# d3-array

Data in JavaScript is often represented by an array, and so one tends to manipulate arrays when visualizing or analyzing data. Some common forms of manipulation include taking a contiguous slice (subset) of an array, filtering an array using a predicate function, and mapping an array to a parallel set of values using a transform function. Before looking at the set of utilities that this module provides, familiarize yourself with the powerful array methods built-in to JavaScript.

JavaScript includes **mutation methods** that modify the array:

*array*.pop - Remove the last element from the array.*array*.push - Add one or more elements to the end of the array.*array*.reverse - Reverse the order of the elements of the array.*array*.shift - Remove the first element from the array.*array*.sort - Sort the elements of the array.*array*.splice - Add or remove elements from the array.*array*.unshift - Add one or more elements to the front of the array.

There are also **access methods** that return some representation of the array:

*array*.concat - Join the array with other array(s) or value(s).*array*.join - Join all elements of the array into a string.*array*.slice - Extract a section of the array.*array*.indexOf - Find the first occurrence of a value within the array.*array*.lastIndexOf - Find the last occurrence of a value within the array.

And finally **iteration methods** that apply functions to elements in the array:

*array*.filter - Create a new array with only the elements for which a predicate is true.*array*.forEach - Call a function for each element in the array.*array*.every - See if every element in the array satisfies a predicate.*array*.map - Create a new array with the result of calling a function on every element in the array.*array*.some - See if at least one element in the array satisfies a predicate.*array*.reduce - Apply a function to reduce the array to a single value (from left-to-right).*array*.reduceRight - Apply a function to reduce the array to a single value (from right-to-left).

## Installing

If you use NPM, `npm install d3-array`

. Otherwise, download the latest release. You can also load directly from d3js.org, either as a standalone library or as part of D3 4.0. AMD, CommonJS, and vanilla environments are supported. In vanilla, a `d3`

global is exported:

```
<script src="https://d3js.org/d3-array.v1.min.js"></script>
<script>
var min = d3.min(array);
</script>
```

## API Reference

### Statistics

Methods for computing basic summary statistics.

# d3.**min**(*array*[, *accessor*]) <>

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.

Unlike the built-in Math.min, this method ignores undefined, null and NaN values; this is useful for ignoring missing data. In addition, elements are compared using *natural* order rather than *numeric* order. For example, the minimum of ["20", "3"] is "20", while the minimum of [20, 3] is 3.

# d3.**max**(*array*[, *accessor*]) <>

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.

Unlike the built-in Math.max, this method ignores undefined values; this is useful for ignoring missing data. In addition, elements are compared using *natural* order rather than *numeric* order. For example, the maximum of ["20", "3"] is "3", while the maximum of [20, 3] is 20.

# d3.**extent**(*array*[, *accessor*]) <>

Returns the minimum and maximum 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.

# d3.**sum**(*array*[, *accessor*]) <>

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.

# d3.**mean**(*array*[, *accessor*]) <>

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.

# d3.**median**(*array*[, *accessor*]) <>

Returns the median of the given *array* of numbers using the R-7 method. 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.

# d3.**quantile**(*array*, *p*[, *accessor*]) <>

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, which is the default for the R programming language and Excel. For example:

```
var a = [0, 10, 30];
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
```

An optional *accessor* function may be specified, which is equivalent to calling *array.map(accessor)* before computing the quantile.

# d3.**variance**(*array*[, *accessor*]) <>

Returns an unbiased estimator of the population 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 variance. This method ignores undefined and NaN values; this is useful for ignoring missing data.

# d3.**deviation**(*array*[, *accessor*]) <>

Returns the standard deviation, defined as the square root of the bias-corrected 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.

### Search

Methods for searching arrays for a specific element.

# d3.**scan**(*array*[, *comparator*]) <>

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. For example:

```
var array = [{foo: 42}, {foo: 91}];
d3.scan(array, function(a, b) { return a.foo - b.foo; }); // 0
d3.scan(array, function(a, b) { return b.foo - a.foo; }); // 1
```

This function is similar to min, except it allows the use of a comparator rather than an accessor and it returns the index instead of the accessed value. See also bisect.

# d3.**bisectLeft**(*array*, *x*[, *lo*[, *hi*]]) <>

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 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.

# d3.**bisect**(*array*, *x*[, *lo*[, *hi*]]) <>

# d3.**bisectRight**(*array*, *x*[, *lo*[, *hi*]]) <>

Similar to 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.

# d3.**bisector**(*accessor*) <>

# d3.**bisector**(*comparator*) <>

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:

```
var data = [
{date: new Date(2011, 1, 1), value: 0.5},
{date: new Date(2011, 2, 1), value: 0.6},
{date: new Date(2011, 3, 1), value: 0.7},
{date: new Date(2011, 4, 1), value: 0.8}
];
```

A suitable bisect function could be constructed as:

`var bisectDate = d3.bisector(function(d) { return d.date; }).right;`

This is equivalent to specifying a comparator:

`var bisectDate = d3.bisector(function(d, x) { return d.date - x; }).right;`

And then applied as `bisectDate(data, new Date(2011, 1, 2))`

, returning an index. Note that the comparator is always passed the search value *x* as the second argument. Use a comparator rather than an accessor if you want values to be sorted in an order different than natural order, such as in descending rather than ascending order.

# *bisector*.**left**(*array*, *x*[, *lo*[, *hi*]]) <>

Equivalent to bisectLeft, but uses this bisector’s associated comparator.

# *bisector*.**right**(*array*, *x*[, *lo*[, *hi*]]) <>

Equivalent to bisectRight, but uses this bisector’s associated comparator.

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 method to arrange elements in ascending order. It is implemented as:

```
function ascending(a, b) {
return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
}
```

Note that if no comparator function is specified to the built-in sort method, the default order is lexicographic (alphabetical), not natural! This can lead to surprising behavior when sorting an array of numbers.

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:

```
function descending(a, b) {
return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;
}
```

Note that if no comparator function is specified to the built-in sort method, the default order is lexicographic (alphabetical), not natural! This can lead to surprising behavior when sorting an array of numbers.

### Transformations

Methods for transforming arrays and for generating new arrays.

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.

`d3.merge([[1], [2, 3]]); // returns [1, 2, 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:

`d3.pairs([1, 2, 3, 4]); // returns [[1, 2], [2, 3], [3, 4]]`

If the specified array has fewer than two elements, returns the empty array.

# d3.**permute**(*array*, *indexes*) <>

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])
returns ["b", "c", "a"]. It is acceptable for the array of indexes to be a different length from the array of elements, and for indexes to be duplicated or omitted.

This method can also be used to extract the values from an object into an array with a stable order. Extracting keyed values in order can be useful for generating data arrays in nested selections. For example:

```
var object = {yield: 27, variety: "Manchuria", year: 1931, site: "University Farm"},
fields = ["site", "variety", "yield"];
d3.permute(object, fields); // returns ["University Farm", "Manchuria", 27]
```

# d3.**shuffle**(*array*[, *lo*[, *hi*]]) <>

Randomizes the order of the specified *array* using the Fisher–Yates shuffle.

# d3.**ticks**(*start*, *stop*, *count*) <>

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 and *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 to format numbers for human consumption.

Ticks are inclusive in the sense that they may include the specified *start* and *stop* values if (and only if) they are exact, nicely-rounded values consistent with the inferred step. More formally, each returned tick *t* satisfies *start* ≤ *t* and *t* ≤ *stop*.

# d3.**tickStep**(*start*, *stop*, *count*) <>

Returns the difference between adjacent tick values if the same arguments were passed to 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 to format numbers for human consumption.

# d3.**range**([*start*, ]*stop*[, *step*]) <>

Returns an array containing an arithmetic progression, similar to the Python built-in 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 for nicely-rounded values.)

If *step* is omitted, it defaults to 1. If *start* is omitted, it defaults to 0. The *stop* value is exclusive; it is not included in the result. If *step* is positive, the last element is the largest *start* + *i* * *step* less than *stop*; if *step* is negative, the last element is the smallest *start* + *i* * *step* greater than *stop*. If the returned array would contain an infinite number of values, an empty range is returned.

The arguments are not required to be integers; however, the results are more predictable if they are. The values in the returned array are defined as *start* + *i* * *step*, where *i* is an integer from zero to one minus the total number of elements in the returned array. For example:

`d3.range(0, 1, 0.2) // [0, 0.2, 0.4, 0.6000000000000001, 0.8]`

This unexpected behavior is due to IEEE 754 double-precision floating point, which defines 0.2 * 3 = 0.6000000000000001. Use d3-format to format numbers for human consumption with appropriate rounding; see also linear.tickFormat in d3-scale.

Likewise, if the returned array should have a specific length, consider using array.map on an integer range. For example:

```
d3.range(0, 1, 1 / 49); // BAD: returns 50 elements!
d3.range(49).map(function(d) { return d / 49; }); // GOOD: returns 49 elements.
```

Uses the zip operator as a two-dimensional matrix transpose.

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.

`d3.zip([1, 2], [3, 4]); // returns [[1, 3], [2, 4]]`

### Histograms

Histograms bin many discrete samples into a smaller number of consecutive, non-overlapping intervals. They are often used to visualize the distribution of numerical data.

Constructs a new histogram generator with the default settings.

Computes the histogram for the given array of *data* samples. Returns an array of bins, where each bin is an array containing the associated elements from the input *data*. Thus, the `length`

of the bin is the number of elements in that bin. Each bin has two additional attributes:

`x0`

- the lower bound of the bin (inclusive).`x1`

- the upper bound of the bin (exclusive, except for the last bin).

If *value* is specified, sets the value accessor to the specified function or constant and returns this histogram generator. If *value* is not specified, returns the current value accessor, which defaults to the identity function.

When a histogram is generated, the value accessor will be invoked for each element in the input data array, being passed the element `d`

, the index `i`

, and the array `data`

as three arguments. The default value accessor assumes that the input data are orderable (comparable), such as numbers or dates. If your data are not, then you should specify an accessor that returns the corresponding orderable value for a given datum.

This is similar to mapping your data to values before invoking the histogram generator, but has the benefit that the input data remains associated with the returned bins, thereby making it easier to access other fields of the data.

# *histogram*.**domain**([*domain*]) <>

If *domain* is specified, sets the domain accessor to the specified function or array and returns this histogram generator. If *domain* is not specified, returns the current domain accessor, which defaults to extent. The histogram domain is defined as an array [*min*, *max*], where *min* is the minimum observable value and *max* is the maximum observable value; both values are inclusive. Any value outside of this domain will be ignored when the histogram is generated.

For example, if you are using the the histogram in conjunction with a linear scale `x`

, you might say:

```
var histogram = d3.histogram()
.domain(x.domain())
.thresholds(x.ticks(20));
```

You can then compute the bins from an array of numbers like so:

`var bins = histogram(numbers);`

Note that the domain accessor is invoked on the materialized array of values, not on the input data array.

# *histogram*.**thresholds**([*count*]) <>

# *histogram*.**thresholds**([*thresholds*]) <>

If *thresholds* is specified, sets the threshold generator to the specified function or array and returns this histogram generator. If *thresholds* is not specified, returns the current threshold generator, which by default implements Sturges’ formula. (Thus by default, the histogram values must be numbers!) Thresholds are defined as an array of values [*x0*, *x1*, …]. Any value less than *x0* will be placed in the first bin; any value greater than or equal to *x0* but less than *x1* will be placed in the second bin; and so on. Thus, the generated histogram will have *thresholds*.length + 1 bins. See histogram thresholds for more information.

If a *count* is specified instead of an array of *thresholds*, then the domain will be uniformly divided into approximately *count* bins; see ticks.

### Histogram Thresholds

These functions are typically not used directly; instead, pass them to *histogram*.thresholds. You may also implement your own threshold generator taking three arguments: the array of input *values* derived from the data, and the observable domain represented as *min* and *max*. The generator may then return either the array of numeric thresholds or the *count* of bins; in the latter case the domain is divided uniformly into approximately *count* bins; see ticks.

# d3.**thresholdFreedmanDiaconis**(*values*, *min*, *max*) <>

Returns the number of bins according to the Freedman–Diaconis rule; the input *values* must be numbers.

# d3.**thresholdScott**(*values*, *min*, *max*) <>

Returns the number of bins according to Scott’s normal reference rule; the input *values* must be numbers.

# d3.**thresholdSturges**(*values*) <>

Returns the number of bins according to Sturges’ formula; the input *values* must be numbers.