d3.nest()
  • References/JavaScript/D3.js/Collection

d3.nest() Creates a new nest operator. The set of keys is initially empty.

2025-01-10 15:47:30
set.add()
  • References/JavaScript/D3.js/Collection

set.add(value) Adds the specified value string to this set. Returns the set, allowing chaining. For example:

2025-01-10 15:47:30
set.values()
  • References/JavaScript/D3.js/Collection

set.values() Returns an array of the string values in this set. The order of the returned values is arbitrary. Can be used

2025-01-10 15:47:30
nest.entries()
  • References/JavaScript/D3.js/Collection

nest.entries(array) Applies the nest operator to the specified array, returning an array of key-values entries

2025-01-10 15:47:30
set.has()
  • References/JavaScript/D3.js/Collection

set.has(value) Returns true if and only if this set has an entry for the specified value string.

2025-01-10 15:47:30
nest.sortValues()
  • References/JavaScript/D3.js/Collection

nest.sortValues(comparator) Sorts leaf elements using the specified comparator function, such as

2025-01-10 15:47:30
map.keys()
  • References/JavaScript/D3.js/Collection

map.keys() Returns an array of string keys for every entry in this map. The order of the returned keys is arbitrary.

2025-01-10 15:47:30
nest.rollup()
  • References/JavaScript/D3.js/Collection

nest.rollup(function) Specifies a rollup function to be applied on each group of leaf elements. The return

2025-01-10 15:47:30
nest.map()
  • References/JavaScript/D3.js/Collection

nest.map(array) Applies the nest operator to the specified array, returning a nested

2025-01-10 15:47:30
map.size()
  • References/JavaScript/D3.js/Collection

map.size() Returns the number of entries in this map.

2025-01-10 15:47:30