Skip to content

Commit

Permalink
Update d3-array, d3-scale.
Browse files Browse the repository at this point in the history
  • Loading branch information
@mbostock
mbostock committed Sep 23, 2020
1 parent 5e516a5 commit ffb43e6
Show file tree
Hide file tree
Showing 2 changed files with 96 additions and 76 deletions.
156 changes: 88 additions & 68 deletions API.md
View file
Expand Up @@ -2,7 +2,7 @@

D3 is a [collection of modules](https://github.com/d3) that are designed to work together; you can use the modules independently, or you can use them together as part of the default build. The source and documentation for each module is available in its repository. Follow the links below to learn more. For changes between major versions, see [CHANGES](https://github.com/d3/d3/blob/master/CHANGES.md); see also the [release notes](https://github.com/d3/d3/releases) and the [3.x reference](https://github.com/d3/d3-3.x-api-reference/blob/master/API-Reference.md).

* [Arrays](#arrays-d3-array) ([Statistics](#statistics), [Search](#search), [Transformations](#transformations), [Histograms](#histograms))
* [Arrays](#arrays-d3-array) ([Statistics](#statistics), [Search](#search), [Iterables](#iterables), [Sets](#sets), [Transformations](#transformations), [Histograms](#histograms))
* [Axes](#axes-d3-axis)
* [Brushes](#brushes-d3-brush)
* [Chords](#chords-d3-chord)
Expand Down Expand Up @@ -35,88 +35,108 @@ D3 is a [collection of modules](https://github.com/d3) that are designed to work

D3 uses [semantic versioning](http://semver.org/). The current version is exposed as d3.version.

## [Arrays (d3-array)](https://github.com/d3/d3-array/tree/v2.7.1)
## [Arrays (d3-array)](https://github.com/d3/d3-array/tree/v2.8.0)

Array manipulation, ordering, searching, summarizing, etc.

### [Statistics](https://github.com/d3/d3-array/blob/v2.7.1/README.md#statistics)
### [Statistics](https://github.com/d3/d3-array/blob/v2.8.0/README.md#statistics)

Methods for computing basic summary statistics.

* [d3.min](https://github.com/d3/d3-array/blob/v2.7.1/README.md#min) - compute the minimum value in an iterable.
* [d3.minIndex](https://github.com/d3/d3-array/blob/v2.7.1/README.md#minIndex) - compute the index of the minimum value in an iterable.
* [d3.max](https://github.com/d3/d3-array/blob/v2.7.1/README.md#max) - compute the maximum value in an iterable.
* [d3.maxIndex](https://github.com/d3/d3-array/blob/v2.7.1/README.md#maxIndex) - compute the index of the maximum value in an iterable.
* [d3.extent](https://github.com/d3/d3-array/blob/v2.7.1/README.md#extent) - compute the minimum and maximum value in an iterable.
* [d3.sum](https://github.com/d3/d3-array/blob/v2.7.1/README.md#sum) - compute the sum of an iterable of numbers.
* [d3.mean](https://github.com/d3/d3-array/blob/v2.7.1/README.md#mean) - compute the arithmetic mean of an iterable of numbers.
* [d3.median](https://github.com/d3/d3-array/blob/v2.7.1/README.md#median) - compute the median of an iterable of numbers (the 0.5-quantile).
* [d3.cumsum](https://github.com/d3/d3-array/blob/v2.7.1/README.md#cumsum) - comute the cumulative sum of an iterable.
* [d3.quantile](https://github.com/d3/d3-array/blob/v2.7.1/README.md#quantile) - compute a quantile for an iterable of numbers.
* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v2.7.1/README.md#quantileSorted) - compute a quantile for a sorted array of numbers.
* [d3.variance](https://github.com/d3/d3-array/blob/v2.7.1/README.md#variance) - compute the variance of an iterable of numbers.
* [d3.deviation](https://github.com/d3/d3-array/blob/v2.7.1/README.md#deviation) - compute the standard deviation of an iterable of numbers.
* [d3.fsum](https://github.com/d3/d3-array/blob/v2.7.1/README.md#fsum) - compute a full precision summation of an iterable of numbers.
* [new d3.Adder](https://github.com/d3/d3-array/blob/v2.7.1/README.md#adder) - creates a full precision adder.
* [*adder*.add](https://github.com/d3/d3-array/blob/v2.7.1/README.md#adder_add) - add a value to an adder.
* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v2.7.1/README.md#adder_valueOf) - returns a double precision representation of an adder’s value.

### [Search](https://github.com/d3/d3-array/blob/v2.7.1/README.md#search)
* [d3.min](https://github.com/d3/d3-array/blob/v2.8.0/README.md#min) - compute the minimum value in an iterable.
* [d3.minIndex](https://github.com/d3/d3-array/blob/v2.8.0/README.md#minIndex) - compute the index of the minimum value in an iterable.
* [d3.max](https://github.com/d3/d3-array/blob/v2.8.0/README.md#max) - compute the maximum value in an iterable.
* [d3.maxIndex](https://github.com/d3/d3-array/blob/v2.8.0/README.md#maxIndex) - compute the index of the maximum value in an iterable.
* [d3.extent](https://github.com/d3/d3-array/blob/v2.8.0/README.md#extent) - compute the minimum and maximum value in an iterable.
* [d3.sum](https://github.com/d3/d3-array/blob/v2.8.0/README.md#sum) - compute the sum of an iterable of numbers.
* [d3.mean](https://github.com/d3/d3-array/blob/v2.8.0/README.md#mean) - compute the arithmetic mean of an iterable of numbers.
* [d3.median](https://github.com/d3/d3-array/blob/v2.8.0/README.md#median) - compute the median of an iterable of numbers (the 0.5-quantile).
* [d3.cumsum](https://github.com/d3/d3-array/blob/v2.8.0/README.md#cumsum) - comute the cumulative sum of an iterable.
* [d3.quantile](https://github.com/d3/d3-array/blob/v2.8.0/README.md#quantile) - compute a quantile for an iterable of numbers.
* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v2.8.0/README.md#quantileSorted) - compute a quantile for a sorted array of numbers.
* [d3.variance](https://github.com/d3/d3-array/blob/v2.8.0/README.md#variance) - compute the variance of an iterable of numbers.
* [d3.deviation](https://github.com/d3/d3-array/blob/v2.8.0/README.md#deviation) - compute the standard deviation of an iterable of numbers.
* [d3.fsum](https://github.com/d3/d3-array/blob/v2.8.0/README.md#fsum) - compute a full precision summation of an iterable of numbers.
* [new d3.Adder](https://github.com/d3/d3-array/blob/v2.8.0/README.md#adder) - creates a full precision adder.
* [*adder*.add](https://github.com/d3/d3-array/blob/v2.8.0/README.md#adder_add) - add a value to an adder.
* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v2.8.0/README.md#adder_valueOf) - returns a double precision representation of an adder’s value.

### [Search](https://github.com/d3/d3-array/blob/v2.8.0/README.md#search)

Methods for searching arrays for a specific element.

* [d3.least](https://github.com/d3/d3-array/blob/v2.7.1/README.md#least) - returns the least element of an iterable.
* [d3.leastIndex](https://github.com/d3/d3-array/blob/v2.7.1/README.md#leastIndex) - returns the index of the least element of an iterable.
* [d3.greatest](https://github.com/d3/d3-array/blob/v2.7.1/README.md#greatest) - returns the greatest element of an iterable.
* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v2.7.1/README.md#greatestIndex) - returns the index of the greatest element of an iterable.
* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisectCenter) - binary search for a value in a sorted array.
* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisectLeft) - binary search for a value in a sorted array.
* [d3.bisect](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisect) - binary search for a value in a sorted array.
* [d3.bisectRight](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisectRight) - binary search for a value in a sorted array.
* [d3.bisector](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisector) - bisect using an accessor or comparator.
* [*bisector*.center](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisector_center) - binary search for a value in a sorted array.
* [*bisector*.left](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisector_left) - bisectLeft, with the given comparator.
* [*bisector*.right](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bisector_right) - bisectRight, with the given comparator.
* [d3.quickselect](https://github.com/d3/d3-array/blob/v2.7.1/README.md#quickselect) - reorder an array of numbers.
* [d3.ascending](https://github.com/d3/d3-array/blob/v2.7.1/README.md#ascending) - compute the natural order of two values.
* [d3.descending](https://github.com/d3/d3-array/blob/v2.7.1/README.md#descending) - compute the natural order of two values.

### [Transformations](https://github.com/d3/d3-array/blob/v2.7.1/README.md#transformations)
* [d3.least](https://github.com/d3/d3-array/blob/v2.8.0/README.md#least) - returns the least element of an iterable.
* [d3.leastIndex](https://github.com/d3/d3-array/blob/v2.8.0/README.md#leastIndex) - returns the index of the least element of an iterable.
* [d3.greatest](https://github.com/d3/d3-array/blob/v2.8.0/README.md#greatest) - returns the greatest element of an iterable.
* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v2.8.0/README.md#greatestIndex) - returns the index of the greatest element of an iterable.
* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisectCenter) - binary search for a value in a sorted array.
* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisectLeft) - binary search for a value in a sorted array.
* [d3.bisect](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisect) - binary search for a value in a sorted array.
* [d3.bisectRight](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisectRight) - binary search for a value in a sorted array.
* [d3.bisector](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisector) - bisect using an accessor or comparator.
* [*bisector*.center](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisector_center) - binary search for a value in a sorted array.
* [*bisector*.left](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisector_left) - bisectLeft, with the given comparator.
* [*bisector*.right](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bisector_right) - bisectRight, with the given comparator.
* [d3.quickselect](https://github.com/d3/d3-array/blob/v2.8.0/README.md#quickselect) - reorder an array of numbers.
* [d3.ascending](https://github.com/d3/d3-array/blob/v2.8.0/README.md#ascending) - compute the natural order of two values.
* [d3.descending](https://github.com/d3/d3-array/blob/v2.8.0/README.md#descending) - compute the natural order of two values.

### [Transformations](https://github.com/d3/d3-array/blob/v2.8.0/README.md#transformations)

Methods for transforming arrays and for generating new arrays.

* [d3.group](https://github.com/d3/d3-array/blob/v2.7.1/README.md#group) - group an iterable into a nested Map.
* [d3.groups](https://github.com/d3/d3-array/blob/v2.7.1/README.md#groups) - group an iterable into a nested array.
* [d3.index](https://github.com/d3/d3-array/blob/v2.7.1/README.md#index) - index an iterable into a nested Map.
* [d3.indexes](https://github.com/d3/d3-array/blob/v2.7.1/README.md#indexes) - index an iterable into a nested array.
* [d3.rollup](https://github.com/d3/d3-array/blob/v2.7.1/README.md#rollup) - reduce an iterable into a nested Map.
* [d3.rollups](https://github.com/d3/d3-array/blob/v2.7.1/README.md#rollups) - reduce an iterable into a nested array.
* [d3.count](https://github.com/d3/d3-array/blob/v2.7.1/README.md#count) - count valid number values in an iterable.
* [d3.cross](https://github.com/d3/d3-array/blob/v2.7.1/README.md#cross) - compute the Cartesian product of two iterables.
* [d3.merge](https://github.com/d3/d3-array/blob/v2.7.1/README.md#merge) - merge multiple iterables into one array.
* [d3.pairs](https://github.com/d3/d3-array/blob/v2.7.1/README.md#pairs) - create an array of adjacent pairs of elements.
* [d3.permute](https://github.com/d3/d3-array/blob/v2.7.1/README.md#permute) - reorder an iterable of elements according to an iterable of indexes.
* [d3.shuffle](https://github.com/d3/d3-array/blob/v2.7.1/README.md#shuffle) - randomize the order of an iterable.
* [d3.shuffler](https://github.com/d3/d3-array/blob/v2.7.1/README.md#shuffler) - randomize the order of an iterable.
* [d3.ticks](https://github.com/d3/d3-array/blob/v2.7.1/README.md#ticks) - generate representative values from a numeric interval.
* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v2.7.1/README.md#tickIncrement) - generate representative values from a numeric interval.
* [d3.tickStep](https://github.com/d3/d3-array/blob/v2.7.1/README.md#tickStep) - generate representative values from a numeric interval.
* [d3.range](https://github.com/d3/d3-array/blob/v2.7.1/README.md#range) - generate a range of numeric values.
* [d3.transpose](https://github.com/d3/d3-array/blob/v2.7.1/README.md#transpose) - transpose an array of arrays.
* [d3.zip](https://github.com/d3/d3-array/blob/v2.7.1/README.md#zip) - transpose a variable number of arrays.

### [Histograms](https://github.com/d3/d3-array/blob/v2.7.1/README.md#histograms)
* [d3.group](https://github.com/d3/d3-array/blob/v2.8.0/README.md#group) - group an iterable into a nested Map.
* [d3.groups](https://github.com/d3/d3-array/blob/v2.8.0/README.md#groups) - group an iterable into a nested array.
* [d3.index](https://github.com/d3/d3-array/blob/v2.8.0/README.md#index) - index an iterable into a nested Map.
* [d3.indexes](https://github.com/d3/d3-array/blob/v2.8.0/README.md#indexes) - index an iterable into a nested array.
* [d3.rollup](https://github.com/d3/d3-array/blob/v2.8.0/README.md#rollup) - reduce an iterable into a nested Map.
* [d3.rollups](https://github.com/d3/d3-array/blob/v2.8.0/README.md#rollups) - reduce an iterable into a nested array.
* [d3.count](https://github.com/d3/d3-array/blob/v2.8.0/README.md#count) - count valid number values in an iterable.
* [d3.cross](https://github.com/d3/d3-array/blob/v2.8.0/README.md#cross) - compute the Cartesian product of two iterables.
* [d3.merge](https://github.com/d3/d3-array/blob/v2.8.0/README.md#merge) - merge multiple iterables into one array.
* [d3.pairs](https://github.com/d3/d3-array/blob/v2.8.0/README.md#pairs) - create an array of adjacent pairs of elements.
* [d3.permute](https://github.com/d3/d3-array/blob/v2.8.0/README.md#permute) - reorder an iterable of elements according to an iterable of indexes.
* [d3.shuffle](https://github.com/d3/d3-array/blob/v2.8.0/README.md#shuffle) - randomize the order of an iterable.
* [d3.shuffler](https://github.com/d3/d3-array/blob/v2.8.0/README.md#shuffler) - randomize the order of an iterable.
* [d3.ticks](https://github.com/d3/d3-array/blob/v2.8.0/README.md#ticks) - generate representative values from a numeric interval.
* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v2.8.0/README.md#tickIncrement) - generate representative values from a numeric interval.
* [d3.tickStep](https://github.com/d3/d3-array/blob/v2.8.0/README.md#tickStep) - generate representative values from a numeric interval.
* [d3.nice](https://github.com/d3/d3-array/blob/v2.8.0/README.md#nice) - extend an interval to align with ticks.
* [d3.range](https://github.com/d3/d3-array/blob/v2.8.0/README.md#range) - generate a range of numeric values.
* [d3.transpose](https://github.com/d3/d3-array/blob/v2.8.0/README.md#transpose) - transpose an array of arrays.
* [d3.zip](https://github.com/d3/d3-array/blob/v2.8.0/README.md#zip) - transpose a variable number of arrays.

### [Iterables](https://github.com/d3/d3-array/blob/v2.8.0/README.md#iterables)

* [d3.every](https://github.com/d3/d3-array/blob/v2.8.0/README.md#every) - test if all values satisfy a condition.
* [d3.some](https://github.com/d3/d3-array/blob/v2.8.0/README.md#some) - test if any value satisfies a condition.
* [d3.filter](https://github.com/d3/d3-array/blob/v2.8.0/README.md#filter) - filter values.
* [d3.map](https://github.com/d3/d3-array/blob/v2.8.0/README.md#map) - map values.
* [d3.reduce](https://github.com/d3/d3-array/blob/v2.8.0/README.md#reduce) - reduce values.
* [d3.reverse](https://github.com/d3/d3-array/blob/v2.8.0/README.md#reverse) - reverse the order of values.
* [d3.sort](https://github.com/d3/d3-array/blob/v2.8.0/README.md#sort) - sort values.

### [Sets](https://github.com/d3/d3-array/blob/v2.8.0/README.md#sets)

* [d3.difference](https://github.com/d3/d3-array/blob/v2.8.0/README.md#difference) - compute a set difference.
* [d3.disjoint](https://github.com/d3/d3-array/blob/v2.8.0/README.md#disjoint) - test whether two sets are disjoint.
* [d3.intersection](https://github.com/d3/d3-array/blob/v2.8.0/README.md#intersection) - compute a set intersection.
* [d3.superset](https://github.com/d3/d3-array/blob/v2.8.0/README.md#superset) - test whether a set is a superset of another.
* [d3.subset](https://github.com/d3/d3-array/blob/v2.8.0/README.md#subset) - test whether a set is a subset of another.
* [d3.union](https://github.com/d3/d3-array/blob/v2.8.0/README.md#union) - compute a set union.

### [Histograms](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bins)

Bin discrete samples into continuous, non-overlapping intervals.

* [d3.bin](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bin) - create a new bin generator.
* [*bin*](https://github.com/d3/d3-array/blob/v2.7.1/README.md#_bin) - bins a given array of samples.
* [*bin*.value](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bin_value)- specify a value accessor for each sample.
* [*bin*.domain](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bin_domain) - specify the interval of observable values.
* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v2.7.1/README.md#bin_thresholds) - specify how values are divided into bins.
* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v2.7.1/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule.
* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v2.7.1/README.md#thresholdScott) - Scott’s normal reference binning rule.
* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v2.7.1/README.md#thresholdSturges) - Sturges’ binning formula.
* [d3.bin](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bin) - create a new bin generator.
* [*bin*](https://github.com/d3/d3-array/blob/v2.8.0/README.md#_bin) - bins a given array of samples.
* [*bin*.value](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bin_value)- specify a value accessor for each sample.
* [*bin*.domain](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bin_domain) - specify the interval of observable values.
* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v2.8.0/README.md#bin_thresholds) - specify how values are divided into bins.
* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v2.8.0/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule.
* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v2.8.0/README.md#thresholdScott) - Scott’s normal reference binning rule.
* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v2.8.0/README.md#thresholdSturges) - Sturges’ binning formula.

## [Axes (d3-axis)](https://github.com/d3/d3-axis/tree/v2.0.0)

Expand Down

0 comments on commit ffb43e6

Please sign in to comment.