From a76d0b83e6acaf7ebd301f4a59486308c5199f3b Mon Sep 17 00:00:00 2001 From: Mike Bostock Date: Sun, 3 Apr 2022 10:44:26 -0500 Subject: [PATCH] d3-array 3.1.4 --- API.md | 192 +++++++++++++++++++++++++++--------------------------- yarn.lock | 6 +- 2 files changed, 99 insertions(+), 99 deletions(-) diff --git a/API.md b/API.md index fe7e8b167a6f5..3b943c6721f3a 100644 --- a/API.md +++ b/API.md @@ -35,119 +35,119 @@ 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.3) +## [Arrays (d3-array)](https://github.com/d3/d3-array/tree/v3.1.4) Array manipulation, ordering, searching, summarizing, etc. -### [Statistics](https://github.com/d3/d3-array/blob/v3.1.3/README.md#statistics) +### [Statistics](https://github.com/d3/d3-array/blob/v3.1.4/README.md#statistics) Methods for computing basic summary statistics. -* [d3.min](https://github.com/d3/d3-array/blob/v3.1.3/README.md#min) - compute the minimum value in an iterable. -* [d3.minIndex](https://github.com/d3/d3-array/blob/v3.1.3/README.md#minIndex) - compute the index of the minimum value in an iterable. -* [d3.max](https://github.com/d3/d3-array/blob/v3.1.3/README.md#max) - compute the maximum value in an iterable. -* [d3.maxIndex](https://github.com/d3/d3-array/blob/v3.1.3/README.md#maxIndex) - compute the index of the maximum value in an iterable. -* [d3.extent](https://github.com/d3/d3-array/blob/v3.1.3/README.md#extent) - compute the minimum and maximum value in an iterable. -* [d3.sum](https://github.com/d3/d3-array/blob/v3.1.3/README.md#sum) - compute the sum of an iterable of numbers. -* [d3.mean](https://github.com/d3/d3-array/blob/v3.1.3/README.md#mean) - compute the arithmetic mean of an iterable of numbers. -* [d3.median](https://github.com/d3/d3-array/blob/v3.1.3/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.3/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.3/README.md#cumsum) - compute the cumulative sum of an iterable. -* [d3.rank](https://github.com/d3/d3-array/blob/v3.1.3/README.md#rank) - compute the rank order of an iterable. -* [d3.quantile](https://github.com/d3/d3-array/blob/v3.1.3/README.md#quantile) - compute a quantile for an iterable of numbers. -* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v3.1.3/README.md#quantileSorted) - compute a quantile for a sorted array of numbers. -* [d3.variance](https://github.com/d3/d3-array/blob/v3.1.3/README.md#variance) - compute the variance of an iterable of numbers. -* [d3.deviation](https://github.com/d3/d3-array/blob/v3.1.3/README.md#deviation) - compute the standard deviation of an iterable of numbers. -* [d3.fcumsum](https://github.com/d3/d3-array/blob/v3.1.3/README.md#fcumsum) - compute a full precision cumulative summation of numbers. -* [d3.fsum](https://github.com/d3/d3-array/blob/v3.1.3/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.3/README.md#adder) - creates a full precision adder. -* [*adder*.add](https://github.com/d3/d3-array/blob/v3.1.3/README.md#adder_add) - add a value to an adder. -* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v3.1.3/README.md#adder_valueOf) - returns a double precision representation of an adder’s value. - -### [Search](https://github.com/d3/d3-array/blob/v3.1.3/README.md#search) +* [d3.min](https://github.com/d3/d3-array/blob/v3.1.4/README.md#min) - compute the minimum value in an iterable. +* [d3.minIndex](https://github.com/d3/d3-array/blob/v3.1.4/README.md#minIndex) - compute the index of the minimum value in an iterable. +* [d3.max](https://github.com/d3/d3-array/blob/v3.1.4/README.md#max) - compute the maximum value in an iterable. +* [d3.maxIndex](https://github.com/d3/d3-array/blob/v3.1.4/README.md#maxIndex) - compute the index of the maximum value in an iterable. +* [d3.extent](https://github.com/d3/d3-array/blob/v3.1.4/README.md#extent) - compute the minimum and maximum value in an iterable. +* [d3.sum](https://github.com/d3/d3-array/blob/v3.1.4/README.md#sum) - compute the sum of an iterable of numbers. +* [d3.mean](https://github.com/d3/d3-array/blob/v3.1.4/README.md#mean) - compute the arithmetic mean of an iterable of numbers. +* [d3.median](https://github.com/d3/d3-array/blob/v3.1.4/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.4/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.4/README.md#cumsum) - compute the cumulative sum of an iterable. +* [d3.rank](https://github.com/d3/d3-array/blob/v3.1.4/README.md#rank) - compute the rank order of an iterable. +* [d3.quantile](https://github.com/d3/d3-array/blob/v3.1.4/README.md#quantile) - compute a quantile for an iterable of numbers. +* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v3.1.4/README.md#quantileSorted) - compute a quantile for a sorted array of numbers. +* [d3.variance](https://github.com/d3/d3-array/blob/v3.1.4/README.md#variance) - compute the variance of an iterable of numbers. +* [d3.deviation](https://github.com/d3/d3-array/blob/v3.1.4/README.md#deviation) - compute the standard deviation of an iterable of numbers. +* [d3.fcumsum](https://github.com/d3/d3-array/blob/v3.1.4/README.md#fcumsum) - compute a full precision cumulative summation of numbers. +* [d3.fsum](https://github.com/d3/d3-array/blob/v3.1.4/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.4/README.md#adder) - creates a full precision adder. +* [*adder*.add](https://github.com/d3/d3-array/blob/v3.1.4/README.md#adder_add) - add a value to an adder. +* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v3.1.4/README.md#adder_valueOf) - returns a double precision representation of an adder’s value. + +### [Search](https://github.com/d3/d3-array/blob/v3.1.4/README.md#search) Methods for searching arrays for a specific element. -* [d3.least](https://github.com/d3/d3-array/blob/v3.1.3/README.md#least) - returns the least element of an iterable. -* [d3.leastIndex](https://github.com/d3/d3-array/blob/v3.1.3/README.md#leastIndex) - returns the index of the least element of an iterable. -* [d3.greatest](https://github.com/d3/d3-array/blob/v3.1.3/README.md#greatest) - returns the greatest element of an iterable. -* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v3.1.3/README.md#greatestIndex) - returns the index of the greatest element of an iterable. -* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisectCenter) - binary search for a value in a sorted array. -* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisectLeft) - binary search for a value in a sorted array. -* [d3.bisect](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisect) - binary search for a value in a sorted array. -* [d3.bisectRight](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisectRight) - binary search for a value in a sorted array. -* [d3.bisector](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisector) - bisect using an accessor or comparator. -* [*bisector*.center](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisector_center) - binary search for a value in a sorted array. -* [*bisector*.left](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisector_left) - bisectLeft, with the given comparator. -* [*bisector*.right](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bisector_right) - bisectRight, with the given comparator. -* [d3.quickselect](https://github.com/d3/d3-array/blob/v3.1.3/README.md#quickselect) - reorder an array of numbers. -* [d3.ascending](https://github.com/d3/d3-array/blob/v3.1.3/README.md#ascending) - compute the natural order of two values. -* [d3.descending](https://github.com/d3/d3-array/blob/v3.1.3/README.md#descending) - compute the natural order of two values. - -### [Transformations](https://github.com/d3/d3-array/blob/v3.1.3/README.md#transformations) +* [d3.least](https://github.com/d3/d3-array/blob/v3.1.4/README.md#least) - returns the least element of an iterable. +* [d3.leastIndex](https://github.com/d3/d3-array/blob/v3.1.4/README.md#leastIndex) - returns the index of the least element of an iterable. +* [d3.greatest](https://github.com/d3/d3-array/blob/v3.1.4/README.md#greatest) - returns the greatest element of an iterable. +* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v3.1.4/README.md#greatestIndex) - returns the index of the greatest element of an iterable. +* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisectCenter) - binary search for a value in a sorted array. +* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisectLeft) - binary search for a value in a sorted array. +* [d3.bisect](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisect) - binary search for a value in a sorted array. +* [d3.bisectRight](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisectRight) - binary search for a value in a sorted array. +* [d3.bisector](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisector) - bisect using an accessor or comparator. +* [*bisector*.center](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisector_center) - binary search for a value in a sorted array. +* [*bisector*.left](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisector_left) - bisectLeft, with the given comparator. +* [*bisector*.right](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bisector_right) - bisectRight, with the given comparator. +* [d3.quickselect](https://github.com/d3/d3-array/blob/v3.1.4/README.md#quickselect) - reorder an array of numbers. +* [d3.ascending](https://github.com/d3/d3-array/blob/v3.1.4/README.md#ascending) - compute the natural order of two values. +* [d3.descending](https://github.com/d3/d3-array/blob/v3.1.4/README.md#descending) - compute the natural order of two values. + +### [Transformations](https://github.com/d3/d3-array/blob/v3.1.4/README.md#transformations) Methods for transforming arrays and for generating new arrays. -* [d3.flatGroup](https://github.com/d3/d3-array/blob/v3.1.3/README.md#flatGroup) - group an iterable into a flat array. -* [d3.flatRollup](https://github.com/d3/d3-array/blob/v3.1.3/README.md#flatRollup) - reduce an iterable into a flat array. -* [d3.group](https://github.com/d3/d3-array/blob/v3.1.3/README.md#group) - group an iterable into a nested Map. -* [d3.groups](https://github.com/d3/d3-array/blob/v3.1.3/README.md#groups) - group an iterable into a nested array. -* [d3.groupSort](https://github.com/d3/d3-array/blob/v3.1.3/README.md#groupSort) - sort keys according to grouped values. -* [d3.index](https://github.com/d3/d3-array/blob/v3.1.3/README.md#index) - index an iterable into a nested Map. -* [d3.indexes](https://github.com/d3/d3-array/blob/v3.1.3/README.md#indexes) - index an iterable into a nested array. -* [d3.rollup](https://github.com/d3/d3-array/blob/v3.1.3/README.md#rollup) - reduce an iterable into a nested Map. -* [d3.rollups](https://github.com/d3/d3-array/blob/v3.1.3/README.md#rollups) - reduce an iterable into a nested array. -* [d3.count](https://github.com/d3/d3-array/blob/v3.1.3/README.md#count) - count valid number values in an iterable. -* [d3.cross](https://github.com/d3/d3-array/blob/v3.1.3/README.md#cross) - compute the Cartesian product of two iterables. -* [d3.merge](https://github.com/d3/d3-array/blob/v3.1.3/README.md#merge) - merge multiple iterables into one array. -* [d3.pairs](https://github.com/d3/d3-array/blob/v3.1.3/README.md#pairs) - create an array of adjacent pairs of elements. -* [d3.permute](https://github.com/d3/d3-array/blob/v3.1.3/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.3/README.md#shuffle) - randomize the order of an iterable. -* [d3.shuffler](https://github.com/d3/d3-array/blob/v3.1.3/README.md#shuffler) - randomize the order of an iterable. -* [d3.ticks](https://github.com/d3/d3-array/blob/v3.1.3/README.md#ticks) - generate representative values from a numeric interval. -* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v3.1.3/README.md#tickIncrement) - generate representative values from a numeric interval. -* [d3.tickStep](https://github.com/d3/d3-array/blob/v3.1.3/README.md#tickStep) - generate representative values from a numeric interval. -* [d3.nice](https://github.com/d3/d3-array/blob/v3.1.3/README.md#nice) - extend an interval to align with ticks. -* [d3.range](https://github.com/d3/d3-array/blob/v3.1.3/README.md#range) - generate a range of numeric values. -* [d3.transpose](https://github.com/d3/d3-array/blob/v3.1.3/README.md#transpose) - transpose an array of arrays. -* [d3.zip](https://github.com/d3/d3-array/blob/v3.1.3/README.md#zip) - transpose a variable number of arrays. - -### [Iterables](https://github.com/d3/d3-array/blob/v3.1.3/README.md#iterables) - -* [d3.every](https://github.com/d3/d3-array/blob/v3.1.3/README.md#every) - test if all values satisfy a condition. -* [d3.some](https://github.com/d3/d3-array/blob/v3.1.3/README.md#some) - test if any value satisfies a condition. -* [d3.filter](https://github.com/d3/d3-array/blob/v3.1.3/README.md#filter) - filter values. -* [d3.map](https://github.com/d3/d3-array/blob/v3.1.3/README.md#map) - map values. -* [d3.reduce](https://github.com/d3/d3-array/blob/v3.1.3/README.md#reduce) - reduce values. -* [d3.reverse](https://github.com/d3/d3-array/blob/v3.1.3/README.md#reverse) - reverse the order of values. -* [d3.sort](https://github.com/d3/d3-array/blob/v3.1.3/README.md#sort) - sort values. - -### [Sets](https://github.com/d3/d3-array/blob/v3.1.3/README.md#sets) - -* [d3.difference](https://github.com/d3/d3-array/blob/v3.1.3/README.md#difference) - compute a set difference. -* [d3.disjoint](https://github.com/d3/d3-array/blob/v3.1.3/README.md#disjoint) - test whether two sets are disjoint. -* [d3.intersection](https://github.com/d3/d3-array/blob/v3.1.3/README.md#intersection) - compute a set intersection. -* [d3.superset](https://github.com/d3/d3-array/blob/v3.1.3/README.md#superset) - test whether a set is a superset of another. -* [d3.subset](https://github.com/d3/d3-array/blob/v3.1.3/README.md#subset) - test whether a set is a subset of another. -* [d3.union](https://github.com/d3/d3-array/blob/v3.1.3/README.md#union) - compute a set union. - -### [Histograms](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bins) +* [d3.flatGroup](https://github.com/d3/d3-array/blob/v3.1.4/README.md#flatGroup) - group an iterable into a flat array. +* [d3.flatRollup](https://github.com/d3/d3-array/blob/v3.1.4/README.md#flatRollup) - reduce an iterable into a flat array. +* [d3.group](https://github.com/d3/d3-array/blob/v3.1.4/README.md#group) - group an iterable into a nested Map. +* [d3.groups](https://github.com/d3/d3-array/blob/v3.1.4/README.md#groups) - group an iterable into a nested array. +* [d3.groupSort](https://github.com/d3/d3-array/blob/v3.1.4/README.md#groupSort) - sort keys according to grouped values. +* [d3.index](https://github.com/d3/d3-array/blob/v3.1.4/README.md#index) - index an iterable into a nested Map. +* [d3.indexes](https://github.com/d3/d3-array/blob/v3.1.4/README.md#indexes) - index an iterable into a nested array. +* [d3.rollup](https://github.com/d3/d3-array/blob/v3.1.4/README.md#rollup) - reduce an iterable into a nested Map. +* [d3.rollups](https://github.com/d3/d3-array/blob/v3.1.4/README.md#rollups) - reduce an iterable into a nested array. +* [d3.count](https://github.com/d3/d3-array/blob/v3.1.4/README.md#count) - count valid number values in an iterable. +* [d3.cross](https://github.com/d3/d3-array/blob/v3.1.4/README.md#cross) - compute the Cartesian product of two iterables. +* [d3.merge](https://github.com/d3/d3-array/blob/v3.1.4/README.md#merge) - merge multiple iterables into one array. +* [d3.pairs](https://github.com/d3/d3-array/blob/v3.1.4/README.md#pairs) - create an array of adjacent pairs of elements. +* [d3.permute](https://github.com/d3/d3-array/blob/v3.1.4/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.4/README.md#shuffle) - randomize the order of an iterable. +* [d3.shuffler](https://github.com/d3/d3-array/blob/v3.1.4/README.md#shuffler) - randomize the order of an iterable. +* [d3.ticks](https://github.com/d3/d3-array/blob/v3.1.4/README.md#ticks) - generate representative values from a numeric interval. +* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v3.1.4/README.md#tickIncrement) - generate representative values from a numeric interval. +* [d3.tickStep](https://github.com/d3/d3-array/blob/v3.1.4/README.md#tickStep) - generate representative values from a numeric interval. +* [d3.nice](https://github.com/d3/d3-array/blob/v3.1.4/README.md#nice) - extend an interval to align with ticks. +* [d3.range](https://github.com/d3/d3-array/blob/v3.1.4/README.md#range) - generate a range of numeric values. +* [d3.transpose](https://github.com/d3/d3-array/blob/v3.1.4/README.md#transpose) - transpose an array of arrays. +* [d3.zip](https://github.com/d3/d3-array/blob/v3.1.4/README.md#zip) - transpose a variable number of arrays. + +### [Iterables](https://github.com/d3/d3-array/blob/v3.1.4/README.md#iterables) + +* [d3.every](https://github.com/d3/d3-array/blob/v3.1.4/README.md#every) - test if all values satisfy a condition. +* [d3.some](https://github.com/d3/d3-array/blob/v3.1.4/README.md#some) - test if any value satisfies a condition. +* [d3.filter](https://github.com/d3/d3-array/blob/v3.1.4/README.md#filter) - filter values. +* [d3.map](https://github.com/d3/d3-array/blob/v3.1.4/README.md#map) - map values. +* [d3.reduce](https://github.com/d3/d3-array/blob/v3.1.4/README.md#reduce) - reduce values. +* [d3.reverse](https://github.com/d3/d3-array/blob/v3.1.4/README.md#reverse) - reverse the order of values. +* [d3.sort](https://github.com/d3/d3-array/blob/v3.1.4/README.md#sort) - sort values. + +### [Sets](https://github.com/d3/d3-array/blob/v3.1.4/README.md#sets) + +* [d3.difference](https://github.com/d3/d3-array/blob/v3.1.4/README.md#difference) - compute a set difference. +* [d3.disjoint](https://github.com/d3/d3-array/blob/v3.1.4/README.md#disjoint) - test whether two sets are disjoint. +* [d3.intersection](https://github.com/d3/d3-array/blob/v3.1.4/README.md#intersection) - compute a set intersection. +* [d3.superset](https://github.com/d3/d3-array/blob/v3.1.4/README.md#superset) - test whether a set is a superset of another. +* [d3.subset](https://github.com/d3/d3-array/blob/v3.1.4/README.md#subset) - test whether a set is a subset of another. +* [d3.union](https://github.com/d3/d3-array/blob/v3.1.4/README.md#union) - compute a set union. + +### [Histograms](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bins) Bin discrete samples into continuous, non-overlapping intervals. -* [d3.bin](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bin) - create a new bin generator. -* [*bin*](https://github.com/d3/d3-array/blob/v3.1.3/README.md#_bin) - bins a given array of samples. -* [*bin*.value](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bin_value) - specify a value accessor for each sample. -* [*bin*.domain](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bin_domain) - specify the interval of observable values. -* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v3.1.3/README.md#bin_thresholds) - specify how values are divided into bins. -* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v3.1.3/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule. -* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v3.1.3/README.md#thresholdScott) - Scott’s normal reference binning rule. -* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v3.1.3/README.md#thresholdSturges) - Sturges’ binning formula. +* [d3.bin](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bin) - create a new bin generator. +* [*bin*](https://github.com/d3/d3-array/blob/v3.1.4/README.md#_bin) - bins a given array of samples. +* [*bin*.value](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bin_value) - specify a value accessor for each sample. +* [*bin*.domain](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bin_domain) - specify the interval of observable values. +* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v3.1.4/README.md#bin_thresholds) - specify how values are divided into bins. +* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v3.1.4/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule. +* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v3.1.4/README.md#thresholdScott) - Scott’s normal reference binning rule. +* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v3.1.4/README.md#thresholdSturges) - Sturges’ binning formula. -### [Interning](https://github.com/d3/d3-array/blob/v3.1.3/README.md#interning) +### [Interning](https://github.com/d3/d3-array/blob/v3.1.4/README.md#interning) -* [d3.InternMap](https://github.com/d3/d3-array/blob/v3.1.3/README.md#InternMap) - a key-interning Map. -* [d3.InternSet](https://github.com/d3/d3-array/blob/v3.1.3/README.md#InternSet) - a value-interning Set. +* [d3.InternMap](https://github.com/d3/d3-array/blob/v3.1.4/README.md#InternMap) - a key-interning Map. +* [d3.InternSet](https://github.com/d3/d3-array/blob/v3.1.4/README.md#InternSet) - a value-interning Set. ## [Axes (d3-axis)](https://github.com/d3/d3-axis/tree/v3.0.0) diff --git a/yarn.lock b/yarn.lock index 9cb3d1f19394b..8272330fa31c5 100644 --- a/yarn.lock +++ b/yarn.lock @@ -304,9 +304,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.3" - resolved "https://registry.yarnpkg.com/d3-array/-/d3-array-3.1.3.tgz#6b293acd0e9fa035aa84da30ecc133f2c54c04d1" - integrity sha512-qwW+3phQqmogYyRDI9hC8AWNeTdyYexazuq/dDM7QgujVDVexwNOxVMUJt+0BRpCw/4S4+byuYTV51kttK/Bzw== + version "3.1.4" + resolved "https://registry.yarnpkg.com/d3-array/-/d3-array-3.1.4.tgz#f7edb5bfcf6d939d0f6a561876ab281c466ea693" + integrity sha512-H8lM97Gr9+LAR4WVHETCMt6LlWtLJVMCKsz1ojors+/PvAs2QqdLa20BuYvU11/DU+nLF0GVWL5Rv3jSgo2KmA== dependencies: internmap "1 - 2"