archive-gh-me/d3
1
0
Fork 0
mirror of https://github.com/d3/d3.git synced 2025-12-08 19:46:24 +00:00
Code Issues Projects Releases Wiki Activity

d3-array 3.2.0

Browse Source
This commit is contained in:
Mike Bostock 2022-07-03 09:34:15 -04:00
parent d61883547c
commit 22f1dc734b
No known key found for this signature in database
GPG Key ID: C6817CA4CDEC8FDB
2 changed files with 119 additions and 114 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

183
API.md
View File

@ -35,119 +35,124 @@ 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/v3.1.6)
## [Arrays (d3-array)](https://github.com/d3/d3-array/tree/v3.2.0)
Array manipulation, ordering, searching, summarizing, etc.
### [Statistics](https://github.com/d3/d3-array/blob/v3.1.6/README.md#statistics)
### [Statistics](https://github.com/d3/d3-array/blob/v3.2.0/README.md#statistics)
Methods for computing basic summary statistics.
* [d3.min](https://github.com/d3/d3-array/blob/v3.1.6/README.md#min) - compute the minimum value in an iterable.
* [d3.minIndex](https://github.com/d3/d3-array/blob/v3.1.6/README.md#minIndex) - compute the index of the minimum value in an iterable.
* [d3.max](https://github.com/d3/d3-array/blob/v3.1.6/README.md#max) - compute the maximum value in an iterable.
* [d3.maxIndex](https://github.com/d3/d3-array/blob/v3.1.6/README.md#maxIndex) - compute the index of the maximum value in an iterable.
* [d3.extent](https://github.com/d3/d3-array/blob/v3.1.6/README.md#extent) - compute the minimum and maximum value in an iterable.
* [d3.sum](https://github.com/d3/d3-array/blob/v3.1.6/README.md#sum) - compute the sum of an iterable of numbers.
* [d3.mean](https://github.com/d3/d3-array/blob/v3.1.6/README.md#mean) - compute the arithmetic mean of an iterable of numbers.
* [d3.median](https://github.com/d3/d3-array/blob/v3.1.6/README.md#median) - compute the median of an iterable of numbers (the 0.5-quantile).
* [d3.mode](https://github.com/d3/d3-array/blob/v3.1.6/README.md#mode) - compute the mode (the most common value) of an iterable of numbers.
* [d3.cumsum](https://github.com/d3/d3-array/blob/v3.1.6/README.md#cumsum) - compute the cumulative sum of an iterable.
* [d3.rank](https://github.com/d3/d3-array/blob/v3.1.6/README.md#rank) - compute the rank order of an iterable.
* [d3.quantile](https://github.com/d3/d3-array/blob/v3.1.6/README.md#quantile) - compute a quantile for an iterable of numbers.
* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v3.1.6/README.md#quantileSorted) - compute a quantile for a sorted array of numbers.
* [d3.variance](https://github.com/d3/d3-array/blob/v3.1.6/README.md#variance) - compute the variance of an iterable of numbers.
* [d3.deviation](https://github.com/d3/d3-array/blob/v3.1.6/README.md#deviation) - compute the standard deviation of an iterable of numbers.
* [d3.fcumsum](https://github.com/d3/d3-array/blob/v3.1.6/README.md#fcumsum) - compute a full precision cumulative summation of numbers.
* [d3.fsum](https://github.com/d3/d3-array/blob/v3.1.6/README.md#fsum) - compute a full precision summation of an iterable of numbers.
* [new d3.Adder](https://github.com/d3/d3-array/blob/v3.1.6/README.md#adder) - creates a full precision adder.
* [*adder*.add](https://github.com/d3/d3-array/blob/v3.1.6/README.md#adder_add) - add a value to an adder.
* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v3.1.6/README.md#adder_valueOf) - returns a double precision representation of an adder’s value.
* [d3.min](https://github.com/d3/d3-array/blob/v3.2.0/README.md#min) - compute the minimum value in an iterable.
* [d3.minIndex](https://github.com/d3/d3-array/blob/v3.2.0/README.md#minIndex) - compute the index of the minimum value in an iterable.
* [d3.max](https://github.com/d3/d3-array/blob/v3.2.0/README.md#max) - compute the maximum value in an iterable.
* [d3.maxIndex](https://github.com/d3/d3-array/blob/v3.2.0/README.md#maxIndex) - compute the index of the maximum value in an iterable.
* [d3.extent](https://github.com/d3/d3-array/blob/v3.2.0/README.md#extent) - compute the minimum and maximum value in an iterable.
* [d3.sum](https://github.com/d3/d3-array/blob/v3.2.0/README.md#sum) - compute the sum of an iterable of numbers.
* [d3.mean](https://github.com/d3/d3-array/blob/v3.2.0/README.md#mean) - compute the arithmetic mean of an iterable of numbers.
* [d3.median](https://github.com/d3/d3-array/blob/v3.2.0/README.md#median) - compute the median of an iterable of numbers (the 0.5-quantile).
* [d3.medianIndex](https://github.com/d3/d3-array/blob/v3.2.0/README.md#median) - compute the median index of an iterable of numbers (the 0.5-quantile).
* [d3.mode](https://github.com/d3/d3-array/blob/v3.2.0/README.md#mode) - compute the mode (the most common value) of an iterable of numbers.
* [d3.cumsum](https://github.com/d3/d3-array/blob/v3.2.0/README.md#cumsum) - compute the cumulative sum of an iterable.
* [d3.rank](https://github.com/d3/d3-array/blob/v3.2.0/README.md#rank) - compute the rank order of an iterable.
* [d3.quantile](https://github.com/d3/d3-array/blob/v3.2.0/README.md#quantile) - compute a quantile for an iterable of numbers.
* [d3.quantileIndex](https://github.com/d3/d3-array/blob/v3.2.0/README.md#quantileIndex) - compute a quantile index for an iterable of numbers.
* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v3.2.0/README.md#quantileSorted) - compute a quantile for a sorted array of numbers.
* [d3.variance](https://github.com/d3/d3-array/blob/v3.2.0/README.md#variance) - compute the variance of an iterable of numbers.
* [d3.deviation](https://github.com/d3/d3-array/blob/v3.2.0/README.md#deviation) - compute the standard deviation of an iterable of numbers.
* [d3.fcumsum](https://github.com/d3/d3-array/blob/v3.2.0/README.md#fcumsum) - compute a full precision cumulative summation of numbers.
* [d3.fsum](https://github.com/d3/d3-array/blob/v3.2.0/README.md#fsum) - compute a full precision summation of an iterable of numbers.
* [new d3.Adder](https://github.com/d3/d3-array/blob/v3.2.0/README.md#adder) - creates a full precision adder.
* [*adder*.add](https://github.com/d3/d3-array/blob/v3.2.0/README.md#adder_add) - add a value to an adder.
* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v3.2.0/README.md#adder_valueOf) - returns a double precision representation of an adder’s value.
* [d3.blur](https://github.com/d3/d3-array/blob/v3.2.0/README.md#blur) - blur an array of numbers in place.
* [d3.blur2](https://github.com/d3/d3-array/blob/v3.2.0/README.md#blur2) - blur a two-dimensional array of numbers in place.
* [d3.blurImage](https://github.com/d3/d3-array/blob/v3.2.0/README.md#blurImage) - blur an RGBA ImageData in place.
### [Search](https://github.com/d3/d3-array/blob/v3.1.6/README.md#search)
### [Search](https://github.com/d3/d3-array/blob/v3.2.0/README.md#search)
Methods for searching arrays for a specific element.
* [d3.least](https://github.com/d3/d3-array/blob/v3.1.6/README.md#least) - returns the least element of an iterable.
* [d3.leastIndex](https://github.com/d3/d3-array/blob/v3.1.6/README.md#leastIndex) - returns the index of the least element of an iterable.
* [d3.greatest](https://github.com/d3/d3-array/blob/v3.1.6/README.md#greatest) - returns the greatest element of an iterable.
* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v3.1.6/README.md#greatestIndex) - returns the index of the greatest element of an iterable.
* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisectCenter) - binary search for a value in a sorted array.
* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisectLeft) - binary search for a value in a sorted array.
* [d3.bisect](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisect) - binary search for a value in a sorted array.
* [d3.bisectRight](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisectRight) - binary search for a value in a sorted array.
* [d3.bisector](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisector) - bisect using an accessor or comparator.
* [*bisector*.center](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisector_center) - binary search for a value in a sorted array.
* [*bisector*.left](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisector_left) - bisectLeft, with the given comparator.
* [*bisector*.right](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bisector_right) - bisectRight, with the given comparator.
* [d3.quickselect](https://github.com/d3/d3-array/blob/v3.1.6/README.md#quickselect) - reorder an array of numbers.
* [d3.ascending](https://github.com/d3/d3-array/blob/v3.1.6/README.md#ascending) - compute the natural order of two values.
* [d3.descending](https://github.com/d3/d3-array/blob/v3.1.6/README.md#descending) - compute the natural order of two values.
* [d3.least](https://github.com/d3/d3-array/blob/v3.2.0/README.md#least) - returns the least element of an iterable.
* [d3.leastIndex](https://github.com/d3/d3-array/blob/v3.2.0/README.md#leastIndex) - returns the index of the least element of an iterable.
* [d3.greatest](https://github.com/d3/d3-array/blob/v3.2.0/README.md#greatest) - returns the greatest element of an iterable.
* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v3.2.0/README.md#greatestIndex) - returns the index of the greatest element of an iterable.
* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisectCenter) - binary search for a value in a sorted array.
* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisectLeft) - binary search for a value in a sorted array.
* [d3.bisect](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisect) - binary search for a value in a sorted array.
* [d3.bisectRight](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisectRight) - binary search for a value in a sorted array.
* [d3.bisector](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisector) - bisect using an accessor or comparator.
* [*bisector*.center](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisector_center) - binary search for a value in a sorted array.
* [*bisector*.left](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisector_left) - bisectLeft, with the given comparator.
* [*bisector*.right](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bisector_right) - bisectRight, with the given comparator.
* [d3.quickselect](https://github.com/d3/d3-array/blob/v3.2.0/README.md#quickselect) - reorder an array of numbers.
* [d3.ascending](https://github.com/d3/d3-array/blob/v3.2.0/README.md#ascending) - compute the natural order of two values.
* [d3.descending](https://github.com/d3/d3-array/blob/v3.2.0/README.md#descending) - compute the natural order of two values.
### [Transformations](https://github.com/d3/d3-array/blob/v3.1.6/README.md#transformations)
### [Transformations](https://github.com/d3/d3-array/blob/v3.2.0/README.md#transformations)
Methods for transforming arrays and for generating new arrays.
* [d3.flatGroup](https://github.com/d3/d3-array/blob/v3.1.6/README.md#flatGroup) - group an iterable into a flat array.
* [d3.flatRollup](https://github.com/d3/d3-array/blob/v3.1.6/README.md#flatRollup) - reduce an iterable into a flat array.
* [d3.group](https://github.com/d3/d3-array/blob/v3.1.6/README.md#group) - group an iterable into a nested Map.
* [d3.groups](https://github.com/d3/d3-array/blob/v3.1.6/README.md#groups) - group an iterable into a nested array.
* [d3.groupSort](https://github.com/d3/d3-array/blob/v3.1.6/README.md#groupSort) - sort keys according to grouped values.
* [d3.index](https://github.com/d3/d3-array/blob/v3.1.6/README.md#index) - index an iterable into a nested Map.
* [d3.indexes](https://github.com/d3/d3-array/blob/v3.1.6/README.md#indexes) - index an iterable into a nested array.
* [d3.rollup](https://github.com/d3/d3-array/blob/v3.1.6/README.md#rollup) - reduce an iterable into a nested Map.
* [d3.rollups](https://github.com/d3/d3-array/blob/v3.1.6/README.md#rollups) - reduce an iterable into a nested array.
* [d3.count](https://github.com/d3/d3-array/blob/v3.1.6/README.md#count) - count valid number values in an iterable.
* [d3.cross](https://github.com/d3/d3-array/blob/v3.1.6/README.md#cross) - compute the Cartesian product of two iterables.
* [d3.merge](https://github.com/d3/d3-array/blob/v3.1.6/README.md#merge) - merge multiple iterables into one array.
* [d3.pairs](https://github.com/d3/d3-array/blob/v3.1.6/README.md#pairs) - create an array of adjacent pairs of elements.
* [d3.permute](https://github.com/d3/d3-array/blob/v3.1.6/README.md#permute) - reorder an iterable of elements according to an iterable of indexes.
* [d3.shuffle](https://github.com/d3/d3-array/blob/v3.1.6/README.md#shuffle) - randomize the order of an iterable.
* [d3.shuffler](https://github.com/d3/d3-array/blob/v3.1.6/README.md#shuffler) - randomize the order of an iterable.
* [d3.ticks](https://github.com/d3/d3-array/blob/v3.1.6/README.md#ticks) - generate representative values from a numeric interval.
* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v3.1.6/README.md#tickIncrement) - generate representative values from a numeric interval.
* [d3.tickStep](https://github.com/d3/d3-array/blob/v3.1.6/README.md#tickStep) - generate representative values from a numeric interval.
* [d3.nice](https://github.com/d3/d3-array/blob/v3.1.6/README.md#nice) - extend an interval to align with ticks.
* [d3.range](https://github.com/d3/d3-array/blob/v3.1.6/README.md#range) - generate a range of numeric values.
* [d3.transpose](https://github.com/d3/d3-array/blob/v3.1.6/README.md#transpose) - transpose an array of arrays.
* [d3.zip](https://github.com/d3/d3-array/blob/v3.1.6/README.md#zip) - transpose a variable number of arrays.
* [d3.flatGroup](https://github.com/d3/d3-array/blob/v3.2.0/README.md#flatGroup) - group an iterable into a flat array.
* [d3.flatRollup](https://github.com/d3/d3-array/blob/v3.2.0/README.md#flatRollup) - reduce an iterable into a flat array.
* [d3.group](https://github.com/d3/d3-array/blob/v3.2.0/README.md#group) - group an iterable into a nested Map.
* [d3.groups](https://github.com/d3/d3-array/blob/v3.2.0/README.md#groups) - group an iterable into a nested array.
* [d3.groupSort](https://github.com/d3/d3-array/blob/v3.2.0/README.md#groupSort) - sort keys according to grouped values.
* [d3.index](https://github.com/d3/d3-array/blob/v3.2.0/README.md#index) - index an iterable into a nested Map.
* [d3.indexes](https://github.com/d3/d3-array/blob/v3.2.0/README.md#indexes) - index an iterable into a nested array.
* [d3.rollup](https://github.com/d3/d3-array/blob/v3.2.0/README.md#rollup) - reduce an iterable into a nested Map.
* [d3.rollups](https://github.com/d3/d3-array/blob/v3.2.0/README.md#rollups) - reduce an iterable into a nested array.
* [d3.count](https://github.com/d3/d3-array/blob/v3.2.0/README.md#count) - count valid number values in an iterable.
* [d3.cross](https://github.com/d3/d3-array/blob/v3.2.0/README.md#cross) - compute the Cartesian product of two iterables.
* [d3.merge](https://github.com/d3/d3-array/blob/v3.2.0/README.md#merge) - merge multiple iterables into one array.
* [d3.pairs](https://github.com/d3/d3-array/blob/v3.2.0/README.md#pairs) - create an array of adjacent pairs of elements.
* [d3.permute](https://github.com/d3/d3-array/blob/v3.2.0/README.md#permute) - reorder an iterable of elements according to an iterable of indexes.
* [d3.shuffle](https://github.com/d3/d3-array/blob/v3.2.0/README.md#shuffle) - randomize the order of an iterable.
* [d3.shuffler](https://github.com/d3/d3-array/blob/v3.2.0/README.md#shuffler) - randomize the order of an iterable.
* [d3.ticks](https://github.com/d3/d3-array/blob/v3.2.0/README.md#ticks) - generate representative values from a numeric interval.
* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v3.2.0/README.md#tickIncrement) - generate representative values from a numeric interval.
* [d3.tickStep](https://github.com/d3/d3-array/blob/v3.2.0/README.md#tickStep) - generate representative values from a numeric interval.
* [d3.nice](https://github.com/d3/d3-array/blob/v3.2.0/README.md#nice) - extend an interval to align with ticks.
* [d3.range](https://github.com/d3/d3-array/blob/v3.2.0/README.md#range) - generate a range of numeric values.
* [d3.transpose](https://github.com/d3/d3-array/blob/v3.2.0/README.md#transpose) - transpose an array of arrays.
* [d3.zip](https://github.com/d3/d3-array/blob/v3.2.0/README.md#zip) - transpose a variable number of arrays.
### [Iterables](https://github.com/d3/d3-array/blob/v3.1.6/README.md#iterables)
### [Iterables](https://github.com/d3/d3-array/blob/v3.2.0/README.md#iterables)
* [d3.every](https://github.com/d3/d3-array/blob/v3.1.6/README.md#every) - test if all values satisfy a condition.
* [d3.some](https://github.com/d3/d3-array/blob/v3.1.6/README.md#some) - test if any value satisfies a condition.
* [d3.filter](https://github.com/d3/d3-array/blob/v3.1.6/README.md#filter) - filter values.
* [d3.map](https://github.com/d3/d3-array/blob/v3.1.6/README.md#map) - map values.
* [d3.reduce](https://github.com/d3/d3-array/blob/v3.1.6/README.md#reduce) - reduce values.
* [d3.reverse](https://github.com/d3/d3-array/blob/v3.1.6/README.md#reverse) - reverse the order of values.
* [d3.sort](https://github.com/d3/d3-array/blob/v3.1.6/README.md#sort) - sort values.
* [d3.every](https://github.com/d3/d3-array/blob/v3.2.0/README.md#every) - test if all values satisfy a condition.
* [d3.some](https://github.com/d3/d3-array/blob/v3.2.0/README.md#some) - test if any value satisfies a condition.
* [d3.filter](https://github.com/d3/d3-array/blob/v3.2.0/README.md#filter) - filter values.
* [d3.map](https://github.com/d3/d3-array/blob/v3.2.0/README.md#map) - map values.
* [d3.reduce](https://github.com/d3/d3-array/blob/v3.2.0/README.md#reduce) - reduce values.
* [d3.reverse](https://github.com/d3/d3-array/blob/v3.2.0/README.md#reverse) - reverse the order of values.
* [d3.sort](https://github.com/d3/d3-array/blob/v3.2.0/README.md#sort) - sort values.
### [Sets](https://github.com/d3/d3-array/blob/v3.1.6/README.md#sets)
### [Sets](https://github.com/d3/d3-array/blob/v3.2.0/README.md#sets)
* [d3.difference](https://github.com/d3/d3-array/blob/v3.1.6/README.md#difference) - compute a set difference.
* [d3.disjoint](https://github.com/d3/d3-array/blob/v3.1.6/README.md#disjoint) - test whether two sets are disjoint.
* [d3.intersection](https://github.com/d3/d3-array/blob/v3.1.6/README.md#intersection) - compute a set intersection.
* [d3.superset](https://github.com/d3/d3-array/blob/v3.1.6/README.md#superset) - test whether a set is a superset of another.
* [d3.subset](https://github.com/d3/d3-array/blob/v3.1.6/README.md#subset) - test whether a set is a subset of another.
* [d3.union](https://github.com/d3/d3-array/blob/v3.1.6/README.md#union) - compute a set union.
* [d3.difference](https://github.com/d3/d3-array/blob/v3.2.0/README.md#difference) - compute a set difference.
* [d3.disjoint](https://github.com/d3/d3-array/blob/v3.2.0/README.md#disjoint) - test whether two sets are disjoint.
* [d3.intersection](https://github.com/d3/d3-array/blob/v3.2.0/README.md#intersection) - compute a set intersection.
* [d3.superset](https://github.com/d3/d3-array/blob/v3.2.0/README.md#superset) - test whether a set is a superset of another.
* [d3.subset](https://github.com/d3/d3-array/blob/v3.2.0/README.md#subset) - test whether a set is a subset of another.
* [d3.union](https://github.com/d3/d3-array/blob/v3.2.0/README.md#union) - compute a set union.
### [Histograms](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bins)
### [Histograms](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bins)
Bin discrete samples into continuous, non-overlapping intervals.
* [d3.bin](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bin) - create a new bin generator.
* [*bin*](https://github.com/d3/d3-array/blob/v3.1.6/README.md#_bin) - bins a given array of samples.
* [*bin*.value](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bin_value) - specify a value accessor for each sample.
* [*bin*.domain](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bin_domain) - specify the interval of observable values.
* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v3.1.6/README.md#bin_thresholds) - specify how values are divided into bins.
* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v3.1.6/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule.
* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v3.1.6/README.md#thresholdScott) - Scott’s normal reference binning rule.
* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v3.1.6/README.md#thresholdSturges) - Sturges’ binning formula.
* [d3.bin](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bin) - create a new bin generator.
* [*bin*](https://github.com/d3/d3-array/blob/v3.2.0/README.md#_bin) - bins a given array of samples.
* [*bin*.value](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bin_value) - specify a value accessor for each sample.
* [*bin*.domain](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bin_domain) - specify the interval of observable values.
* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v3.2.0/README.md#bin_thresholds) - specify how values are divided into bins.
* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v3.2.0/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule.
* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v3.2.0/README.md#thresholdScott) - Scott’s normal reference binning rule.
* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v3.2.0/README.md#thresholdSturges) - Sturges’ binning formula.
### [Interning](https://github.com/d3/d3-array/blob/v3.1.6/README.md#interning)
### [Interning](https://github.com/d3/d3-array/blob/v3.2.0/README.md#interning)
* [d3.InternMap](https://github.com/d3/d3-array/blob/v3.1.6/README.md#InternMap) - a key-interning Map.
* [d3.InternSet](https://github.com/d3/d3-array/blob/v3.1.6/README.md#InternSet) - a value-interning Set.
* [d3.InternMap](https://github.com/d3/d3-array/blob/v3.2.0/README.md#InternMap) - a key-interning Map.
* [d3.InternSet](https://github.com/d3/d3-array/blob/v3.2.0/README.md#InternSet) - a value-interning Set.
## [Axes (d3-axis)](https://github.com/d3/d3-axis/tree/v3.0.0)

50
yarn.lock
View File

@ -3,23 +3,23 @@
"@babel/code-frame@^7.10.4":
version "7.16.7"
resolved "https://registry.yarnpkg.com/@babel/code-frame/-/code-frame-7.16.7.tgz#44416b6bd7624b998f5b1af5d470856c40138789"
integrity sha512-iAXqUn8IIeBTNd72xsFlgaXHkMBMt6y4HJp1tIaK465CWLT/fG1aqB7ykr95gHHmlBdGbFeWWfyB4NJJ0nmeIg==
version "7.18.6"
resolved "https://registry.yarnpkg.com/@babel/code-frame/-/code-frame-7.18.6.tgz#3b25d38c89600baa2dcc219edfa88a74eb2c427a"
integrity sha512-TDCmlK5eOvH+eH7cdAFlNXeVJqWIQ7gW9tY1GJIpUtFb6CmjVyq2VM3u71bOyR8CRihcCgMUYoDNyLXao3+70Q==
dependencies:
"@babel/highlight" "^7.16.7"
"@babel/highlight" "^7.18.6"
"@babel/helper-validator-identifier@^7.16.7":
version "7.16.7"
resolved "https://registry.yarnpkg.com/@babel/helper-validator-identifier/-/helper-validator-identifier-7.16.7.tgz#e8c602438c4a8195751243da9031d1607d247cad"
integrity sha512-hsEnFemeiW4D08A5gUAZxLBTXpZ39P+a+DGDsHw1yxqyQ/jzFEnxf5uTEGp+3bzAbNOxU1paTgYS4ECU/IgfDw==
"@babel/helper-validator-identifier@^7.18.6":
version "7.18.6"
resolved "https://registry.yarnpkg.com/@babel/helper-validator-identifier/-/helper-validator-identifier-7.18.6.tgz#9c97e30d31b2b8c72a1d08984f2ca9b574d7a076"
integrity sha512-MmetCkz9ej86nJQV+sFCxoGGrUbU3q02kgLciwkrt9QqEB7cP39oKEY0PakknEO0Gu20SskMRi+AYZ3b1TpN9g==
"@babel/highlight@^7.16.7":
version "7.17.12"
resolved "https://registry.yarnpkg.com/@babel/highlight/-/highlight-7.17.12.tgz#257de56ee5afbd20451ac0a75686b6b404257351"
integrity sha512-7yykMVF3hfZY2jsHZEEgLc+3x4o1O+fYyULu11GynEUQNwB6lua+IIQn1FiJxNucd5UlyJryrwsOh8PL9Sn8Qg==
"@babel/highlight@^7.18.6":
version "7.18.6"
resolved "https://registry.yarnpkg.com/@babel/highlight/-/highlight-7.18.6.tgz#81158601e93e2563795adcbfbdf5d64be3f2ecdf"
integrity sha512-u7stbOuYjaPezCuLj29hNW1v64M2Md2qupEKP1fHc7WdOA3DgLh37suiSrZYY7haUB7iBeQZ9P1uiRF359do3g==
dependencies:
"@babel/helper-validator-identifier" "^7.16.7"
"@babel/helper-validator-identifier" "^7.18.6"
chalk "^2.0.0"
js-tokens "^4.0.0"
@ -126,9 +126,9 @@
integrity sha512-EYNwp3bU+98cpU4lAWYYL7Zz+2gryWH1qbdDTidVd6hkiR6weksdbMadyXKXNPEkQFhXM+hVO9ZygomHXp+AIw==
"@types/node@*":
version "18.0.0"
resolved "https://registry.yarnpkg.com/@types/node/-/node-18.0.0.tgz#67c7b724e1bcdd7a8821ce0d5ee184d3b4dd525a"
integrity sha512-cHlGmko4gWLVI27cGJntjs/Sj8th9aYwplmZFwmmgYQQvL5NUsgVJG7OddLvNfLqYS31KFN0s3qlaD9qCaxACA==
version "18.0.1"
resolved "https://registry.yarnpkg.com/@types/node/-/node-18.0.1.tgz#e91bd73239b338557a84d1f67f7b9e0f25643870"
integrity sha512-CmR8+Tsy95hhwtZBKJBs0/FFq4XX7sDZHlGGf+0q+BRZfMbOTkzkj0AFAuTyXbObDIoanaBBW0+KEW+m3N16Wg==
"@types/resolve@1.17.1":
version "1.17.1"
@ -351,9 +351,9 @@ cross-spawn@^7.0.2:
which "^2.0.1"
"d3-array@2 - 3", "d3-array@2.10.0 - 3", "d3-array@2.5.0 - 3", d3-array@3:
version "3.1.6"
resolved "https://registry.yarnpkg.com/d3-array/-/d3-array-3.1.6.tgz#0342c835925826f49b4d16eb7027aec334ffc97d"
integrity sha512-DCbBBNuKOeiR9h04ySRBMW52TFVc91O9wJziuyXw6Ztmy8D3oZbmCkOO3UHKC7ceNJsN2Mavo9+vwV8EAEUXzA==
version "3.2.0"
resolved "https://registry.yarnpkg.com/d3-array/-/d3-array-3.2.0.tgz#15bf96cd9b7333e02eb8de8053d78962eafcff14"
integrity sha512-3yXFQo0oG3QCxbF06rMPFyGRMGJNS7NvsV1+2joOjbBE+9xvWQ8+GcMJAjRCzw06zQ3/arXeJgbPYcjUCuC+3g==
dependencies:
internmap "1 - 2"
@ -645,9 +645,9 @@ eslint-visitor-keys@^3.3.0:
integrity sha512-mQ+suqKJVyeuwGYHAdjMFqjCyfl8+Ldnxuyp3ldiMBFKkvytrXUZWaiPCEav8qDHKty44bD+qV1IP4T+w+xXRA==
eslint@8:
version "8.18.0"
resolved "https://registry.yarnpkg.com/eslint/-/eslint-8.18.0.tgz#78d565d16c993d0b73968c523c0446b13da784fd"
integrity sha512-As1EfFMVk7Xc6/CvhssHUjsAQSkpfXvUGMFC3ce8JDe6WvqCgRrLOBQbVpsBFr1X1V+RACOadnzVvcUS5ni2bA==
version "8.19.0"
resolved "https://registry.yarnpkg.com/eslint/-/eslint-8.19.0.tgz#7342a3cbc4fbc5c106a1eefe0fd0b50b6b1a7d28"
integrity sha512-SXOPj3x9VKvPe81TjjUJCYlV4oJjQw68Uek+AM0X4p+33dj2HY5bpTZOgnQHcG2eAm1mtCU9uNMnJi7exU/kYw==
dependencies:
"@eslint/eslintrc" "^1.3.0"
"@humanwhocodes/config-array" "^0.9.2"
@ -779,9 +779,9 @@ flat@^5.0.2:
integrity sha512-b6suED+5/3rTpUBdG1gupIl8MPFCAMA0QXwmljLhvCUKcUvdE4gWky9zpuGCcXHOsz4J9wPGNWq6OKpmIzz3hQ==
flatted@^3.1.0:
version "3.2.5"
resolved "https://registry.yarnpkg.com/flatted/-/flatted-3.2.5.tgz#76c8584f4fc843db64702a6bd04ab7a8bd666da3"
integrity sha512-WIWGi2L3DyTUvUrwRKgGi9TwxQMUEqPOPQBVi71R96jZXJdFskXEmf54BoZaS1kknGODoIGASGEzBUYdyMCBJg==
version "3.2.6"
resolved "https://registry.yarnpkg.com/flatted/-/flatted-3.2.6.tgz#022e9218c637f9f3fc9c35ab9c9193f05add60b2"
integrity sha512-0sQoMh9s0BYsm+12Huy/rkKxVu4R1+r96YX5cG44rHV0pQ6iC3Q+mkoMFaGWObMFYQxCVT+ssG1ksneA2MI9KQ==
fs.realpath@^1.0.0:
version "1.0.0"