d3-array - npm Package Compare versions
Comparing version 0.7.0 to 0.7.1
@@ -1,1 +0,1 @@ | ||
| var version = "0.7.0"; export * from "../index"; export {version}; | ||
| var version = "0.7.1"; export * from "../index"; export {version}; |
| (function (global, factory) { | ||
| typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : | ||
| typeof define === 'function' && define.amd ? define('d3-array', ['exports'], factory) : | ||
| factory((global.d3_array = {})); | ||
| typeof define === 'function' && define.amd ? define(['exports'], factory) : | ||
| (factory((global.d3_array = {}))); | ||
| }(this, function (exports) { 'use strict'; | ||
@@ -9,3 +9,3 @@ | ||
| return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN; | ||
| }; | ||
| } | ||
@@ -16,4 +16,4 @@ function bisector(compare) { | ||
| left: function(a, x, lo, hi) { | ||
| if (arguments.length < 3) lo = 0; | ||
| if (arguments.length < 4) hi = a.length; | ||
| if (lo == null) lo = 0; | ||
| if (hi == null) hi = a.length; | ||
| while (lo < hi) { | ||
@@ -27,4 +27,4 @@ var mid = lo + hi >>> 1; | ||
| right: function(a, x, lo, hi) { | ||
| if (arguments.length < 3) lo = 0; | ||
| if (arguments.length < 4) hi = a.length; | ||
| if (lo == null) lo = 0; | ||
| if (hi == null) hi = a.length; | ||
| while (lo < hi) { | ||
@@ -38,3 +38,3 @@ var mid = lo + hi >>> 1; | ||
| }; | ||
| }; | ||
| } | ||
@@ -53,7 +53,7 @@ function ascendingComparator(f) { | ||
| return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN; | ||
| }; | ||
| } | ||
| function number$1(x) { | ||
| return x === null ? NaN : +x; | ||
| }; | ||
| } | ||
@@ -69,3 +69,3 @@ function variance(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) { | ||
@@ -91,8 +91,8 @@ if (!isNaN(a = number$1(array[i]))) { | ||
| if (j > 1) return s / (j - 1); | ||
| }; | ||
| } | ||
| function deviation() { | ||
| var v = variance.apply(this, arguments); | ||
| function deviation(array, f) { | ||
| var v = variance(array, f); | ||
| return v ? Math.sqrt(v) : v; | ||
| }; | ||
| } | ||
@@ -106,3 +106,3 @@ function extent(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if ((b = array[i]) != null && b >= b) { a = c = b; break; } | ||
@@ -124,3 +124,3 @@ while (++i < n) if ((b = array[i]) != null) { | ||
| return [a, c]; | ||
| }; | ||
| } | ||
@@ -131,16 +131,10 @@ function constant(x) { | ||
| }; | ||
| }; | ||
| } | ||
| function identity(x) { | ||
| return x; | ||
| }; | ||
| } | ||
| function range(start, stop, step) { | ||
| if ((n = arguments.length) < 3) { | ||
| step = 1; | ||
| if (n < 2) { | ||
| stop = start; | ||
| start = 0; | ||
| } | ||
| } | ||
| start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step; | ||
@@ -156,3 +150,3 @@ var i = -1, | ||
| return range; | ||
| }; | ||
| } | ||
@@ -169,3 +163,3 @@ var e10 = Math.sqrt(50); | ||
| ); | ||
| }; | ||
| } | ||
@@ -180,7 +174,7 @@ function tickStep(start, stop, count) { | ||
| return stop < start ? -step1 : step1; | ||
| }; | ||
| } | ||
| function sturges(values) { | ||
| return Math.ceil(Math.log(values.length) / Math.LN2) + 1; | ||
| }; | ||
| } | ||
@@ -259,6 +253,6 @@ function number(x) { | ||
| return histogram; | ||
| }; | ||
| } | ||
| function quantile(array, p, f) { | ||
| if (arguments.length < 3) f = number$1; | ||
| if (f == null) f = number$1; | ||
| if (!(n = array.length)) return; | ||
@@ -273,3 +267,3 @@ if ((p = +p) <= 0 || n < 2) return +f(array[0], 0, array); | ||
| return a + (b - a) * (h - i); | ||
| }; | ||
| } | ||
@@ -279,7 +273,7 @@ function freedmanDiaconis(values, min, max) { | ||
| return Math.ceil((max - min) / (2 * (quantile(values, 0.75) - quantile(values, 0.25)) * Math.pow(values.length, -1 / 3))); | ||
| }; | ||
| } | ||
| function scott(values, min, max) { | ||
| return Math.ceil((max - min) / (3.5 * deviation(values) * Math.pow(values.length, -1 / 3))); | ||
| }; | ||
| } | ||
@@ -292,3 +286,3 @@ function max(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if ((b = array[i]) != null && b >= b) { a = b; break; } | ||
@@ -304,3 +298,3 @@ while (++i < n) if ((b = array[i]) != null && b > a) a = b; | ||
| return a; | ||
| }; | ||
| } | ||
@@ -314,3 +308,3 @@ function mean(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if (!isNaN(a = number$1(array[i]))) s += a; else --j; | ||
@@ -324,3 +318,3 @@ } | ||
| if (j) return s / j; | ||
| }; | ||
| } | ||
@@ -333,3 +327,3 @@ function median(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if (!isNaN(a = number$1(array[i]))) numbers.push(a); | ||
@@ -343,3 +337,3 @@ } | ||
| return quantile(numbers.sort(ascending), 0.5); | ||
| }; | ||
| } | ||
@@ -366,3 +360,3 @@ function merge(arrays) { | ||
| return merged; | ||
| }; | ||
| } | ||
@@ -375,3 +369,3 @@ function min(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if ((b = array[i]) != null && b >= b) { a = b; break; } | ||
@@ -387,9 +381,9 @@ while (++i < n) if ((b = array[i]) != null && a > b) a = b; | ||
| return a; | ||
| }; | ||
| } | ||
| function pairs(array) { | ||
| var i = 0, n = array.length - 1, p0, p1 = array[0], pairs = new Array(n < 0 ? 0 : n); | ||
| while (i < n) pairs[i] = [p0 = p1, p1 = array[++i]]; | ||
| var i = 0, n = array.length - 1, p = array[0], pairs = new Array(n < 0 ? 0 : n); | ||
| while (i < n) pairs[i] = [p, p = array[++i]]; | ||
| return pairs; | ||
| }; | ||
| } | ||
@@ -400,3 +394,3 @@ function permute(array, indexes) { | ||
| return permutes; | ||
| }; | ||
| } | ||
@@ -416,11 +410,6 @@ function scan(array, compare) { | ||
| if (compare(xj, xj) === 0) return j; | ||
| }; | ||
| } | ||
| function shuffle(array, i0, i1) { | ||
| if ((m = arguments.length) < 3) { | ||
| i1 = array.length; | ||
| if (m < 2) i0 = 0; | ||
| } | ||
| var m = i1 - i0, | ||
| var m = (i1 == null ? array.length : i1) - (i0 = i0 == null ? 0 : +i0), | ||
| t, | ||
@@ -437,3 +426,3 @@ i; | ||
| return array; | ||
| }; | ||
| } | ||
@@ -446,3 +435,3 @@ function sum(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if (a = +array[i]) s += a; // Note: zero and null are equivalent. | ||
@@ -456,3 +445,3 @@ } | ||
| return s; | ||
| }; | ||
| } | ||
@@ -467,3 +456,3 @@ function transpose(matrix) { | ||
| return transpose; | ||
| }; | ||
| } | ||
@@ -476,5 +465,5 @@ function length(d) { | ||
| return transpose(arguments); | ||
| }; | ||
| } | ||
| var version = "0.7.0"; | ||
| var version = "0.7.1"; | ||
@@ -481,0 +470,0 @@ exports.version = version; |
@@ -1,1 +0,1 @@ | ||
| !function(n,r){"object"==typeof exports&&"undefined"!=typeof module?r(exports):"function"==typeof define&&define.amd?define("d3-array",["exports"],r):r(n.d3_array={})}(this,function(n){"use strict";function r(n,r){return r>n?-1:n>r?1:n>=r?0:NaN}function t(n){return 1===n.length&&(n=e(n)),{left:function(r,t,e,u){for(arguments.length<3&&(e=0),arguments.length<4&&(u=r.length);u>e;){var o=e+u>>>1;n(r[o],t)<0?e=o+1:u=o}return e},right:function(r,t,e,u){for(arguments.length<3&&(e=0),arguments.length<4&&(u=r.length);u>e;){var o=e+u>>>1;n(r[o],t)>0?u=o:e=o+1}return e}}}function e(n){return function(t,e){return r(n(t),e)}}function u(n,r){return n>r?-1:r>n?1:r>=n?0:NaN}function o(n){return null===n?NaN:+n}function a(n,r){var t,e,u=n.length,a=0,f=0,i=-1,l=0;if(1===arguments.length)for(;++i<u;)isNaN(t=o(n[i]))||(e=t-a,a+=e/++l,f+=e*(t-a));else for(;++i<u;)isNaN(t=o(r(n[i],i,n)))||(e=t-a,a+=e/++l,f+=e*(t-a));return l>1?f/(l-1):void 0}function f(){var n=a.apply(this,arguments);return n?Math.sqrt(n):n}function i(n,r){var t,e,u,o=-1,a=n.length;if(1===arguments.length){for(;++o<a;)if(null!=(e=n[o])&&e>=e){t=u=e;break}for(;++o<a;)null!=(e=n[o])&&(t>e&&(t=e),e>u&&(u=e))}else{for(;++o<a;)if(null!=(e=r(n[o],o,n))&&e>=e){t=u=e;break}for(;++o<a;)null!=(e=r(n[o],o,n))&&(t>e&&(t=e),e>u&&(u=e))}return[t,u]}function l(n){return function(){return n}}function h(n){return n}function s(n,r,t){(u=arguments.length)<3&&(t=1,2>u&&(r=n,n=0));for(var e=-1,u=0|Math.max(0,Math.ceil((r-n)/t)),o=new Array(u);++e<u;)o[e]=n+e*t;return o}function g(n,r,t){var e=c(n,r,t);return s(Math.ceil(n/e)*e,Math.floor(r/e)*e+e/2,e)}function c(n,r,t){var e=Math.abs(r-n)/Math.max(0,t),u=Math.pow(10,Math.floor(Math.log(e)/Math.LN10)),o=e/u;return o>=C?u*=10:o>=E?u*=5:o>=G&&(u*=2),n>r?-u:u}function m(n){return Math.ceil(Math.log(n.length)/Math.LN2)+1}function v(n){return+n}function p(){function n(n){var u,o,a=n.length,f=new Array(a);for(u=0;a>u;++u)f[u]=+r(n[u],u,n);var i=t(f),l=+i[0],h=+i[1],s=e(f,l,h);Array.isArray(s)||(s=g(l,h,+s));var c=s.length;for(u=0;c>u;++u)s[u]=+s[u];for(;s[0]<=l;)s.shift(),--c;for(;s[c-1]>=h;)s.pop(),--c;var m,v=new Array(c+1);for(u=0;c>=u;++u)m=v[u]=[],m.x0=u>0?s[u-1]:l,m.x1=c>u?s[u]:h;for(u=0;a>u;++u)o=f[u],o>=l&&h>=o&&v[_(s,o,0,c)].push(n[u]);return v}var r=h,t=i,e=m;return n.value=function(t){return arguments.length?(r="function"==typeof t?t:l(+t),n):r},n.domain=function(r){return arguments.length?(t="function"==typeof r?r:l([+r[0],+r[1]]),n):t},n.thresholds=function(r){return arguments.length?(e="function"==typeof r?r:l(Array.isArray(r)?Array.prototype.map.call(r,v):+r),n):e},n}function d(n,r,t){if(arguments.length<3&&(t=o),e=n.length){if((r=+r)<=0||2>e)return+t(n[0],0,n);if(r>=1)return+t(n[e-1],e-1,n);var e,u=(e-1)*r,a=Math.floor(u),f=+t(n[a],a,n),i=+t(n[a+1],a+1,n);return f+(i-f)*(u-a)}}function y(n,t,e){return n.sort(r),Math.ceil((e-t)/(2*(d(n,.75)-d(n,.25))*Math.pow(n.length,-1/3)))}function M(n,r,t){return Math.ceil((t-r)/(3.5*f(n)*Math.pow(n.length,-1/3)))}function N(n,r){var t,e,u=-1,o=n.length;if(1===arguments.length){for(;++u<o;)if(null!=(e=n[u])&&e>=e){t=e;break}for(;++u<o;)null!=(e=n[u])&&e>t&&(t=e)}else{for(;++u<o;)if(null!=(e=r(n[u],u,n))&&e>=e){t=e;break}for(;++u<o;)null!=(e=r(n[u],u,n))&&e>t&&(t=e)}return t}function A(n,r){var t,e=0,u=n.length,a=-1,f=u;if(1===arguments.length)for(;++a<u;)isNaN(t=o(n[a]))?--f:e+=t;else for(;++a<u;)isNaN(t=o(r(n[a],a,n)))?--f:e+=t;return f?e/f:void 0}function b(n,t){var e,u=[],a=n.length,f=-1;if(1===arguments.length)for(;++f<a;)isNaN(e=o(n[f]))||u.push(e);else for(;++f<a;)isNaN(e=o(t(n[f],f,n)))||u.push(e);return d(u.sort(r),.5)}function w(n){for(var r,t,e,u=n.length,o=-1,a=0;++o<u;)a+=n[o].length;for(t=new Array(a);--u>=0;)for(e=n[u],r=e.length;--r>=0;)t[--a]=e[r];return t}function x(n,r){var t,e,u=-1,o=n.length;if(1===arguments.length){for(;++u<o;)if(null!=(e=n[u])&&e>=e){t=e;break}for(;++u<o;)null!=(e=n[u])&&t>e&&(t=e)}else{for(;++u<o;)if(null!=(e=r(n[u],u,n))&&e>=e){t=e;break}for(;++u<o;)null!=(e=r(n[u],u,n))&&t>e&&(t=e)}return t}function k(n){for(var r,t=0,e=n.length-1,u=n[0],o=new Array(0>e?0:e);e>t;)o[t]=[r=u,u=n[++t]];return o}function q(n,r){for(var t=r.length,e=new Array(t);t--;)e[t]=n[r[t]];return e}function L(n,t){if(e=n.length){var e,u,o=0,a=0,f=n[a];for(t||(t=r);++o<e;)(t(u=n[o],f)<0||0!==t(f,f))&&(f=u,a=o);return 0===t(f,f)?a:void 0}}function S(n,r,t){(o=arguments.length)<3&&(t=n.length,2>o&&(r=0));for(var e,u,o=t-r;o;)u=Math.random()*o--|0,e=n[o+r],n[o+r]=n[u+r],n[u+r]=e;return n}function j(n,r){var t,e=0,u=n.length,o=-1;if(1===arguments.length)for(;++o<u;)(t=+n[o])&&(e+=t);else for(;++o<u;)(t=+r(n[o],o,n))&&(e+=t);return e}function z(n){if(!(u=n.length))return[];for(var r=-1,t=x(n,D),e=new Array(t);++r<t;)for(var u,o=-1,a=e[r]=new Array(u);++o<u;)a[o]=n[o][r];return e}function D(n){return n.length}function F(){return z(arguments)}var R=t(r),_=R.right,B=R.left,C=Math.sqrt(50),E=Math.sqrt(10),G=Math.sqrt(2),H="0.7.0";n.version=H,n.bisect=_,n.bisectRight=_,n.bisectLeft=B,n.ascending=r,n.bisector=t,n.descending=u,n.deviation=f,n.extent=i,n.histogram=p,n.thresholdFreedmanDiaconis=y,n.thresholdScott=M,n.thresholdSturges=m,n.max=N,n.mean=A,n.median=b,n.merge=w,n.min=x,n.pairs=k,n.permute=q,n.quantile=d,n.range=s,n.scan=L,n.shuffle=S,n.sum=j,n.ticks=g,n.tickStep=c,n.transpose=z,n.variance=a,n.zip=F}); | ||
| !function(n,r){"object"==typeof exports&&"undefined"!=typeof module?r(exports):"function"==typeof define&&define.amd?define(["exports"],r):r(n.d3_array={})}(this,function(n){"use strict";function r(n,r){return r>n?-1:n>r?1:n>=r?0:NaN}function t(n){return 1===n.length&&(n=e(n)),{left:function(r,t,e,u){for(null==e&&(e=0),null==u&&(u=r.length);u>e;){var o=e+u>>>1;n(r[o],t)<0?e=o+1:u=o}return e},right:function(r,t,e,u){for(null==e&&(e=0),null==u&&(u=r.length);u>e;){var o=e+u>>>1;n(r[o],t)>0?u=o:e=o+1}return e}}}function e(n){return function(t,e){return r(n(t),e)}}function u(n,r){return n>r?-1:r>n?1:r>=n?0:NaN}function o(n){return null===n?NaN:+n}function f(n,r){var t,e,u=n.length,f=0,l=0,i=-1,a=0;if(null==r)for(;++i<u;)isNaN(t=o(n[i]))||(e=t-f,f+=e/++a,l+=e*(t-f));else for(;++i<u;)isNaN(t=o(r(n[i],i,n)))||(e=t-f,f+=e/++a,l+=e*(t-f));return a>1?l/(a-1):void 0}function l(n,r){var t=f(n,r);return t?Math.sqrt(t):t}function i(n,r){var t,e,u,o=-1,f=n.length;if(null==r){for(;++o<f;)if(null!=(e=n[o])&&e>=e){t=u=e;break}for(;++o<f;)null!=(e=n[o])&&(t>e&&(t=e),e>u&&(u=e))}else{for(;++o<f;)if(null!=(e=r(n[o],o,n))&&e>=e){t=u=e;break}for(;++o<f;)null!=(e=r(n[o],o,n))&&(t>e&&(t=e),e>u&&(u=e))}return[t,u]}function a(n){return function(){return n}}function h(n){return n}function c(n,r,t){n=+n,r=+r,t=(u=arguments.length)<2?(r=n,n=0,1):3>u?1:+t;for(var e=-1,u=0|Math.max(0,Math.ceil((r-n)/t)),o=new Array(u);++e<u;)o[e]=n+e*t;return o}function s(n,r,t){var e=g(n,r,t);return c(Math.ceil(n/e)*e,Math.floor(r/e)*e+e/2,e)}function g(n,r,t){var e=Math.abs(r-n)/Math.max(0,t),u=Math.pow(10,Math.floor(Math.log(e)/Math.LN10)),o=e/u;return o>=C?u*=10:o>=E?u*=5:o>=G&&(u*=2),n>r?-u:u}function v(n){return Math.ceil(Math.log(n.length)/Math.LN2)+1}function p(n){return+n}function d(){function n(n){var u,o,f=n.length,l=new Array(f);for(u=0;f>u;++u)l[u]=+r(n[u],u,n);var i=t(l),a=+i[0],h=+i[1],c=e(l,a,h);Array.isArray(c)||(c=s(a,h,+c));var g=c.length;for(u=0;g>u;++u)c[u]=+c[u];for(;c[0]<=a;)c.shift(),--g;for(;c[g-1]>=h;)c.pop(),--g;var v,p=new Array(g+1);for(u=0;g>=u;++u)v=p[u]=[],v.x0=u>0?c[u-1]:a,v.x1=g>u?c[u]:h;for(u=0;f>u;++u)o=l[u],o>=a&&h>=o&&p[_(c,o,0,g)].push(n[u]);return p}var r=h,t=i,e=v;return n.value=function(t){return arguments.length?(r="function"==typeof t?t:a(+t),n):r},n.domain=function(r){return arguments.length?(t="function"==typeof r?r:a([+r[0],+r[1]]),n):t},n.thresholds=function(r){return arguments.length?(e="function"==typeof r?r:a(Array.isArray(r)?Array.prototype.map.call(r,p):+r),n):e},n}function M(n,r,t){if(null==t&&(t=o),e=n.length){if((r=+r)<=0||2>e)return+t(n[0],0,n);if(r>=1)return+t(n[e-1],e-1,n);var e,u=(e-1)*r,f=Math.floor(u),l=+t(n[f],f,n),i=+t(n[f+1],f+1,n);return l+(i-l)*(u-f)}}function m(n,t,e){return n.sort(r),Math.ceil((e-t)/(2*(M(n,.75)-M(n,.25))*Math.pow(n.length,-1/3)))}function y(n,r,t){return Math.ceil((t-r)/(3.5*l(n)*Math.pow(n.length,-1/3)))}function N(n,r){var t,e,u=-1,o=n.length;if(null==r){for(;++u<o;)if(null!=(e=n[u])&&e>=e){t=e;break}for(;++u<o;)null!=(e=n[u])&&e>t&&(t=e)}else{for(;++u<o;)if(null!=(e=r(n[u],u,n))&&e>=e){t=e;break}for(;++u<o;)null!=(e=r(n[u],u,n))&&e>t&&(t=e)}return t}function A(n,r){var t,e=0,u=n.length,f=-1,l=u;if(null==r)for(;++f<u;)isNaN(t=o(n[f]))?--l:e+=t;else for(;++f<u;)isNaN(t=o(r(n[f],f,n)))?--l:e+=t;return l?e/l:void 0}function b(n,t){var e,u=[],f=n.length,l=-1;if(null==t)for(;++l<f;)isNaN(e=o(n[l]))||u.push(e);else for(;++l<f;)isNaN(e=o(t(n[l],l,n)))||u.push(e);return M(u.sort(r),.5)}function w(n){for(var r,t,e,u=n.length,o=-1,f=0;++o<u;)f+=n[o].length;for(t=new Array(f);--u>=0;)for(e=n[u],r=e.length;--r>=0;)t[--f]=e[r];return t}function x(n,r){var t,e,u=-1,o=n.length;if(null==r){for(;++u<o;)if(null!=(e=n[u])&&e>=e){t=e;break}for(;++u<o;)null!=(e=n[u])&&t>e&&(t=e)}else{for(;++u<o;)if(null!=(e=r(n[u],u,n))&&e>=e){t=e;break}for(;++u<o;)null!=(e=r(n[u],u,n))&&t>e&&(t=e)}return t}function k(n){for(var r=0,t=n.length-1,e=n[0],u=new Array(0>t?0:t);t>r;)u[r]=[e,e=n[++r]];return u}function q(n,r){for(var t=r.length,e=new Array(t);t--;)e[t]=n[r[t]];return e}function L(n,t){if(e=n.length){var e,u,o=0,f=0,l=n[f];for(t||(t=r);++o<e;)(t(u=n[o],l)<0||0!==t(l,l))&&(l=u,f=o);return 0===t(l,l)?f:void 0}}function S(n,r,t){for(var e,u,o=(null==t?n.length:t)-(r=null==r?0:+r);o;)u=Math.random()*o--|0,e=n[o+r],n[o+r]=n[u+r],n[u+r]=e;return n}function j(n,r){var t,e=0,u=n.length,o=-1;if(null==r)for(;++o<u;)(t=+n[o])&&(e+=t);else for(;++o<u;)(t=+r(n[o],o,n))&&(e+=t);return e}function z(n){if(!(u=n.length))return[];for(var r=-1,t=x(n,D),e=new Array(t);++r<t;)for(var u,o=-1,f=e[r]=new Array(u);++o<u;)f[o]=n[o][r];return e}function D(n){return n.length}function F(){return z(arguments)}var R=t(r),_=R.right,B=R.left,C=Math.sqrt(50),E=Math.sqrt(10),G=Math.sqrt(2),H="0.7.1";n.version=H,n.bisect=_,n.bisectRight=_,n.bisectLeft=B,n.ascending=r,n.bisector=t,n.descending=u,n.deviation=l,n.extent=i,n.histogram=d,n.thresholdFreedmanDiaconis=m,n.thresholdScott=y,n.thresholdSturges=v,n.max=N,n.mean=A,n.median=b,n.merge=w,n.min=x,n.pairs=k,n.permute=q,n.quantile=M,n.range=c,n.scan=L,n.shuffle=S,n.sum=j,n.ticks=s,n.tickStep=g,n.transpose=z,n.variance=f,n.zip=F}); |
| { | ||
| "name": "d3-array", | ||
| "version": "0.7.0", | ||
| "version": "0.7.1", | ||
| "description": "Array manipulation, ordering, searching, summarizing, etc.", | ||
@@ -28,9 +28,10 @@ "keywords": [ | ||
| "scripts": { | ||
| "pretest": "mkdir -p build && node -e 'process.stdout.write(\"var version = \\\"\" + require(\"./package.json\").version + \"\\\"; export * from \\\"../index\\\"; export {version};\");' > build/bundle.js && rollup -f umd -u d3-array -n d3_array -o build/d3-array.js -- build/bundle.js", | ||
| "test": "faucet `find test -name '*-test.js'`", | ||
| "prepublish": "npm run test && uglifyjs build/d3-array.js -c -m -o build/d3-array.min.js && rm -f build/d3-array.zip && zip -j build/d3-array.zip -- LICENSE README.md build/d3-array.js build/d3-array.min.js" | ||
| "pretest": "mkdir -p build && node -e 'process.stdout.write(\"var version = \\\"\" + require(\"./package.json\").version + \"\\\"; export * from \\\"../index\\\"; export {version};\");' > build/bundle.js && rollup -f umd -n d3_array -o build/d3-array.js -- build/bundle.js", | ||
| "test": "faucet `find test -name '*-test.js'` && eslint index.js src", | ||
| "prepublish": "npm run test && uglifyjs build/d3-array.js -c -m -o build/d3-array.min.js && rm -f build/d3-array.zip && zip -j build/d3-array.zip -- LICENSE README.md build/d3-array.js build/d3-array.min.js", | ||
| "postpublish": "VERSION=`node -e 'console.log(require(\"./package.json\").version)'`; git push && git tag -am \"Release $VERSION.\" v${VERSION} && git push --tags && cp build/d3-array.js ../d3.github.com/d3-array.v0.7.js && cp build/d3-array.min.js ../d3.github.com/d3-array.v0.7.min.js && cd ../d3.github.com && git add d3-array.v0.7.js d3-array.v0.7.min.js && git commit -m \"d3-array ${VERSION}\" && git push" | ||
| }, | ||
| "devDependencies": { | ||
| "faucet": "0.0", | ||
| "rollup": "0.20.5", | ||
| "rollup": "0.25", | ||
| "seedrandom": "2", | ||
@@ -37,0 +38,0 @@ "tape": "4", |
@@ -55,3 +55,3 @@ # d3-array | ||
| <a name="min" href="#min">#</a> d3_array.<b>min</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="min" href="#min">#</a> d3.<b>min</b>(<i>array</i>[, <i>accessor</i>]) | ||
@@ -64,3 +64,3 @@ Returns the minimum value in the given *array* using natural order. If the array is empty, returns undefined. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the minimum value. | ||
| <a name="max" href="#max">#</a> d3_array.<b>max</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="max" href="#max">#</a> d3.<b>max</b>(<i>array</i>[, <i>accessor</i>]) | ||
@@ -73,19 +73,19 @@ Returns the maximum value in the given *array* using natural order. If the array is empty, returns undefined. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the maximum value. | ||
| <a name="extent" href="#extent">#</a> d3_array.<b>extent</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="extent" href="#extent">#</a> d3.<b>extent</b>(<i>array</i>[, <i>accessor</i>]) | ||
| Returns the [minimum](#min) and [maximum](#max) value in the given *array* using natural order. If the array is empty, returns [undefined, undefined]. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the extent. | ||
| <a name="sum" href="#sum">#</a> d3_array.<b>sum</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="sum" href="#sum">#</a> d3.<b>sum</b>(<i>array</i>[, <i>accessor</i>]) | ||
| Returns the sum of the given *array* of numbers. If the array is empty, returns 0. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the sum. This method ignores undefined and NaN values; this is useful for ignoring missing data. | ||
| <a name="mean" href="#mean">#</a> d3_array.<b>mean</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="mean" href="#mean">#</a> d3.<b>mean</b>(<i>array</i>[, <i>accessor</i>]) | ||
| Returns the mean of the given *array* of numbers. If the array is empty, returns undefined. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the mean. This method ignores undefined and NaN values; this is useful for ignoring missing data. | ||
| <a name="median" href="#median">#</a> d3_array.<b>median</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="median" href="#median">#</a> d3.<b>median</b>(<i>array</i>[, <i>accessor</i>]) | ||
| Returns the median of the given *array* of numbers using the [R-7 method](https://en.wikipedia.org/wiki/Quantile#Estimating_quantiles_from_a_sample). If the array is empty, returns undefined. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the median. This method ignores undefined and NaN values; this is useful for ignoring missing data. | ||
| <a name="quantile" href="#quantile">#</a> d3_array.<b>quantile</b>(<i>array</i>, <i>p</i>[, <i>accessor</i>]) | ||
| <a name="quantile" href="#quantile">#</a> d3.<b>quantile</b>(<i>array</i>, <i>p</i>[, <i>accessor</i>]) | ||
@@ -96,8 +96,8 @@ Returns the *p*-quantile of the given sorted *array* of numbers, where *p* is a number in the range [0, 1]. For example, the median can be computed using *p* = 0.5, the first quartile at *p* = 0.25, and the third quartile at *p* = 0.75. This particular implementation uses the [R-7 method](http://en.wikipedia.org/wiki/Quantile#Quantiles_of_a_population), which is the default for the R programming language and Excel. For example: | ||
| var a = [0, 10, 30]; | ||
| d3_array.quantile(a, 0); // 0 | ||
| d3_array.quantile(a, 0.5); // 10 | ||
| d3_array.quantile(a, 1); // 30 | ||
| d3_array.quantile(a, 0.25); // 5 | ||
| d3_array.quantile(a, 0.75); // 20 | ||
| d3_array.quantile(a, 0.1); // 2 | ||
| d3.quantile(a, 0); // 0 | ||
| d3.quantile(a, 0.5); // 10 | ||
| d3.quantile(a, 1); // 30 | ||
| d3.quantile(a, 0.25); // 5 | ||
| d3.quantile(a, 0.75); // 20 | ||
| d3.quantile(a, 0.1); // 2 | ||
| ``` | ||
@@ -107,7 +107,7 @@ | ||
| <a name="variance" href="#variance">#</a> d3_array.<b>variance</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="variance" href="#variance">#</a> d3.<b>variance</b>(<i>array</i>[, <i>accessor</i>]) | ||
| Returns an [unbiased estimator of the population variance](http://mathworld.wolfram.com/SampleVariance.html) of the given *array* of numbers. If the array has fewer than two values, returns undefined. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the variance. This method ignores undefined and NaN values; this is useful for ignoring missing data. | ||
| <a name="deviation" href="#deviation">#</a> d3_array.<b>deviation</b>(<i>array</i>[, <i>accessor</i>]) | ||
| <a name="deviation" href="#deviation">#</a> d3.<b>deviation</b>(<i>array</i>[, <i>accessor</i>]) | ||
@@ -120,3 +120,3 @@ Returns the standard deviation, defined as the square root of the [bias-corrected variance](#variance), of the given *array* of numbers. If the array has fewer than two values, returns undefined. An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the standard deviation. This method ignores undefined and NaN values; this is useful for ignoring missing data. | ||
| <a name="scan" href="#scan">#</a> d3_array.<b>scan</b>(<i>array</i>[, <i>comparator</i>]) | ||
| <a name="scan" href="#scan">#</a> d3.<b>scan</b>(<i>array</i>[, <i>comparator</i>]) | ||
@@ -127,4 +127,4 @@ Performs a linear scan of the specified *array*, returning the index of the least element according to the specified *comparator*. If the given *array* contains no comparable elements (*i.e.*, the comparator returns NaN when comparing each element to itself), returns undefined. If *comparator* is not specified, it defaults to [ascending](#ascending). For example: | ||
| var array = [{foo: 42}, {foo: 91}]; | ||
| d3_array.scan(array, function(a, b) { return a.foo - b.foo; }); // 0 | ||
| d3_array.scan(array, function(a, b) { return b.foo - a.foo; }); // 1 | ||
| d3.scan(array, function(a, b) { return a.foo - b.foo; }); // 0 | ||
| d3.scan(array, function(a, b) { return b.foo - a.foo; }); // 1 | ||
| ``` | ||
@@ -134,13 +134,13 @@ | ||
| <a name="bisectLeft" href="#bisectLeft">#</a> d3_array.<b>bisectLeft</b>(<i>array</i>, <i>x</i>[, <i>lo</i>[, <i>hi</i>]]) | ||
| <a name="bisectLeft" href="#bisectLeft">#</a> d3.<b>bisectLeft</b>(<i>array</i>, <i>x</i>[, <i>lo</i>[, <i>hi</i>]]) | ||
| Returns the insertion point for *x* in *array* to maintain sorted order. The arguments *lo* and *hi* may be used to specify a subset of the array which should be considered; by default the entire array is used. If *x* is already present in *array*, the insertion point will be before (to the left of) any existing entries. The return value is suitable for use as the first argument to [splice](https://developer.mozilla.org/en/JavaScript/Reference/Global_Objects/Array/splice) assuming that *array* is already sorted. The returned insertion point *i* partitions the *array* into two halves so that all *v* < *x* for *v* in *array*.slice(*lo*, *i*) for the left side and all *v* >= *x* for *v* in *array*.slice(*i*, *hi*) for the right side. | ||
| <a name="bisect" href="#bisect">#</a> d3_array.<b>bisect</b>(<i>array</i>, <i>x</i>[, <i>lo</i>[, <i>hi</i>]])<br> | ||
| <a name="bisectRight" href="#bisectRight">#</a> d3_array.<b>bisectRight</b>(<i>array</i>, <i>x</i>[, <i>lo</i>[, <i>hi</i>]]) | ||
| <a name="bisect" href="#bisect">#</a> d3.<b>bisect</b>(<i>array</i>, <i>x</i>[, <i>lo</i>[, <i>hi</i>]])<br> | ||
| <a name="bisectRight" href="#bisectRight">#</a> d3.<b>bisectRight</b>(<i>array</i>, <i>x</i>[, <i>lo</i>[, <i>hi</i>]]) | ||
| Similar to [bisectLeft](#bisectLeft), but returns an insertion point which comes after (to the right of) any existing entries of *x* in *array*. The returned insertion point *i* partitions the *array* into two halves so that all *v* <= *x* for *v* in *array*.slice(*lo*, *i*) for the left side and all *v* > *x* for *v* in *array*.slice(*i*, *hi*) for the right side. | ||
| <a name="bisector" href="#bisector">#</a> d3_array.<b>bisector</b>(<i>accessor</i>) | ||
| <br><a name="bisector" href="#bisector">#</a> d3_array.<b>bisector</b>(<i>comparator</i>) | ||
| <a name="bisector" href="#bisector">#</a> d3.<b>bisector</b>(<i>accessor</i>) | ||
| <br><a name="bisector" href="#bisector">#</a> d3.<b>bisector</b>(<i>comparator</i>) | ||
@@ -161,3 +161,3 @@ Returns a new bisector using the specified *accessor* or *comparator* function. This method can be used to bisect arrays of objects instead of being limited to simple arrays of primitives. For example, given the following array of objects: | ||
| ```js | ||
| var bisectDate = d3_array.bisector(function(d) { return d.date; }).right; | ||
| var bisectDate = d3.bisector(function(d) { return d.date; }).right; | ||
| ``` | ||
@@ -168,3 +168,3 @@ | ||
| ```js | ||
| var bisectDate = d3_array.bisector(function(d, x) { return d.date - x; }).right; | ||
| var bisectDate = d3.bisector(function(d, x) { return d.date - x; }).right; | ||
| ``` | ||
@@ -182,3 +182,3 @@ | ||
| <a name="ascending" href="#ascending">#</a> d3_array.<b>ascending</b>(<i>a</i>, <i>b</i>) | ||
| <a name="ascending" href="#ascending">#</a> d3.<b>ascending</b>(<i>a</i>, <i>b</i>) | ||
@@ -195,3 +195,3 @@ Returns -1 if *a* is less than *b*, or 1 if *a* is greater than *b*, or 0. This is the comparator function for natural order, and can be used in conjunction with the built-in [*array*.sort](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort) method to arrange elements in ascending order. It is implemented as: | ||
| <a name="descending" href="#descending">#</a> d3_array.<b>descending</b>(<i>a</i>, <i>b</i>) | ||
| <a name="descending" href="#descending">#</a> d3.<b>descending</b>(<i>a</i>, <i>b</i>) | ||
@@ -212,3 +212,3 @@ Returns -1 if *a* is greater than *b*, or 1 if *a* is less than *b*, or 0. This is the comparator function for reverse natural order, and can be used in conjunction with the built-in array sort method to arrange elements in descending order. It is implemented as: | ||
| <a name="merge" href="#merge">#</a> d3_array.<b>merge</b>(<i>arrays</i>) | ||
| <a name="merge" href="#merge">#</a> d3.<b>merge</b>(<i>arrays</i>) | ||
@@ -218,6 +218,6 @@ Merges the specified *arrays* into a single array. This method is similar to the built-in array concat method; the only difference is that it is more convenient when you have an array of arrays. | ||
| ```js | ||
| d3_array.merge([[1], [2, 3]]); // returns [1, 2, 3] | ||
| d3.merge([[1], [2, 3]]); // returns [1, 2, 3] | ||
| ``` | ||
| <a name="pairs" href="#pairs">#</a> d3_array.<b>pairs</b>(<i>array</i>) | ||
| <a name="pairs" href="#pairs">#</a> d3.<b>pairs</b>(<i>array</i>) | ||
@@ -227,3 +227,3 @@ For each adjacent pair of elements in the specified *array*, returns a new array of tuples of element *i* and element *i* - 1. For example: | ||
| ```js | ||
| d3_array.pairs([1, 2, 3, 4]); // returns [[1, 2], [2, 3], [3, 4]] | ||
| d3.pairs([1, 2, 3, 4]); // returns [[1, 2], [2, 3], [3, 4]] | ||
| ``` | ||
@@ -233,3 +233,3 @@ | ||
| <a name="permute" href="#permute">#</a> d3_array.<b>permute</b>(<i>array</i>, <i>indexes</i>) | ||
| <a name="permute" href="#permute">#</a> d3.<b>permute</b>(<i>array</i>, <i>indexes</i>) | ||
@@ -245,18 +245,18 @@ Returns a permutation of the specified *array* using the specified array of *indexes*. The returned array contains the corresponding element in array for each index in indexes, in order. For example, permute(["a", "b", "c"], [1, 2, 0]) | ||
| d3_array.permute(object, fields); // returns ["University Farm", "Manchuria", 27] | ||
| d3.permute(object, fields); // returns ["University Farm", "Manchuria", 27] | ||
| ``` | ||
| <a name="shuffle" href="#shuffle">#</a> d3_array.<b>shuffle</b>(<i>array</i>[, <i>lo</i>[, <i>hi</i>]]) | ||
| <a name="shuffle" href="#shuffle">#</a> d3.<b>shuffle</b>(<i>array</i>[, <i>lo</i>[, <i>hi</i>]]) | ||
| Randomizes the order of the specified *array* using the [Fisher–Yates shuffle](http://bost.ocks.org/mike/shuffle/). | ||
| <a name="ticks" href="#ticks">#</a> d3_array.<b>ticks</b>(<i>start</i>, <i>stop</i>, <i>count</i>) | ||
| <a name="ticks" href="#ticks">#</a> d3.<b>ticks</b>(<i>start</i>, <i>stop</i>, <i>count</i>) | ||
| Returns an array of approximately *count* + 1 uniformly-spaced, nicely-rounded values between *start* and *stop* (inclusive). Each value is a power of ten multiplied by 1, 2 or 5. See also [tickStep](#tickStep) and [*linear*.ticks](https://github.com/d3/d3-scale#linear_ticks). Note that due to the limited precision of IEEE 754 floating point, the returned values may not be exact decimals; use [d3-format](https://github.com/d3/d3-format) to format numbers for human consumption. | ||
| <a name="tickStep" href="#tickStep">#</a> d3_array.<b>tickStep</b>(<i>start</i>, <i>stop</i>, <i>count</i>) | ||
| <a name="tickStep" href="#tickStep">#</a> d3.<b>tickStep</b>(<i>start</i>, <i>stop</i>, <i>count</i>) | ||
| Returns the difference between adjacent tick values if the same arguments were passed to [ticks](#ticks): a nicely-rounded value that is a power of ten multiplied by 1, 2 or 5. Note that due to the limited precision of IEEE 754 floating point, the returned value may not be exact decimals; use [d3-format](https://github.com/d3/d3-format) to format numbers for human consumption. | ||
| <a name="range" href="#range">#</a> d3_array.<b>range</b>([<i>start</i>, ]<i>stop</i>[, <i>step</i>]) | ||
| <a name="range" href="#range">#</a> d3.<b>range</b>([<i>start</i>, ]<i>stop</i>[, <i>step</i>]) | ||
@@ -270,3 +270,3 @@ Returns an array containing an arithmetic progression, similar to the Python built-in [range](http://docs.python.org/library/functions.html#range). This method is often used to iterate over a sequence of uniformly-spaced numeric values, such as the indexes of an array or the ticks of a linear scale. (See also [ticks](#ticks) for nicely-rounded values.) | ||
| ```js | ||
| d3_array.range(0, 1, 0.2) // [0, 0.2, 0.4, 0.6000000000000001, 0.8] | ||
| d3.range(0, 1, 0.2) // [0, 0.2, 0.4, 0.6000000000000001, 0.8] | ||
| ``` | ||
@@ -279,11 +279,11 @@ | ||
| ```js | ||
| d3_array.range(0, 1, 1 / 49); // BAD: returns 50 elements! | ||
| d3_array.range(49).map(function(d) { return d / 49; }); // GOOD: returns 49 elements. | ||
| d3.range(0, 1, 1 / 49); // BAD: returns 50 elements! | ||
| d3.range(49).map(function(d) { return d / 49; }); // GOOD: returns 49 elements. | ||
| ``` | ||
| <a name="transpose" href="#transpose">#</a> d3_array.<b>transpose</b>(<i>matrix</i>) | ||
| <a name="transpose" href="#transpose">#</a> d3.<b>transpose</b>(<i>matrix</i>) | ||
| Uses the [zip](#zip) operator as a two-dimensional [matrix transpose](http://en.wikipedia.org/wiki/Transpose). | ||
| <a name="zip" href="#zip">#</a> d3_array.<b>zip</b>(<i>arrays…</i>) | ||
| <a name="zip" href="#zip">#</a> d3.<b>zip</b>(<i>arrays…</i>) | ||
@@ -293,3 +293,3 @@ Returns an array of arrays, where the *i*th array contains the *i*th element from each of the argument *arrays*. The returned array is truncated in length to the shortest array in *arrays*. If *arrays* contains only a single array, the returned array contains one-element arrays. With no arguments, the returned array is empty. | ||
| ```js | ||
| d3_array.zip([1, 2], [3, 4]); // returns [[1, 3], [2, 4]] | ||
| d3.zip([1, 2], [3, 4]); // returns [[1, 3], [2, 4]] | ||
| ``` | ||
@@ -303,3 +303,3 @@ | ||
| <a name="histogram" href="#histogram">#</a> d3_array.<b>histogram</b>() | ||
| <a name="histogram" href="#histogram">#</a> d3.<b>histogram</b>() | ||
@@ -330,3 +330,3 @@ Constructs a new histogram generator with the default settings. | ||
| ```js | ||
| var histogram = d3_array.histogram() | ||
| var histogram = d3.histogram() | ||
| .domain(x.domain()) | ||
@@ -355,12 +355,12 @@ .thresholds(x.ticks(20)); | ||
| <a name="thresholdFreedmanDiaconis" href="#thresholdFreedmanDiaconis">#</a> d3_array.<b>thresholdFreedmanDiaconis</b>(<i>values</i>, <i>min</i>, <i>max</i>) | ||
| <a name="thresholdFreedmanDiaconis" href="#thresholdFreedmanDiaconis">#</a> d3.<b>thresholdFreedmanDiaconis</b>(<i>values</i>, <i>min</i>, <i>max</i>) | ||
| Returns the number of bins according to the [Freedman–Diaconis rule](https://en.wikipedia.org/wiki/Histogram#Mathematical_definition). | ||
| <a name="thresholdScott" href="#thresholdScott">#</a> d3_array.<b>thresholdScott</b>(<i>values</i>, <i>min</i>, <i>max</i>) | ||
| <a name="thresholdScott" href="#thresholdScott">#</a> d3.<b>thresholdScott</b>(<i>values</i>, <i>min</i>, <i>max</i>) | ||
| Returns the number of bins according to [Scott’s normal reference rule](https://en.wikipedia.org/wiki/Histogram#Mathematical_definition). | ||
| <a name="thresholdSturges" href="#thresholdSturges">#</a> d3_array.<b>thresholdSturges</b>(<i>values</i>) | ||
| <a name="thresholdSturges" href="#thresholdSturges">#</a> d3.<b>thresholdSturges</b>(<i>values</i>) | ||
| Returns the number of bins according to [Sturges’ formula](https://en.wikipedia.org/wiki/Histogram#Mathematical_definition). |
| export default function(a, b) { | ||
| return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN; | ||
| }; | ||
| } |
@@ -7,4 +7,4 @@ import ascending from "./ascending"; | ||
| left: function(a, x, lo, hi) { | ||
| if (arguments.length < 3) lo = 0; | ||
| if (arguments.length < 4) hi = a.length; | ||
| if (lo == null) lo = 0; | ||
| if (hi == null) hi = a.length; | ||
| while (lo < hi) { | ||
@@ -18,4 +18,4 @@ var mid = lo + hi >>> 1; | ||
| right: function(a, x, lo, hi) { | ||
| if (arguments.length < 3) lo = 0; | ||
| if (arguments.length < 4) hi = a.length; | ||
| if (lo == null) lo = 0; | ||
| if (hi == null) hi = a.length; | ||
| while (lo < hi) { | ||
@@ -29,3 +29,3 @@ var mid = lo + hi >>> 1; | ||
| }; | ||
| }; | ||
| } | ||
@@ -32,0 +32,0 @@ function ascendingComparator(f) { |
@@ -5,2 +5,2 @@ export default function(x) { | ||
| }; | ||
| }; | ||
| } |
| export default function(a, b) { | ||
| return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN; | ||
| }; | ||
| } |
| import variance from "./variance"; | ||
| export default function() { | ||
| var v = variance.apply(this, arguments); | ||
| export default function(array, f) { | ||
| var v = variance(array, f); | ||
| return v ? Math.sqrt(v) : v; | ||
| }; | ||
| } |
@@ -8,3 +8,3 @@ export default function(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if ((b = array[i]) != null && b >= b) { a = c = b; break; } | ||
@@ -26,2 +26,2 @@ while (++i < n) if ((b = array[i]) != null) { | ||
| return [a, c]; | ||
| }; | ||
| } |
@@ -80,2 +80,2 @@ import bisect from "./bisect"; | ||
| return histogram; | ||
| }; | ||
| } |
| export default function(x) { | ||
| return x; | ||
| }; | ||
| } |
@@ -7,3 +7,3 @@ export default function(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if ((b = array[i]) != null && b >= b) { a = b; break; } | ||
@@ -19,2 +19,2 @@ while (++i < n) if ((b = array[i]) != null && b > a) a = b; | ||
| return a; | ||
| }; | ||
| } |
@@ -10,3 +10,3 @@ import number from "./number"; | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if (!isNaN(a = number(array[i]))) s += a; else --j; | ||
@@ -20,2 +20,2 @@ } | ||
| if (j) return s / j; | ||
| }; | ||
| } |
@@ -11,3 +11,3 @@ import ascending from "./ascending"; | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if (!isNaN(a = number(array[i]))) numbers.push(a); | ||
@@ -21,2 +21,2 @@ } | ||
| return quantile(numbers.sort(ascending), 0.5); | ||
| }; | ||
| } |
@@ -21,2 +21,2 @@ export default function(arrays) { | ||
| return merged; | ||
| }; | ||
| } |
@@ -7,3 +7,3 @@ export default function(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if ((b = array[i]) != null && b >= b) { a = b; break; } | ||
@@ -19,2 +19,2 @@ while (++i < n) if ((b = array[i]) != null && a > b) a = b; | ||
| return a; | ||
| }; | ||
| } |
| export default function(x) { | ||
| return x === null ? NaN : +x; | ||
| }; | ||
| } |
| export default function(array) { | ||
| var i = 0, n = array.length - 1, p0, p1 = array[0], pairs = new Array(n < 0 ? 0 : n); | ||
| while (i < n) pairs[i] = [p0 = p1, p1 = array[++i]]; | ||
| var i = 0, n = array.length - 1, p = array[0], pairs = new Array(n < 0 ? 0 : n); | ||
| while (i < n) pairs[i] = [p, p = array[++i]]; | ||
| return pairs; | ||
| }; | ||
| } |
@@ -5,2 +5,2 @@ export default function(array, indexes) { | ||
| return permutes; | ||
| }; | ||
| } |
| import number from "./number"; | ||
| export default function(array, p, f) { | ||
| if (arguments.length < 3) f = number; | ||
| if (f == null) f = number; | ||
| if (!(n = array.length)) return; | ||
@@ -14,2 +14,2 @@ if ((p = +p) <= 0 || n < 2) return +f(array[0], 0, array); | ||
| return a + (b - a) * (h - i); | ||
| }; | ||
| } |
| export default function(start, stop, step) { | ||
| if ((n = arguments.length) < 3) { | ||
| step = 1; | ||
| if (n < 2) { | ||
| stop = start; | ||
| start = 0; | ||
| } | ||
| } | ||
| start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step; | ||
@@ -19,2 +13,2 @@ var i = -1, | ||
| return range; | ||
| }; | ||
| } |
@@ -16,2 +16,2 @@ import ascending from "./ascending"; | ||
| if (compare(xj, xj) === 0) return j; | ||
| }; | ||
| } |
| export default function(array, i0, i1) { | ||
| if ((m = arguments.length) < 3) { | ||
| i1 = array.length; | ||
| if (m < 2) i0 = 0; | ||
| } | ||
| var m = i1 - i0, | ||
| var m = (i1 == null ? array.length : i1) - (i0 = i0 == null ? 0 : +i0), | ||
| t, | ||
@@ -19,2 +14,2 @@ i; | ||
| return array; | ||
| }; | ||
| } |
@@ -7,3 +7,3 @@ export default function(array, f) { | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) if (a = +array[i]) s += a; // Note: zero and null are equivalent. | ||
@@ -17,2 +17,2 @@ } | ||
| return s; | ||
| }; | ||
| } |
@@ -7,2 +7,2 @@ import ascending from "../ascending"; | ||
| return Math.ceil((max - min) / (2 * (quantile(values, 0.75) - quantile(values, 0.25)) * Math.pow(values.length, -1 / 3))); | ||
| }; | ||
| } |
@@ -5,2 +5,2 @@ import deviation from "../deviation"; | ||
| return Math.ceil((max - min) / (3.5 * deviation(values) * Math.pow(values.length, -1 / 3))); | ||
| }; | ||
| } |
| export default function(values) { | ||
| return Math.ceil(Math.log(values.length) / Math.LN2) + 1; | ||
| }; | ||
| } |
@@ -14,3 +14,3 @@ import range from "./range"; | ||
| ); | ||
| }; | ||
| } | ||
@@ -25,2 +25,2 @@ export function tickStep(start, stop, count) { | ||
| return stop < start ? -step1 : step1; | ||
| }; | ||
| } |
@@ -11,3 +11,3 @@ import min from "./min"; | ||
| return transpose; | ||
| }; | ||
| } | ||
@@ -14,0 +14,0 @@ function length(d) { |
@@ -12,3 +12,3 @@ import number from "./number"; | ||
| if (arguments.length === 1) { | ||
| if (f == null) { | ||
| while (++i < n) { | ||
@@ -34,2 +34,2 @@ if (!isNaN(a = number(array[i]))) { | ||
| if (j > 1) return s / (j - 1); | ||
| }; | ||
| } |
@@ -5,2 +5,2 @@ import transpose from "./transpose"; | ||
| return transpose(arguments); | ||
| }; | ||
| } |
New alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Fixed alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Improved metrics
- Number of package files
- increased by2.63%
39
Worsened metrics
- Total package byte prevSize
- decreased by-0.53%
68306
- Lines of code
- decreased by-2.48%
788