From ff34b4c11e2240cca6b1ca0a4bad5da90844ece9 Mon Sep 17 00:00:00 2001 From: Mike Bostock Date: Wed, 24 Mar 2021 09:48:57 -0700 Subject: [PATCH] d3-array 2.12.1 --- API.md | 170 +++++++++++++++++++++++++++--------------------------- yarn.lock | 24 ++++---- 2 files changed, 97 insertions(+), 97 deletions(-) diff --git a/API.md b/API.md index 41319b7c..74be8720 100644 --- a/API.md +++ b/API.md @@ -35,115 +35,115 @@ 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.12.0) +## [Arrays (d3-array)](https://github.com/d3/d3-array/tree/v2.12.1) Array manipulation, ordering, searching, summarizing, etc. -### [Statistics](https://github.com/d3/d3-array/blob/v2.12.0/README.md#statistics) +### [Statistics](https://github.com/d3/d3-array/blob/v2.12.1/README.md#statistics) Methods for computing basic summary statistics. -* [d3.min](https://github.com/d3/d3-array/blob/v2.12.0/README.md#min) - compute the minimum value in an iterable. -* [d3.minIndex](https://github.com/d3/d3-array/blob/v2.12.0/README.md#minIndex) - compute the index of the minimum value in an iterable. -* [d3.max](https://github.com/d3/d3-array/blob/v2.12.0/README.md#max) - compute the maximum value in an iterable. -* [d3.maxIndex](https://github.com/d3/d3-array/blob/v2.12.0/README.md#maxIndex) - compute the index of the maximum value in an iterable. -* [d3.extent](https://github.com/d3/d3-array/blob/v2.12.0/README.md#extent) - compute the minimum and maximum value in an iterable. -* [d3.sum](https://github.com/d3/d3-array/blob/v2.12.0/README.md#sum) - compute the sum of an iterable of numbers. -* [d3.mean](https://github.com/d3/d3-array/blob/v2.12.0/README.md#mean) - compute the arithmetic mean of an iterable of numbers. -* [d3.median](https://github.com/d3/d3-array/blob/v2.12.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.12.0/README.md#cumsum) - compute the cumulative sum of an iterable. -* [d3.quantile](https://github.com/d3/d3-array/blob/v2.12.0/README.md#quantile) - compute a quantile for an iterable of numbers. -* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v2.12.0/README.md#quantileSorted) - compute a quantile for a sorted array of numbers. -* [d3.variance](https://github.com/d3/d3-array/blob/v2.12.0/README.md#variance) - compute the variance of an iterable of numbers. -* [d3.deviation](https://github.com/d3/d3-array/blob/v2.12.0/README.md#deviation) - compute the standard deviation of an iterable of numbers. -* [d3.fcumsum](https://github.com/d3/d3-array/blob/v2.12.0/README.md#fcumsum) - compute a full precision cumulative summation of numbers. -* [d3.fsum](https://github.com/d3/d3-array/blob/v2.12.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.12.0/README.md#adder) - creates a full precision adder. -* [*adder*.add](https://github.com/d3/d3-array/blob/v2.12.0/README.md#adder_add) - add a value to an adder. -* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v2.12.0/README.md#adder_valueOf) - returns a double precision representation of an adder’s value. +* [d3.min](https://github.com/d3/d3-array/blob/v2.12.1/README.md#min) - compute the minimum value in an iterable. +* [d3.minIndex](https://github.com/d3/d3-array/blob/v2.12.1/README.md#minIndex) - compute the index of the minimum value in an iterable. +* [d3.max](https://github.com/d3/d3-array/blob/v2.12.1/README.md#max) - compute the maximum value in an iterable. +* [d3.maxIndex](https://github.com/d3/d3-array/blob/v2.12.1/README.md#maxIndex) - compute the index of the maximum value in an iterable. +* [d3.extent](https://github.com/d3/d3-array/blob/v2.12.1/README.md#extent) - compute the minimum and maximum value in an iterable. +* [d3.sum](https://github.com/d3/d3-array/blob/v2.12.1/README.md#sum) - compute the sum of an iterable of numbers. +* [d3.mean](https://github.com/d3/d3-array/blob/v2.12.1/README.md#mean) - compute the arithmetic mean of an iterable of numbers. +* [d3.median](https://github.com/d3/d3-array/blob/v2.12.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.12.1/README.md#cumsum) - compute the cumulative sum of an iterable. +* [d3.quantile](https://github.com/d3/d3-array/blob/v2.12.1/README.md#quantile) - compute a quantile for an iterable of numbers. +* [d3.quantileSorted](https://github.com/d3/d3-array/blob/v2.12.1/README.md#quantileSorted) - compute a quantile for a sorted array of numbers. +* [d3.variance](https://github.com/d3/d3-array/blob/v2.12.1/README.md#variance) - compute the variance of an iterable of numbers. +* [d3.deviation](https://github.com/d3/d3-array/blob/v2.12.1/README.md#deviation) - compute the standard deviation of an iterable of numbers. +* [d3.fcumsum](https://github.com/d3/d3-array/blob/v2.12.1/README.md#fcumsum) - compute a full precision cumulative summation of numbers. +* [d3.fsum](https://github.com/d3/d3-array/blob/v2.12.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.12.1/README.md#adder) - creates a full precision adder. +* [*adder*.add](https://github.com/d3/d3-array/blob/v2.12.1/README.md#adder_add) - add a value to an adder. +* [*adder*.valueOf](https://github.com/d3/d3-array/blob/v2.12.1/README.md#adder_valueOf) - returns a double precision representation of an adder’s value. -### [Search](https://github.com/d3/d3-array/blob/v2.12.0/README.md#search) +### [Search](https://github.com/d3/d3-array/blob/v2.12.1/README.md#search) Methods for searching arrays for a specific element. -* [d3.least](https://github.com/d3/d3-array/blob/v2.12.0/README.md#least) - returns the least element of an iterable. -* [d3.leastIndex](https://github.com/d3/d3-array/blob/v2.12.0/README.md#leastIndex) - returns the index of the least element of an iterable. -* [d3.greatest](https://github.com/d3/d3-array/blob/v2.12.0/README.md#greatest) - returns the greatest element of an iterable. -* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v2.12.0/README.md#greatestIndex) - returns the index of the greatest element of an iterable. -* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisectCenter) - binary search for a value in a sorted array. -* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisectLeft) - binary search for a value in a sorted array. -* [d3.bisect](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisect) - binary search for a value in a sorted array. -* [d3.bisectRight](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisectRight) - binary search for a value in a sorted array. -* [d3.bisector](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisector) - bisect using an accessor or comparator. -* [*bisector*.center](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisector_center) - binary search for a value in a sorted array. -* [*bisector*.left](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisector_left) - bisectLeft, with the given comparator. -* [*bisector*.right](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bisector_right) - bisectRight, with the given comparator. -* [d3.quickselect](https://github.com/d3/d3-array/blob/v2.12.0/README.md#quickselect) - reorder an array of numbers. -* [d3.ascending](https://github.com/d3/d3-array/blob/v2.12.0/README.md#ascending) - compute the natural order of two values. -* [d3.descending](https://github.com/d3/d3-array/blob/v2.12.0/README.md#descending) - compute the natural order of two values. +* [d3.least](https://github.com/d3/d3-array/blob/v2.12.1/README.md#least) - returns the least element of an iterable. +* [d3.leastIndex](https://github.com/d3/d3-array/blob/v2.12.1/README.md#leastIndex) - returns the index of the least element of an iterable. +* [d3.greatest](https://github.com/d3/d3-array/blob/v2.12.1/README.md#greatest) - returns the greatest element of an iterable. +* [d3.greatestIndex](https://github.com/d3/d3-array/blob/v2.12.1/README.md#greatestIndex) - returns the index of the greatest element of an iterable. +* [d3.bisectCenter](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisectCenter) - binary search for a value in a sorted array. +* [d3.bisectLeft](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisectLeft) - binary search for a value in a sorted array. +* [d3.bisect](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisect) - binary search for a value in a sorted array. +* [d3.bisectRight](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisectRight) - binary search for a value in a sorted array. +* [d3.bisector](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisector) - bisect using an accessor or comparator. +* [*bisector*.center](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisector_center) - binary search for a value in a sorted array. +* [*bisector*.left](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisector_left) - bisectLeft, with the given comparator. +* [*bisector*.right](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bisector_right) - bisectRight, with the given comparator. +* [d3.quickselect](https://github.com/d3/d3-array/blob/v2.12.1/README.md#quickselect) - reorder an array of numbers. +* [d3.ascending](https://github.com/d3/d3-array/blob/v2.12.1/README.md#ascending) - compute the natural order of two values. +* [d3.descending](https://github.com/d3/d3-array/blob/v2.12.1/README.md#descending) - compute the natural order of two values. -### [Transformations](https://github.com/d3/d3-array/blob/v2.12.0/README.md#transformations) +### [Transformations](https://github.com/d3/d3-array/blob/v2.12.1/README.md#transformations) Methods for transforming arrays and for generating new arrays. -* [d3.group](https://github.com/d3/d3-array/blob/v2.12.0/README.md#group) - group an iterable into a nested Map. -* [d3.groups](https://github.com/d3/d3-array/blob/v2.12.0/README.md#groups) - group an iterable into a nested array. -* [d3.index](https://github.com/d3/d3-array/blob/v2.12.0/README.md#index) - index an iterable into a nested Map. -* [d3.indexes](https://github.com/d3/d3-array/blob/v2.12.0/README.md#indexes) - index an iterable into a nested array. -* [d3.rollup](https://github.com/d3/d3-array/blob/v2.12.0/README.md#rollup) - reduce an iterable into a nested Map. -* [d3.rollups](https://github.com/d3/d3-array/blob/v2.12.0/README.md#rollups) - reduce an iterable into a nested array. -* [d3.groupSort](https://github.com/d3/d3-array/blob/v2.12.0/README.md#groupSort) - sort keys according to grouped values. -* [d3.count](https://github.com/d3/d3-array/blob/v2.12.0/README.md#count) - count valid number values in an iterable. -* [d3.cross](https://github.com/d3/d3-array/blob/v2.12.0/README.md#cross) - compute the Cartesian product of two iterables. -* [d3.merge](https://github.com/d3/d3-array/blob/v2.12.0/README.md#merge) - merge multiple iterables into one array. -* [d3.pairs](https://github.com/d3/d3-array/blob/v2.12.0/README.md#pairs) - create an array of adjacent pairs of elements. -* [d3.permute](https://github.com/d3/d3-array/blob/v2.12.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.12.0/README.md#shuffle) - randomize the order of an iterable. -* [d3.shuffler](https://github.com/d3/d3-array/blob/v2.12.0/README.md#shuffler) - randomize the order of an iterable. -* [d3.ticks](https://github.com/d3/d3-array/blob/v2.12.0/README.md#ticks) - generate representative values from a numeric interval. -* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v2.12.0/README.md#tickIncrement) - generate representative values from a numeric interval. -* [d3.tickStep](https://github.com/d3/d3-array/blob/v2.12.0/README.md#tickStep) - generate representative values from a numeric interval. -* [d3.nice](https://github.com/d3/d3-array/blob/v2.12.0/README.md#nice) - extend an interval to align with ticks. -* [d3.range](https://github.com/d3/d3-array/blob/v2.12.0/README.md#range) - generate a range of numeric values. -* [d3.transpose](https://github.com/d3/d3-array/blob/v2.12.0/README.md#transpose) - transpose an array of arrays. -* [d3.zip](https://github.com/d3/d3-array/blob/v2.12.0/README.md#zip) - transpose a variable number of arrays. +* [d3.group](https://github.com/d3/d3-array/blob/v2.12.1/README.md#group) - group an iterable into a nested Map. +* [d3.groups](https://github.com/d3/d3-array/blob/v2.12.1/README.md#groups) - group an iterable into a nested array. +* [d3.index](https://github.com/d3/d3-array/blob/v2.12.1/README.md#index) - index an iterable into a nested Map. +* [d3.indexes](https://github.com/d3/d3-array/blob/v2.12.1/README.md#indexes) - index an iterable into a nested array. +* [d3.rollup](https://github.com/d3/d3-array/blob/v2.12.1/README.md#rollup) - reduce an iterable into a nested Map. +* [d3.rollups](https://github.com/d3/d3-array/blob/v2.12.1/README.md#rollups) - reduce an iterable into a nested array. +* [d3.groupSort](https://github.com/d3/d3-array/blob/v2.12.1/README.md#groupSort) - sort keys according to grouped values. +* [d3.count](https://github.com/d3/d3-array/blob/v2.12.1/README.md#count) - count valid number values in an iterable. +* [d3.cross](https://github.com/d3/d3-array/blob/v2.12.1/README.md#cross) - compute the Cartesian product of two iterables. +* [d3.merge](https://github.com/d3/d3-array/blob/v2.12.1/README.md#merge) - merge multiple iterables into one array. +* [d3.pairs](https://github.com/d3/d3-array/blob/v2.12.1/README.md#pairs) - create an array of adjacent pairs of elements. +* [d3.permute](https://github.com/d3/d3-array/blob/v2.12.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.12.1/README.md#shuffle) - randomize the order of an iterable. +* [d3.shuffler](https://github.com/d3/d3-array/blob/v2.12.1/README.md#shuffler) - randomize the order of an iterable. +* [d3.ticks](https://github.com/d3/d3-array/blob/v2.12.1/README.md#ticks) - generate representative values from a numeric interval. +* [d3.tickIncrement](https://github.com/d3/d3-array/blob/v2.12.1/README.md#tickIncrement) - generate representative values from a numeric interval. +* [d3.tickStep](https://github.com/d3/d3-array/blob/v2.12.1/README.md#tickStep) - generate representative values from a numeric interval. +* [d3.nice](https://github.com/d3/d3-array/blob/v2.12.1/README.md#nice) - extend an interval to align with ticks. +* [d3.range](https://github.com/d3/d3-array/blob/v2.12.1/README.md#range) - generate a range of numeric values. +* [d3.transpose](https://github.com/d3/d3-array/blob/v2.12.1/README.md#transpose) - transpose an array of arrays. +* [d3.zip](https://github.com/d3/d3-array/blob/v2.12.1/README.md#zip) - transpose a variable number of arrays. -### [Iterables](https://github.com/d3/d3-array/blob/v2.12.0/README.md#iterables) +### [Iterables](https://github.com/d3/d3-array/blob/v2.12.1/README.md#iterables) -* [d3.every](https://github.com/d3/d3-array/blob/v2.12.0/README.md#every) - test if all values satisfy a condition. -* [d3.some](https://github.com/d3/d3-array/blob/v2.12.0/README.md#some) - test if any value satisfies a condition. -* [d3.filter](https://github.com/d3/d3-array/blob/v2.12.0/README.md#filter) - filter values. -* [d3.map](https://github.com/d3/d3-array/blob/v2.12.0/README.md#map) - map values. -* [d3.reduce](https://github.com/d3/d3-array/blob/v2.12.0/README.md#reduce) - reduce values. -* [d3.reverse](https://github.com/d3/d3-array/blob/v2.12.0/README.md#reverse) - reverse the order of values. -* [d3.sort](https://github.com/d3/d3-array/blob/v2.12.0/README.md#sort) - sort values. +* [d3.every](https://github.com/d3/d3-array/blob/v2.12.1/README.md#every) - test if all values satisfy a condition. +* [d3.some](https://github.com/d3/d3-array/blob/v2.12.1/README.md#some) - test if any value satisfies a condition. +* [d3.filter](https://github.com/d3/d3-array/blob/v2.12.1/README.md#filter) - filter values. +* [d3.map](https://github.com/d3/d3-array/blob/v2.12.1/README.md#map) - map values. +* [d3.reduce](https://github.com/d3/d3-array/blob/v2.12.1/README.md#reduce) - reduce values. +* [d3.reverse](https://github.com/d3/d3-array/blob/v2.12.1/README.md#reverse) - reverse the order of values. +* [d3.sort](https://github.com/d3/d3-array/blob/v2.12.1/README.md#sort) - sort values. -### [Sets](https://github.com/d3/d3-array/blob/v2.12.0/README.md#sets) +### [Sets](https://github.com/d3/d3-array/blob/v2.12.1/README.md#sets) -* [d3.difference](https://github.com/d3/d3-array/blob/v2.12.0/README.md#difference) - compute a set difference. -* [d3.disjoint](https://github.com/d3/d3-array/blob/v2.12.0/README.md#disjoint) - test whether two sets are disjoint. -* [d3.intersection](https://github.com/d3/d3-array/blob/v2.12.0/README.md#intersection) - compute a set intersection. -* [d3.superset](https://github.com/d3/d3-array/blob/v2.12.0/README.md#superset) - test whether a set is a superset of another. -* [d3.subset](https://github.com/d3/d3-array/blob/v2.12.0/README.md#subset) - test whether a set is a subset of another. -* [d3.union](https://github.com/d3/d3-array/blob/v2.12.0/README.md#union) - compute a set union. +* [d3.difference](https://github.com/d3/d3-array/blob/v2.12.1/README.md#difference) - compute a set difference. +* [d3.disjoint](https://github.com/d3/d3-array/blob/v2.12.1/README.md#disjoint) - test whether two sets are disjoint. +* [d3.intersection](https://github.com/d3/d3-array/blob/v2.12.1/README.md#intersection) - compute a set intersection. +* [d3.superset](https://github.com/d3/d3-array/blob/v2.12.1/README.md#superset) - test whether a set is a superset of another. +* [d3.subset](https://github.com/d3/d3-array/blob/v2.12.1/README.md#subset) - test whether a set is a subset of another. +* [d3.union](https://github.com/d3/d3-array/blob/v2.12.1/README.md#union) - compute a set union. -### [Histograms](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bins) +### [Histograms](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bins) Bin discrete samples into continuous, non-overlapping intervals. -* [d3.bin](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bin) - create a new bin generator. -* [*bin*](https://github.com/d3/d3-array/blob/v2.12.0/README.md#_bin) - bins a given array of samples. -* [*bin*.value](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bin_value) - specify a value accessor for each sample. -* [*bin*.domain](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bin_domain) - specify the interval of observable values. -* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v2.12.0/README.md#bin_thresholds) - specify how values are divided into bins. -* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v2.12.0/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule. -* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v2.12.0/README.md#thresholdScott) - Scott’s normal reference binning rule. -* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v2.12.0/README.md#thresholdSturges) - Sturges’ binning formula. +* [d3.bin](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bin) - create a new bin generator. +* [*bin*](https://github.com/d3/d3-array/blob/v2.12.1/README.md#_bin) - bins a given array of samples. +* [*bin*.value](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bin_value) - specify a value accessor for each sample. +* [*bin*.domain](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bin_domain) - specify the interval of observable values. +* [*bin*.thresholds](https://github.com/d3/d3-array/blob/v2.12.1/README.md#bin_thresholds) - specify how values are divided into bins. +* [d3.thresholdFreedmanDiaconis](https://github.com/d3/d3-array/blob/v2.12.1/README.md#thresholdFreedmanDiaconis) - the Freedman–Diaconis binning rule. +* [d3.thresholdScott](https://github.com/d3/d3-array/blob/v2.12.1/README.md#thresholdScott) - Scott’s normal reference binning rule. +* [d3.thresholdSturges](https://github.com/d3/d3-array/blob/v2.12.1/README.md#thresholdSturges) - Sturges’ binning formula. -### [Interning](https://github.com/d3/d3-array/blob/v2.12.0/README.md#interning) +### [Interning](https://github.com/d3/d3-array/blob/v2.12.1/README.md#interning) -* [d3.InternMap](https://github.com/d3/d3-array/blob/v2.12.0/README.md#InternMap) - a key-interning Map. -* [d3.InternSet](https://github.com/d3/d3-array/blob/v2.12.0/README.md#InternSet) - a value-interning Set. +* [d3.InternMap](https://github.com/d3/d3-array/blob/v2.12.1/README.md#InternMap) - a key-interning Map. +* [d3.InternSet](https://github.com/d3/d3-array/blob/v2.12.1/README.md#InternSet) - a value-interning Set. ## [Axes (d3-axis)](https://github.com/d3/d3-axis/tree/v2.1.0) diff --git a/yarn.lock b/yarn.lock index 14ca5ef3..f5211322 100644 --- a/yarn.lock +++ b/yarn.lock @@ -24,9 +24,9 @@ js-tokens "^4.0.0" "@types/node@*": - version "14.14.33" - resolved "https://registry.yarnpkg.com/@types/node/-/node-14.14.33.tgz#9e4f8c64345522e4e8ce77b334a8aaa64e2b6c78" - integrity sha512-oJqcTrgPUF29oUP8AsUqbXGJNuPutsetaa9kTQAQce5Lx5dTYWV02ScBiT/k1BX/Z7pKeqedmvp39Wu4zR7N7g== + version "14.14.35" + resolved "https://registry.yarnpkg.com/@types/node/-/node-14.14.35.tgz#42c953a4e2b18ab931f72477e7012172f4ffa313" + integrity sha512-Lt+wj8NVPx0zUmUwumiVXapmaLUcAk3yPuHCFVXras9k5VT9TdhJqKqGVUQCD60OTMCl0qxJ57OiTL0Mic3Iag== "@types/resolve@0.0.8": version "0.0.8" @@ -110,9 +110,9 @@ concat-map@0.0.1: integrity sha1-2Klr13/Wjfd5OnMDajug1UBdR3s= d3-array@2, d3-array@>=2.5, d3-array@^2.3.0: - version "2.12.0" - resolved "https://registry.yarnpkg.com/d3-array/-/d3-array-2.12.0.tgz#68a74d153e52d6bf4608d9f6388cca48b42a4c3f" - integrity sha512-T6H/qNldyD/1OlRkJbonb3u3MPhNwju8OPxYv0YSjDb/B2RUeeBEHzIpNrYiinwpmz8+am+puMrpcrDWgY9wRg== + version "2.12.1" + resolved "https://registry.yarnpkg.com/d3-array/-/d3-array-2.12.1.tgz#e20b41aafcdffdf5d50928004ececf815a465e81" + integrity sha512-B0ErZK/66mHtEsR1TkPEEkwdy+WDesimkM5gpZr5Dsg54BiTA5RXtYW5qTLIAcekaS9xfZrzBLF/OAkB3Qn1YQ== dependencies: internmap "^1.0.0" @@ -762,9 +762,9 @@ rollup-pluginutils@^2.8.1: estree-walker "^0.6.1" rollup@2: - version "2.41.0" - resolved "https://registry.yarnpkg.com/rollup/-/rollup-2.41.0.tgz#b2a398bbabbf227738dedaef099e494aed468982" - integrity sha512-Gk76XHTggulWPH95q8V62bw6uqDH6UGvbD6LOa3QUyhuMF3eOuaeDHR7SLm1T9faitkpNrqzUAVYx47klcMnlA== + version "2.42.4" + resolved "https://registry.yarnpkg.com/rollup/-/rollup-2.42.4.tgz#97c910a48bd0db6aaa4271dd48745870cbbbf970" + integrity sha512-Zqv3EvNfcllBHyyEUM754npqsZw82VIjK34cDQMwrQ1d6aqxzeYu5yFb7smGkPU4C1Bj7HupIMeT6WU7uIdnMw== optionalDependencies: fsevents "~2.3.1" @@ -874,9 +874,9 @@ tape@4: through "~2.3.8" terser@^5.0.0: - version "5.6.0" - resolved "https://registry.yarnpkg.com/terser/-/terser-5.6.0.tgz#138cdf21c5e3100b1b3ddfddf720962f88badcd2" - integrity sha512-vyqLMoqadC1uR0vywqOZzriDYzgEkNJFK4q9GeyOBHIbiECHiWLKcWfbQWAUaPfxkjDhapSlZB9f7fkMrvkVjA== + version "5.6.1" + resolved "https://registry.yarnpkg.com/terser/-/terser-5.6.1.tgz#a48eeac5300c0a09b36854bf90d9c26fb201973c" + integrity sha512-yv9YLFQQ+3ZqgWCUk+pvNJwgUTdlIxUk1WTN+RnaFJe2L7ipG2csPT0ra2XRm7Cs8cxN7QXmK1rFzEwYEQkzXw== dependencies: commander "^2.20.0" source-map "~0.7.2"