You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@solr.apache.org by ep...@apache.org on 2026/08/26 22:08:47 UTC
(solr) 02/02: SOLR-8885: Update to latest D3, no longer on EOL version. (#4814)
This is an automated email from the ASF dual-hosted git repository.
epugh pushed a commit to branch branch_10x
in repository https://gitbox.apache.org/repos/asf/solr.git
commit 6bdca5dbbe778dd655dba5e4765fcd205a53b55e
Author: Eric Pugh <ep...@opensourceconnections.com>
AuthorDate: Wed Aug 26 18:01:04 2026 -0400
SOLR-8885: Update to latest D3, no longer on EOL version. (#4814)
(cherry picked from commit 8370ebbd49ddbd29af6e6d84aae8598e4b4b81bc)
---
NOTICE.txt | 5 +-
changelog/unreleased/SOLR-8885.yml | 10 +
gradle/validation/rat-config.xml | 9 +-
solr/webapp/web/js/angular/controllers/cloud.js | 83 +-
solr/webapp/web/js/angular/controllers/stream.js | 31 +-
solr/webapp/web/libs/d3.js | 27352 +++++++++++++++------
6 files changed, 19381 insertions(+), 8109 deletions(-)
diff --git a/NOTICE.txt b/NOTICE.txt
index 876f5eca838..7cd5811b2b4 100644
--- a/NOTICE.txt
+++ b/NOTICE.txt
@@ -23,8 +23,9 @@ This product includes the jQuery UI JavaScript library.
Copyright OpenJS Foundation and other contributors, https://jqueryui.com
License: MIT https://jquery.org/license
-This product includes the D3.js JavaScript library created by Michael Bostock.
-Copyright (c) 2012, Michael Bostock, https://github.com/mbostock/d3
+This product includes the D3.js JavaScript library created by Mike Bostock.
+Copyright 2010-2023 Mike Bostock, https://d3js.org
+License: ISC https://github.com/d3/d3/blob/main/LICENSE
This product includes the highlight.js Javascript library created by Ivan Sagalaev
Copyright (c) 2006, Ivan Sagalaev, https://github.com/isagalaev/highlight.js
diff --git a/changelog/unreleased/SOLR-8885.yml b/changelog/unreleased/SOLR-8885.yml
new file mode 100644
index 00000000000..e050acc5f58
--- /dev/null
+++ b/changelog/unreleased/SOLR-8885.yml
@@ -0,0 +1,10 @@
+title: >
+ Upgraded the bundled d3.js library (used for the Admin UI's Cloud graph,
+ Stream explain-tree, and Nodes disk-usage bar chart) from the decade-old
+ 2.8.1 to 7.9.0.
+type: dependency_update
+authors:
+ - name: Eric Pugh
+links:
+ - name: SOLR-8885
+ url: https://issues.apache.org/jira/browse/SOLR-8885
diff --git a/gradle/validation/rat-config.xml b/gradle/validation/rat-config.xml
index 22d2fd9942a..3028823c729 100644
--- a/gradle/validation/rat-config.xml
+++ b/gradle/validation/rat-config.xml
@@ -24,6 +24,7 @@
<family id="MIT" name="The MIT License"/>
<family id="BSD4" name="Original BSD License (with advertising clause)"/>
<family id="BSD-modi" name="Modified BSD License"/>
+ <family id="ISC" name="ISC License"/>
<family id="GEN" name="Generated"/>
</families>
@@ -36,7 +37,6 @@
<!-- Various BSD-like third-party libraries with non-standard copyright headers -->
<license family="BSD-modi" id="BSD-modi" name="Modified BSD License">
<any>
- <text>THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</text> <!-- d3.js -->
<text>THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS</text> <!-- highlight.js -->
</any>
</license>
@@ -46,6 +46,12 @@
<text> ; License: MIT</text>
</license>
+ <!-- Single-line copyright banner used by the d3.js bundled asset; the full
+ ISC license text isn't embedded in the bundle itself. -->
+ <license family="ISC" id="ISC-d3" name="ISC (d3.js)">
+ <text>d3js.org</text>
+ </license>
+
<!-- Inline MIT comment used by jQuery UI bundled assets -->
<license family="MIT" id="MIT-jqueryui" name="MIT (jQuery UI)">
<text>Released under the MIT license.</text>
@@ -61,6 +67,7 @@
<approved>
<family license_ref="BSD-modi"/>
+ <family license_ref="ISC"/>
<family license_ref="GEN"/>
<!-- MIT is already approved by the default config; MIT-uigrid inherits that. -->
<!-- BSD4 is intentionally absent: matching files are policy violations. -->
diff --git a/solr/webapp/web/js/angular/controllers/cloud.js b/solr/webapp/web/js/angular/controllers/cloud.js
index f045583ef7f..1a3fb2d26c9 100644
--- a/solr/webapp/web/js/angular/controllers/cloud.js
+++ b/solr/webapp/web/js/angular/controllers/cloud.js
@@ -563,7 +563,7 @@ var nodesSubController = function($scope, Collections, System, Metrics, MetricsE
// Execute the transition to show the bars
bars.transition()
- .ease('elastic')
+ .ease(d3.easeElastic)
.style('width', function (d) {
return d.pct + '%';
});
@@ -953,12 +953,12 @@ solrAdminApp.directive('graph', function(Constants) {
var classes = ['link'];
classes.push('lvl-' + p.target.depth);
- if (p.target.data && p.target.data.leader) {
+ if (p.target.data.data && p.target.data.data.leader) {
classes.push('leader');
}
- if (p.target.data && p.target.data.state) {
- classes.push(p.target.data.state);
+ if (p.target.data.data && p.target.data.data.state) {
+ classes.push(p.target.data.data.state);
}
return classes.join(' ');
@@ -968,13 +968,13 @@ solrAdminApp.directive('graph', function(Constants) {
var classes = ['node'];
classes.push('lvl-' + d.depth);
- if (d.data && d.data.leader) {
+ if (d.data.data && d.data.data.leader) {
classes.push('leader');
}
- if (d.data && d.data.state) {
- if(!(d.data.type=='shard' && d.data.state=='active')){
- classes.push(d.data.state);
+ if (d.data.data && d.data.data.state) {
+ if(!(d.data.data.type=='shard' && d.data.data.state=='active')){
+ classes.push(d.data.data.state);
}
}
@@ -982,39 +982,39 @@ solrAdminApp.directive('graph', function(Constants) {
};
var helper_tooltip_text = function (d) {
- if (!d.data) {
+ if (!d.data.data) {
return tooltip;
}
var tooltip;
- if (! d.data.type) {
+ if (! d.data.data.type) {
return tooltip;
}
- if (d.data.type == 'collection') {
- tooltip = d.name + " {<br/> ";
- tooltip += "numShards: [" + d.data.numShards + "],<br/>";
- tooltip += "router: [" + d.data.router + "],<br/>";
- tooltip += "replicationFactor: [" + d.data.replicationFactor + "],<br/>";
- tooltip += "nrtReplicas: [" + d.data.nrtReplicas + "],<br/>";
- tooltip += "pullReplicas: [" + d.data.pullReplicas + "],<br/>";
- tooltip += "tlogReplicas: [" + d.data.tlogReplicas + "],<br/>";
+ if (d.data.data.type == 'collection') {
+ tooltip = d.data.name + " {<br/> ";
+ tooltip += "numShards: [" + d.data.data.numShards + "],<br/>";
+ tooltip += "router: [" + d.data.data.router + "],<br/>";
+ tooltip += "replicationFactor: [" + d.data.data.replicationFactor + "],<br/>";
+ tooltip += "nrtReplicas: [" + d.data.data.nrtReplicas + "],<br/>";
+ tooltip += "pullReplicas: [" + d.data.data.pullReplicas + "],<br/>";
+ tooltip += "tlogReplicas: [" + d.data.data.tlogReplicas + "],<br/>";
tooltip += "}";
- } else if (d.data.type == 'shard') {
- tooltip = d.name + " {<br/> ";
- tooltip += "range: [" + d.data.range + "],<br/>";
- tooltip += "state: [" + d.data.state + "],<br/>";
+ } else if (d.data.data.type == 'shard') {
+ tooltip = d.data.name + " {<br/> ";
+ tooltip += "range: [" + d.data.data.range + "],<br/>";
+ tooltip += "state: [" + d.data.data.state + "],<br/>";
tooltip += "}";
- } else if (d.data.type == 'node') {
- tooltip = d.data.uri.core_node + " {<br/>";
+ } else if (d.data.data.type == 'node') {
+ tooltip = d.data.data.uri.core_node + " {<br/>";
if (0 !== scope.helperData.core.length) {
- tooltip += "core: [" + d.data.uri.core + "],<br/>";
+ tooltip += "core: [" + d.data.data.uri.core + "],<br/>";
}
if (0 !== scope.helperData.node_name.length) {
- tooltip += "node_name: [" + d.data.uri.node_name + "],<br/>";
+ tooltip += "node_name: [" + d.data.data.uri.node_name + "],<br/>";
}
tooltip += "}";
}
@@ -1023,25 +1023,25 @@ solrAdminApp.directive('graph', function(Constants) {
};
var helper_node_text = function (d) {
- if (!d.data || !d.data.uri) {
- return d.name;
+ if (!d.data.data || !d.data.data.uri) {
+ return d.data.name;
}
- var name = d.data.uri.hostname;
+ var name = d.data.data.uri.hostname;
if (1 !== scope.helperData.protocol.length) {
- name = d.data.uri.protocol + '//' + name;
+ name = d.data.data.uri.protocol + '//' + name;
}
if (1 !== scope.helperData.port.length) {
- name += ':' + d.data.uri.port;
+ name += ':' + d.data.data.uri.port;
}
if (1 !== scope.helperData.pathname.length) {
- name += d.data.uri.pathname;
+ name += d.data.data.uri.pathname;
}
if(0 !== scope.helperData.replicaType.length) {
- name += ' (' + d.data.uri.replicaType[0] + ')';
+ name += ' (' + d.data.data.uri.replicaType[0] + ')';
}
return name;
@@ -1074,14 +1074,14 @@ solrAdminApp.directive('graph', function(Constants) {
}
})
.on('click', function(d) {
- if (d.data.type == "node"){
+ if (d.data.data.type == "node"){
location.href = getNodeUrl(d, view);
}
});
}
function getNodeUrl(d, view){
- var url = d.name + Constants.ROOT_URL + "#/~cloud";
+ var url = d.data.name + Constants.ROOT_URL + "#/~cloud";
if (view != undefined){
url += "?view=" + view;
}
@@ -1095,11 +1095,12 @@ solrAdminApp.directive('graph', function(Constants) {
// Calculate roughly the width of host name to align the graph
var hostnameWidth = graphData.children.length > 0 ?
graphData.children[0].children[0].children[0].name.length * 5.5 : 400;
- var tree = d3.layout.tree().size([h, Math.max(w - 140 - hostnameWidth, 100)]);
+ var root = d3.hierarchy(graphData);
+ d3.tree().size([h, Math.max(w - 140 - hostnameWidth, 100)])(root);
- var diagonal = d3.svg.diagonal().projection(function (d) {
- return [d.y, d.x];
- });
+ var diagonal = d3.linkHorizontal()
+ .x(function (d) { return d.y; })
+ .y(function (d) { return d.x; });
d3.select('#canvas', element).html('');
var vis = d3.select('#canvas', element).append('svg')
@@ -1108,10 +1109,10 @@ solrAdminApp.directive('graph', function(Constants) {
.append('g')
.attr('transform', 'translate(10, 0)');
- var nodes = tree.nodes(graphData);
+ var nodes = root.descendants();
var link = vis.selectAll('path.link')
- .data(tree.links(nodes))
+ .data(root.links())
.enter().append('path')
.attr('class', helper_path_class)
.attr('d', diagonal);
diff --git a/solr/webapp/web/js/angular/controllers/stream.js b/solr/webapp/web/js/angular/controllers/stream.js
index 92440c36024..f8001d84ffe 100644
--- a/solr/webapp/web/js/angular/controllers/stream.js
+++ b/solr/webapp/web/js/angular/controllers/stream.js
@@ -151,29 +151,29 @@ solrAdminApp.directive('explanationGraph', function(Constants) {
var helper_node_class = function(d) {
var classes = ['node'];
- if (d.data && d.data.expressionType) {
- classes.push(d.data.expressionType);
+ if (d.data.data && d.data.data.expressionType) {
+ classes.push(d.data.data.expressionType);
}
return classes.join(' ');
};
var helper_node_text = function(d) {
- if (d.data && d.data.functionName) {
- return d.data.functionName;
+ if (d.data.data && d.data.data.functionName) {
+ return d.data.data.functionName;
}
- return d.name
+ return d.data.name
};
var helper_tooltip = function(d) {
return [
- "Function: " + d.data.functionName,
- "Type: " + d.data.expressionType,
- "Class: " + d.data.implementingClass.replace("org.apache.solr.client.solrj.io", "o.a.s.c.s.i"),
+ "Function: " + d.data.data.functionName,
+ "Type: " + d.data.data.expressionType,
+ "Class: " + d.data.data.implementingClass.replace("org.apache.solr.client.solrj.io", "o.a.s.c.s.i"),
"=============",
- d.data.expression
+ d.data.data.expression
].join("\n");
}
@@ -187,11 +187,12 @@ solrAdminApp.directive('explanationGraph', function(Constants) {
var w = 100 + (depth * 100),
h = leafCount * 40;
- var tree = d3.layout.tree().size([h, w]);
+ var root = d3.hierarchy(graphData);
+ d3.tree().size([h, w])(root);
- var diagonal = d3.svg.diagonal().projection(function(d) {
- return [d.y * .7, d.x];
- });
+ var diagonal = d3.linkHorizontal()
+ .x(function(d) { return d.y * .7; })
+ .y(function(d) { return d.x; });
d3.select('#canvas', element).html('');
var vis = d3.select('#canvas', element).append('svg')
@@ -200,10 +201,10 @@ solrAdminApp.directive('explanationGraph', function(Constants) {
.append('g')
.attr('transform', 'translate(25, 0)');
- var nodes = tree.nodes(graphData);
+ var nodes = root.descendants();
var link = vis.selectAll('path.link')
- .data(tree.links(nodes))
+ .data(root.links())
.enter().append('path')
.attr('class', helper_path_class)
.attr('d', diagonal);
diff --git a/solr/webapp/web/libs/d3.js b/solr/webapp/web/libs/d3.js
index 50156035b09..6c6bf89df14 100644
--- a/solr/webapp/web/libs/d3.js
+++ b/solr/webapp/web/libs/d3.js
@@ -1,9373 +1,20625 @@
-/*
+// https://d3js.org v7.9.0 Copyright 2010-2023 Mike Bostock
+(function (global, factory) {
+typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+typeof define === 'function' && define.amd ? define(['exports'], factory) :
+(global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.d3 = global.d3 || {}));
+})(this, (function (exports) { 'use strict';
-Copyright (c) 2013, Michael Bostock
-All rights reserved.
+var version = "7.9.0";
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
+function ascending$3(a, b) {
+ return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
+}
-* Redistributions of source code must retain the above copyright notice, this
- list of conditions and the following disclaimer.
+function descending$2(a, b) {
+ return a == null || b == null ? NaN
+ : b < a ? -1
+ : b > a ? 1
+ : b >= a ? 0
+ : NaN;
+}
-* Redistributions in binary form must reproduce the above copyright notice,
- this list of conditions and the following disclaimer in the documentation
- and/or other materials provided with the distribution.
+function bisector(f) {
+ let compare1, compare2, delta;
+
+ // If an accessor is specified, promote it to a comparator. In this case we
+ // can test whether the search value is (self-) comparable. We can’t do this
+ // for a comparator (except for specific, known comparators) because we can’t
+ // tell if the comparator is symmetric, and an asymmetric comparator can’t be
+ // used to test whether a single value is comparable.
+ if (f.length !== 2) {
+ compare1 = ascending$3;
+ compare2 = (d, x) => ascending$3(f(d), x);
+ delta = (d, x) => f(d) - x;
+ } else {
+ compare1 = f === ascending$3 || f === descending$2 ? f : zero$1;
+ compare2 = f;
+ delta = f;
+ }
-* The name Michael Bostock may not be used to endorse or promote products
- derived from this software without specific prior written permission.
+ function left(a, x, lo = 0, hi = a.length) {
+ if (lo < hi) {
+ if (compare1(x, x) !== 0) return hi;
+ do {
+ const mid = (lo + hi) >>> 1;
+ if (compare2(a[mid], x) < 0) lo = mid + 1;
+ else hi = mid;
+ } while (lo < hi);
+ }
+ return lo;
+ }
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL MICHAEL BOSTOCK BE LIABLE FOR ANY DIRECT,
-INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
-BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
-OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
-EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ function right(a, x, lo = 0, hi = a.length) {
+ if (lo < hi) {
+ if (compare1(x, x) !== 0) return hi;
+ do {
+ const mid = (lo + hi) >>> 1;
+ if (compare2(a[mid], x) <= 0) lo = mid + 1;
+ else hi = mid;
+ } while (lo < hi);
+ }
+ return lo;
+ }
-*/
+ function center(a, x, lo = 0, hi = a.length) {
+ const i = left(a, x, lo, hi - 1);
+ return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;
+ }
-(function(){if (!Date.now) Date.now = function() {
- return +new Date;
-};
-try {
- document.createElement("div").style.setProperty("opacity", 0, "");
-} catch (error) {
- var d3_style_prototype = CSSStyleDeclaration.prototype,
- d3_style_setProperty = d3_style_prototype.setProperty;
- d3_style_prototype.setProperty = function(name, value, priority) {
- d3_style_setProperty.call(this, name, value + "", priority);
- };
+ return {left, center, right};
}
-d3 = {version: "2.8.1"}; // semver
-function d3_class(ctor, properties) {
- try {
- for (var key in properties) {
- Object.defineProperty(ctor.prototype, key, {
- value: properties[key],
- enumerable: false
- });
+
+function zero$1() {
+ return 0;
+}
+
+function number$3(x) {
+ return x === null ? NaN : +x;
+}
+
+function* numbers(values, valueof) {
+ if (valueof === undefined) {
+ for (let value of values) {
+ if (value != null && (value = +value) >= value) {
+ yield value;
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
+ yield value;
+ }
}
- } catch (e) {
- ctor.prototype = properties;
}
}
-var d3_array = d3_arraySlice; // conversion for NodeLists
-function d3_arrayCopy(pseudoarray) {
- var i = -1, n = pseudoarray.length, array = [];
- while (++i < n) array.push(pseudoarray[i]);
- return array;
+const ascendingBisect = bisector(ascending$3);
+const bisectRight = ascendingBisect.right;
+const bisectLeft = ascendingBisect.left;
+const bisectCenter = bisector(number$3).center;
+var bisect = bisectRight;
+
+function blur(values, r) {
+ if (!((r = +r) >= 0)) throw new RangeError("invalid r");
+ let length = values.length;
+ if (!((length = Math.floor(length)) >= 0)) throw new RangeError("invalid length");
+ if (!length || !r) return values;
+ const blur = blurf(r);
+ const temp = values.slice();
+ blur(values, temp, 0, length, 1);
+ blur(temp, values, 0, length, 1);
+ blur(values, temp, 0, length, 1);
+ return values;
}
-function d3_arraySlice(pseudoarray) {
- return Array.prototype.slice.call(pseudoarray);
+const blur2 = Blur2(blurf);
+
+const blurImage = Blur2(blurfImage);
+
+function Blur2(blur) {
+ return function(data, rx, ry = rx) {
+ if (!((rx = +rx) >= 0)) throw new RangeError("invalid rx");
+ if (!((ry = +ry) >= 0)) throw new RangeError("invalid ry");
+ let {data: values, width, height} = data;
+ if (!((width = Math.floor(width)) >= 0)) throw new RangeError("invalid width");
+ if (!((height = Math.floor(height !== undefined ? height : values.length / width)) >= 0)) throw new RangeError("invalid height");
+ if (!width || !height || (!rx && !ry)) return data;
+ const blurx = rx && blur(rx);
+ const blury = ry && blur(ry);
+ const temp = values.slice();
+ if (blurx && blury) {
+ blurh(blurx, temp, values, width, height);
+ blurh(blurx, values, temp, width, height);
+ blurh(blurx, temp, values, width, height);
+ blurv(blury, values, temp, width, height);
+ blurv(blury, temp, values, width, height);
+ blurv(blury, values, temp, width, height);
+ } else if (blurx) {
+ blurh(blurx, values, temp, width, height);
+ blurh(blurx, temp, values, width, height);
+ blurh(blurx, values, temp, width, height);
+ } else if (blury) {
+ blurv(blury, values, temp, width, height);
+ blurv(blury, temp, values, width, height);
+ blurv(blury, values, temp, width, height);
+ }
+ return data;
+ };
}
-try {
- d3_array(document.documentElement.childNodes)[0].nodeType;
-} catch(e) {
- d3_array = d3_arrayCopy;
+function blurh(blur, T, S, w, h) {
+ for (let y = 0, n = w * h; y < n;) {
+ blur(T, S, y, y += w, 1);
+ }
}
-var d3_arraySubclass = [].__proto__?
+function blurv(blur, T, S, w, h) {
+ for (let x = 0, n = w * h; x < w; ++x) {
+ blur(T, S, x, x + n, w);
+ }
+}
-// Until ECMAScript supports array subclassing, prototype injection works well.
-function(array, prototype) {
- array.__proto__ = prototype;
-}:
+function blurfImage(radius) {
+ const blur = blurf(radius);
+ return (T, S, start, stop, step) => {
+ start <<= 2, stop <<= 2, step <<= 2;
+ blur(T, S, start + 0, stop + 0, step);
+ blur(T, S, start + 1, stop + 1, step);
+ blur(T, S, start + 2, stop + 2, step);
+ blur(T, S, start + 3, stop + 3, step);
+ };
+}
-// And if your browser doesn't support __proto__, we'll use direct extension.
-function(array, prototype) {
- for (var property in prototype) array[property] = prototype[property];
-};
-d3.map = function(object) {
- var map = new d3_Map;
- for (var key in object) map.set(key, object[key]);
- return map;
-};
+// Given a target array T, a source array S, sets each value T[i] to the average
+// of {S[i - r], …, S[i], …, S[i + r]}, where r = ⌊radius⌋, start <= i < stop,
+// for each i, i + step, i + 2 * step, etc., and where S[j] is clamped between
+// S[start] (inclusive) and S[stop] (exclusive). If the given radius is not an
+// integer, S[i - r - 1] and S[i + r + 1] are added to the sum, each weighted
+// according to r - ⌊radius⌋.
+function blurf(radius) {
+ const radius0 = Math.floor(radius);
+ if (radius0 === radius) return bluri(radius);
+ const t = radius - radius0;
+ const w = 2 * radius + 1;
+ return (T, S, start, stop, step) => { // stop must be aligned!
+ if (!((stop -= step) >= start)) return; // inclusive stop
+ let sum = radius0 * S[start];
+ const s0 = step * radius0;
+ const s1 = s0 + step;
+ for (let i = start, j = start + s0; i < j; i += step) {
+ sum += S[Math.min(stop, i)];
+ }
+ for (let i = start, j = stop; i <= j; i += step) {
+ sum += S[Math.min(stop, i + s0)];
+ T[i] = (sum + t * (S[Math.max(start, i - s1)] + S[Math.min(stop, i + s1)])) / w;
+ sum -= S[Math.max(start, i - s0)];
+ }
+ };
+}
-function d3_Map() {}
+// Like blurf, but optimized for integer radius.
+function bluri(radius) {
+ const w = 2 * radius + 1;
+ return (T, S, start, stop, step) => { // stop must be aligned!
+ if (!((stop -= step) >= start)) return; // inclusive stop
+ let sum = radius * S[start];
+ const s = step * radius;
+ for (let i = start, j = start + s; i < j; i += step) {
+ sum += S[Math.min(stop, i)];
+ }
+ for (let i = start, j = stop; i <= j; i += step) {
+ sum += S[Math.min(stop, i + s)];
+ T[i] = sum / w;
+ sum -= S[Math.max(start, i - s)];
+ }
+ };
+}
-d3_class(d3_Map, {
- has: function(key) {
- return d3_map_prefix + key in this;
- },
- get: function(key) {
- return this[d3_map_prefix + key];
- },
- set: function(key, value) {
- return this[d3_map_prefix + key] = value;
- },
- remove: function(key) {
- key = d3_map_prefix + key;
- return key in this && delete this[key];
- },
- keys: function() {
- var keys = [];
- this.forEach(function(key) { keys.push(key); });
- return keys;
- },
- values: function() {
- var values = [];
- this.forEach(function(key, value) { values.push(value); });
- return values;
- },
- entries: function() {
- var entries = [];
- this.forEach(function(key, value) { entries.push({key: key, value: value}); });
- return entries;
- },
- forEach: function(f) {
- for (var key in this) {
- if (key.charCodeAt(0) === d3_map_prefixCode) {
- f.call(this, key.substring(1), this[key]);
+function count$1(values, valueof) {
+ let count = 0;
+ if (valueof === undefined) {
+ for (let value of values) {
+ if (value != null && (value = +value) >= value) {
+ ++count;
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
+ ++count;
}
}
}
-});
+ return count;
+}
-var d3_map_prefix = "\0", // prevent collision with built-ins
- d3_map_prefixCode = d3_map_prefix.charCodeAt(0);
-function d3_this() {
- return this;
+function length$3(array) {
+ return array.length | 0;
}
-d3.functor = function(v) {
- return typeof v === "function" ? v : function() { return v; };
-};
-// Copies a variable number of methods from source to target.
-d3.rebind = function(target, source) {
- var i = 1, n = arguments.length, method;
- while (++i < n) target[method = arguments[i]] = d3_rebind(target, source, source[method]);
- return target;
-};
-// Method is assumed to be a standard D3 getter-setter:
-// If passed with no arguments, gets the value.
-// If passed with arguments, sets the value and returns the target.
-function d3_rebind(target, source, method) {
- return function() {
- var value = method.apply(source, arguments);
- return arguments.length ? target : value;
- };
+function empty$2(length) {
+ return !(length > 0);
}
-d3.ascending = function(a, b) {
- return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
-};
-d3.descending = function(a, b) {
- return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;
-};
-d3.mean = function(array, f) {
- var n = array.length,
- a,
- m = 0,
- i = -1,
- j = 0;
- if (arguments.length === 1) {
- while (++i < n) if (d3_number(a = array[i])) m += (a - m) / ++j;
- } else {
- while (++i < n) if (d3_number(a = f.call(array, array[i], i))) m += (a - m) / ++j;
- }
- return j ? m : undefined;
-};
-d3.median = function(array, f) {
- if (arguments.length > 1) array = array.map(f);
- array = array.filter(d3_number);
- return array.length ? d3.quantile(array.sort(d3.ascending), .5) : undefined;
-};
-d3.min = function(array, f) {
- var i = -1,
- n = array.length,
- a,
- b;
- if (arguments.length === 1) {
- while (++i < n && ((a = array[i]) == null || a != a)) a = undefined;
- while (++i < n) if ((b = array[i]) != null && a > b) a = b;
- } else {
- while (++i < n && ((a = f.call(array, array[i], i)) == null || a != a)) a = undefined;
- while (++i < n) if ((b = f.call(array, array[i], i)) != null && a > b) a = b;
- }
- return a;
-};
-d3.max = function(array, f) {
- var i = -1,
- n = array.length,
- a,
- b;
- if (arguments.length === 1) {
- while (++i < n && ((a = array[i]) == null || a != a)) a = undefined;
- while (++i < n) if ((b = array[i]) != null && b > a) a = b;
- } else {
- while (++i < n && ((a = f.call(array, array[i], i)) == null || a != a)) a = undefined;
- while (++i < n) if ((b = f.call(array, array[i], i)) != null && b > a) a = b;
- }
- return a;
-};
-d3.extent = function(array, f) {
- var i = -1,
- n = array.length,
- a,
- b,
- c;
- if (arguments.length === 1) {
- while (++i < n && ((a = c = array[i]) == null || a != a)) a = c = undefined;
- while (++i < n) if ((b = array[i]) != null) {
- if (a > b) a = b;
- if (c < b) c = b;
- }
- } else {
- while (++i < n && ((a = c = f.call(array, array[i], i)) == null || a != a)) a = undefined;
- while (++i < n) if ((b = f.call(array, array[i], i)) != null) {
- if (a > b) a = b;
- if (c < b) c = b;
+
+function arrayify(values) {
+ return typeof values !== "object" || "length" in values ? values : Array.from(values);
+}
+
+function reducer(reduce) {
+ return values => reduce(...values);
+}
+
+function cross$2(...values) {
+ const reduce = typeof values[values.length - 1] === "function" && reducer(values.pop());
+ values = values.map(arrayify);
+ const lengths = values.map(length$3);
+ const j = values.length - 1;
+ const index = new Array(j + 1).fill(0);
+ const product = [];
+ if (j < 0 || lengths.some(empty$2)) return product;
+ while (true) {
+ product.push(index.map((j, i) => values[i][j]));
+ let i = j;
+ while (++index[i] === lengths[i]) {
+ if (i === 0) return reduce ? product.map(reduce) : product;
+ index[i--] = 0;
}
}
- return [a, c];
-};
-d3.random = {
- normal: function(mean, deviation) {
- if (arguments.length < 2) deviation = 1;
- if (arguments.length < 1) mean = 0;
- return function() {
- var x, y, r;
- do {
- x = Math.random() * 2 - 1;
- y = Math.random() * 2 - 1;
- r = x * x + y * y;
- } while (!r || r > 1);
- return mean + deviation * x * Math.sqrt(-2 * Math.log(r) / r);
- };
- }
-};
-function d3_number(x) {
- return x != null && !isNaN(x);
}
-d3.sum = function(array, f) {
- var s = 0,
- n = array.length,
- a,
- i = -1;
- if (arguments.length === 1) {
- while (++i < n) if (!isNaN(a = +array[i])) s += a;
- } else {
- while (++i < n) if (!isNaN(a = +f.call(array, array[i], i))) s += a;
- }
+function cumsum(values, valueof) {
+ var sum = 0, index = 0;
+ return Float64Array.from(values, valueof === undefined
+ ? v => (sum += +v || 0)
+ : v => (sum += +valueof(v, index++, values) || 0));
+}
- return s;
-};
-// R-7 per <http://en.wikipedia.org/wiki/Quantile>
-d3.quantile = function(values, p) {
- var H = (values.length - 1) * p + 1,
- h = Math.floor(H),
- v = values[h - 1],
- e = H - h;
- return e ? v + e * (values[h] - v) : v;
-};
-d3.transpose = function(matrix) {
- return d3.zip.apply(d3, matrix);
-};
-d3.zip = function() {
- if (!(n = arguments.length)) return [];
- for (var i = -1, m = d3.min(arguments, d3_zipLength), zips = new Array(m); ++i < m;) {
- for (var j = -1, n, zip = zips[i] = new Array(n); ++j < n;) {
- zip[j] = arguments[j][i];
+function variance(values, valueof) {
+ let count = 0;
+ let delta;
+ let mean = 0;
+ let sum = 0;
+ if (valueof === undefined) {
+ for (let value of values) {
+ if (value != null && (value = +value) >= value) {
+ delta = value - mean;
+ mean += delta / ++count;
+ sum += delta * (value - mean);
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
+ delta = value - mean;
+ mean += delta / ++count;
+ sum += delta * (value - mean);
+ }
}
}
- return zips;
-};
+ if (count > 1) return sum / (count - 1);
+}
-function d3_zipLength(d) {
- return d.length;
+function deviation(values, valueof) {
+ const v = variance(values, valueof);
+ return v ? Math.sqrt(v) : v;
}
-d3.bisector = function(f) {
- return {
- left: function(a, x, lo, hi) {
- if (arguments.length < 3) lo = 0;
- if (arguments.length < 4) hi = a.length;
- while (lo < hi) {
- var mid = lo + hi >> 1;
- if (f.call(a, a[mid], mid) < x) lo = mid + 1;
- else hi = mid;
+
+function extent$1(values, valueof) {
+ let min;
+ let max;
+ if (valueof === undefined) {
+ for (const value of values) {
+ if (value != null) {
+ if (min === undefined) {
+ if (value >= value) min = max = value;
+ } else {
+ if (min > value) min = value;
+ if (max < value) max = value;
+ }
}
- return lo;
- },
- right: function(a, x, lo, hi) {
- if (arguments.length < 3) lo = 0;
- if (arguments.length < 4) hi = a.length;
- while (lo < hi) {
- var mid = lo + hi >> 1;
- if (x < f.call(a, a[mid], mid)) hi = mid;
- else lo = mid + 1;
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null) {
+ if (min === undefined) {
+ if (value >= value) min = max = value;
+ } else {
+ if (min > value) min = value;
+ if (max < value) max = value;
+ }
}
- return lo;
}
- };
-};
+ }
+ return [min, max];
+}
-var d3_bisector = d3.bisector(function(d) { return d; });
-d3.bisectLeft = d3_bisector.left;
-d3.bisect = d3.bisectRight = d3_bisector.right;
-d3.first = function(array, f) {
- var i = 0,
- n = array.length,
- a = array[0],
- b;
- if (arguments.length === 1) f = d3.ascending;
- while (++i < n) {
- if (f.call(array, a, b = array[i]) > 0) {
- a = b;
+// https://github.com/python/cpython/blob/a74eea238f5baba15797e2e8b570d153bc8690a7/Modules/mathmodule.c#L1423
+class Adder {
+ constructor() {
+ this._partials = new Float64Array(32);
+ this._n = 0;
+ }
+ add(x) {
+ const p = this._partials;
+ let i = 0;
+ for (let j = 0; j < this._n && j < 32; j++) {
+ const y = p[j],
+ hi = x + y,
+ lo = Math.abs(x) < Math.abs(y) ? x - (hi - y) : y - (hi - x);
+ if (lo) p[i++] = lo;
+ x = hi;
}
+ p[i] = x;
+ this._n = i + 1;
+ return this;
}
- return a;
-};
-d3.last = function(array, f) {
- var i = 0,
- n = array.length,
- a = array[0],
- b;
- if (arguments.length === 1) f = d3.ascending;
- while (++i < n) {
- if (f.call(array, a, b = array[i]) <= 0) {
- a = b;
+ valueOf() {
+ const p = this._partials;
+ let n = this._n, x, y, lo, hi = 0;
+ if (n > 0) {
+ hi = p[--n];
+ while (n > 0) {
+ x = hi;
+ y = p[--n];
+ hi = x + y;
+ lo = y - (hi - x);
+ if (lo) break;
+ }
+ if (n > 0 && ((lo < 0 && p[n - 1] < 0) || (lo > 0 && p[n - 1] > 0))) {
+ y = lo * 2;
+ x = hi + y;
+ if (y == x - hi) hi = x;
+ }
}
+ return hi;
}
- return a;
-};
-d3.nest = function() {
- var nest = {},
- keys = [],
- sortKeys = [],
- sortValues,
- rollup;
-
- function map(array, depth) {
- if (depth >= keys.length) return rollup
- ? rollup.call(nest, array) : (sortValues
- ? array.sort(sortValues)
- : array);
-
- var i = -1,
- n = array.length,
- key = keys[depth++],
- keyValue,
- object,
- valuesByKey = new d3_Map,
- values,
- o = {};
+}
- while (++i < n) {
- if (values = valuesByKey.get(keyValue = key(object = array[i]))) {
- values.push(object);
- } else {
- valuesByKey.set(keyValue, [object]);
+function fsum(values, valueof) {
+ const adder = new Adder();
+ if (valueof === undefined) {
+ for (let value of values) {
+ if (value = +value) {
+ adder.add(value);
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if (value = +valueof(value, ++index, values)) {
+ adder.add(value);
}
}
+ }
+ return +adder;
+}
- valuesByKey.forEach(function(keyValue) {
- o[keyValue] = map(valuesByKey.get(keyValue), depth);
- });
+function fcumsum(values, valueof) {
+ const adder = new Adder();
+ let index = -1;
+ return Float64Array.from(values, valueof === undefined
+ ? v => adder.add(+v || 0)
+ : v => adder.add(+valueof(v, ++index, values) || 0)
+ );
+}
- return o;
+class InternMap extends Map {
+ constructor(entries, key = keyof) {
+ super();
+ Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});
+ if (entries != null) for (const [key, value] of entries) this.set(key, value);
+ }
+ get(key) {
+ return super.get(intern_get(this, key));
+ }
+ has(key) {
+ return super.has(intern_get(this, key));
}
+ set(key, value) {
+ return super.set(intern_set(this, key), value);
+ }
+ delete(key) {
+ return super.delete(intern_delete(this, key));
+ }
+}
- function entries(map, depth) {
- if (depth >= keys.length) return map;
+class InternSet extends Set {
+ constructor(values, key = keyof) {
+ super();
+ Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});
+ if (values != null) for (const value of values) this.add(value);
+ }
+ has(value) {
+ return super.has(intern_get(this, value));
+ }
+ add(value) {
+ return super.add(intern_set(this, value));
+ }
+ delete(value) {
+ return super.delete(intern_delete(this, value));
+ }
+}
- var a = [],
- sortKey = sortKeys[depth++],
- key;
+function intern_get({_intern, _key}, value) {
+ const key = _key(value);
+ return _intern.has(key) ? _intern.get(key) : value;
+}
- for (key in map) {
- a.push({key: key, values: entries(map[key], depth)});
- }
+function intern_set({_intern, _key}, value) {
+ const key = _key(value);
+ if (_intern.has(key)) return _intern.get(key);
+ _intern.set(key, value);
+ return value;
+}
- if (sortKey) a.sort(function(a, b) {
- return sortKey(a.key, b.key);
- });
+function intern_delete({_intern, _key}, value) {
+ const key = _key(value);
+ if (_intern.has(key)) {
+ value = _intern.get(key);
+ _intern.delete(key);
+ }
+ return value;
+}
+
+function keyof(value) {
+ return value !== null && typeof value === "object" ? value.valueOf() : value;
+}
+
+function identity$9(x) {
+ return x;
+}
+
+function group(values, ...keys) {
+ return nest(values, identity$9, identity$9, keys);
+}
- return a;
+function groups(values, ...keys) {
+ return nest(values, Array.from, identity$9, keys);
+}
+
+function flatten$1(groups, keys) {
+ for (let i = 1, n = keys.length; i < n; ++i) {
+ groups = groups.flatMap(g => g.pop().map(([key, value]) => [...g, key, value]));
}
+ return groups;
+}
- nest.map = function(array) {
- return map(array, 0);
- };
+function flatGroup(values, ...keys) {
+ return flatten$1(groups(values, ...keys), keys);
+}
- nest.entries = function(array) {
- return entries(map(array, 0), 0);
- };
+function flatRollup(values, reduce, ...keys) {
+ return flatten$1(rollups(values, reduce, ...keys), keys);
+}
- nest.key = function(d) {
- keys.push(d);
- return nest;
- };
+function rollup(values, reduce, ...keys) {
+ return nest(values, identity$9, reduce, keys);
+}
- // Specifies the order for the most-recently specified key.
- // Note: only applies to entries. Map keys are unordered!
- nest.sortKeys = function(order) {
- sortKeys[keys.length - 1] = order;
- return nest;
- };
+function rollups(values, reduce, ...keys) {
+ return nest(values, Array.from, reduce, keys);
+}
- // Specifies the order for leaf values.
- // Applies to both maps and entries array.
- nest.sortValues = function(order) {
- sortValues = order;
- return nest;
- };
+function index$4(values, ...keys) {
+ return nest(values, identity$9, unique, keys);
+}
- nest.rollup = function(f) {
- rollup = f;
- return nest;
- };
+function indexes(values, ...keys) {
+ return nest(values, Array.from, unique, keys);
+}
- return nest;
-};
-d3.keys = function(map) {
- var keys = [];
- for (var key in map) keys.push(key);
- return keys;
-};
-d3.values = function(map) {
- var values = [];
- for (var key in map) values.push(map[key]);
- return values;
-};
-d3.entries = function(map) {
- var entries = [];
- for (var key in map) entries.push({key: key, value: map[key]});
- return entries;
-};
-d3.permute = function(array, indexes) {
- var permutes = [],
- i = -1,
- n = indexes.length;
- while (++i < n) permutes[i] = array[indexes[i]];
- return permutes;
-};
-d3.merge = function(arrays) {
- return Array.prototype.concat.apply([], arrays);
-};
-d3.split = function(array, f) {
- var arrays = [],
- values = [],
- value,
- i = -1,
- n = array.length;
- if (arguments.length < 2) f = d3_splitter;
- while (++i < n) {
- if (f.call(values, value = array[i], i)) {
- values = [];
+function unique(values) {
+ if (values.length !== 1) throw new Error("duplicate key");
+ return values[0];
+}
+
+function nest(values, map, reduce, keys) {
+ return (function regroup(values, i) {
+ if (i >= keys.length) return reduce(values);
+ const groups = new InternMap();
+ const keyof = keys[i++];
+ let index = -1;
+ for (const value of values) {
+ const key = keyof(value, ++index, values);
+ const group = groups.get(key);
+ if (group) group.push(value);
+ else groups.set(key, [value]);
+ }
+ for (const [key, values] of groups) {
+ groups.set(key, regroup(values, i));
+ }
+ return map(groups);
+ })(values, 0);
+}
+
+function permute(source, keys) {
+ return Array.from(keys, key => source[key]);
+}
+
+function sort(values, ...F) {
+ if (typeof values[Symbol.iterator] !== "function") throw new TypeError("values is not iterable");
+ values = Array.from(values);
+ let [f] = F;
+ if ((f && f.length !== 2) || F.length > 1) {
+ const index = Uint32Array.from(values, (d, i) => i);
+ if (F.length > 1) {
+ F = F.map(f => values.map(f));
+ index.sort((i, j) => {
+ for (const f of F) {
+ const c = ascendingDefined(f[i], f[j]);
+ if (c) return c;
+ }
+ });
} else {
- if (!values.length) arrays.push(values);
- values.push(value);
+ f = values.map(f);
+ index.sort((i, j) => ascendingDefined(f[i], f[j]));
}
+ return permute(values, index);
}
- return arrays;
-};
+ return values.sort(compareDefined(f));
+}
+
+function compareDefined(compare = ascending$3) {
+ if (compare === ascending$3) return ascendingDefined;
+ if (typeof compare !== "function") throw new TypeError("compare is not a function");
+ return (a, b) => {
+ const x = compare(a, b);
+ if (x || x === 0) return x;
+ return (compare(b, b) === 0) - (compare(a, a) === 0);
+ };
+}
-function d3_splitter(d) {
- return d == null;
+function ascendingDefined(a, b) {
+ return (a == null || !(a >= a)) - (b == null || !(b >= b)) || (a < b ? -1 : a > b ? 1 : 0);
}
-function d3_collapse(s) {
- return s.replace(/(^\s+)|(\s+$)/g, "").replace(/\s+/g, " ");
+
+function groupSort(values, reduce, key) {
+ return (reduce.length !== 2
+ ? sort(rollup(values, reduce, key), (([ak, av], [bk, bv]) => ascending$3(av, bv) || ascending$3(ak, bk)))
+ : sort(group(values, key), (([ak, av], [bk, bv]) => reduce(av, bv) || ascending$3(ak, bk))))
+ .map(([key]) => key);
}
-d3.range = function(start, stop, step) {
- if (arguments.length < 3) {
- step = 1;
- if (arguments.length < 2) {
- stop = start;
- start = 0;
- }
- }
- if ((stop - start) / step === Infinity) throw new Error("infinite range");
- var range = [],
- k = d3_range_integerScale(Math.abs(step)),
- i = -1,
- j;
- start *= k, stop *= k, step *= k;
- if (step < 0) while ((j = start + step * ++i) > stop) range.push(j / k);
- else while ((j = start + step * ++i) < stop) range.push(j / k);
- return range;
-};
-function d3_range_integerScale(x) {
- var k = 1;
- while (x * k % 1) k *= 10;
- return k;
+var array$5 = Array.prototype;
+
+var slice$3 = array$5.slice;
+
+function constant$b(x) {
+ return () => x;
}
-d3.requote = function(s) {
- return s.replace(d3_requote_re, "\\$&");
-};
-var d3_requote_re = /[\\\^\$\*\+\?\|\[\]\(\)\.\{\}]/g;
-d3.round = function(x, n) {
- return n
- ? Math.round(x * (n = Math.pow(10, n))) / n
- : Math.round(x);
-};
-d3.xhr = function(url, mime, callback) {
- var req = new XMLHttpRequest;
- if (arguments.length < 3) callback = mime, mime = null;
- else if (mime && req.overrideMimeType) req.overrideMimeType(mime);
- req.open("GET", url, true);
- if (mime) req.setRequestHeader("Accept", mime);
- req.onreadystatechange = function() {
- if (req.readyState === 4) callback(req.status < 300 ? req : null);
- };
- req.send(null);
-};
-d3.text = function(url, mime, callback) {
- function ready(req) {
- callback(req && req.responseText);
- }
- if (arguments.length < 3) {
- callback = mime;
- mime = null;
- }
- d3.xhr(url, mime, ready);
-};
-d3.json = function(url, callback) {
- d3.text(url, "application/json", function(text) {
- callback(text ? JSON.parse(text) : null);
- });
-};
-d3.html = function(url, callback) {
- d3.text(url, "text/html", function(text) {
- if (text != null) { // Treat empty string as valid HTML.
- var range = document.createRange();
- range.selectNode(document.body);
- text = range.createContextualFragment(text);
- }
- callback(text);
- });
-};
-d3.xml = function(url, mime, callback) {
- function ready(req) {
- callback(req && req.responseXML);
- }
- if (arguments.length < 3) {
- callback = mime;
- mime = null;
+const e10 = Math.sqrt(50),
+ e5 = Math.sqrt(10),
+ e2 = Math.sqrt(2);
+
+function tickSpec(start, stop, count) {
+ const step = (stop - start) / Math.max(0, count),
+ power = Math.floor(Math.log10(step)),
+ error = step / Math.pow(10, power),
+ factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;
+ let i1, i2, inc;
+ if (power < 0) {
+ inc = Math.pow(10, -power) / factor;
+ i1 = Math.round(start * inc);
+ i2 = Math.round(stop * inc);
+ if (i1 / inc < start) ++i1;
+ if (i2 / inc > stop) --i2;
+ inc = -inc;
+ } else {
+ inc = Math.pow(10, power) * factor;
+ i1 = Math.round(start / inc);
+ i2 = Math.round(stop / inc);
+ if (i1 * inc < start) ++i1;
+ if (i2 * inc > stop) --i2;
}
- d3.xhr(url, mime, ready);
-};
-var d3_nsPrefix = {
- svg: "http://www.w3.org/2000/svg",
- xhtml: "http://www.w3.org/1999/xhtml",
- xlink: "http://www.w3.org/1999/xlink",
- xml: "http://www.w3.org/XML/1998/namespace",
- xmlns: "http://www.w3.org/2000/xmlns/"
-};
+ if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);
+ return [i1, i2, inc];
+}
-d3.ns = {
- prefix: d3_nsPrefix,
- qualify: function(name) {
- var i = name.indexOf(":"),
- prefix = name;
- if (i >= 0) {
- prefix = name.substring(0, i);
- name = name.substring(i + 1);
- }
- return d3_nsPrefix.hasOwnProperty(prefix)
- ? {space: d3_nsPrefix[prefix], local: name}
- : name;
+function ticks(start, stop, count) {
+ stop = +stop, start = +start, count = +count;
+ if (!(count > 0)) return [];
+ if (start === stop) return [start];
+ const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);
+ if (!(i2 >= i1)) return [];
+ const n = i2 - i1 + 1, ticks = new Array(n);
+ if (reverse) {
+ if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;
+ else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;
+ } else {
+ if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;
+ else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;
}
+ return ticks;
+}
+
+function tickIncrement(start, stop, count) {
+ stop = +stop, start = +start, count = +count;
+ return tickSpec(start, stop, count)[2];
+}
+
+function tickStep(start, stop, count) {
+ stop = +stop, start = +start, count = +count;
+ const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);
+ return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);
+}
+
+function nice$1(start, stop, count) {
+ let prestep;
+ while (true) {
+ const step = tickIncrement(start, stop, count);
+ if (step === prestep || step === 0 || !isFinite(step)) {
+ return [start, stop];
+ } else if (step > 0) {
+ start = Math.floor(start / step) * step;
+ stop = Math.ceil(stop / step) * step;
+ } else if (step < 0) {
+ start = Math.ceil(start * step) / step;
+ stop = Math.floor(stop * step) / step;
+ }
+ prestep = step;
+ }
+}
+
+function thresholdSturges(values) {
+ return Math.max(1, Math.ceil(Math.log(count$1(values)) / Math.LN2) + 1);
+}
+
+function bin() {
+ var value = identity$9,
+ domain = extent$1,
+ threshold = thresholdSturges;
+
+ function histogram(data) {
+ if (!Array.isArray(data)) data = Array.from(data);
+
+ var i,
+ n = data.length,
+ x,
+ step,
+ values = new Array(n);
+
+ for (i = 0; i < n; ++i) {
+ values[i] = value(data[i], i, data);
+ }
+
+ var xz = domain(values),
+ x0 = xz[0],
+ x1 = xz[1],
+ tz = threshold(values, x0, x1);
+
+ // Convert number of thresholds into uniform thresholds, and nice the
+ // default domain accordingly.
+ if (!Array.isArray(tz)) {
+ const max = x1, tn = +tz;
+ if (domain === extent$1) [x0, x1] = nice$1(x0, x1, tn);
+ tz = ticks(x0, x1, tn);
+
+ // If the domain is aligned with the first tick (which it will by
+ // default), then we can use quantization rather than bisection to bin
+ // values, which is substantially faster.
+ if (tz[0] <= x0) step = tickIncrement(x0, x1, tn);
+
+ // If the last threshold is coincident with the domain’s upper bound, the
+ // last bin will be zero-width. If the default domain is used, and this
+ // last threshold is coincident with the maximum input value, we can
+ // extend the niced upper bound by one tick to ensure uniform bin widths;
+ // otherwise, we simply remove the last threshold. Note that we don’t
+ // coerce values or the domain to numbers, and thus must be careful to
+ // compare order (>=) rather than strict equality (===)!
+ if (tz[tz.length - 1] >= x1) {
+ if (max >= x1 && domain === extent$1) {
+ const step = tickIncrement(x0, x1, tn);
+ if (isFinite(step)) {
+ if (step > 0) {
+ x1 = (Math.floor(x1 / step) + 1) * step;
+ } else if (step < 0) {
+ x1 = (Math.ceil(x1 * -step) + 1) / -step;
+ }
+ }
+ } else {
+ tz.pop();
+ }
+ }
+ }
+
+ // Remove any thresholds outside the domain.
+ // Be careful not to mutate an array owned by the user!
+ var m = tz.length, a = 0, b = m;
+ while (tz[a] <= x0) ++a;
+ while (tz[b - 1] > x1) --b;
+ if (a || b < m) tz = tz.slice(a, b), m = b - a;
+
+ var bins = new Array(m + 1),
+ bin;
+
+ // Initialize bins.
+ for (i = 0; i <= m; ++i) {
+ bin = bins[i] = [];
+ bin.x0 = i > 0 ? tz[i - 1] : x0;
+ bin.x1 = i < m ? tz[i] : x1;
+ }
+
+ // Assign data to bins by value, ignoring any outside the domain.
+ if (isFinite(step)) {
+ if (step > 0) {
+ for (i = 0; i < n; ++i) {
+ if ((x = values[i]) != null && x0 <= x && x <= x1) {
+ bins[Math.min(m, Math.floor((x - x0) / step))].push(data[i]);
+ }
+ }
+ } else if (step < 0) {
+ for (i = 0; i < n; ++i) {
+ if ((x = values[i]) != null && x0 <= x && x <= x1) {
+ const j = Math.floor((x0 - x) * step);
+ bins[Math.min(m, j + (tz[j] <= x))].push(data[i]); // handle off-by-one due to rounding
+ }
+ }
+ }
+ } else {
+ for (i = 0; i < n; ++i) {
+ if ((x = values[i]) != null && x0 <= x && x <= x1) {
+ bins[bisect(tz, x, 0, m)].push(data[i]);
+ }
+ }
+ }
+
+ return bins;
+ }
+
+ histogram.value = function(_) {
+ return arguments.length ? (value = typeof _ === "function" ? _ : constant$b(_), histogram) : value;
+ };
+
+ histogram.domain = function(_) {
+ return arguments.length ? (domain = typeof _ === "function" ? _ : constant$b([_[0], _[1]]), histogram) : domain;
+ };
+
+ histogram.thresholds = function(_) {
+ return arguments.length ? (threshold = typeof _ === "function" ? _ : constant$b(Array.isArray(_) ? slice$3.call(_) : _), histogram) : threshold;
+ };
+
+ return histogram;
+}
+
+function max$3(values, valueof) {
+ let max;
+ if (valueof === undefined) {
+ for (const value of values) {
+ if (value != null
+ && (max < value || (max === undefined && value >= value))) {
+ max = value;
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null
+ && (max < value || (max === undefined && value >= value))) {
+ max = value;
+ }
+ }
+ }
+ return max;
+}
+
+function maxIndex(values, valueof) {
+ let max;
+ let maxIndex = -1;
+ let index = -1;
+ if (valueof === undefined) {
+ for (const value of values) {
+ ++index;
+ if (value != null
+ && (max < value || (max === undefined && value >= value))) {
+ max = value, maxIndex = index;
+ }
+ }
+ } else {
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null
+ && (max < value || (max === undefined && value >= value))) {
+ max = value, maxIndex = index;
+ }
+ }
+ }
+ return maxIndex;
+}
+
+function min$2(values, valueof) {
+ let min;
+ if (valueof === undefined) {
+ for (const value of values) {
+ if (value != null
+ && (min > value || (min === undefined && value >= value))) {
+ min = value;
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null
+ && (min > value || (min === undefined && value >= value))) {
+ min = value;
+ }
+ }
+ }
+ return min;
+}
+
+function minIndex(values, valueof) {
+ let min;
+ let minIndex = -1;
+ let index = -1;
+ if (valueof === undefined) {
+ for (const value of values) {
+ ++index;
+ if (value != null
+ && (min > value || (min === undefined && value >= value))) {
+ min = value, minIndex = index;
+ }
+ }
+ } else {
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null
+ && (min > value || (min === undefined && value >= value))) {
+ min = value, minIndex = index;
+ }
+ }
+ }
+ return minIndex;
+}
+
+// Based on https://github.com/mourner/quickselect
+// ISC license, Copyright 2018 Vladimir Agafonkin.
+function quickselect(array, k, left = 0, right = Infinity, compare) {
+ k = Math.floor(k);
+ left = Math.floor(Math.max(0, left));
+ right = Math.floor(Math.min(array.length - 1, right));
+
+ if (!(left <= k && k <= right)) return array;
+
+ compare = compare === undefined ? ascendingDefined : compareDefined(compare);
+
+ while (right > left) {
+ if (right - left > 600) {
+ const n = right - left + 1;
+ const m = k - left + 1;
+ const z = Math.log(n);
+ const s = 0.5 * Math.exp(2 * z / 3);
+ const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
+ const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
+ const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
+ quickselect(array, k, newLeft, newRight, compare);
+ }
+
+ const t = array[k];
+ let i = left;
+ let j = right;
+
+ swap$1(array, left, k);
+ if (compare(array[right], t) > 0) swap$1(array, left, right);
+
+ while (i < j) {
+ swap$1(array, i, j), ++i, --j;
+ while (compare(array[i], t) < 0) ++i;
+ while (compare(array[j], t) > 0) --j;
+ }
+
+ if (compare(array[left], t) === 0) swap$1(array, left, j);
+ else ++j, swap$1(array, j, right);
+
+ if (j <= k) left = j + 1;
+ if (k <= j) right = j - 1;
+ }
+
+ return array;
+}
+
+function swap$1(array, i, j) {
+ const t = array[i];
+ array[i] = array[j];
+ array[j] = t;
+}
+
+function greatest(values, compare = ascending$3) {
+ let max;
+ let defined = false;
+ if (compare.length === 1) {
+ let maxValue;
+ for (const element of values) {
+ const value = compare(element);
+ if (defined
+ ? ascending$3(value, maxValue) > 0
+ : ascending$3(value, value) === 0) {
+ max = element;
+ maxValue = value;
+ defined = true;
+ }
+ }
+ } else {
+ for (const value of values) {
+ if (defined
+ ? compare(value, max) > 0
+ : compare(value, value) === 0) {
+ max = value;
+ defined = true;
+ }
+ }
+ }
+ return max;
+}
+
+function quantile$1(values, p, valueof) {
+ values = Float64Array.from(numbers(values, valueof));
+ if (!(n = values.length) || isNaN(p = +p)) return;
+ if (p <= 0 || n < 2) return min$2(values);
+ if (p >= 1) return max$3(values);
+ var n,
+ i = (n - 1) * p,
+ i0 = Math.floor(i),
+ value0 = max$3(quickselect(values, i0).subarray(0, i0 + 1)),
+ value1 = min$2(values.subarray(i0 + 1));
+ return value0 + (value1 - value0) * (i - i0);
+}
+
+function quantileSorted(values, p, valueof = number$3) {
+ if (!(n = values.length) || isNaN(p = +p)) return;
+ if (p <= 0 || n < 2) return +valueof(values[0], 0, values);
+ if (p >= 1) return +valueof(values[n - 1], n - 1, values);
+ var n,
+ i = (n - 1) * p,
+ i0 = Math.floor(i),
+ value0 = +valueof(values[i0], i0, values),
+ value1 = +valueof(values[i0 + 1], i0 + 1, values);
+ return value0 + (value1 - value0) * (i - i0);
+}
+
+function quantileIndex(values, p, valueof = number$3) {
+ if (isNaN(p = +p)) return;
+ numbers = Float64Array.from(values, (_, i) => number$3(valueof(values[i], i, values)));
+ if (p <= 0) return minIndex(numbers);
+ if (p >= 1) return maxIndex(numbers);
+ var numbers,
+ index = Uint32Array.from(values, (_, i) => i),
+ j = numbers.length - 1,
+ i = Math.floor(j * p);
+ quickselect(index, i, 0, j, (i, j) => ascendingDefined(numbers[i], numbers[j]));
+ i = greatest(index.subarray(0, i + 1), (i) => numbers[i]);
+ return i >= 0 ? i : -1;
+}
+
+function thresholdFreedmanDiaconis(values, min, max) {
+ const c = count$1(values), d = quantile$1(values, 0.75) - quantile$1(values, 0.25);
+ return c && d ? Math.ceil((max - min) / (2 * d * Math.pow(c, -1 / 3))) : 1;
+}
+
+function thresholdScott(values, min, max) {
+ const c = count$1(values), d = deviation(values);
+ return c && d ? Math.ceil((max - min) * Math.cbrt(c) / (3.49 * d)) : 1;
+}
+
+function mean(values, valueof) {
+ let count = 0;
+ let sum = 0;
+ if (valueof === undefined) {
+ for (let value of values) {
+ if (value != null && (value = +value) >= value) {
+ ++count, sum += value;
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
+ ++count, sum += value;
+ }
+ }
+ }
+ if (count) return sum / count;
+}
+
+function median(values, valueof) {
+ return quantile$1(values, 0.5, valueof);
+}
+
+function medianIndex(values, valueof) {
+ return quantileIndex(values, 0.5, valueof);
+}
+
+function* flatten(arrays) {
+ for (const array of arrays) {
+ yield* array;
+ }
+}
+
+function merge(arrays) {
+ return Array.from(flatten(arrays));
+}
+
+function mode(values, valueof) {
+ const counts = new InternMap();
+ if (valueof === undefined) {
+ for (let value of values) {
+ if (value != null && value >= value) {
+ counts.set(value, (counts.get(value) || 0) + 1);
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if ((value = valueof(value, ++index, values)) != null && value >= value) {
+ counts.set(value, (counts.get(value) || 0) + 1);
+ }
+ }
+ }
+ let modeValue;
+ let modeCount = 0;
+ for (const [value, count] of counts) {
+ if (count > modeCount) {
+ modeCount = count;
+ modeValue = value;
+ }
+ }
+ return modeValue;
+}
+
+function pairs(values, pairof = pair) {
+ const pairs = [];
+ let previous;
+ let first = false;
+ for (const value of values) {
+ if (first) pairs.push(pairof(previous, value));
+ previous = value;
+ first = true;
+ }
+ return pairs;
+}
+
+function pair(a, b) {
+ return [a, b];
+}
+
+function range$2(start, stop, step) {
+ start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step;
+
+ var i = -1,
+ n = Math.max(0, Math.ceil((stop - start) / step)) | 0,
+ range = new Array(n);
+
+ while (++i < n) {
+ range[i] = start + i * step;
+ }
+
+ return range;
+}
+
+function rank(values, valueof = ascending$3) {
+ if (typeof values[Symbol.iterator] !== "function") throw new TypeError("values is not iterable");
+ let V = Array.from(values);
+ const R = new Float64Array(V.length);
+ if (valueof.length !== 2) V = V.map(valueof), valueof = ascending$3;
+ const compareIndex = (i, j) => valueof(V[i], V[j]);
+ let k, r;
+ values = Uint32Array.from(V, (_, i) => i);
+ // Risky chaining due to Safari 14 https://github.com/d3/d3-array/issues/123
+ values.sort(valueof === ascending$3 ? (i, j) => ascendingDefined(V[i], V[j]) : compareDefined(compareIndex));
+ values.forEach((j, i) => {
+ const c = compareIndex(j, k === undefined ? j : k);
+ if (c >= 0) {
+ if (k === undefined || c > 0) k = j, r = i;
+ R[j] = r;
+ } else {
+ R[j] = NaN;
+ }
+ });
+ return R;
+}
+
+function least(values, compare = ascending$3) {
+ let min;
+ let defined = false;
+ if (compare.length === 1) {
+ let minValue;
+ for (const element of values) {
+ const value = compare(element);
+ if (defined
+ ? ascending$3(value, minValue) < 0
+ : ascending$3(value, value) === 0) {
+ min = element;
+ minValue = value;
+ defined = true;
+ }
+ }
+ } else {
+ for (const value of values) {
+ if (defined
+ ? compare(value, min) < 0
+ : compare(value, value) === 0) {
+ min = value;
+ defined = true;
+ }
+ }
+ }
+ return min;
+}
+
+function leastIndex(values, compare = ascending$3) {
+ if (compare.length === 1) return minIndex(values, compare);
+ let minValue;
+ let min = -1;
+ let index = -1;
+ for (const value of values) {
+ ++index;
+ if (min < 0
+ ? compare(value, value) === 0
+ : compare(value, minValue) < 0) {
+ minValue = value;
+ min = index;
+ }
+ }
+ return min;
+}
+
+function greatestIndex(values, compare = ascending$3) {
+ if (compare.length === 1) return maxIndex(values, compare);
+ let maxValue;
+ let max = -1;
+ let index = -1;
+ for (const value of values) {
+ ++index;
+ if (max < 0
+ ? compare(value, value) === 0
+ : compare(value, maxValue) > 0) {
+ maxValue = value;
+ max = index;
+ }
+ }
+ return max;
+}
+
+function scan(values, compare) {
+ const index = leastIndex(values, compare);
+ return index < 0 ? undefined : index;
+}
+
+var shuffle$1 = shuffler(Math.random);
+
+function shuffler(random) {
+ return function shuffle(array, i0 = 0, i1 = array.length) {
+ let m = i1 - (i0 = +i0);
+ while (m) {
+ const i = random() * m-- | 0, t = array[m + i0];
+ array[m + i0] = array[i + i0];
+ array[i + i0] = t;
+ }
+ return array;
+ };
+}
+
+function sum$2(values, valueof) {
+ let sum = 0;
+ if (valueof === undefined) {
+ for (let value of values) {
+ if (value = +value) {
+ sum += value;
+ }
+ }
+ } else {
+ let index = -1;
+ for (let value of values) {
+ if (value = +valueof(value, ++index, values)) {
+ sum += value;
+ }
+ }
+ }
+ return sum;
+}
+
+function transpose(matrix) {
+ if (!(n = matrix.length)) return [];
+ for (var i = -1, m = min$2(matrix, length$2), transpose = new Array(m); ++i < m;) {
+ for (var j = -1, n, row = transpose[i] = new Array(n); ++j < n;) {
+ row[j] = matrix[j][i];
+ }
+ }
+ return transpose;
+}
+
+function length$2(d) {
+ return d.length;
+}
+
+function zip() {
+ return transpose(arguments);
+}
+
+function every(values, test) {
+ if (typeof test !== "function") throw new TypeError("test is not a function");
+ let index = -1;
+ for (const value of values) {
+ if (!test(value, ++index, values)) {
+ return false;
+ }
+ }
+ return true;
+}
+
+function some(values, test) {
+ if (typeof test !== "function") throw new TypeError("test is not a function");
+ let index = -1;
+ for (const value of values) {
+ if (test(value, ++index, values)) {
+ return true;
+ }
+ }
+ return false;
+}
+
+function filter$1(values, test) {
+ if (typeof test !== "function") throw new TypeError("test is not a function");
+ const array = [];
+ let index = -1;
+ for (const value of values) {
+ if (test(value, ++index, values)) {
+ array.push(value);
+ }
+ }
+ return array;
+}
+
+function map$1(values, mapper) {
+ if (typeof values[Symbol.iterator] !== "function") throw new TypeError("values is not iterable");
+ if (typeof mapper !== "function") throw new TypeError("mapper is not a function");
+ return Array.from(values, (value, index) => mapper(value, index, values));
+}
+
+function reduce(values, reducer, value) {
+ if (typeof reducer !== "function") throw new TypeError("reducer is not a function");
+ const iterator = values[Symbol.iterator]();
+ let done, next, index = -1;
+ if (arguments.length < 3) {
+ ({done, value} = iterator.next());
+ if (done) return;
+ ++index;
+ }
+ while (({done, value: next} = iterator.next()), !done) {
+ value = reducer(value, next, ++index, values);
+ }
+ return value;
+}
+
+function reverse$1(values) {
+ if (typeof values[Symbol.iterator] !== "function") throw new TypeError("values is not iterable");
+ return Array.from(values).reverse();
+}
+
+function difference(values, ...others) {
+ values = new InternSet(values);
+ for (const other of others) {
+ for (const value of other) {
+ values.delete(value);
+ }
+ }
+ return values;
+}
+
+function disjoint(values, other) {
+ const iterator = other[Symbol.iterator](), set = new InternSet();
+ for (const v of values) {
+ if (set.has(v)) return false;
+ let value, done;
+ while (({value, done} = iterator.next())) {
+ if (done) break;
+ if (Object.is(v, value)) return false;
+ set.add(value);
+ }
+ }
+ return true;
+}
+
+function intersection(values, ...others) {
+ values = new InternSet(values);
+ others = others.map(set$2);
+ out: for (const value of values) {
+ for (const other of others) {
+ if (!other.has(value)) {
+ values.delete(value);
+ continue out;
+ }
+ }
+ }
+ return values;
+}
+
+function set$2(values) {
+ return values instanceof InternSet ? values : new InternSet(values);
+}
+
+function superset(values, other) {
+ const iterator = values[Symbol.iterator](), set = new Set();
+ for (const o of other) {
+ const io = intern(o);
+ if (set.has(io)) continue;
+ let value, done;
+ while (({value, done} = iterator.next())) {
+ if (done) return false;
+ const ivalue = intern(value);
+ set.add(ivalue);
+ if (Object.is(io, ivalue)) break;
+ }
+ }
+ return true;
+}
+
+function intern(value) {
+ return value !== null && typeof value === "object" ? value.valueOf() : value;
+}
+
+function subset(values, other) {
+ return superset(other, values);
+}
+
+function union(...others) {
+ const set = new InternSet();
+ for (const other of others) {
+ for (const o of other) {
+ set.add(o);
+ }
+ }
+ return set;
+}
+
+function identity$8(x) {
+ return x;
+}
+
+var top = 1,
+ right = 2,
+ bottom = 3,
+ left = 4,
+ epsilon$6 = 1e-6;
+
+function translateX(x) {
+ return "translate(" + x + ",0)";
+}
+
+function translateY(y) {
+ return "translate(0," + y + ")";
+}
+
+function number$2(scale) {
+ return d => +scale(d);
+}
+
+function center$1(scale, offset) {
+ offset = Math.max(0, scale.bandwidth() - offset * 2) / 2;
+ if (scale.round()) offset = Math.round(offset);
+ return d => +scale(d) + offset;
+}
+
+function entering() {
+ return !this.__axis;
+}
+
+function axis(orient, scale) {
+ var tickArguments = [],
+ tickValues = null,
+ tickFormat = null,
+ tickSizeInner = 6,
+ tickSizeOuter = 6,
+ tickPadding = 3,
+ offset = typeof window !== "undefined" && window.devicePixelRatio > 1 ? 0 : 0.5,
+ k = orient === top || orient === left ? -1 : 1,
+ x = orient === left || orient === right ? "x" : "y",
+ transform = orient === top || orient === bottom ? translateX : translateY;
+
+ function axis(context) {
+ var values = tickValues == null ? (scale.ticks ? scale.ticks.apply(scale, tickArguments) : scale.domain()) : tickValues,
+ format = tickFormat == null ? (scale.tickFormat ? scale.tickFormat.apply(scale, tickArguments) : identity$8) : tickFormat,
+ spacing = Math.max(tickSizeInner, 0) + tickPadding,
+ range = scale.range(),
+ range0 = +range[0] + offset,
+ range1 = +range[range.length - 1] + offset,
+ position = (scale.bandwidth ? center$1 : number$2)(scale.copy(), offset),
+ selection = context.selection ? context.selection() : context,
+ path = selection.selectAll(".domain").data([null]),
+ tick = selection.selectAll(".tick").data(values, scale).order(),
+ tickExit = tick.exit(),
+ tickEnter = tick.enter().append("g").attr("class", "tick"),
+ line = tick.select("line"),
+ text = tick.select("text");
+
+ path = path.merge(path.enter().insert("path", ".tick")
+ .attr("class", "domain")
+ .attr("stroke", "currentColor"));
+
+ tick = tick.merge(tickEnter);
+
+ line = line.merge(tickEnter.append("line")
+ .attr("stroke", "currentColor")
+ .attr(x + "2", k * tickSizeInner));
+
+ text = text.merge(tickEnter.append("text")
+ .attr("fill", "currentColor")
+ .attr(x, k * spacing)
+ .attr("dy", orient === top ? "0em" : orient === bottom ? "0.71em" : "0.32em"));
+
+ if (context !== selection) {
+ path = path.transition(context);
+ tick = tick.transition(context);
+ line = line.transition(context);
+ text = text.transition(context);
+
+ tickExit = tickExit.transition(context)
+ .attr("opacity", epsilon$6)
+ .attr("transform", function(d) { return isFinite(d = position(d)) ? transform(d + offset) : this.getAttribute("transform"); });
+
+ tickEnter
+ .attr("opacity", epsilon$6)
+ .attr("transform", function(d) { var p = this.parentNode.__axis; return transform((p && isFinite(p = p(d)) ? p : position(d)) + offset); });
+ }
+
+ tickExit.remove();
+
+ path
+ .attr("d", orient === left || orient === right
+ ? (tickSizeOuter ? "M" + k * tickSizeOuter + "," + range0 + "H" + offset + "V" + range1 + "H" + k * tickSizeOuter : "M" + offset + "," + range0 + "V" + range1)
+ : (tickSizeOuter ? "M" + range0 + "," + k * tickSizeOuter + "V" + offset + "H" + range1 + "V" + k * tickSizeOuter : "M" + range0 + "," + offset + "H" + range1));
+
+ tick
+ .attr("opacity", 1)
+ .attr("transform", function(d) { return transform(position(d) + offset); });
+
+ line
+ .attr(x + "2", k * tickSizeInner);
+
+ text
+ .attr(x, k * spacing)
+ .text(format);
+
+ selection.filter(entering)
+ .attr("fill", "none")
+ .attr("font-size", 10)
+ .attr("font-family", "sans-serif")
+ .attr("text-anchor", orient === right ? "start" : orient === left ? "end" : "middle");
+
+ selection
+ .each(function() { this.__axis = position; });
+ }
+
+ axis.scale = function(_) {
+ return arguments.length ? (scale = _, axis) : scale;
+ };
+
+ axis.ticks = function() {
+ return tickArguments = Array.from(arguments), axis;
+ };
+
+ axis.tickArguments = function(_) {
+ return arguments.length ? (tickArguments = _ == null ? [] : Array.from(_), axis) : tickArguments.slice();
+ };
+
+ axis.tickValues = function(_) {
+ return arguments.length ? (tickValues = _ == null ? null : Array.from(_), axis) : tickValues && tickValues.slice();
+ };
+
+ axis.tickFormat = function(_) {
+ return arguments.length ? (tickFormat = _, axis) : tickFormat;
+ };
+
+ axis.tickSize = function(_) {
+ return arguments.length ? (tickSizeInner = tickSizeOuter = +_, axis) : tickSizeInner;
+ };
+
+ axis.tickSizeInner = function(_) {
+ return arguments.length ? (tickSizeInner = +_, axis) : tickSizeInner;
+ };
+
+ axis.tickSizeOuter = function(_) {
+ return arguments.length ? (tickSizeOuter = +_, axis) : tickSizeOuter;
+ };
+
+ axis.tickPadding = function(_) {
+ return arguments.length ? (tickPadding = +_, axis) : tickPadding;
+ };
+
+ axis.offset = function(_) {
+ return arguments.length ? (offset = +_, axis) : offset;
+ };
+
+ return axis;
+}
+
+function axisTop(scale) {
+ return axis(top, scale);
+}
+
+function axisRight(scale) {
+ return axis(right, scale);
+}
+
+function axisBottom(scale) {
+ return axis(bottom, scale);
+}
+
+function axisLeft(scale) {
+ return axis(left, scale);
+}
+
+var noop$3 = {value: () => {}};
+
+function dispatch() {
+ for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {
+ if (!(t = arguments[i] + "") || (t in _) || /[\s.]/.test(t)) throw new Error("illegal type: " + t);
+ _[t] = [];
+ }
+ return new Dispatch(_);
+}
+
+function Dispatch(_) {
+ this._ = _;
+}
+
+function parseTypenames$1(typenames, types) {
+ return typenames.trim().split(/^|\s+/).map(function(t) {
+ var name = "", i = t.indexOf(".");
+ if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);
+ if (t && !types.hasOwnProperty(t)) throw new Error("unknown type: " + t);
+ return {type: t, name: name};
+ });
+}
+
+Dispatch.prototype = dispatch.prototype = {
+ constructor: Dispatch,
+ on: function(typename, callback) {
+ var _ = this._,
+ T = parseTypenames$1(typename + "", _),
+ t,
+ i = -1,
+ n = T.length;
+
+ // If no callback was specified, return the callback of the given type and name.
+ if (arguments.length < 2) {
+ while (++i < n) if ((t = (typename = T[i]).type) && (t = get$1(_[t], typename.name))) return t;
+ return;
+ }
+
+ // If a type was specified, set the callback for the given type and name.
+ // Otherwise, if a null callback was specified, remove callbacks of the given name.
+ if (callback != null && typeof callback !== "function") throw new Error("invalid callback: " + callback);
+ while (++i < n) {
+ if (t = (typename = T[i]).type) _[t] = set$1(_[t], typename.name, callback);
+ else if (callback == null) for (t in _) _[t] = set$1(_[t], typename.name, null);
+ }
+
+ return this;
+ },
+ copy: function() {
+ var copy = {}, _ = this._;
+ for (var t in _) copy[t] = _[t].slice();
+ return new Dispatch(copy);
+ },
+ call: function(type, that) {
+ if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];
+ if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
+ for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
+ },
+ apply: function(type, that, args) {
+ if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
+ for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
+ }
+};
+
+function get$1(type, name) {
+ for (var i = 0, n = type.length, c; i < n; ++i) {
+ if ((c = type[i]).name === name) {
+ return c.value;
+ }
+ }
+}
+
+function set$1(type, name, callback) {
+ for (var i = 0, n = type.length; i < n; ++i) {
+ if (type[i].name === name) {
+ type[i] = noop$3, type = type.slice(0, i).concat(type.slice(i + 1));
+ break;
+ }
+ }
+ if (callback != null) type.push({name: name, value: callback});
+ return type;
+}
+
+var xhtml = "http://www.w3.org/1999/xhtml";
+
+var namespaces = {
+ svg: "http://www.w3.org/2000/svg",
+ xhtml: xhtml,
+ xlink: "http://www.w3.org/1999/xlink",
+ xml: "http://www.w3.org/XML/1998/namespace",
+ xmlns: "http://www.w3.org/2000/xmlns/"
+};
+
+function namespace(name) {
+ var prefix = name += "", i = prefix.indexOf(":");
+ if (i >= 0 && (prefix = name.slice(0, i)) !== "xmlns") name = name.slice(i + 1);
+ return namespaces.hasOwnProperty(prefix) ? {space: namespaces[prefix], local: name} : name; // eslint-disable-line no-prototype-builtins
+}
+
+function creatorInherit(name) {
+ return function() {
+ var document = this.ownerDocument,
+ uri = this.namespaceURI;
+ return uri === xhtml && document.documentElement.namespaceURI === xhtml
+ ? document.createElement(name)
+ : document.createElementNS(uri, name);
+ };
+}
+
+function creatorFixed(fullname) {
+ return function() {
+ return this.ownerDocument.createElementNS(fullname.space, fullname.local);
+ };
+}
+
+function creator(name) {
+ var fullname = namespace(name);
+ return (fullname.local
+ ? creatorFixed
+ : creatorInherit)(fullname);
+}
+
+function none$2() {}
+
+function selector(selector) {
+ return selector == null ? none$2 : function() {
+ return this.querySelector(selector);
+ };
+}
+
+function selection_select(select) {
+ if (typeof select !== "function") select = selector(select);
+
+ for (var groups = this._groups, m = groups.length, subgroups = new Array(m), j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, subgroup = subgroups[j] = new Array(n), node, subnode, i = 0; i < n; ++i) {
+ if ((node = group[i]) && (subnode = select.call(node, node.__data__, i, group))) {
+ if ("__data__" in node) subnode.__data__ = node.__data__;
+ subgroup[i] = subnode;
+ }
+ }
+ }
+
+ return new Selection$1(subgroups, this._parents);
+}
+
+// Given something array like (or null), returns something that is strictly an
+// array. This is used to ensure that array-like objects passed to d3.selectAll
+// or selection.selectAll are converted into proper arrays when creating a
+// selection; we don’t ever want to create a selection backed by a live
+// HTMLCollection or NodeList. However, note that selection.selectAll will use a
+// static NodeList as a group, since it safely derived from querySelectorAll.
+function array$4(x) {
+ return x == null ? [] : Array.isArray(x) ? x : Array.from(x);
+}
+
+function empty$1() {
+ return [];
+}
+
+function selectorAll(selector) {
+ return selector == null ? empty$1 : function() {
+ return this.querySelectorAll(selector);
+ };
+}
+
+function arrayAll(select) {
+ return function() {
+ return array$4(select.apply(this, arguments));
+ };
+}
+
+function selection_selectAll(select) {
+ if (typeof select === "function") select = arrayAll(select);
+ else select = selectorAll(select);
+
+ for (var groups = this._groups, m = groups.length, subgroups = [], parents = [], j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, node, i = 0; i < n; ++i) {
+ if (node = group[i]) {
+ subgroups.push(select.call(node, node.__data__, i, group));
+ parents.push(node);
+ }
+ }
+ }
+
+ return new Selection$1(subgroups, parents);
+}
+
+function matcher(selector) {
+ return function() {
+ return this.matches(selector);
+ };
+}
+
+function childMatcher(selector) {
+ return function(node) {
+ return node.matches(selector);
+ };
+}
+
+var find$1 = Array.prototype.find;
+
+function childFind(match) {
+ return function() {
+ return find$1.call(this.children, match);
+ };
+}
+
+function childFirst() {
+ return this.firstElementChild;
+}
+
+function selection_selectChild(match) {
+ return this.select(match == null ? childFirst
+ : childFind(typeof match === "function" ? match : childMatcher(match)));
+}
+
+var filter = Array.prototype.filter;
+
+function children() {
+ return Array.from(this.children);
+}
+
+function childrenFilter(match) {
+ return function() {
+ return filter.call(this.children, match);
+ };
+}
+
+function selection_selectChildren(match) {
+ return this.selectAll(match == null ? children
+ : childrenFilter(typeof match === "function" ? match : childMatcher(match)));
+}
+
+function selection_filter(match) {
+ if (typeof match !== "function") match = matcher(match);
+
+ for (var groups = this._groups, m = groups.length, subgroups = new Array(m), j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, subgroup = subgroups[j] = [], node, i = 0; i < n; ++i) {
+ if ((node = group[i]) && match.call(node, node.__data__, i, group)) {
+ subgroup.push(node);
+ }
+ }
+ }
+
+ return new Selection$1(subgroups, this._parents);
+}
+
+function sparse(update) {
+ return new Array(update.length);
+}
+
+function selection_enter() {
+ return new Selection$1(this._enter || this._groups.map(sparse), this._parents);
+}
+
+function EnterNode(parent, datum) {
+ this.ownerDocument = parent.ownerDocument;
+ this.namespaceURI = parent.namespaceURI;
+ this._next = null;
+ this._parent = parent;
+ this.__data__ = datum;
+}
+
+EnterNode.prototype = {
+ constructor: EnterNode,
+ appendChild: function(child) { return this._parent.insertBefore(child, this._next); },
+ insertBefore: function(child, next) { return this._parent.insertBefore(child, next); },
+ querySelector: function(selector) { return this._parent.querySelector(selector); },
+ querySelectorAll: function(selector) { return this._parent.querySelectorAll(selector); }
+};
+
+function constant$a(x) {
+ return function() {
+ return x;
+ };
+}
+
+function bindIndex(parent, group, enter, update, exit, data) {
+ var i = 0,
+ node,
+ groupLength = group.length,
+ dataLength = data.length;
+
+ // Put any non-null nodes that fit into update.
+ // Put any null nodes into enter.
+ // Put any remaining data into enter.
+ for (; i < dataLength; ++i) {
+ if (node = group[i]) {
+ node.__data__ = data[i];
+ update[i] = node;
+ } else {
+ enter[i] = new EnterNode(parent, data[i]);
+ }
+ }
+
+ // Put any non-null nodes that don’t fit into exit.
+ for (; i < groupLength; ++i) {
+ if (node = group[i]) {
+ exit[i] = node;
+ }
+ }
+}
+
+function bindKey(parent, group, enter, update, exit, data, key) {
+ var i,
+ node,
+ nodeByKeyValue = new Map,
+ groupLength = group.length,
+ dataLength = data.length,
+ keyValues = new Array(groupLength),
+ keyValue;
+
+ // Compute the key for each node.
+ // If multiple nodes have the same key, the duplicates are added to exit.
+ for (i = 0; i < groupLength; ++i) {
+ if (node = group[i]) {
+ keyValues[i] = keyValue = key.call(node, node.__data__, i, group) + "";
+ if (nodeByKeyValue.has(keyValue)) {
+ exit[i] = node;
+ } else {
+ nodeByKeyValue.set(keyValue, node);
+ }
+ }
+ }
+
+ // Compute the key for each datum.
+ // If there a node associated with this key, join and add it to update.
+ // If there is not (or the key is a duplicate), add it to enter.
+ for (i = 0; i < dataLength; ++i) {
+ keyValue = key.call(parent, data[i], i, data) + "";
+ if (node = nodeByKeyValue.get(keyValue)) {
+ update[i] = node;
+ node.__data__ = data[i];
+ nodeByKeyValue.delete(keyValue);
+ } else {
+ enter[i] = new EnterNode(parent, data[i]);
+ }
+ }
+
+ // Add any remaining nodes that were not bound to data to exit.
+ for (i = 0; i < groupLength; ++i) {
+ if ((node = group[i]) && (nodeByKeyValue.get(keyValues[i]) === node)) {
+ exit[i] = node;
+ }
+ }
+}
+
+function datum(node) {
+ return node.__data__;
+}
+
+function selection_data(value, key) {
+ if (!arguments.length) return Array.from(this, datum);
+
+ var bind = key ? bindKey : bindIndex,
+ parents = this._parents,
+ groups = this._groups;
+
+ if (typeof value !== "function") value = constant$a(value);
+
+ for (var m = groups.length, update = new Array(m), enter = new Array(m), exit = new Array(m), j = 0; j < m; ++j) {
+ var parent = parents[j],
+ group = groups[j],
+ groupLength = group.length,
+ data = arraylike(value.call(parent, parent && parent.__data__, j, parents)),
+ dataLength = data.length,
+ enterGroup = enter[j] = new Array(dataLength),
+ updateGroup = update[j] = new Array(dataLength),
+ exitGroup = exit[j] = new Array(groupLength);
+
+ bind(parent, group, enterGroup, updateGroup, exitGroup, data, key);
+
+ // Now connect the enter nodes to their following update node, such that
+ // appendChild can insert the materialized enter node before this node,
+ // rather than at the end of the parent node.
+ for (var i0 = 0, i1 = 0, previous, next; i0 < dataLength; ++i0) {
+ if (previous = enterGroup[i0]) {
+ if (i0 >= i1) i1 = i0 + 1;
+ while (!(next = updateGroup[i1]) && ++i1 < dataLength);
+ previous._next = next || null;
+ }
+ }
+ }
+
+ update = new Selection$1(update, parents);
+ update._enter = enter;
+ update._exit = exit;
+ return update;
+}
+
+// Given some data, this returns an array-like view of it: an object that
+// exposes a length property and allows numeric indexing. Note that unlike
+// selectAll, this isn’t worried about “live” collections because the resulting
+// array will only be used briefly while data is being bound. (It is possible to
+// cause the data to change while iterating by using a key function, but please
+// don’t; we’d rather avoid a gratuitous copy.)
+function arraylike(data) {
+ return typeof data === "object" && "length" in data
+ ? data // Array, TypedArray, NodeList, array-like
+ : Array.from(data); // Map, Set, iterable, string, or anything else
+}
+
+function selection_exit() {
+ return new Selection$1(this._exit || this._groups.map(sparse), this._parents);
+}
+
+function selection_join(onenter, onupdate, onexit) {
+ var enter = this.enter(), update = this, exit = this.exit();
+ if (typeof onenter === "function") {
+ enter = onenter(enter);
+ if (enter) enter = enter.selection();
+ } else {
+ enter = enter.append(onenter + "");
+ }
+ if (onupdate != null) {
+ update = onupdate(update);
+ if (update) update = update.selection();
+ }
+ if (onexit == null) exit.remove(); else onexit(exit);
+ return enter && update ? enter.merge(update).order() : update;
+}
+
+function selection_merge(context) {
+ var selection = context.selection ? context.selection() : context;
+
+ for (var groups0 = this._groups, groups1 = selection._groups, m0 = groups0.length, m1 = groups1.length, m = Math.min(m0, m1), merges = new Array(m0), j = 0; j < m; ++j) {
+ for (var group0 = groups0[j], group1 = groups1[j], n = group0.length, merge = merges[j] = new Array(n), node, i = 0; i < n; ++i) {
+ if (node = group0[i] || group1[i]) {
+ merge[i] = node;
+ }
+ }
+ }
+
+ for (; j < m0; ++j) {
+ merges[j] = groups0[j];
+ }
+
+ return new Selection$1(merges, this._parents);
+}
+
+function selection_order() {
+
+ for (var groups = this._groups, j = -1, m = groups.length; ++j < m;) {
+ for (var group = groups[j], i = group.length - 1, next = group[i], node; --i >= 0;) {
+ if (node = group[i]) {
+ if (next && node.compareDocumentPosition(next) ^ 4) next.parentNode.insertBefore(node, next);
+ next = node;
+ }
+ }
+ }
+
+ return this;
+}
+
+function selection_sort(compare) {
+ if (!compare) compare = ascending$2;
+
+ function compareNode(a, b) {
+ return a && b ? compare(a.__data__, b.__data__) : !a - !b;
+ }
+
+ for (var groups = this._groups, m = groups.length, sortgroups = new Array(m), j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, sortgroup = sortgroups[j] = new Array(n), node, i = 0; i < n; ++i) {
+ if (node = group[i]) {
+ sortgroup[i] = node;
+ }
+ }
+ sortgroup.sort(compareNode);
+ }
+
+ return new Selection$1(sortgroups, this._parents).order();
+}
+
+function ascending$2(a, b) {
+ return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
+}
+
+function selection_call() {
+ var callback = arguments[0];
+ arguments[0] = this;
+ callback.apply(null, arguments);
+ return this;
+}
+
+function selection_nodes() {
+ return Array.from(this);
+}
+
+function selection_node() {
+
+ for (var groups = this._groups, j = 0, m = groups.length; j < m; ++j) {
+ for (var group = groups[j], i = 0, n = group.length; i < n; ++i) {
+ var node = group[i];
+ if (node) return node;
+ }
+ }
+
+ return null;
+}
+
+function selection_size() {
+ let size = 0;
+ for (const node of this) ++size; // eslint-disable-line no-unused-vars
+ return size;
+}
+
+function selection_empty() {
+ return !this.node();
+}
+
+function selection_each(callback) {
+
+ for (var groups = this._groups, j = 0, m = groups.length; j < m; ++j) {
+ for (var group = groups[j], i = 0, n = group.length, node; i < n; ++i) {
+ if (node = group[i]) callback.call(node, node.__data__, i, group);
+ }
+ }
+
+ return this;
+}
+
+function attrRemove$1(name) {
+ return function() {
+ this.removeAttribute(name);
+ };
+}
+
+function attrRemoveNS$1(fullname) {
+ return function() {
+ this.removeAttributeNS(fullname.space, fullname.local);
+ };
+}
+
+function attrConstant$1(name, value) {
+ return function() {
+ this.setAttribute(name, value);
+ };
+}
+
+function attrConstantNS$1(fullname, value) {
+ return function() {
+ this.setAttributeNS(fullname.space, fullname.local, value);
+ };
+}
+
+function attrFunction$1(name, value) {
+ return function() {
+ var v = value.apply(this, arguments);
+ if (v == null) this.removeAttribute(name);
+ else this.setAttribute(name, v);
+ };
+}
+
+function attrFunctionNS$1(fullname, value) {
+ return function() {
+ var v = value.apply(this, arguments);
+ if (v == null) this.removeAttributeNS(fullname.space, fullname.local);
+ else this.setAttributeNS(fullname.space, fullname.local, v);
+ };
+}
+
+function selection_attr(name, value) {
+ var fullname = namespace(name);
+
+ if (arguments.length < 2) {
+ var node = this.node();
+ return fullname.local
+ ? node.getAttributeNS(fullname.space, fullname.local)
+ : node.getAttribute(fullname);
+ }
+
+ return this.each((value == null
+ ? (fullname.local ? attrRemoveNS$1 : attrRemove$1) : (typeof value === "function"
+ ? (fullname.local ? attrFunctionNS$1 : attrFunction$1)
+ : (fullname.local ? attrConstantNS$1 : attrConstant$1)))(fullname, value));
+}
+
+function defaultView(node) {
+ return (node.ownerDocument && node.ownerDocument.defaultView) // node is a Node
+ || (node.document && node) // node is a Window
+ || node.defaultView; // node is a Document
+}
+
+function styleRemove$1(name) {
+ return function() {
+ this.style.removeProperty(name);
+ };
+}
+
+function styleConstant$1(name, value, priority) {
+ return function() {
+ this.style.setProperty(name, value, priority);
+ };
+}
+
+function styleFunction$1(name, value, priority) {
+ return function() {
+ var v = value.apply(this, arguments);
+ if (v == null) this.style.removeProperty(name);
+ else this.style.setProperty(name, v, priority);
+ };
+}
+
+function selection_style(name, value, priority) {
+ return arguments.length > 1
+ ? this.each((value == null
+ ? styleRemove$1 : typeof value === "function"
+ ? styleFunction$1
+ : styleConstant$1)(name, value, priority == null ? "" : priority))
+ : styleValue(this.node(), name);
+}
+
+function styleValue(node, name) {
+ return node.style.getPropertyValue(name)
+ || defaultView(node).getComputedStyle(node, null).getPropertyValue(name);
+}
+
+function propertyRemove(name) {
+ return function() {
+ delete this[name];
+ };
+}
+
+function propertyConstant(name, value) {
+ return function() {
+ this[name] = value;
+ };
+}
+
+function propertyFunction(name, value) {
+ return function() {
+ var v = value.apply(this, arguments);
+ if (v == null) delete this[name];
+ else this[name] = v;
+ };
+}
+
+function selection_property(name, value) {
+ return arguments.length > 1
+ ? this.each((value == null
+ ? propertyRemove : typeof value === "function"
+ ? propertyFunction
+ : propertyConstant)(name, value))
+ : this.node()[name];
+}
+
+function classArray(string) {
+ return string.trim().split(/^|\s+/);
+}
+
+function classList(node) {
+ return node.classList || new ClassList(node);
+}
+
+function ClassList(node) {
+ this._node = node;
+ this._names = classArray(node.getAttribute("class") || "");
+}
+
+ClassList.prototype = {
+ add: function(name) {
+ var i = this._names.indexOf(name);
+ if (i < 0) {
+ this._names.push(name);
+ this._node.setAttribute("class", this._names.join(" "));
+ }
+ },
+ remove: function(name) {
+ var i = this._names.indexOf(name);
+ if (i >= 0) {
+ this._names.splice(i, 1);
+ this._node.setAttribute("class", this._names.join(" "));
+ }
+ },
+ contains: function(name) {
+ return this._names.indexOf(name) >= 0;
+ }
+};
+
+function classedAdd(node, names) {
+ var list = classList(node), i = -1, n = names.length;
+ while (++i < n) list.add(names[i]);
+}
+
+function classedRemove(node, names) {
+ var list = classList(node), i = -1, n = names.length;
+ while (++i < n) list.remove(names[i]);
+}
+
+function classedTrue(names) {
+ return function() {
+ classedAdd(this, names);
+ };
+}
+
+function classedFalse(names) {
+ return function() {
+ classedRemove(this, names);
+ };
+}
+
+function classedFunction(names, value) {
+ return function() {
+ (value.apply(this, arguments) ? classedAdd : classedRemove)(this, names);
+ };
+}
+
+function selection_classed(name, value) {
+ var names = classArray(name + "");
+
+ if (arguments.length < 2) {
+ var list = classList(this.node()), i = -1, n = names.length;
+ while (++i < n) if (!list.contains(names[i])) return false;
+ return true;
+ }
+
+ return this.each((typeof value === "function"
+ ? classedFunction : value
+ ? classedTrue
+ : classedFalse)(names, value));
+}
+
+function textRemove() {
+ this.textContent = "";
+}
+
+function textConstant$1(value) {
+ return function() {
+ this.textContent = value;
+ };
+}
+
+function textFunction$1(value) {
+ return function() {
+ var v = value.apply(this, arguments);
+ this.textContent = v == null ? "" : v;
+ };
+}
+
+function selection_text(value) {
+ return arguments.length
+ ? this.each(value == null
+ ? textRemove : (typeof value === "function"
+ ? textFunction$1
+ : textConstant$1)(value))
+ : this.node().textContent;
+}
+
+function htmlRemove() {
+ this.innerHTML = "";
+}
+
+function htmlConstant(value) {
+ return function() {
+ this.innerHTML = value;
+ };
+}
+
+function htmlFunction(value) {
+ return function() {
+ var v = value.apply(this, arguments);
+ this.innerHTML = v == null ? "" : v;
+ };
+}
+
+function selection_html(value) {
+ return arguments.length
+ ? this.each(value == null
+ ? htmlRemove : (typeof value === "function"
+ ? htmlFunction
+ : htmlConstant)(value))
+ : this.node().innerHTML;
+}
+
+function raise() {
+ if (this.nextSibling) this.parentNode.appendChild(this);
+}
+
+function selection_raise() {
+ return this.each(raise);
+}
+
+function lower() {
+ if (this.previousSibling) this.parentNode.insertBefore(this, this.parentNode.firstChild);
+}
+
+function selection_lower() {
+ return this.each(lower);
+}
+
+function selection_append(name) {
+ var create = typeof name === "function" ? name : creator(name);
+ return this.select(function() {
+ return this.appendChild(create.apply(this, arguments));
+ });
+}
+
+function constantNull() {
+ return null;
+}
+
+function selection_insert(name, before) {
+ var create = typeof name === "function" ? name : creator(name),
+ select = before == null ? constantNull : typeof before === "function" ? before : selector(before);
+ return this.select(function() {
+ return this.insertBefore(create.apply(this, arguments), select.apply(this, arguments) || null);
+ });
+}
+
+function remove() {
+ var parent = this.parentNode;
+ if (parent) parent.removeChild(this);
+}
+
+function selection_remove() {
+ return this.each(remove);
+}
+
+function selection_cloneShallow() {
+ var clone = this.cloneNode(false), parent = this.parentNode;
+ return parent ? parent.insertBefore(clone, this.nextSibling) : clone;
+}
+
+function selection_cloneDeep() {
+ var clone = this.cloneNode(true), parent = this.parentNode;
+ return parent ? parent.insertBefore(clone, this.nextSibling) : clone;
+}
+
+function selection_clone(deep) {
+ return this.select(deep ? selection_cloneDeep : selection_cloneShallow);
+}
+
+function selection_datum(value) {
+ return arguments.length
+ ? this.property("__data__", value)
+ : this.node().__data__;
+}
+
+function contextListener(listener) {
+ return function(event) {
+ listener.call(this, event, this.__data__);
+ };
+}
+
+function parseTypenames(typenames) {
+ return typenames.trim().split(/^|\s+/).map(function(t) {
+ var name = "", i = t.indexOf(".");
+ if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);
+ return {type: t, name: name};
+ });
+}
+
+function onRemove(typename) {
+ return function() {
+ var on = this.__on;
+ if (!on) return;
+ for (var j = 0, i = -1, m = on.length, o; j < m; ++j) {
+ if (o = on[j], (!typename.type || o.type === typename.type) && o.name === typename.name) {
+ this.removeEventListener(o.type, o.listener, o.options);
+ } else {
+ on[++i] = o;
+ }
+ }
+ if (++i) on.length = i;
+ else delete this.__on;
+ };
+}
+
+function onAdd(typename, value, options) {
+ return function() {
+ var on = this.__on, o, listener = contextListener(value);
+ if (on) for (var j = 0, m = on.length; j < m; ++j) {
+ if ((o = on[j]).type === typename.type && o.name === typename.name) {
+ this.removeEventListener(o.type, o.listener, o.options);
+ this.addEventListener(o.type, o.listener = listener, o.options = options);
+ o.value = value;
+ return;
+ }
+ }
+ this.addEventListener(typename.type, listener, options);
+ o = {type: typename.type, name: typename.name, value: value, listener: listener, options: options};
+ if (!on) this.__on = [o];
+ else on.push(o);
+ };
+}
+
+function selection_on(typename, value, options) {
+ var typenames = parseTypenames(typename + ""), i, n = typenames.length, t;
+
+ if (arguments.length < 2) {
+ var on = this.node().__on;
+ if (on) for (var j = 0, m = on.length, o; j < m; ++j) {
+ for (i = 0, o = on[j]; i < n; ++i) {
+ if ((t = typenames[i]).type === o.type && t.name === o.name) {
+ return o.value;
+ }
+ }
+ }
+ return;
+ }
+
+ on = value ? onAdd : onRemove;
+ for (i = 0; i < n; ++i) this.each(on(typenames[i], value, options));
+ return this;
+}
+
+function dispatchEvent(node, type, params) {
+ var window = defaultView(node),
+ event = window.CustomEvent;
+
+ if (typeof event === "function") {
+ event = new event(type, params);
+ } else {
+ event = window.document.createEvent("Event");
+ if (params) event.initEvent(type, params.bubbles, params.cancelable), event.detail = params.detail;
+ else event.initEvent(type, false, false);
+ }
+
+ node.dispatchEvent(event);
+}
+
+function dispatchConstant(type, params) {
+ return function() {
+ return dispatchEvent(this, type, params);
+ };
+}
+
+function dispatchFunction(type, params) {
+ return function() {
+ return dispatchEvent(this, type, params.apply(this, arguments));
+ };
+}
+
+function selection_dispatch(type, params) {
+ return this.each((typeof params === "function"
+ ? dispatchFunction
+ : dispatchConstant)(type, params));
+}
+
+function* selection_iterator() {
+ for (var groups = this._groups, j = 0, m = groups.length; j < m; ++j) {
+ for (var group = groups[j], i = 0, n = group.length, node; i < n; ++i) {
+ if (node = group[i]) yield node;
+ }
+ }
+}
+
+var root$1 = [null];
+
+function Selection$1(groups, parents) {
+ this._groups = groups;
+ this._parents = parents;
+}
+
+function selection() {
+ return new Selection$1([[document.documentElement]], root$1);
+}
+
+function selection_selection() {
+ return this;
+}
+
+Selection$1.prototype = selection.prototype = {
+ constructor: Selection$1,
+ select: selection_select,
+ selectAll: selection_selectAll,
+ selectChild: selection_selectChild,
+ selectChildren: selection_selectChildren,
+ filter: selection_filter,
+ data: selection_data,
+ enter: selection_enter,
+ exit: selection_exit,
+ join: selection_join,
+ merge: selection_merge,
+ selection: selection_selection,
+ order: selection_order,
+ sort: selection_sort,
+ call: selection_call,
+ nodes: selection_nodes,
+ node: selection_node,
+ size: selection_size,
+ empty: selection_empty,
+ each: selection_each,
+ attr: selection_attr,
+ style: selection_style,
+ property: selection_property,
+ classed: selection_classed,
+ text: selection_text,
+ html: selection_html,
+ raise: selection_raise,
+ lower: selection_lower,
+ append: selection_append,
+ insert: selection_insert,
+ remove: selection_remove,
+ clone: selection_clone,
+ datum: selection_datum,
+ on: selection_on,
+ dispatch: selection_dispatch,
+ [Symbol.iterator]: selection_iterator
+};
+
+function select(selector) {
+ return typeof selector === "string"
+ ? new Selection$1([[document.querySelector(selector)]], [document.documentElement])
+ : new Selection$1([[selector]], root$1);
+}
+
+function create$1(name) {
+ return select(creator(name).call(document.documentElement));
+}
+
+var nextId = 0;
+
+function local$1() {
+ return new Local;
+}
+
+function Local() {
+ this._ = "@" + (++nextId).toString(36);
+}
+
+Local.prototype = local$1.prototype = {
+ constructor: Local,
+ get: function(node) {
+ var id = this._;
+ while (!(id in node)) if (!(node = node.parentNode)) return;
+ return node[id];
+ },
+ set: function(node, value) {
+ return node[this._] = value;
+ },
+ remove: function(node) {
+ return this._ in node && delete node[this._];
+ },
+ toString: function() {
+ return this._;
+ }
+};
+
+function sourceEvent(event) {
+ let sourceEvent;
+ while (sourceEvent = event.sourceEvent) event = sourceEvent;
+ return event;
+}
+
+function pointer(event, node) {
+ event = sourceEvent(event);
+ if (node === undefined) node = event.currentTarget;
+ if (node) {
+ var svg = node.ownerSVGElement || node;
+ if (svg.createSVGPoint) {
+ var point = svg.createSVGPoint();
+ point.x = event.clientX, point.y = event.clientY;
+ point = point.matrixTransform(node.getScreenCTM().inverse());
+ return [point.x, point.y];
+ }
+ if (node.getBoundingClientRect) {
+ var rect = node.getBoundingClientRect();
+ return [event.clientX - rect.left - node.clientLeft, event.clientY - rect.top - node.clientTop];
+ }
+ }
+ return [event.pageX, event.pageY];
+}
+
+function pointers(events, node) {
+ if (events.target) { // i.e., instanceof Event, not TouchList or iterable
+ events = sourceEvent(events);
+ if (node === undefined) node = events.currentTarget;
+ events = events.touches || [events];
+ }
+ return Array.from(events, event => pointer(event, node));
+}
+
+function selectAll(selector) {
+ return typeof selector === "string"
+ ? new Selection$1([document.querySelectorAll(selector)], [document.documentElement])
+ : new Selection$1([array$4(selector)], root$1);
+}
+
+// These are typically used in conjunction with noevent to ensure that we can
+// preventDefault on the event.
+const nonpassive = {passive: false};
+const nonpassivecapture = {capture: true, passive: false};
+
+function nopropagation$2(event) {
+ event.stopImmediatePropagation();
+}
+
+function noevent$2(event) {
+ event.preventDefault();
+ event.stopImmediatePropagation();
+}
+
+function dragDisable(view) {
+ var root = view.document.documentElement,
+ selection = select(view).on("dragstart.drag", noevent$2, nonpassivecapture);
+ if ("onselectstart" in root) {
+ selection.on("selectstart.drag", noevent$2, nonpassivecapture);
+ } else {
+ root.__noselect = root.style.MozUserSelect;
+ root.style.MozUserSelect = "none";
+ }
+}
+
+function yesdrag(view, noclick) {
+ var root = view.document.documentElement,
+ selection = select(view).on("dragstart.drag", null);
+ if (noclick) {
+ selection.on("click.drag", noevent$2, nonpassivecapture);
+ setTimeout(function() { selection.on("click.drag", null); }, 0);
+ }
+ if ("onselectstart" in root) {
+ selection.on("selectstart.drag", null);
+ } else {
+ root.style.MozUserSelect = root.__noselect;
+ delete root.__noselect;
+ }
+}
+
+var constant$9 = x => () => x;
+
+function DragEvent(type, {
+ sourceEvent,
+ subject,
+ target,
+ identifier,
+ active,
+ x, y, dx, dy,
+ dispatch
+}) {
+ Object.defineProperties(this, {
+ type: {value: type, enumerable: true, configurable: true},
+ sourceEvent: {value: sourceEvent, enumerable: true, configurable: true},
+ subject: {value: subject, enumerable: true, configurable: true},
+ target: {value: target, enumerable: true, configurable: true},
+ identifier: {value: identifier, enumerable: true, configurable: true},
+ active: {value: active, enumerable: true, configurable: true},
+ x: {value: x, enumerable: true, configurable: true},
+ y: {value: y, enumerable: true, configurable: true},
+ dx: {value: dx, enumerable: true, configurable: true},
+ dy: {value: dy, enumerable: true, configurable: true},
+ _: {value: dispatch}
+ });
+}
+
+DragEvent.prototype.on = function() {
+ var value = this._.on.apply(this._, arguments);
+ return value === this._ ? this : value;
+};
+
+// Ignore right-click, since that should open the context menu.
+function defaultFilter$2(event) {
+ return !event.ctrlKey && !event.button;
+}
+
+function defaultContainer() {
+ return this.parentNode;
+}
+
+function defaultSubject(event, d) {
+ return d == null ? {x: event.x, y: event.y} : d;
+}
+
+function defaultTouchable$2() {
+ return navigator.maxTouchPoints || ("ontouchstart" in this);
+}
+
+function drag() {
+ var filter = defaultFilter$2,
+ container = defaultContainer,
+ subject = defaultSubject,
+ touchable = defaultTouchable$2,
+ gestures = {},
+ listeners = dispatch("start", "drag", "end"),
+ active = 0,
+ mousedownx,
+ mousedowny,
+ mousemoving,
+ touchending,
+ clickDistance2 = 0;
+
+ function drag(selection) {
+ selection
+ .on("mousedown.drag", mousedowned)
+ .filter(touchable)
+ .on("touchstart.drag", touchstarted)
+ .on("touchmove.drag", touchmoved, nonpassive)
+ .on("touchend.drag touchcancel.drag", touchended)
+ .style("touch-action", "none")
+ .style("-webkit-tap-highlight-color", "rgba(0,0,0,0)");
+ }
+
+ function mousedowned(event, d) {
+ if (touchending || !filter.call(this, event, d)) return;
+ var gesture = beforestart(this, container.call(this, event, d), event, d, "mouse");
+ if (!gesture) return;
+ select(event.view)
+ .on("mousemove.drag", mousemoved, nonpassivecapture)
+ .on("mouseup.drag", mouseupped, nonpassivecapture);
+ dragDisable(event.view);
+ nopropagation$2(event);
+ mousemoving = false;
+ mousedownx = event.clientX;
+ mousedowny = event.clientY;
+ gesture("start", event);
+ }
+
+ function mousemoved(event) {
+ noevent$2(event);
+ if (!mousemoving) {
+ var dx = event.clientX - mousedownx, dy = event.clientY - mousedowny;
+ mousemoving = dx * dx + dy * dy > clickDistance2;
+ }
+ gestures.mouse("drag", event);
+ }
+
+ function mouseupped(event) {
+ select(event.view).on("mousemove.drag mouseup.drag", null);
+ yesdrag(event.view, mousemoving);
+ noevent$2(event);
+ gestures.mouse("end", event);
+ }
+
+ function touchstarted(event, d) {
+ if (!filter.call(this, event, d)) return;
+ var touches = event.changedTouches,
+ c = container.call(this, event, d),
+ n = touches.length, i, gesture;
+
+ for (i = 0; i < n; ++i) {
+ if (gesture = beforestart(this, c, event, d, touches[i].identifier, touches[i])) {
+ nopropagation$2(event);
+ gesture("start", event, touches[i]);
+ }
+ }
+ }
+
+ function touchmoved(event) {
+ var touches = event.changedTouches,
+ n = touches.length, i, gesture;
+
+ for (i = 0; i < n; ++i) {
+ if (gesture = gestures[touches[i].identifier]) {
+ noevent$2(event);
+ gesture("drag", event, touches[i]);
+ }
+ }
+ }
+
+ function touchended(event) {
+ var touches = event.changedTouches,
+ n = touches.length, i, gesture;
+
+ if (touchending) clearTimeout(touchending);
+ touchending = setTimeout(function() { touchending = null; }, 500); // Ghost clicks are delayed!
+ for (i = 0; i < n; ++i) {
+ if (gesture = gestures[touches[i].identifier]) {
+ nopropagation$2(event);
+ gesture("end", event, touches[i]);
+ }
+ }
+ }
+
+ function beforestart(that, container, event, d, identifier, touch) {
+ var dispatch = listeners.copy(),
+ p = pointer(touch || event, container), dx, dy,
+ s;
+
+ if ((s = subject.call(that, new DragEvent("beforestart", {
+ sourceEvent: event,
+ target: drag,
+ identifier,
+ active,
+ x: p[0],
+ y: p[1],
+ dx: 0,
+ dy: 0,
+ dispatch
+ }), d)) == null) return;
+
+ dx = s.x - p[0] || 0;
+ dy = s.y - p[1] || 0;
+
+ return function gesture(type, event, touch) {
+ var p0 = p, n;
+ switch (type) {
+ case "start": gestures[identifier] = gesture, n = active++; break;
+ case "end": delete gestures[identifier], --active; // falls through
+ case "drag": p = pointer(touch || event, container), n = active; break;
+ }
+ dispatch.call(
+ type,
+ that,
+ new DragEvent(type, {
+ sourceEvent: event,
+ subject: s,
+ target: drag,
+ identifier,
+ active: n,
+ x: p[0] + dx,
+ y: p[1] + dy,
+ dx: p[0] - p0[0],
+ dy: p[1] - p0[1],
+ dispatch
+ }),
+ d
+ );
+ };
+ }
+
+ drag.filter = function(_) {
+ return arguments.length ? (filter = typeof _ === "function" ? _ : constant$9(!!_), drag) : filter;
+ };
+
+ drag.container = function(_) {
+ return arguments.length ? (container = typeof _ === "function" ? _ : constant$9(_), drag) : container;
+ };
+
+ drag.subject = function(_) {
+ return arguments.length ? (subject = typeof _ === "function" ? _ : constant$9(_), drag) : subject;
+ };
+
+ drag.touchable = function(_) {
+ return arguments.length ? (touchable = typeof _ === "function" ? _ : constant$9(!!_), drag) : touchable;
+ };
+
+ drag.on = function() {
+ var value = listeners.on.apply(listeners, arguments);
+ return value === listeners ? drag : value;
+ };
+
+ drag.clickDistance = function(_) {
+ return arguments.length ? (clickDistance2 = (_ = +_) * _, drag) : Math.sqrt(clickDistance2);
+ };
+
+ return drag;
+}
+
+function define(constructor, factory, prototype) {
+ constructor.prototype = factory.prototype = prototype;
+ prototype.constructor = constructor;
+}
+
+function extend(parent, definition) {
+ var prototype = Object.create(parent.prototype);
+ for (var key in definition) prototype[key] = definition[key];
+ return prototype;
+}
+
+function Color() {}
+
+var darker = 0.7;
+var brighter = 1 / darker;
+
+var reI = "\\s*([+-]?\\d+)\\s*",
+ reN = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)\\s*",
+ reP = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)%\\s*",
+ reHex = /^#([0-9a-f]{3,8})$/,
+ reRgbInteger = new RegExp(`^rgb\\(${reI},${reI},${reI}\\)$`),
+ reRgbPercent = new RegExp(`^rgb\\(${reP},${reP},${reP}\\)$`),
+ reRgbaInteger = new RegExp(`^rgba\\(${reI},${reI},${reI},${reN}\\)$`),
+ reRgbaPercent = new RegExp(`^rgba\\(${reP},${reP},${reP},${reN}\\)$`),
+ reHslPercent = new RegExp(`^hsl\\(${reN},${reP},${reP}\\)$`),
+ reHslaPercent = new RegExp(`^hsla\\(${reN},${reP},${reP},${reN}\\)$`);
+
+var named = {
+ aliceblue: 0xf0f8ff,
+ antiquewhite: 0xfaebd7,
+ aqua: 0x00ffff,
+ aquamarine: 0x7fffd4,
+ azure: 0xf0ffff,
+ beige: 0xf5f5dc,
+ bisque: 0xffe4c4,
+ black: 0x000000,
+ blanchedalmond: 0xffebcd,
+ blue: 0x0000ff,
+ blueviolet: 0x8a2be2,
+ brown: 0xa52a2a,
+ burlywood: 0xdeb887,
+ cadetblue: 0x5f9ea0,
+ chartreuse: 0x7fff00,
+ chocolate: 0xd2691e,
+ coral: 0xff7f50,
+ cornflowerblue: 0x6495ed,
+ cornsilk: 0xfff8dc,
+ crimson: 0xdc143c,
+ cyan: 0x00ffff,
+ darkblue: 0x00008b,
+ darkcyan: 0x008b8b,
+ darkgoldenrod: 0xb8860b,
+ darkgray: 0xa9a9a9,
+ darkgreen: 0x006400,
+ darkgrey: 0xa9a9a9,
+ darkkhaki: 0xbdb76b,
+ darkmagenta: 0x8b008b,
+ darkolivegreen: 0x556b2f,
+ darkorange: 0xff8c00,
+ darkorchid: 0x9932cc,
+ darkred: 0x8b0000,
+ darksalmon: 0xe9967a,
+ darkseagreen: 0x8fbc8f,
+ darkslateblue: 0x483d8b,
+ darkslategray: 0x2f4f4f,
+ darkslategrey: 0x2f4f4f,
+ darkturquoise: 0x00ced1,
+ darkviolet: 0x9400d3,
+ deeppink: 0xff1493,
+ deepskyblue: 0x00bfff,
+ dimgray: 0x696969,
+ dimgrey: 0x696969,
+ dodgerblue: 0x1e90ff,
+ firebrick: 0xb22222,
+ floralwhite: 0xfffaf0,
+ forestgreen: 0x228b22,
+ fuchsia: 0xff00ff,
+ gainsboro: 0xdcdcdc,
+ ghostwhite: 0xf8f8ff,
+ gold: 0xffd700,
+ goldenrod: 0xdaa520,
+ gray: 0x808080,
+ green: 0x008000,
+ greenyellow: 0xadff2f,
+ grey: 0x808080,
+ honeydew: 0xf0fff0,
+ hotpink: 0xff69b4,
+ indianred: 0xcd5c5c,
+ indigo: 0x4b0082,
+ ivory: 0xfffff0,
+ khaki: 0xf0e68c,
+ lavender: 0xe6e6fa,
+ lavenderblush: 0xfff0f5,
+ lawngreen: 0x7cfc00,
+ lemonchiffon: 0xfffacd,
+ lightblue: 0xadd8e6,
+ lightcoral: 0xf08080,
+ lightcyan: 0xe0ffff,
+ lightgoldenrodyellow: 0xfafad2,
+ lightgray: 0xd3d3d3,
+ lightgreen: 0x90ee90,
+ lightgrey: 0xd3d3d3,
+ lightpink: 0xffb6c1,
+ lightsalmon: 0xffa07a,
+ lightseagreen: 0x20b2aa,
+ lightskyblue: 0x87cefa,
+ lightslategray: 0x778899,
+ lightslategrey: 0x778899,
+ lightsteelblue: 0xb0c4de,
+ lightyellow: 0xffffe0,
+ lime: 0x00ff00,
+ limegreen: 0x32cd32,
+ linen: 0xfaf0e6,
+ magenta: 0xff00ff,
+ maroon: 0x800000,
+ mediumaquamarine: 0x66cdaa,
+ mediumblue: 0x0000cd,
+ mediumorchid: 0xba55d3,
+ mediumpurple: 0x9370db,
+ mediumseagreen: 0x3cb371,
+ mediumslateblue: 0x7b68ee,
+ mediumspringgreen: 0x00fa9a,
+ mediumturquoise: 0x48d1cc,
+ mediumvioletred: 0xc71585,
+ midnightblue: 0x191970,
+ mintcream: 0xf5fffa,
+ mistyrose: 0xffe4e1,
+ moccasin: 0xffe4b5,
+ navajowhite: 0xffdead,
+ navy: 0x000080,
+ oldlace: 0xfdf5e6,
+ olive: 0x808000,
+ olivedrab: 0x6b8e23,
+ orange: 0xffa500,
+ orangered: 0xff4500,
+ orchid: 0xda70d6,
+ palegoldenrod: 0xeee8aa,
+ palegreen: 0x98fb98,
+ paleturquoise: 0xafeeee,
+ palevioletred: 0xdb7093,
+ papayawhip: 0xffefd5,
+ peachpuff: 0xffdab9,
+ peru: 0xcd853f,
+ pink: 0xffc0cb,
+ plum: 0xdda0dd,
+ powderblue: 0xb0e0e6,
+ purple: 0x800080,
+ rebeccapurple: 0x663399,
+ red: 0xff0000,
+ rosybrown: 0xbc8f8f,
+ royalblue: 0x4169e1,
+ saddlebrown: 0x8b4513,
+ salmon: 0xfa8072,
+ sandybrown: 0xf4a460,
+ seagreen: 0x2e8b57,
+ seashell: 0xfff5ee,
+ sienna: 0xa0522d,
+ silver: 0xc0c0c0,
+ skyblue: 0x87ceeb,
+ slateblue: 0x6a5acd,
+ slategray: 0x708090,
+ slategrey: 0x708090,
+ snow: 0xfffafa,
+ springgreen: 0x00ff7f,
+ steelblue: 0x4682b4,
+ tan: 0xd2b48c,
+ teal: 0x008080,
+ thistle: 0xd8bfd8,
+ tomato: 0xff6347,
+ turquoise: 0x40e0d0,
+ violet: 0xee82ee,
+ wheat: 0xf5deb3,
+ white: 0xffffff,
+ whitesmoke: 0xf5f5f5,
+ yellow: 0xffff00,
+ yellowgreen: 0x9acd32
+};
+
+define(Color, color, {
+ copy(channels) {
+ return Object.assign(new this.constructor, this, channels);
+ },
+ displayable() {
+ return this.rgb().displayable();
+ },
+ hex: color_formatHex, // Deprecated! Use color.formatHex.
+ formatHex: color_formatHex,
+ formatHex8: color_formatHex8,
+ formatHsl: color_formatHsl,
+ formatRgb: color_formatRgb,
+ toString: color_formatRgb
+});
+
+function color_formatHex() {
+ return this.rgb().formatHex();
+}
+
+function color_formatHex8() {
+ return this.rgb().formatHex8();
+}
+
+function color_formatHsl() {
+ return hslConvert(this).formatHsl();
+}
+
+function color_formatRgb() {
+ return this.rgb().formatRgb();
+}
+
+function color(format) {
+ var m, l;
+ format = (format + "").trim().toLowerCase();
+ return (m = reHex.exec(format)) ? (l = m[1].length, m = parseInt(m[1], 16), l === 6 ? rgbn(m) // #ff0000
+ : l === 3 ? new Rgb((m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), ((m & 0xf) << 4) | (m & 0xf), 1) // #f00
+ : l === 8 ? rgba(m >> 24 & 0xff, m >> 16 & 0xff, m >> 8 & 0xff, (m & 0xff) / 0xff) // #ff000000
+ : l === 4 ? rgba((m >> 12 & 0xf) | (m >> 8 & 0xf0), (m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), (((m & 0xf) << 4) | (m & 0xf)) / 0xff) // #f000
+ : null) // invalid hex
+ : (m = reRgbInteger.exec(format)) ? new Rgb(m[1], m[2], m[3], 1) // rgb(255, 0, 0)
+ : (m = reRgbPercent.exec(format)) ? new Rgb(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, 1) // rgb(100%, 0%, 0%)
+ : (m = reRgbaInteger.exec(format)) ? rgba(m[1], m[2], m[3], m[4]) // rgba(255, 0, 0, 1)
+ : (m = reRgbaPercent.exec(format)) ? rgba(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, m[4]) // rgb(100%, 0%, 0%, 1)
+ : (m = reHslPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, 1) // hsl(120, 50%, 50%)
+ : (m = reHslaPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, m[4]) // hsla(120, 50%, 50%, 1)
+ : named.hasOwnProperty(format) ? rgbn(named[format]) // eslint-disable-line no-prototype-builtins
+ : format === "transparent" ? new Rgb(NaN, NaN, NaN, 0)
+ : null;
+}
+
+function rgbn(n) {
+ return new Rgb(n >> 16 & 0xff, n >> 8 & 0xff, n & 0xff, 1);
+}
+
+function rgba(r, g, b, a) {
+ if (a <= 0) r = g = b = NaN;
+ return new Rgb(r, g, b, a);
+}
+
+function rgbConvert(o) {
+ if (!(o instanceof Color)) o = color(o);
+ if (!o) return new Rgb;
+ o = o.rgb();
+ return new Rgb(o.r, o.g, o.b, o.opacity);
+}
+
+function rgb(r, g, b, opacity) {
+ return arguments.length === 1 ? rgbConvert(r) : new Rgb(r, g, b, opacity == null ? 1 : opacity);
+}
+
+function Rgb(r, g, b, opacity) {
+ this.r = +r;
+ this.g = +g;
+ this.b = +b;
+ this.opacity = +opacity;
+}
+
+define(Rgb, rgb, extend(Color, {
+ brighter(k) {
+ k = k == null ? brighter : Math.pow(brighter, k);
+ return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);
+ },
+ darker(k) {
+ k = k == null ? darker : Math.pow(darker, k);
+ return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);
+ },
+ rgb() {
+ return this;
+ },
+ clamp() {
+ return new Rgb(clampi(this.r), clampi(this.g), clampi(this.b), clampa(this.opacity));
+ },
+ displayable() {
+ return (-0.5 <= this.r && this.r < 255.5)
+ && (-0.5 <= this.g && this.g < 255.5)
+ && (-0.5 <= this.b && this.b < 255.5)
+ && (0 <= this.opacity && this.opacity <= 1);
+ },
+ hex: rgb_formatHex, // Deprecated! Use color.formatHex.
+ formatHex: rgb_formatHex,
+ formatHex8: rgb_formatHex8,
+ formatRgb: rgb_formatRgb,
+ toString: rgb_formatRgb
+}));
+
+function rgb_formatHex() {
+ return `#${hex(this.r)}${hex(this.g)}${hex(this.b)}`;
+}
+
+function rgb_formatHex8() {
+ return `#${hex(this.r)}${hex(this.g)}${hex(this.b)}${hex((isNaN(this.opacity) ? 1 : this.opacity) * 255)}`;
+}
+
+function rgb_formatRgb() {
+ const a = clampa(this.opacity);
+ return `${a === 1 ? "rgb(" : "rgba("}${clampi(this.r)}, ${clampi(this.g)}, ${clampi(this.b)}${a === 1 ? ")" : `, ${a})`}`;
+}
+
+function clampa(opacity) {
+ return isNaN(opacity) ? 1 : Math.max(0, Math.min(1, opacity));
+}
+
+function clampi(value) {
+ return Math.max(0, Math.min(255, Math.round(value) || 0));
+}
+
+function hex(value) {
+ value = clampi(value);
+ return (value < 16 ? "0" : "") + value.toString(16);
+}
+
+function hsla(h, s, l, a) {
+ if (a <= 0) h = s = l = NaN;
+ else if (l <= 0 || l >= 1) h = s = NaN;
+ else if (s <= 0) h = NaN;
+ return new Hsl(h, s, l, a);
+}
+
+function hslConvert(o) {
+ if (o instanceof Hsl) return new Hsl(o.h, o.s, o.l, o.opacity);
+ if (!(o instanceof Color)) o = color(o);
+ if (!o) return new Hsl;
+ if (o instanceof Hsl) return o;
+ o = o.rgb();
+ var r = o.r / 255,
+ g = o.g / 255,
+ b = o.b / 255,
+ min = Math.min(r, g, b),
+ max = Math.max(r, g, b),
+ h = NaN,
+ s = max - min,
+ l = (max + min) / 2;
+ if (s) {
+ if (r === max) h = (g - b) / s + (g < b) * 6;
+ else if (g === max) h = (b - r) / s + 2;
+ else h = (r - g) / s + 4;
+ s /= l < 0.5 ? max + min : 2 - max - min;
+ h *= 60;
+ } else {
+ s = l > 0 && l < 1 ? 0 : h;
+ }
+ return new Hsl(h, s, l, o.opacity);
+}
+
+function hsl$2(h, s, l, opacity) {
+ return arguments.length === 1 ? hslConvert(h) : new Hsl(h, s, l, opacity == null ? 1 : opacity);
+}
+
+function Hsl(h, s, l, opacity) {
+ this.h = +h;
+ this.s = +s;
+ this.l = +l;
+ this.opacity = +opacity;
+}
+
+define(Hsl, hsl$2, extend(Color, {
+ brighter(k) {
+ k = k == null ? brighter : Math.pow(brighter, k);
+ return new Hsl(this.h, this.s, this.l * k, this.opacity);
+ },
+ darker(k) {
+ k = k == null ? darker : Math.pow(darker, k);
+ return new Hsl(this.h, this.s, this.l * k, this.opacity);
+ },
+ rgb() {
+ var h = this.h % 360 + (this.h < 0) * 360,
+ s = isNaN(h) || isNaN(this.s) ? 0 : this.s,
+ l = this.l,
+ m2 = l + (l < 0.5 ? l : 1 - l) * s,
+ m1 = 2 * l - m2;
+ return new Rgb(
+ hsl2rgb(h >= 240 ? h - 240 : h + 120, m1, m2),
+ hsl2rgb(h, m1, m2),
+ hsl2rgb(h < 120 ? h + 240 : h - 120, m1, m2),
+ this.opacity
+ );
+ },
+ clamp() {
+ return new Hsl(clamph(this.h), clampt(this.s), clampt(this.l), clampa(this.opacity));
+ },
+ displayable() {
+ return (0 <= this.s && this.s <= 1 || isNaN(this.s))
+ && (0 <= this.l && this.l <= 1)
+ && (0 <= this.opacity && this.opacity <= 1);
+ },
+ formatHsl() {
+ const a = clampa(this.opacity);
+ return `${a === 1 ? "hsl(" : "hsla("}${clamph(this.h)}, ${clampt(this.s) * 100}%, ${clampt(this.l) * 100}%${a === 1 ? ")" : `, ${a})`}`;
+ }
+}));
+
+function clamph(value) {
+ value = (value || 0) % 360;
+ return value < 0 ? value + 360 : value;
+}
+
+function clampt(value) {
+ return Math.max(0, Math.min(1, value || 0));
+}
+
+/* From FvD 13.37, CSS Color Module Level 3 */
+function hsl2rgb(h, m1, m2) {
+ return (h < 60 ? m1 + (m2 - m1) * h / 60
+ : h < 180 ? m2
+ : h < 240 ? m1 + (m2 - m1) * (240 - h) / 60
+ : m1) * 255;
+}
+
+const radians$1 = Math.PI / 180;
+const degrees$2 = 180 / Math.PI;
+
+// https://observablehq.com/@mbostock/lab-and-rgb
+const K = 18,
+ Xn = 0.96422,
+ Yn = 1,
+ Zn = 0.82521,
+ t0$1 = 4 / 29,
+ t1$1 = 6 / 29,
+ t2 = 3 * t1$1 * t1$1,
+ t3 = t1$1 * t1$1 * t1$1;
+
+function labConvert(o) {
+ if (o instanceof Lab) return new Lab(o.l, o.a, o.b, o.opacity);
+ if (o instanceof Hcl) return hcl2lab(o);
+ if (!(o instanceof Rgb)) o = rgbConvert(o);
+ var r = rgb2lrgb(o.r),
+ g = rgb2lrgb(o.g),
+ b = rgb2lrgb(o.b),
+ y = xyz2lab((0.2225045 * r + 0.7168786 * g + 0.0606169 * b) / Yn), x, z;
+ if (r === g && g === b) x = z = y; else {
+ x = xyz2lab((0.4360747 * r + 0.3850649 * g + 0.1430804 * b) / Xn);
+ z = xyz2lab((0.0139322 * r + 0.0971045 * g + 0.7141733 * b) / Zn);
+ }
+ return new Lab(116 * y - 16, 500 * (x - y), 200 * (y - z), o.opacity);
+}
+
+function gray(l, opacity) {
+ return new Lab(l, 0, 0, opacity == null ? 1 : opacity);
+}
+
+function lab$1(l, a, b, opacity) {
+ return arguments.length === 1 ? labConvert(l) : new Lab(l, a, b, opacity == null ? 1 : opacity);
+}
+
+function Lab(l, a, b, opacity) {
+ this.l = +l;
+ this.a = +a;
+ this.b = +b;
+ this.opacity = +opacity;
+}
+
+define(Lab, lab$1, extend(Color, {
+ brighter(k) {
+ return new Lab(this.l + K * (k == null ? 1 : k), this.a, this.b, this.opacity);
+ },
+ darker(k) {
+ return new Lab(this.l - K * (k == null ? 1 : k), this.a, this.b, this.opacity);
+ },
+ rgb() {
+ var y = (this.l + 16) / 116,
+ x = isNaN(this.a) ? y : y + this.a / 500,
+ z = isNaN(this.b) ? y : y - this.b / 200;
+ x = Xn * lab2xyz(x);
+ y = Yn * lab2xyz(y);
+ z = Zn * lab2xyz(z);
+ return new Rgb(
+ lrgb2rgb( 3.1338561 * x - 1.6168667 * y - 0.4906146 * z),
+ lrgb2rgb(-0.9787684 * x + 1.9161415 * y + 0.0334540 * z),
+ lrgb2rgb( 0.0719453 * x - 0.2289914 * y + 1.4052427 * z),
+ this.opacity
+ );
+ }
+}));
+
+function xyz2lab(t) {
+ return t > t3 ? Math.pow(t, 1 / 3) : t / t2 + t0$1;
+}
+
+function lab2xyz(t) {
+ return t > t1$1 ? t * t * t : t2 * (t - t0$1);
+}
+
+function lrgb2rgb(x) {
+ return 255 * (x <= 0.0031308 ? 12.92 * x : 1.055 * Math.pow(x, 1 / 2.4) - 0.055);
+}
+
+function rgb2lrgb(x) {
+ return (x /= 255) <= 0.04045 ? x / 12.92 : Math.pow((x + 0.055) / 1.055, 2.4);
+}
+
+function hclConvert(o) {
+ if (o instanceof Hcl) return new Hcl(o.h, o.c, o.l, o.opacity);
+ if (!(o instanceof Lab)) o = labConvert(o);
+ if (o.a === 0 && o.b === 0) return new Hcl(NaN, 0 < o.l && o.l < 100 ? 0 : NaN, o.l, o.opacity);
+ var h = Math.atan2(o.b, o.a) * degrees$2;
+ return new Hcl(h < 0 ? h + 360 : h, Math.sqrt(o.a * o.a + o.b * o.b), o.l, o.opacity);
+}
+
+function lch(l, c, h, opacity) {
+ return arguments.length === 1 ? hclConvert(l) : new Hcl(h, c, l, opacity == null ? 1 : opacity);
+}
+
+function hcl$2(h, c, l, opacity) {
+ return arguments.length === 1 ? hclConvert(h) : new Hcl(h, c, l, opacity == null ? 1 : opacity);
+}
+
+function Hcl(h, c, l, opacity) {
+ this.h = +h;
+ this.c = +c;
+ this.l = +l;
+ this.opacity = +opacity;
+}
+
+function hcl2lab(o) {
+ if (isNaN(o.h)) return new Lab(o.l, 0, 0, o.opacity);
+ var h = o.h * radians$1;
+ return new Lab(o.l, Math.cos(h) * o.c, Math.sin(h) * o.c, o.opacity);
+}
+
+define(Hcl, hcl$2, extend(Color, {
+ brighter(k) {
+ return new Hcl(this.h, this.c, this.l + K * (k == null ? 1 : k), this.opacity);
+ },
+ darker(k) {
+ return new Hcl(this.h, this.c, this.l - K * (k == null ? 1 : k), this.opacity);
+ },
+ rgb() {
+ return hcl2lab(this).rgb();
+ }
+}));
+
+var A = -0.14861,
+ B$1 = +1.78277,
+ C = -0.29227,
+ D$1 = -0.90649,
+ E = +1.97294,
+ ED = E * D$1,
+ EB = E * B$1,
+ BC_DA = B$1 * C - D$1 * A;
+
+function cubehelixConvert(o) {
+ if (o instanceof Cubehelix) return new Cubehelix(o.h, o.s, o.l, o.opacity);
+ if (!(o instanceof Rgb)) o = rgbConvert(o);
+ var r = o.r / 255,
+ g = o.g / 255,
+ b = o.b / 255,
+ l = (BC_DA * b + ED * r - EB * g) / (BC_DA + ED - EB),
+ bl = b - l,
+ k = (E * (g - l) - C * bl) / D$1,
+ s = Math.sqrt(k * k + bl * bl) / (E * l * (1 - l)), // NaN if l=0 or l=1
+ h = s ? Math.atan2(k, bl) * degrees$2 - 120 : NaN;
+ return new Cubehelix(h < 0 ? h + 360 : h, s, l, o.opacity);
+}
+
+function cubehelix$3(h, s, l, opacity) {
+ return arguments.length === 1 ? cubehelixConvert(h) : new Cubehelix(h, s, l, opacity == null ? 1 : opacity);
+}
+
+function Cubehelix(h, s, l, opacity) {
+ this.h = +h;
+ this.s = +s;
+ this.l = +l;
+ this.opacity = +opacity;
+}
+
+define(Cubehelix, cubehelix$3, extend(Color, {
+ brighter(k) {
+ k = k == null ? brighter : Math.pow(brighter, k);
+ return new Cubehelix(this.h, this.s, this.l * k, this.opacity);
+ },
+ darker(k) {
+ k = k == null ? darker : Math.pow(darker, k);
+ return new Cubehelix(this.h, this.s, this.l * k, this.opacity);
+ },
+ rgb() {
+ var h = isNaN(this.h) ? 0 : (this.h + 120) * radians$1,
+ l = +this.l,
+ a = isNaN(this.s) ? 0 : this.s * l * (1 - l),
+ cosh = Math.cos(h),
+ sinh = Math.sin(h);
+ return new Rgb(
+ 255 * (l + a * (A * cosh + B$1 * sinh)),
+ 255 * (l + a * (C * cosh + D$1 * sinh)),
+ 255 * (l + a * (E * cosh)),
+ this.opacity
+ );
+ }
+}));
+
+function basis$1(t1, v0, v1, v2, v3) {
+ var t2 = t1 * t1, t3 = t2 * t1;
+ return ((1 - 3 * t1 + 3 * t2 - t3) * v0
+ + (4 - 6 * t2 + 3 * t3) * v1
+ + (1 + 3 * t1 + 3 * t2 - 3 * t3) * v2
+ + t3 * v3) / 6;
+}
+
+function basis$2(values) {
+ var n = values.length - 1;
+ return function(t) {
+ var i = t <= 0 ? (t = 0) : t >= 1 ? (t = 1, n - 1) : Math.floor(t * n),
+ v1 = values[i],
+ v2 = values[i + 1],
+ v0 = i > 0 ? values[i - 1] : 2 * v1 - v2,
+ v3 = i < n - 1 ? values[i + 2] : 2 * v2 - v1;
+ return basis$1((t - i / n) * n, v0, v1, v2, v3);
+ };
+}
+
+function basisClosed$1(values) {
+ var n = values.length;
+ return function(t) {
+ var i = Math.floor(((t %= 1) < 0 ? ++t : t) * n),
+ v0 = values[(i + n - 1) % n],
+ v1 = values[i % n],
+ v2 = values[(i + 1) % n],
+ v3 = values[(i + 2) % n];
+ return basis$1((t - i / n) * n, v0, v1, v2, v3);
+ };
+}
+
+var constant$8 = x => () => x;
+
+function linear$2(a, d) {
+ return function(t) {
+ return a + t * d;
+ };
+}
+
+function exponential$1(a, b, y) {
+ return a = Math.pow(a, y), b = Math.pow(b, y) - a, y = 1 / y, function(t) {
+ return Math.pow(a + t * b, y);
+ };
+}
+
+function hue$1(a, b) {
+ var d = b - a;
+ return d ? linear$2(a, d > 180 || d < -180 ? d - 360 * Math.round(d / 360) : d) : constant$8(isNaN(a) ? b : a);
+}
+
+function gamma$1(y) {
+ return (y = +y) === 1 ? nogamma : function(a, b) {
+ return b - a ? exponential$1(a, b, y) : constant$8(isNaN(a) ? b : a);
+ };
+}
+
+function nogamma(a, b) {
+ var d = b - a;
+ return d ? linear$2(a, d) : constant$8(isNaN(a) ? b : a);
+}
+
+var interpolateRgb = (function rgbGamma(y) {
+ var color = gamma$1(y);
+
+ function rgb$1(start, end) {
+ var r = color((start = rgb(start)).r, (end = rgb(end)).r),
+ g = color(start.g, end.g),
+ b = color(start.b, end.b),
+ opacity = nogamma(start.opacity, end.opacity);
+ return function(t) {
+ start.r = r(t);
+ start.g = g(t);
+ start.b = b(t);
+ start.opacity = opacity(t);
+ return start + "";
+ };
+ }
+
+ rgb$1.gamma = rgbGamma;
+
+ return rgb$1;
+})(1);
+
+function rgbSpline(spline) {
+ return function(colors) {
+ var n = colors.length,
+ r = new Array(n),
+ g = new Array(n),
+ b = new Array(n),
+ i, color;
+ for (i = 0; i < n; ++i) {
+ color = rgb(colors[i]);
+ r[i] = color.r || 0;
+ g[i] = color.g || 0;
+ b[i] = color.b || 0;
+ }
+ r = spline(r);
+ g = spline(g);
+ b = spline(b);
+ color.opacity = 1;
+ return function(t) {
+ color.r = r(t);
+ color.g = g(t);
+ color.b = b(t);
+ return color + "";
+ };
+ };
+}
+
+var rgbBasis = rgbSpline(basis$2);
+var rgbBasisClosed = rgbSpline(basisClosed$1);
+
+function numberArray(a, b) {
+ if (!b) b = [];
+ var n = a ? Math.min(b.length, a.length) : 0,
+ c = b.slice(),
+ i;
+ return function(t) {
+ for (i = 0; i < n; ++i) c[i] = a[i] * (1 - t) + b[i] * t;
+ return c;
+ };
+}
+
+function isNumberArray(x) {
+ return ArrayBuffer.isView(x) && !(x instanceof DataView);
+}
+
+function array$3(a, b) {
+ return (isNumberArray(b) ? numberArray : genericArray)(a, b);
+}
+
+function genericArray(a, b) {
+ var nb = b ? b.length : 0,
+ na = a ? Math.min(nb, a.length) : 0,
+ x = new Array(na),
+ c = new Array(nb),
+ i;
+
+ for (i = 0; i < na; ++i) x[i] = interpolate$2(a[i], b[i]);
+ for (; i < nb; ++i) c[i] = b[i];
+
+ return function(t) {
+ for (i = 0; i < na; ++i) c[i] = x[i](t);
+ return c;
+ };
+}
+
+function date$1(a, b) {
+ var d = new Date;
+ return a = +a, b = +b, function(t) {
+ return d.setTime(a * (1 - t) + b * t), d;
+ };
+}
+
+function interpolateNumber(a, b) {
+ return a = +a, b = +b, function(t) {
+ return a * (1 - t) + b * t;
+ };
+}
+
+function object$1(a, b) {
+ var i = {},
+ c = {},
+ k;
+
+ if (a === null || typeof a !== "object") a = {};
+ if (b === null || typeof b !== "object") b = {};
+
+ for (k in b) {
+ if (k in a) {
+ i[k] = interpolate$2(a[k], b[k]);
+ } else {
+ c[k] = b[k];
+ }
+ }
+
+ return function(t) {
+ for (k in i) c[k] = i[k](t);
+ return c;
+ };
+}
+
+var reA = /[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,
+ reB = new RegExp(reA.source, "g");
+
+function zero(b) {
+ return function() {
+ return b;
+ };
+}
+
+function one(b) {
+ return function(t) {
+ return b(t) + "";
+ };
+}
+
+function interpolateString(a, b) {
+ var bi = reA.lastIndex = reB.lastIndex = 0, // scan index for next number in b
+ am, // current match in a
+ bm, // current match in b
+ bs, // string preceding current number in b, if any
+ i = -1, // index in s
+ s = [], // string constants and placeholders
+ q = []; // number interpolators
+
+ // Coerce inputs to strings.
+ a = a + "", b = b + "";
+
+ // Interpolate pairs of numbers in a & b.
+ while ((am = reA.exec(a))
+ && (bm = reB.exec(b))) {
+ if ((bs = bm.index) > bi) { // a string precedes the next number in b
+ bs = b.slice(bi, bs);
+ if (s[i]) s[i] += bs; // coalesce with previous string
+ else s[++i] = bs;
+ }
+ if ((am = am[0]) === (bm = bm[0])) { // numbers in a & b match
+ if (s[i]) s[i] += bm; // coalesce with previous string
+ else s[++i] = bm;
+ } else { // interpolate non-matching numbers
+ s[++i] = null;
+ q.push({i: i, x: interpolateNumber(am, bm)});
+ }
+ bi = reB.lastIndex;
+ }
+
+ // Add remains of b.
+ if (bi < b.length) {
+ bs = b.slice(bi);
+ if (s[i]) s[i] += bs; // coalesce with previous string
+ else s[++i] = bs;
+ }
+
+ // Special optimization for only a single match.
+ // Otherwise, interpolate each of the numbers and rejoin the string.
+ return s.length < 2 ? (q[0]
+ ? one(q[0].x)
+ : zero(b))
+ : (b = q.length, function(t) {
+ for (var i = 0, o; i < b; ++i) s[(o = q[i]).i] = o.x(t);
+ return s.join("");
+ });
+}
+
+function interpolate$2(a, b) {
+ var t = typeof b, c;
+ return b == null || t === "boolean" ? constant$8(b)
+ : (t === "number" ? interpolateNumber
+ : t === "string" ? ((c = color(b)) ? (b = c, interpolateRgb) : interpolateString)
+ : b instanceof color ? interpolateRgb
+ : b instanceof Date ? date$1
+ : isNumberArray(b) ? numberArray
+ : Array.isArray(b) ? genericArray
+ : typeof b.valueOf !== "function" && typeof b.toString !== "function" || isNaN(b) ? object$1
+ : interpolateNumber)(a, b);
+}
+
+function discrete(range) {
+ var n = range.length;
+ return function(t) {
+ return range[Math.max(0, Math.min(n - 1, Math.floor(t * n)))];
+ };
+}
+
+function hue(a, b) {
+ var i = hue$1(+a, +b);
+ return function(t) {
+ var x = i(t);
+ return x - 360 * Math.floor(x / 360);
+ };
+}
+
+function interpolateRound(a, b) {
+ return a = +a, b = +b, function(t) {
+ return Math.round(a * (1 - t) + b * t);
+ };
+}
+
+var degrees$1 = 180 / Math.PI;
+
+var identity$7 = {
+ translateX: 0,
+ translateY: 0,
+ rotate: 0,
+ skewX: 0,
+ scaleX: 1,
+ scaleY: 1
+};
+
+function decompose(a, b, c, d, e, f) {
+ var scaleX, scaleY, skewX;
+ if (scaleX = Math.sqrt(a * a + b * b)) a /= scaleX, b /= scaleX;
+ if (skewX = a * c + b * d) c -= a * skewX, d -= b * skewX;
+ if (scaleY = Math.sqrt(c * c + d * d)) c /= scaleY, d /= scaleY, skewX /= scaleY;
+ if (a * d < b * c) a = -a, b = -b, skewX = -skewX, scaleX = -scaleX;
+ return {
+ translateX: e,
+ translateY: f,
+ rotate: Math.atan2(b, a) * degrees$1,
+ skewX: Math.atan(skewX) * degrees$1,
+ scaleX: scaleX,
+ scaleY: scaleY
+ };
+}
+
+var svgNode;
+
+/* eslint-disable no-undef */
+function parseCss(value) {
+ const m = new (typeof DOMMatrix === "function" ? DOMMatrix : WebKitCSSMatrix)(value + "");
+ return m.isIdentity ? identity$7 : decompose(m.a, m.b, m.c, m.d, m.e, m.f);
+}
+
+function parseSvg(value) {
+ if (value == null) return identity$7;
+ if (!svgNode) svgNode = document.createElementNS("http://www.w3.org/2000/svg", "g");
+ svgNode.setAttribute("transform", value);
+ if (!(value = svgNode.transform.baseVal.consolidate())) return identity$7;
+ value = value.matrix;
+ return decompose(value.a, value.b, value.c, value.d, value.e, value.f);
+}
+
+function interpolateTransform(parse, pxComma, pxParen, degParen) {
+
+ function pop(s) {
+ return s.length ? s.pop() + " " : "";
+ }
+
+ function translate(xa, ya, xb, yb, s, q) {
+ if (xa !== xb || ya !== yb) {
+ var i = s.push("translate(", null, pxComma, null, pxParen);
+ q.push({i: i - 4, x: interpolateNumber(xa, xb)}, {i: i - 2, x: interpolateNumber(ya, yb)});
+ } else if (xb || yb) {
+ s.push("translate(" + xb + pxComma + yb + pxParen);
+ }
+ }
+
+ function rotate(a, b, s, q) {
+ if (a !== b) {
+ if (a - b > 180) b += 360; else if (b - a > 180) a += 360; // shortest path
+ q.push({i: s.push(pop(s) + "rotate(", null, degParen) - 2, x: interpolateNumber(a, b)});
+ } else if (b) {
+ s.push(pop(s) + "rotate(" + b + degParen);
+ }
+ }
+
+ function skewX(a, b, s, q) {
+ if (a !== b) {
+ q.push({i: s.push(pop(s) + "skewX(", null, degParen) - 2, x: interpolateNumber(a, b)});
+ } else if (b) {
+ s.push(pop(s) + "skewX(" + b + degParen);
+ }
+ }
+
+ function scale(xa, ya, xb, yb, s, q) {
+ if (xa !== xb || ya !== yb) {
+ var i = s.push(pop(s) + "scale(", null, ",", null, ")");
+ q.push({i: i - 4, x: interpolateNumber(xa, xb)}, {i: i - 2, x: interpolateNumber(ya, yb)});
+ } else if (xb !== 1 || yb !== 1) {
+ s.push(pop(s) + "scale(" + xb + "," + yb + ")");
+ }
+ }
+
+ return function(a, b) {
+ var s = [], // string constants and placeholders
+ q = []; // number interpolators
+ a = parse(a), b = parse(b);
+ translate(a.translateX, a.translateY, b.translateX, b.translateY, s, q);
+ rotate(a.rotate, b.rotate, s, q);
+ skewX(a.skewX, b.skewX, s, q);
+ scale(a.scaleX, a.scaleY, b.scaleX, b.scaleY, s, q);
+ a = b = null; // gc
+ return function(t) {
+ var i = -1, n = q.length, o;
+ while (++i < n) s[(o = q[i]).i] = o.x(t);
+ return s.join("");
+ };
+ };
+}
+
+var interpolateTransformCss = interpolateTransform(parseCss, "px, ", "px)", "deg)");
+var interpolateTransformSvg = interpolateTransform(parseSvg, ", ", ")", ")");
+
+var epsilon2$1 = 1e-12;
+
+function cosh(x) {
+ return ((x = Math.exp(x)) + 1 / x) / 2;
+}
+
+function sinh(x) {
+ return ((x = Math.exp(x)) - 1 / x) / 2;
+}
+
+function tanh(x) {
+ return ((x = Math.exp(2 * x)) - 1) / (x + 1);
+}
+
+var interpolateZoom = (function zoomRho(rho, rho2, rho4) {
+
+ // p0 = [ux0, uy0, w0]
+ // p1 = [ux1, uy1, w1]
+ function zoom(p0, p1) {
+ var ux0 = p0[0], uy0 = p0[1], w0 = p0[2],
+ ux1 = p1[0], uy1 = p1[1], w1 = p1[2],
+ dx = ux1 - ux0,
+ dy = uy1 - uy0,
+ d2 = dx * dx + dy * dy,
+ i,
+ S;
+
+ // Special case for u0 ≅ u1.
+ if (d2 < epsilon2$1) {
+ S = Math.log(w1 / w0) / rho;
+ i = function(t) {
+ return [
+ ux0 + t * dx,
+ uy0 + t * dy,
+ w0 * Math.exp(rho * t * S)
+ ];
+ };
+ }
+
+ // General case.
+ else {
+ var d1 = Math.sqrt(d2),
+ b0 = (w1 * w1 - w0 * w0 + rho4 * d2) / (2 * w0 * rho2 * d1),
+ b1 = (w1 * w1 - w0 * w0 - rho4 * d2) / (2 * w1 * rho2 * d1),
+ r0 = Math.log(Math.sqrt(b0 * b0 + 1) - b0),
+ r1 = Math.log(Math.sqrt(b1 * b1 + 1) - b1);
+ S = (r1 - r0) / rho;
+ i = function(t) {
+ var s = t * S,
+ coshr0 = cosh(r0),
+ u = w0 / (rho2 * d1) * (coshr0 * tanh(rho * s + r0) - sinh(r0));
+ return [
+ ux0 + u * dx,
+ uy0 + u * dy,
+ w0 * coshr0 / cosh(rho * s + r0)
+ ];
+ };
+ }
+
+ i.duration = S * 1000 * rho / Math.SQRT2;
+
+ return i;
+ }
+
+ zoom.rho = function(_) {
+ var _1 = Math.max(1e-3, +_), _2 = _1 * _1, _4 = _2 * _2;
+ return zoomRho(_1, _2, _4);
+ };
+
+ return zoom;
+})(Math.SQRT2, 2, 4);
+
+function hsl(hue) {
+ return function(start, end) {
+ var h = hue((start = hsl$2(start)).h, (end = hsl$2(end)).h),
+ s = nogamma(start.s, end.s),
+ l = nogamma(start.l, end.l),
+ opacity = nogamma(start.opacity, end.opacity);
+ return function(t) {
+ start.h = h(t);
+ start.s = s(t);
+ start.l = l(t);
+ start.opacity = opacity(t);
+ return start + "";
+ };
+ }
+}
+
+var hsl$1 = hsl(hue$1);
+var hslLong = hsl(nogamma);
+
+function lab(start, end) {
+ var l = nogamma((start = lab$1(start)).l, (end = lab$1(end)).l),
+ a = nogamma(start.a, end.a),
+ b = nogamma(start.b, end.b),
+ opacity = nogamma(start.opacity, end.opacity);
+ return function(t) {
+ start.l = l(t);
+ start.a = a(t);
+ start.b = b(t);
+ start.opacity = opacity(t);
+ return start + "";
+ };
+}
+
+function hcl(hue) {
+ return function(start, end) {
+ var h = hue((start = hcl$2(start)).h, (end = hcl$2(end)).h),
+ c = nogamma(start.c, end.c),
+ l = nogamma(start.l, end.l),
+ opacity = nogamma(start.opacity, end.opacity);
+ return function(t) {
+ start.h = h(t);
+ start.c = c(t);
+ start.l = l(t);
+ start.opacity = opacity(t);
+ return start + "";
+ };
+ }
+}
+
+var hcl$1 = hcl(hue$1);
+var hclLong = hcl(nogamma);
+
+function cubehelix$1(hue) {
+ return (function cubehelixGamma(y) {
+ y = +y;
+
+ function cubehelix(start, end) {
+ var h = hue((start = cubehelix$3(start)).h, (end = cubehelix$3(end)).h),
+ s = nogamma(start.s, end.s),
+ l = nogamma(start.l, end.l),
+ opacity = nogamma(start.opacity, end.opacity);
+ return function(t) {
+ start.h = h(t);
+ start.s = s(t);
+ start.l = l(Math.pow(t, y));
+ start.opacity = opacity(t);
+ return start + "";
+ };
+ }
+
+ cubehelix.gamma = cubehelixGamma;
+
+ return cubehelix;
+ })(1);
+}
+
+var cubehelix$2 = cubehelix$1(hue$1);
+var cubehelixLong = cubehelix$1(nogamma);
+
+function piecewise(interpolate, values) {
+ if (values === undefined) values = interpolate, interpolate = interpolate$2;
+ var i = 0, n = values.length - 1, v = values[0], I = new Array(n < 0 ? 0 : n);
+ while (i < n) I[i] = interpolate(v, v = values[++i]);
+ return function(t) {
+ var i = Math.max(0, Math.min(n - 1, Math.floor(t *= n)));
+ return I[i](t - i);
+ };
+}
+
+function quantize$1(interpolator, n) {
+ var samples = new Array(n);
+ for (var i = 0; i < n; ++i) samples[i] = interpolator(i / (n - 1));
+ return samples;
+}
+
+var frame = 0, // is an animation frame pending?
+ timeout$1 = 0, // is a timeout pending?
+ interval$1 = 0, // are any timers active?
+ pokeDelay = 1000, // how frequently we check for clock skew
+ taskHead,
+ taskTail,
+ clockLast = 0,
+ clockNow = 0,
+ clockSkew = 0,
+ clock = typeof performance === "object" && performance.now ? performance : Date,
+ setFrame = typeof window === "object" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(f) { setTimeout(f, 17); };
+
+function now() {
+ return clockNow || (setFrame(clearNow), clockNow = clock.now() + clockSkew);
+}
+
+function clearNow() {
+ clockNow = 0;
+}
+
+function Timer() {
+ this._call =
+ this._time =
+ this._next = null;
+}
+
+Timer.prototype = timer.prototype = {
+ constructor: Timer,
+ restart: function(callback, delay, time) {
+ if (typeof callback !== "function") throw new TypeError("callback is not a function");
+ time = (time == null ? now() : +time) + (delay == null ? 0 : +delay);
+ if (!this._next && taskTail !== this) {
+ if (taskTail) taskTail._next = this;
+ else taskHead = this;
+ taskTail = this;
+ }
+ this._call = callback;
+ this._time = time;
+ sleep();
+ },
+ stop: function() {
+ if (this._call) {
+ this._call = null;
+ this._time = Infinity;
+ sleep();
+ }
+ }
+};
+
+function timer(callback, delay, time) {
+ var t = new Timer;
+ t.restart(callback, delay, time);
+ return t;
+}
+
+function timerFlush() {
+ now(); // Get the current time, if not already set.
+ ++frame; // Pretend we’ve set an alarm, if we haven’t already.
+ var t = taskHead, e;
+ while (t) {
+ if ((e = clockNow - t._time) >= 0) t._call.call(undefined, e);
+ t = t._next;
+ }
+ --frame;
+}
+
+function wake() {
+ clockNow = (clockLast = clock.now()) + clockSkew;
+ frame = timeout$1 = 0;
+ try {
+ timerFlush();
+ } finally {
+ frame = 0;
+ nap();
+ clockNow = 0;
+ }
+}
+
+function poke() {
+ var now = clock.now(), delay = now - clockLast;
+ if (delay > pokeDelay) clockSkew -= delay, clockLast = now;
+}
+
+function nap() {
+ var t0, t1 = taskHead, t2, time = Infinity;
+ while (t1) {
+ if (t1._call) {
+ if (time > t1._time) time = t1._time;
+ t0 = t1, t1 = t1._next;
+ } else {
+ t2 = t1._next, t1._next = null;
+ t1 = t0 ? t0._next = t2 : taskHead = t2;
+ }
+ }
+ taskTail = t0;
+ sleep(time);
+}
+
+function sleep(time) {
+ if (frame) return; // Soonest alarm already set, or will be.
+ if (timeout$1) timeout$1 = clearTimeout(timeout$1);
+ var delay = time - clockNow; // Strictly less than if we recomputed clockNow.
+ if (delay > 24) {
+ if (time < Infinity) timeout$1 = setTimeout(wake, time - clock.now() - clockSkew);
+ if (interval$1) interval$1 = clearInterval(interval$1);
+ } else {
+ if (!interval$1) clockLast = clock.now(), interval$1 = setInterval(poke, pokeDelay);
+ frame = 1, setFrame(wake);
+ }
+}
+
+function timeout(callback, delay, time) {
+ var t = new Timer;
+ delay = delay == null ? 0 : +delay;
+ t.restart(elapsed => {
+ t.stop();
+ callback(elapsed + delay);
+ }, delay, time);
+ return t;
+}
+
+function interval(callback, delay, time) {
+ var t = new Timer, total = delay;
+ if (delay == null) return t.restart(callback, delay, time), t;
+ t._restart = t.restart;
+ t.restart = function(callback, delay, time) {
+ delay = +delay, time = time == null ? now() : +time;
+ t._restart(function tick(elapsed) {
+ elapsed += total;
+ t._restart(tick, total += delay, time);
+ callback(elapsed);
+ }, delay, time);
+ };
+ t.restart(callback, delay, time);
+ return t;
+}
+
+var emptyOn = dispatch("start", "end", "cancel", "interrupt");
+var emptyTween = [];
+
+var CREATED = 0;
+var SCHEDULED = 1;
+var STARTING = 2;
+var STARTED = 3;
+var RUNNING = 4;
+var ENDING = 5;
+var ENDED = 6;
+
+function schedule(node, name, id, index, group, timing) {
+ var schedules = node.__transition;
+ if (!schedules) node.__transition = {};
+ else if (id in schedules) return;
+ create(node, id, {
+ name: name,
+ index: index, // For context during callback.
+ group: group, // For context during callback.
+ on: emptyOn,
+ tween: emptyTween,
+ time: timing.time,
+ delay: timing.delay,
+ duration: timing.duration,
+ ease: timing.ease,
+ timer: null,
+ state: CREATED
+ });
+}
+
+function init(node, id) {
+ var schedule = get(node, id);
+ if (schedule.state > CREATED) throw new Error("too late; already scheduled");
+ return schedule;
+}
+
+function set(node, id) {
+ var schedule = get(node, id);
+ if (schedule.state > STARTED) throw new Error("too late; already running");
+ return schedule;
+}
+
+function get(node, id) {
+ var schedule = node.__transition;
+ if (!schedule || !(schedule = schedule[id])) throw new Error("transition not found");
+ return schedule;
+}
+
+function create(node, id, self) {
+ var schedules = node.__transition,
+ tween;
+
+ // Initialize the self timer when the transition is created.
+ // Note the actual delay is not known until the first callback!
+ schedules[id] = self;
+ self.timer = timer(schedule, 0, self.time);
+
+ function schedule(elapsed) {
+ self.state = SCHEDULED;
+ self.timer.restart(start, self.delay, self.time);
+
+ // If the elapsed delay is less than our first sleep, start immediately.
+ if (self.delay <= elapsed) start(elapsed - self.delay);
+ }
+
+ function start(elapsed) {
+ var i, j, n, o;
+
+ // If the state is not SCHEDULED, then we previously errored on start.
+ if (self.state !== SCHEDULED) return stop();
+
+ for (i in schedules) {
+ o = schedules[i];
+ if (o.name !== self.name) continue;
+
+ // While this element already has a starting transition during this frame,
+ // defer starting an interrupting transition until that transition has a
+ // chance to tick (and possibly end); see d3/d3-transition#54!
+ if (o.state === STARTED) return timeout(start);
+
+ // Interrupt the active transition, if any.
+ if (o.state === RUNNING) {
+ o.state = ENDED;
+ o.timer.stop();
+ o.on.call("interrupt", node, node.__data__, o.index, o.group);
+ delete schedules[i];
+ }
+
+ // Cancel any pre-empted transitions.
+ else if (+i < id) {
+ o.state = ENDED;
+ o.timer.stop();
+ o.on.call("cancel", node, node.__data__, o.index, o.group);
+ delete schedules[i];
+ }
+ }
+
+ // Defer the first tick to end of the current frame; see d3/d3#1576.
+ // Note the transition may be canceled after start and before the first tick!
+ // Note this must be scheduled before the start event; see d3/d3-transition#16!
+ // Assuming this is successful, subsequent callbacks go straight to tick.
+ timeout(function() {
+ if (self.state === STARTED) {
+ self.state = RUNNING;
+ self.timer.restart(tick, self.delay, self.time);
+ tick(elapsed);
+ }
+ });
+
+ // Dispatch the start event.
+ // Note this must be done before the tween are initialized.
+ self.state = STARTING;
+ self.on.call("start", node, node.__data__, self.index, self.group);
+ if (self.state !== STARTING) return; // interrupted
+ self.state = STARTED;
+
+ // Initialize the tween, deleting null tween.
+ tween = new Array(n = self.tween.length);
+ for (i = 0, j = -1; i < n; ++i) {
+ if (o = self.tween[i].value.call(node, node.__data__, self.index, self.group)) {
+ tween[++j] = o;
+ }
+ }
+ tween.length = j + 1;
+ }
+
+ function tick(elapsed) {
+ var t = elapsed < self.duration ? self.ease.call(null, elapsed / self.duration) : (self.timer.restart(stop), self.state = ENDING, 1),
+ i = -1,
+ n = tween.length;
+
+ while (++i < n) {
+ tween[i].call(node, t);
+ }
+
+ // Dispatch the end event.
+ if (self.state === ENDING) {
+ self.on.call("end", node, node.__data__, self.index, self.group);
+ stop();
+ }
+ }
+
+ function stop() {
+ self.state = ENDED;
+ self.timer.stop();
+ delete schedules[id];
+ for (var i in schedules) return; // eslint-disable-line no-unused-vars
+ delete node.__transition;
+ }
+}
+
+function interrupt(node, name) {
+ var schedules = node.__transition,
+ schedule,
+ active,
+ empty = true,
+ i;
+
+ if (!schedules) return;
+
+ name = name == null ? null : name + "";
+
+ for (i in schedules) {
+ if ((schedule = schedules[i]).name !== name) { empty = false; continue; }
+ active = schedule.state > STARTING && schedule.state < ENDING;
+ schedule.state = ENDED;
+ schedule.timer.stop();
+ schedule.on.call(active ? "interrupt" : "cancel", node, node.__data__, schedule.index, schedule.group);
+ delete schedules[i];
+ }
+
+ if (empty) delete node.__transition;
+}
+
+function selection_interrupt(name) {
+ return this.each(function() {
+ interrupt(this, name);
+ });
+}
+
+function tweenRemove(id, name) {
+ var tween0, tween1;
+ return function() {
+ var schedule = set(this, id),
+ tween = schedule.tween;
+
+ // If this node shared tween with the previous node,
+ // just assign the updated shared tween and we’re done!
+ // Otherwise, copy-on-write.
+ if (tween !== tween0) {
+ tween1 = tween0 = tween;
+ for (var i = 0, n = tween1.length; i < n; ++i) {
+ if (tween1[i].name === name) {
+ tween1 = tween1.slice();
+ tween1.splice(i, 1);
+ break;
+ }
+ }
+ }
+
+ schedule.tween = tween1;
+ };
+}
+
+function tweenFunction(id, name, value) {
+ var tween0, tween1;
+ if (typeof value !== "function") throw new Error;
+ return function() {
+ var schedule = set(this, id),
+ tween = schedule.tween;
+
+ // If this node shared tween with the previous node,
+ // just assign the updated shared tween and we’re done!
+ // Otherwise, copy-on-write.
+ if (tween !== tween0) {
+ tween1 = (tween0 = tween).slice();
+ for (var t = {name: name, value: value}, i = 0, n = tween1.length; i < n; ++i) {
+ if (tween1[i].name === name) {
+ tween1[i] = t;
+ break;
+ }
+ }
+ if (i === n) tween1.push(t);
+ }
+
+ schedule.tween = tween1;
+ };
+}
+
+function transition_tween(name, value) {
+ var id = this._id;
+
+ name += "";
+
+ if (arguments.length < 2) {
+ var tween = get(this.node(), id).tween;
+ for (var i = 0, n = tween.length, t; i < n; ++i) {
+ if ((t = tween[i]).name === name) {
+ return t.value;
+ }
+ }
+ return null;
+ }
+
+ return this.each((value == null ? tweenRemove : tweenFunction)(id, name, value));
+}
+
+function tweenValue(transition, name, value) {
+ var id = transition._id;
+
+ transition.each(function() {
+ var schedule = set(this, id);
+ (schedule.value || (schedule.value = {}))[name] = value.apply(this, arguments);
+ });
+
+ return function(node) {
+ return get(node, id).value[name];
+ };
+}
+
+function interpolate$1(a, b) {
+ var c;
+ return (typeof b === "number" ? interpolateNumber
+ : b instanceof color ? interpolateRgb
+ : (c = color(b)) ? (b = c, interpolateRgb)
+ : interpolateString)(a, b);
+}
+
+function attrRemove(name) {
+ return function() {
+ this.removeAttribute(name);
+ };
+}
+
+function attrRemoveNS(fullname) {
+ return function() {
+ this.removeAttributeNS(fullname.space, fullname.local);
+ };
+}
+
+function attrConstant(name, interpolate, value1) {
+ var string00,
+ string1 = value1 + "",
+ interpolate0;
+ return function() {
+ var string0 = this.getAttribute(name);
+ return string0 === string1 ? null
+ : string0 === string00 ? interpolate0
+ : interpolate0 = interpolate(string00 = string0, value1);
+ };
+}
+
+function attrConstantNS(fullname, interpolate, value1) {
+ var string00,
+ string1 = value1 + "",
+ interpolate0;
+ return function() {
+ var string0 = this.getAttributeNS(fullname.space, fullname.local);
+ return string0 === string1 ? null
+ : string0 === string00 ? interpolate0
+ : interpolate0 = interpolate(string00 = string0, value1);
+ };
+}
+
+function attrFunction(name, interpolate, value) {
+ var string00,
+ string10,
+ interpolate0;
+ return function() {
+ var string0, value1 = value(this), string1;
+ if (value1 == null) return void this.removeAttribute(name);
+ string0 = this.getAttribute(name);
+ string1 = value1 + "";
+ return string0 === string1 ? null
+ : string0 === string00 && string1 === string10 ? interpolate0
+ : (string10 = string1, interpolate0 = interpolate(string00 = string0, value1));
+ };
+}
+
+function attrFunctionNS(fullname, interpolate, value) {
+ var string00,
+ string10,
+ interpolate0;
+ return function() {
+ var string0, value1 = value(this), string1;
+ if (value1 == null) return void this.removeAttributeNS(fullname.space, fullname.local);
+ string0 = this.getAttributeNS(fullname.space, fullname.local);
+ string1 = value1 + "";
+ return string0 === string1 ? null
+ : string0 === string00 && string1 === string10 ? interpolate0
+ : (string10 = string1, interpolate0 = interpolate(string00 = string0, value1));
+ };
+}
+
+function transition_attr(name, value) {
+ var fullname = namespace(name), i = fullname === "transform" ? interpolateTransformSvg : interpolate$1;
+ return this.attrTween(name, typeof value === "function"
+ ? (fullname.local ? attrFunctionNS : attrFunction)(fullname, i, tweenValue(this, "attr." + name, value))
+ : value == null ? (fullname.local ? attrRemoveNS : attrRemove)(fullname)
+ : (fullname.local ? attrConstantNS : attrConstant)(fullname, i, value));
+}
+
+function attrInterpolate(name, i) {
+ return function(t) {
+ this.setAttribute(name, i.call(this, t));
+ };
+}
+
+function attrInterpolateNS(fullname, i) {
+ return function(t) {
+ this.setAttributeNS(fullname.space, fullname.local, i.call(this, t));
+ };
+}
+
+function attrTweenNS(fullname, value) {
+ var t0, i0;
+ function tween() {
+ var i = value.apply(this, arguments);
+ if (i !== i0) t0 = (i0 = i) && attrInterpolateNS(fullname, i);
+ return t0;
+ }
+ tween._value = value;
+ return tween;
+}
+
+function attrTween(name, value) {
+ var t0, i0;
+ function tween() {
+ var i = value.apply(this, arguments);
+ if (i !== i0) t0 = (i0 = i) && attrInterpolate(name, i);
+ return t0;
+ }
+ tween._value = value;
+ return tween;
+}
+
+function transition_attrTween(name, value) {
+ var key = "attr." + name;
+ if (arguments.length < 2) return (key = this.tween(key)) && key._value;
+ if (value == null) return this.tween(key, null);
+ if (typeof value !== "function") throw new Error;
+ var fullname = namespace(name);
+ return this.tween(key, (fullname.local ? attrTweenNS : attrTween)(fullname, value));
+}
+
+function delayFunction(id, value) {
+ return function() {
+ init(this, id).delay = +value.apply(this, arguments);
+ };
+}
+
+function delayConstant(id, value) {
+ return value = +value, function() {
+ init(this, id).delay = value;
+ };
+}
+
+function transition_delay(value) {
+ var id = this._id;
+
+ return arguments.length
+ ? this.each((typeof value === "function"
+ ? delayFunction
+ : delayConstant)(id, value))
+ : get(this.node(), id).delay;
+}
+
+function durationFunction(id, value) {
+ return function() {
+ set(this, id).duration = +value.apply(this, arguments);
+ };
+}
+
+function durationConstant(id, value) {
+ return value = +value, function() {
+ set(this, id).duration = value;
+ };
+}
+
+function transition_duration(value) {
+ var id = this._id;
+
+ return arguments.length
+ ? this.each((typeof value === "function"
+ ? durationFunction
+ : durationConstant)(id, value))
+ : get(this.node(), id).duration;
+}
+
+function easeConstant(id, value) {
+ if (typeof value !== "function") throw new Error;
+ return function() {
+ set(this, id).ease = value;
+ };
+}
+
+function transition_ease(value) {
+ var id = this._id;
+
+ return arguments.length
+ ? this.each(easeConstant(id, value))
+ : get(this.node(), id).ease;
+}
+
+function easeVarying(id, value) {
+ return function() {
+ var v = value.apply(this, arguments);
+ if (typeof v !== "function") throw new Error;
+ set(this, id).ease = v;
+ };
+}
+
+function transition_easeVarying(value) {
+ if (typeof value !== "function") throw new Error;
+ return this.each(easeVarying(this._id, value));
+}
+
+function transition_filter(match) {
+ if (typeof match !== "function") match = matcher(match);
+
+ for (var groups = this._groups, m = groups.length, subgroups = new Array(m), j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, subgroup = subgroups[j] = [], node, i = 0; i < n; ++i) {
+ if ((node = group[i]) && match.call(node, node.__data__, i, group)) {
+ subgroup.push(node);
+ }
+ }
+ }
+
+ return new Transition(subgroups, this._parents, this._name, this._id);
+}
+
+function transition_merge(transition) {
+ if (transition._id !== this._id) throw new Error;
+
+ for (var groups0 = this._groups, groups1 = transition._groups, m0 = groups0.length, m1 = groups1.length, m = Math.min(m0, m1), merges = new Array(m0), j = 0; j < m; ++j) {
+ for (var group0 = groups0[j], group1 = groups1[j], n = group0.length, merge = merges[j] = new Array(n), node, i = 0; i < n; ++i) {
+ if (node = group0[i] || group1[i]) {
+ merge[i] = node;
+ }
+ }
+ }
+
+ for (; j < m0; ++j) {
+ merges[j] = groups0[j];
+ }
+
+ return new Transition(merges, this._parents, this._name, this._id);
+}
+
+function start(name) {
+ return (name + "").trim().split(/^|\s+/).every(function(t) {
+ var i = t.indexOf(".");
+ if (i >= 0) t = t.slice(0, i);
+ return !t || t === "start";
+ });
+}
+
+function onFunction(id, name, listener) {
+ var on0, on1, sit = start(name) ? init : set;
+ return function() {
+ var schedule = sit(this, id),
+ on = schedule.on;
+
+ // If this node shared a dispatch with the previous node,
+ // just assign the updated shared dispatch and we’re done!
+ // Otherwise, copy-on-write.
+ if (on !== on0) (on1 = (on0 = on).copy()).on(name, listener);
+
+ schedule.on = on1;
+ };
+}
+
+function transition_on(name, listener) {
+ var id = this._id;
+
+ return arguments.length < 2
+ ? get(this.node(), id).on.on(name)
+ : this.each(onFunction(id, name, listener));
+}
+
+function removeFunction(id) {
+ return function() {
+ var parent = this.parentNode;
+ for (var i in this.__transition) if (+i !== id) return;
+ if (parent) parent.removeChild(this);
+ };
+}
+
+function transition_remove() {
+ return this.on("end.remove", removeFunction(this._id));
+}
+
+function transition_select(select) {
+ var name = this._name,
+ id = this._id;
+
+ if (typeof select !== "function") select = selector(select);
+
+ for (var groups = this._groups, m = groups.length, subgroups = new Array(m), j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, subgroup = subgroups[j] = new Array(n), node, subnode, i = 0; i < n; ++i) {
+ if ((node = group[i]) && (subnode = select.call(node, node.__data__, i, group))) {
+ if ("__data__" in node) subnode.__data__ = node.__data__;
+ subgroup[i] = subnode;
+ schedule(subgroup[i], name, id, i, subgroup, get(node, id));
+ }
+ }
+ }
+
+ return new Transition(subgroups, this._parents, name, id);
+}
+
+function transition_selectAll(select) {
+ var name = this._name,
+ id = this._id;
+
+ if (typeof select !== "function") select = selectorAll(select);
+
+ for (var groups = this._groups, m = groups.length, subgroups = [], parents = [], j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, node, i = 0; i < n; ++i) {
+ if (node = group[i]) {
+ for (var children = select.call(node, node.__data__, i, group), child, inherit = get(node, id), k = 0, l = children.length; k < l; ++k) {
+ if (child = children[k]) {
+ schedule(child, name, id, k, children, inherit);
+ }
+ }
+ subgroups.push(children);
+ parents.push(node);
+ }
+ }
+ }
+
+ return new Transition(subgroups, parents, name, id);
+}
+
+var Selection = selection.prototype.constructor;
+
+function transition_selection() {
+ return new Selection(this._groups, this._parents);
+}
+
+function styleNull(name, interpolate) {
+ var string00,
+ string10,
+ interpolate0;
+ return function() {
+ var string0 = styleValue(this, name),
+ string1 = (this.style.removeProperty(name), styleValue(this, name));
+ return string0 === string1 ? null
+ : string0 === string00 && string1 === string10 ? interpolate0
+ : interpolate0 = interpolate(string00 = string0, string10 = string1);
+ };
+}
+
+function styleRemove(name) {
+ return function() {
+ this.style.removeProperty(name);
+ };
+}
+
+function styleConstant(name, interpolate, value1) {
+ var string00,
+ string1 = value1 + "",
+ interpolate0;
+ return function() {
+ var string0 = styleValue(this, name);
+ return string0 === string1 ? null
+ : string0 === string00 ? interpolate0
+ : interpolate0 = interpolate(string00 = string0, value1);
+ };
+}
+
+function styleFunction(name, interpolate, value) {
+ var string00,
+ string10,
+ interpolate0;
+ return function() {
+ var string0 = styleValue(this, name),
+ value1 = value(this),
+ string1 = value1 + "";
+ if (value1 == null) string1 = value1 = (this.style.removeProperty(name), styleValue(this, name));
+ return string0 === string1 ? null
+ : string0 === string00 && string1 === string10 ? interpolate0
+ : (string10 = string1, interpolate0 = interpolate(string00 = string0, value1));
+ };
+}
+
+function styleMaybeRemove(id, name) {
+ var on0, on1, listener0, key = "style." + name, event = "end." + key, remove;
+ return function() {
+ var schedule = set(this, id),
+ on = schedule.on,
+ listener = schedule.value[key] == null ? remove || (remove = styleRemove(name)) : undefined;
+
+ // If this node shared a dispatch with the previous node,
+ // just assign the updated shared dispatch and we’re done!
+ // Otherwise, copy-on-write.
+ if (on !== on0 || listener0 !== listener) (on1 = (on0 = on).copy()).on(event, listener0 = listener);
+
+ schedule.on = on1;
+ };
+}
+
+function transition_style(name, value, priority) {
+ var i = (name += "") === "transform" ? interpolateTransformCss : interpolate$1;
+ return value == null ? this
+ .styleTween(name, styleNull(name, i))
+ .on("end.style." + name, styleRemove(name))
+ : typeof value === "function" ? this
+ .styleTween(name, styleFunction(name, i, tweenValue(this, "style." + name, value)))
+ .each(styleMaybeRemove(this._id, name))
+ : this
+ .styleTween(name, styleConstant(name, i, value), priority)
+ .on("end.style." + name, null);
+}
+
+function styleInterpolate(name, i, priority) {
+ return function(t) {
+ this.style.setProperty(name, i.call(this, t), priority);
+ };
+}
+
+function styleTween(name, value, priority) {
+ var t, i0;
+ function tween() {
+ var i = value.apply(this, arguments);
+ if (i !== i0) t = (i0 = i) && styleInterpolate(name, i, priority);
+ return t;
+ }
+ tween._value = value;
+ return tween;
+}
+
+function transition_styleTween(name, value, priority) {
+ var key = "style." + (name += "");
+ if (arguments.length < 2) return (key = this.tween(key)) && key._value;
+ if (value == null) return this.tween(key, null);
+ if (typeof value !== "function") throw new Error;
+ return this.tween(key, styleTween(name, value, priority == null ? "" : priority));
+}
+
+function textConstant(value) {
+ return function() {
+ this.textContent = value;
+ };
+}
+
+function textFunction(value) {
+ return function() {
+ var value1 = value(this);
+ this.textContent = value1 == null ? "" : value1;
+ };
+}
+
+function transition_text(value) {
+ return this.tween("text", typeof value === "function"
+ ? textFunction(tweenValue(this, "text", value))
+ : textConstant(value == null ? "" : value + ""));
+}
+
+function textInterpolate(i) {
+ return function(t) {
+ this.textContent = i.call(this, t);
+ };
+}
+
+function textTween(value) {
+ var t0, i0;
+ function tween() {
+ var i = value.apply(this, arguments);
+ if (i !== i0) t0 = (i0 = i) && textInterpolate(i);
+ return t0;
+ }
+ tween._value = value;
+ return tween;
+}
+
+function transition_textTween(value) {
+ var key = "text";
+ if (arguments.length < 1) return (key = this.tween(key)) && key._value;
+ if (value == null) return this.tween(key, null);
+ if (typeof value !== "function") throw new Error;
+ return this.tween(key, textTween(value));
+}
+
+function transition_transition() {
+ var name = this._name,
+ id0 = this._id,
+ id1 = newId();
+
+ for (var groups = this._groups, m = groups.length, j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, node, i = 0; i < n; ++i) {
+ if (node = group[i]) {
+ var inherit = get(node, id0);
+ schedule(node, name, id1, i, group, {
+ time: inherit.time + inherit.delay + inherit.duration,
+ delay: 0,
+ duration: inherit.duration,
+ ease: inherit.ease
+ });
+ }
+ }
+ }
+
+ return new Transition(groups, this._parents, name, id1);
+}
+
+function transition_end() {
+ var on0, on1, that = this, id = that._id, size = that.size();
+ return new Promise(function(resolve, reject) {
+ var cancel = {value: reject},
+ end = {value: function() { if (--size === 0) resolve(); }};
+
+ that.each(function() {
+ var schedule = set(this, id),
+ on = schedule.on;
+
+ // If this node shared a dispatch with the previous node,
+ // just assign the updated shared dispatch and we’re done!
+ // Otherwise, copy-on-write.
+ if (on !== on0) {
+ on1 = (on0 = on).copy();
+ on1._.cancel.push(cancel);
+ on1._.interrupt.push(cancel);
+ on1._.end.push(end);
+ }
+
+ schedule.on = on1;
+ });
+
+ // The selection was empty, resolve end immediately
+ if (size === 0) resolve();
+ });
+}
+
+var id = 0;
+
+function Transition(groups, parents, name, id) {
+ this._groups = groups;
+ this._parents = parents;
+ this._name = name;
+ this._id = id;
+}
+
+function transition(name) {
+ return selection().transition(name);
+}
+
+function newId() {
+ return ++id;
+}
+
+var selection_prototype = selection.prototype;
+
+Transition.prototype = transition.prototype = {
+ constructor: Transition,
+ select: transition_select,
+ selectAll: transition_selectAll,
+ selectChild: selection_prototype.selectChild,
+ selectChildren: selection_prototype.selectChildren,
+ filter: transition_filter,
+ merge: transition_merge,
+ selection: transition_selection,
+ transition: transition_transition,
+ call: selection_prototype.call,
+ nodes: selection_prototype.nodes,
+ node: selection_prototype.node,
+ size: selection_prototype.size,
+ empty: selection_prototype.empty,
+ each: selection_prototype.each,
+ on: transition_on,
+ attr: transition_attr,
+ attrTween: transition_attrTween,
+ style: transition_style,
+ styleTween: transition_styleTween,
+ text: transition_text,
+ textTween: transition_textTween,
+ remove: transition_remove,
+ tween: transition_tween,
+ delay: transition_delay,
+ duration: transition_duration,
+ ease: transition_ease,
+ easeVarying: transition_easeVarying,
+ end: transition_end,
+ [Symbol.iterator]: selection_prototype[Symbol.iterator]
+};
+
+const linear$1 = t => +t;
+
+function quadIn(t) {
+ return t * t;
+}
+
+function quadOut(t) {
+ return t * (2 - t);
+}
+
+function quadInOut(t) {
+ return ((t *= 2) <= 1 ? t * t : --t * (2 - t) + 1) / 2;
+}
+
+function cubicIn(t) {
+ return t * t * t;
+}
+
+function cubicOut(t) {
+ return --t * t * t + 1;
+}
+
+function cubicInOut(t) {
+ return ((t *= 2) <= 1 ? t * t * t : (t -= 2) * t * t + 2) / 2;
+}
+
+var exponent$1 = 3;
+
+var polyIn = (function custom(e) {
+ e = +e;
+
+ function polyIn(t) {
+ return Math.pow(t, e);
+ }
+
+ polyIn.exponent = custom;
+
+ return polyIn;
+})(exponent$1);
+
+var polyOut = (function custom(e) {
+ e = +e;
+
+ function polyOut(t) {
+ return 1 - Math.pow(1 - t, e);
+ }
+
+ polyOut.exponent = custom;
+
+ return polyOut;
+})(exponent$1);
+
+var polyInOut = (function custom(e) {
+ e = +e;
+
+ function polyInOut(t) {
+ return ((t *= 2) <= 1 ? Math.pow(t, e) : 2 - Math.pow(2 - t, e)) / 2;
+ }
+
+ polyInOut.exponent = custom;
+
+ return polyInOut;
+})(exponent$1);
+
+var pi$4 = Math.PI,
+ halfPi$3 = pi$4 / 2;
+
+function sinIn(t) {
+ return (+t === 1) ? 1 : 1 - Math.cos(t * halfPi$3);
+}
+
+function sinOut(t) {
+ return Math.sin(t * halfPi$3);
+}
+
+function sinInOut(t) {
+ return (1 - Math.cos(pi$4 * t)) / 2;
+}
+
+// tpmt is two power minus ten times t scaled to [0,1]
+function tpmt(x) {
+ return (Math.pow(2, -10 * x) - 0.0009765625) * 1.0009775171065494;
+}
+
+function expIn(t) {
+ return tpmt(1 - +t);
+}
+
+function expOut(t) {
+ return 1 - tpmt(t);
+}
+
+function expInOut(t) {
+ return ((t *= 2) <= 1 ? tpmt(1 - t) : 2 - tpmt(t - 1)) / 2;
+}
+
+function circleIn(t) {
+ return 1 - Math.sqrt(1 - t * t);
+}
+
+function circleOut(t) {
+ return Math.sqrt(1 - --t * t);
+}
+
+function circleInOut(t) {
+ return ((t *= 2) <= 1 ? 1 - Math.sqrt(1 - t * t) : Math.sqrt(1 - (t -= 2) * t) + 1) / 2;
+}
+
+var b1 = 4 / 11,
+ b2 = 6 / 11,
+ b3 = 8 / 11,
+ b4 = 3 / 4,
+ b5 = 9 / 11,
+ b6 = 10 / 11,
+ b7 = 15 / 16,
+ b8 = 21 / 22,
+ b9 = 63 / 64,
+ b0 = 1 / b1 / b1;
+
+function bounceIn(t) {
+ return 1 - bounceOut(1 - t);
+}
+
+function bounceOut(t) {
+ return (t = +t) < b1 ? b0 * t * t : t < b3 ? b0 * (t -= b2) * t + b4 : t < b6 ? b0 * (t -= b5) * t + b7 : b0 * (t -= b8) * t + b9;
+}
+
+function bounceInOut(t) {
+ return ((t *= 2) <= 1 ? 1 - bounceOut(1 - t) : bounceOut(t - 1) + 1) / 2;
+}
+
+var overshoot = 1.70158;
+
+var backIn = (function custom(s) {
+ s = +s;
+
+ function backIn(t) {
+ return (t = +t) * t * (s * (t - 1) + t);
+ }
+
+ backIn.overshoot = custom;
+
+ return backIn;
+})(overshoot);
+
+var backOut = (function custom(s) {
+ s = +s;
+
+ function backOut(t) {
+ return --t * t * ((t + 1) * s + t) + 1;
+ }
+
+ backOut.overshoot = custom;
+
+ return backOut;
+})(overshoot);
+
+var backInOut = (function custom(s) {
+ s = +s;
+
+ function backInOut(t) {
+ return ((t *= 2) < 1 ? t * t * ((s + 1) * t - s) : (t -= 2) * t * ((s + 1) * t + s) + 2) / 2;
+ }
+
+ backInOut.overshoot = custom;
+
+ return backInOut;
+})(overshoot);
+
+var tau$5 = 2 * Math.PI,
+ amplitude = 1,
+ period = 0.3;
+
+var elasticIn = (function custom(a, p) {
+ var s = Math.asin(1 / (a = Math.max(1, a))) * (p /= tau$5);
+
+ function elasticIn(t) {
+ return a * tpmt(-(--t)) * Math.sin((s - t) / p);
+ }
+
+ elasticIn.amplitude = function(a) { return custom(a, p * tau$5); };
+ elasticIn.period = function(p) { return custom(a, p); };
+
+ return elasticIn;
+})(amplitude, period);
+
+var elasticOut = (function custom(a, p) {
+ var s = Math.asin(1 / (a = Math.max(1, a))) * (p /= tau$5);
+
+ function elasticOut(t) {
+ return 1 - a * tpmt(t = +t) * Math.sin((t + s) / p);
+ }
+
+ elasticOut.amplitude = function(a) { return custom(a, p * tau$5); };
+ elasticOut.period = function(p) { return custom(a, p); };
+
+ return elasticOut;
+})(amplitude, period);
+
+var elasticInOut = (function custom(a, p) {
+ var s = Math.asin(1 / (a = Math.max(1, a))) * (p /= tau$5);
+
+ function elasticInOut(t) {
+ return ((t = t * 2 - 1) < 0
+ ? a * tpmt(-t) * Math.sin((s - t) / p)
+ : 2 - a * tpmt(t) * Math.sin((s + t) / p)) / 2;
+ }
+
+ elasticInOut.amplitude = function(a) { return custom(a, p * tau$5); };
+ elasticInOut.period = function(p) { return custom(a, p); };
+
+ return elasticInOut;
+})(amplitude, period);
+
+var defaultTiming = {
+ time: null, // Set on use.
+ delay: 0,
+ duration: 250,
+ ease: cubicInOut
+};
+
+function inherit(node, id) {
+ var timing;
+ while (!(timing = node.__transition) || !(timing = timing[id])) {
+ if (!(node = node.parentNode)) {
+ throw new Error(`transition ${id} not found`);
+ }
+ }
+ return timing;
+}
+
+function selection_transition(name) {
+ var id,
+ timing;
+
+ if (name instanceof Transition) {
+ id = name._id, name = name._name;
+ } else {
+ id = newId(), (timing = defaultTiming).time = now(), name = name == null ? null : name + "";
+ }
+
+ for (var groups = this._groups, m = groups.length, j = 0; j < m; ++j) {
+ for (var group = groups[j], n = group.length, node, i = 0; i < n; ++i) {
+ if (node = group[i]) {
+ schedule(node, name, id, i, group, timing || inherit(node, id));
+ }
+ }
+ }
+
+ return new Transition(groups, this._parents, name, id);
+}
+
+selection.prototype.interrupt = selection_interrupt;
+selection.prototype.transition = selection_transition;
+
+var root = [null];
+
+function active(node, name) {
+ var schedules = node.__transition,
+ schedule,
+ i;
+
+ if (schedules) {
+ name = name == null ? null : name + "";
+ for (i in schedules) {
+ if ((schedule = schedules[i]).state > SCHEDULED && schedule.name === name) {
+ return new Transition([[node]], root, name, +i);
+ }
+ }
+ }
+
+ return null;
+}
+
+var constant$7 = x => () => x;
+
+function BrushEvent(type, {
+ sourceEvent,
+ target,
+ selection,
+ mode,
+ dispatch
+}) {
+ Object.defineProperties(this, {
+ type: {value: type, enumerable: true, configurable: true},
+ sourceEvent: {value: sourceEvent, enumerable: true, configurable: true},
+ target: {value: target, enumerable: true, configurable: true},
+ selection: {value: selection, enumerable: true, configurable: true},
+ mode: {value: mode, enumerable: true, configurable: true},
+ _: {value: dispatch}
+ });
+}
+
+function nopropagation$1(event) {
+ event.stopImmediatePropagation();
+}
+
+function noevent$1(event) {
+ event.preventDefault();
+ event.stopImmediatePropagation();
+}
+
+var MODE_DRAG = {name: "drag"},
+ MODE_SPACE = {name: "space"},
+ MODE_HANDLE = {name: "handle"},
+ MODE_CENTER = {name: "center"};
+
+const {abs: abs$3, max: max$2, min: min$1} = Math;
+
+function number1(e) {
+ return [+e[0], +e[1]];
+}
+
+function number2(e) {
+ return [number1(e[0]), number1(e[1])];
+}
+
+var X = {
+ name: "x",
+ handles: ["w", "e"].map(type),
+ input: function(x, e) { return x == null ? null : [[+x[0], e[0][1]], [+x[1], e[1][1]]]; },
+ output: function(xy) { return xy && [xy[0][0], xy[1][0]]; }
+};
+
+var Y = {
+ name: "y",
+ handles: ["n", "s"].map(type),
+ input: function(y, e) { return y == null ? null : [[e[0][0], +y[0]], [e[1][0], +y[1]]]; },
+ output: function(xy) { return xy && [xy[0][1], xy[1][1]]; }
+};
+
+var XY = {
+ name: "xy",
+ handles: ["n", "w", "e", "s", "nw", "ne", "sw", "se"].map(type),
+ input: function(xy) { return xy == null ? null : number2(xy); },
+ output: function(xy) { return xy; }
+};
+
+var cursors = {
+ overlay: "crosshair",
+ selection: "move",
+ n: "ns-resize",
+ e: "ew-resize",
+ s: "ns-resize",
+ w: "ew-resize",
+ nw: "nwse-resize",
+ ne: "nesw-resize",
+ se: "nwse-resize",
+ sw: "nesw-resize"
+};
+
+var flipX = {
+ e: "w",
+ w: "e",
+ nw: "ne",
+ ne: "nw",
+ se: "sw",
+ sw: "se"
+};
+
+var flipY = {
+ n: "s",
+ s: "n",
+ nw: "sw",
+ ne: "se",
+ se: "ne",
+ sw: "nw"
+};
+
+var signsX = {
+ overlay: +1,
+ selection: +1,
+ n: null,
+ e: +1,
+ s: null,
+ w: -1,
+ nw: -1,
+ ne: +1,
+ se: +1,
+ sw: -1
+};
+
+var signsY = {
+ overlay: +1,
+ selection: +1,
+ n: -1,
+ e: null,
+ s: +1,
+ w: null,
+ nw: -1,
+ ne: -1,
+ se: +1,
+ sw: +1
+};
+
+function type(t) {
+ return {type: t};
+}
+
+// Ignore right-click, since that should open the context menu.
+function defaultFilter$1(event) {
+ return !event.ctrlKey && !event.button;
+}
+
+function defaultExtent$1() {
+ var svg = this.ownerSVGElement || this;
+ if (svg.hasAttribute("viewBox")) {
+ svg = svg.viewBox.baseVal;
+ return [[svg.x, svg.y], [svg.x + svg.width, svg.y + svg.height]];
+ }
+ return [[0, 0], [svg.width.baseVal.value, svg.height.baseVal.value]];
+}
+
+function defaultTouchable$1() {
+ return navigator.maxTouchPoints || ("ontouchstart" in this);
+}
+
+// Like d3.local, but with the name “__brush” rather than auto-generated.
+function local(node) {
+ while (!node.__brush) if (!(node = node.parentNode)) return;
+ return node.__brush;
+}
+
+function empty(extent) {
+ return extent[0][0] === extent[1][0]
+ || extent[0][1] === extent[1][1];
+}
+
+function brushSelection(node) {
+ var state = node.__brush;
+ return state ? state.dim.output(state.selection) : null;
+}
+
+function brushX() {
+ return brush$1(X);
+}
+
+function brushY() {
+ return brush$1(Y);
+}
+
+function brush() {
+ return brush$1(XY);
+}
+
+function brush$1(dim) {
+ var extent = defaultExtent$1,
+ filter = defaultFilter$1,
+ touchable = defaultTouchable$1,
+ keys = true,
+ listeners = dispatch("start", "brush", "end"),
+ handleSize = 6,
+ touchending;
+
+ function brush(group) {
+ var overlay = group
+ .property("__brush", initialize)
+ .selectAll(".overlay")
+ .data([type("overlay")]);
+
+ overlay.enter().append("rect")
+ .attr("class", "overlay")
+ .attr("pointer-events", "all")
+ .attr("cursor", cursors.overlay)
+ .merge(overlay)
+ .each(function() {
+ var extent = local(this).extent;
+ select(this)
+ .attr("x", extent[0][0])
+ .attr("y", extent[0][1])
+ .attr("width", extent[1][0] - extent[0][0])
+ .attr("height", extent[1][1] - extent[0][1]);
+ });
+
+ group.selectAll(".selection")
+ .data([type("selection")])
+ .enter().append("rect")
+ .attr("class", "selection")
+ .attr("cursor", cursors.selection)
+ .attr("fill", "#777")
+ .attr("fill-opacity", 0.3)
+ .attr("stroke", "#fff")
+ .attr("shape-rendering", "crispEdges");
+
+ var handle = group.selectAll(".handle")
+ .data(dim.handles, function(d) { return d.type; });
+
+ handle.exit().remove();
+
+ handle.enter().append("rect")
+ .attr("class", function(d) { return "handle handle--" + d.type; })
+ .attr("cursor", function(d) { return cursors[d.type]; });
+
+ group
+ .each(redraw)
+ .attr("fill", "none")
+ .attr("pointer-events", "all")
+ .on("mousedown.brush", started)
+ .filter(touchable)
+ .on("touchstart.brush", started)
+ .on("touchmove.brush", touchmoved)
+ .on("touchend.brush touchcancel.brush", touchended)
+ .style("touch-action", "none")
+ .style("-webkit-tap-highlight-color", "rgba(0,0,0,0)");
+ }
+
+ brush.move = function(group, selection, event) {
+ if (group.tween) {
+ group
+ .on("start.brush", function(event) { emitter(this, arguments).beforestart().start(event); })
+ .on("interrupt.brush end.brush", function(event) { emitter(this, arguments).end(event); })
+ .tween("brush", function() {
+ var that = this,
+ state = that.__brush,
+ emit = emitter(that, arguments),
+ selection0 = state.selection,
+ selection1 = dim.input(typeof selection === "function" ? selection.apply(this, arguments) : selection, state.extent),
+ i = interpolate$2(selection0, selection1);
+
+ function tween(t) {
+ state.selection = t === 1 && selection1 === null ? null : i(t);
+ redraw.call(that);
+ emit.brush();
+ }
+
+ return selection0 !== null && selection1 !== null ? tween : tween(1);
+ });
+ } else {
+ group
+ .each(function() {
+ var that = this,
+ args = arguments,
+ state = that.__brush,
+ selection1 = dim.input(typeof selection === "function" ? selection.apply(that, args) : selection, state.extent),
+ emit = emitter(that, args).beforestart();
+
+ interrupt(that);
+ state.selection = selection1 === null ? null : selection1;
+ redraw.call(that);
+ emit.start(event).brush(event).end(event);
+ });
+ }
+ };
+
+ brush.clear = function(group, event) {
+ brush.move(group, null, event);
+ };
+
+ function redraw() {
+ var group = select(this),
+ selection = local(this).selection;
+
+ if (selection) {
+ group.selectAll(".selection")
+ .style("display", null)
+ .attr("x", selection[0][0])
+ .attr("y", selection[0][1])
+ .attr("width", selection[1][0] - selection[0][0])
+ .attr("height", selection[1][1] - selection[0][1]);
+
+ group.selectAll(".handle")
+ .style("display", null)
+ .attr("x", function(d) { return d.type[d.type.length - 1] === "e" ? selection[1][0] - handleSize / 2 : selection[0][0] - handleSize / 2; })
+ .attr("y", function(d) { return d.type[0] === "s" ? selection[1][1] - handleSize / 2 : selection[0][1] - handleSize / 2; })
+ .attr("width", function(d) { return d.type === "n" || d.type === "s" ? selection[1][0] - selection[0][0] + handleSize : handleSize; })
+ .attr("height", function(d) { return d.type === "e" || d.type === "w" ? selection[1][1] - selection[0][1] + handleSize : handleSize; });
+ }
+
+ else {
+ group.selectAll(".selection,.handle")
+ .style("display", "none")
+ .attr("x", null)
+ .attr("y", null)
+ .attr("width", null)
+ .attr("height", null);
+ }
+ }
+
+ function emitter(that, args, clean) {
+ var emit = that.__brush.emitter;
+ return emit && (!clean || !emit.clean) ? emit : new Emitter(that, args, clean);
+ }
+
+ function Emitter(that, args, clean) {
+ this.that = that;
+ this.args = args;
+ this.state = that.__brush;
+ this.active = 0;
+ this.clean = clean;
+ }
+
+ Emitter.prototype = {
+ beforestart: function() {
+ if (++this.active === 1) this.state.emitter = this, this.starting = true;
+ return this;
+ },
+ start: function(event, mode) {
+ if (this.starting) this.starting = false, this.emit("start", event, mode);
+ else this.emit("brush", event);
+ return this;
+ },
+ brush: function(event, mode) {
+ this.emit("brush", event, mode);
+ return this;
+ },
+ end: function(event, mode) {
+ if (--this.active === 0) delete this.state.emitter, this.emit("end", event, mode);
+ return this;
+ },
+ emit: function(type, event, mode) {
+ var d = select(this.that).datum();
+ listeners.call(
+ type,
+ this.that,
+ new BrushEvent(type, {
+ sourceEvent: event,
+ target: brush,
+ selection: dim.output(this.state.selection),
+ mode,
+ dispatch: listeners
+ }),
+ d
+ );
+ }
+ };
+
+ function started(event) {
+ if (touchending && !event.touches) return;
+ if (!filter.apply(this, arguments)) return;
+
+ var that = this,
+ type = event.target.__data__.type,
+ mode = (keys && event.metaKey ? type = "overlay" : type) === "selection" ? MODE_DRAG : (keys && event.altKey ? MODE_CENTER : MODE_HANDLE),
+ signX = dim === Y ? null : signsX[type],
+ signY = dim === X ? null : signsY[type],
+ state = local(that),
+ extent = state.extent,
+ selection = state.selection,
+ W = extent[0][0], w0, w1,
+ N = extent[0][1], n0, n1,
+ E = extent[1][0], e0, e1,
+ S = extent[1][1], s0, s1,
+ dx = 0,
+ dy = 0,
+ moving,
+ shifting = signX && signY && keys && event.shiftKey,
+ lockX,
+ lockY,
+ points = Array.from(event.touches || [event], t => {
+ const i = t.identifier;
+ t = pointer(t, that);
+ t.point0 = t.slice();
+ t.identifier = i;
+ return t;
+ });
+
+ interrupt(that);
+ var emit = emitter(that, arguments, true).beforestart();
+
+ if (type === "overlay") {
+ if (selection) moving = true;
+ const pts = [points[0], points[1] || points[0]];
+ state.selection = selection = [[
+ w0 = dim === Y ? W : min$1(pts[0][0], pts[1][0]),
+ n0 = dim === X ? N : min$1(pts[0][1], pts[1][1])
+ ], [
+ e0 = dim === Y ? E : max$2(pts[0][0], pts[1][0]),
+ s0 = dim === X ? S : max$2(pts[0][1], pts[1][1])
+ ]];
+ if (points.length > 1) move(event);
+ } else {
+ w0 = selection[0][0];
+ n0 = selection[0][1];
+ e0 = selection[1][0];
+ s0 = selection[1][1];
+ }
+
+ w1 = w0;
+ n1 = n0;
+ e1 = e0;
+ s1 = s0;
+
+ var group = select(that)
+ .attr("pointer-events", "none");
+
+ var overlay = group.selectAll(".overlay")
+ .attr("cursor", cursors[type]);
+
+ if (event.touches) {
+ emit.moved = moved;
+ emit.ended = ended;
+ } else {
+ var view = select(event.view)
+ .on("mousemove.brush", moved, true)
+ .on("mouseup.brush", ended, true);
+ if (keys) view
+ .on("keydown.brush", keydowned, true)
+ .on("keyup.brush", keyupped, true);
+
+ dragDisable(event.view);
+ }
+
+ redraw.call(that);
+ emit.start(event, mode.name);
+
+ function moved(event) {
+ for (const p of event.changedTouches || [event]) {
+ for (const d of points)
+ if (d.identifier === p.identifier) d.cur = pointer(p, that);
+ }
+ if (shifting && !lockX && !lockY && points.length === 1) {
+ const point = points[0];
+ if (abs$3(point.cur[0] - point[0]) > abs$3(point.cur[1] - point[1]))
+ lockY = true;
+ else
+ lockX = true;
+ }
+ for (const point of points)
+ if (point.cur) point[0] = point.cur[0], point[1] = point.cur[1];
+ moving = true;
+ noevent$1(event);
+ move(event);
+ }
+
+ function move(event) {
+ const point = points[0], point0 = point.point0;
+ var t;
+
+ dx = point[0] - point0[0];
+ dy = point[1] - point0[1];
+
+ switch (mode) {
+ case MODE_SPACE:
+ case MODE_DRAG: {
+ if (signX) dx = max$2(W - w0, min$1(E - e0, dx)), w1 = w0 + dx, e1 = e0 + dx;
+ if (signY) dy = max$2(N - n0, min$1(S - s0, dy)), n1 = n0 + dy, s1 = s0 + dy;
+ break;
+ }
+ case MODE_HANDLE: {
+ if (points[1]) {
+ if (signX) w1 = max$2(W, min$1(E, points[0][0])), e1 = max$2(W, min$1(E, points[1][0])), signX = 1;
+ if (signY) n1 = max$2(N, min$1(S, points[0][1])), s1 = max$2(N, min$1(S, points[1][1])), signY = 1;
+ } else {
+ if (signX < 0) dx = max$2(W - w0, min$1(E - w0, dx)), w1 = w0 + dx, e1 = e0;
+ else if (signX > 0) dx = max$2(W - e0, min$1(E - e0, dx)), w1 = w0, e1 = e0 + dx;
+ if (signY < 0) dy = max$2(N - n0, min$1(S - n0, dy)), n1 = n0 + dy, s1 = s0;
+ else if (signY > 0) dy = max$2(N - s0, min$1(S - s0, dy)), n1 = n0, s1 = s0 + dy;
+ }
+ break;
+ }
+ case MODE_CENTER: {
+ if (signX) w1 = max$2(W, min$1(E, w0 - dx * signX)), e1 = max$2(W, min$1(E, e0 + dx * signX));
+ if (signY) n1 = max$2(N, min$1(S, n0 - dy * signY)), s1 = max$2(N, min$1(S, s0 + dy * signY));
+ break;
+ }
+ }
+
+ if (e1 < w1) {
+ signX *= -1;
+ t = w0, w0 = e0, e0 = t;
+ t = w1, w1 = e1, e1 = t;
+ if (type in flipX) overlay.attr("cursor", cursors[type = flipX[type]]);
+ }
+
+ if (s1 < n1) {
+ signY *= -1;
+ t = n0, n0 = s0, s0 = t;
+ t = n1, n1 = s1, s1 = t;
+ if (type in flipY) overlay.attr("cursor", cursors[type = flipY[type]]);
+ }
+
+ if (state.selection) selection = state.selection; // May be set by brush.move!
+ if (lockX) w1 = selection[0][0], e1 = selection[1][0];
+ if (lockY) n1 = selection[0][1], s1 = selection[1][1];
+
+ if (selection[0][0] !== w1
+ || selection[0][1] !== n1
+ || selection[1][0] !== e1
+ || selection[1][1] !== s1) {
+ state.selection = [[w1, n1], [e1, s1]];
+ redraw.call(that);
+ emit.brush(event, mode.name);
+ }
+ }
+
+ function ended(event) {
+ nopropagation$1(event);
+ if (event.touches) {
+ if (event.touches.length) return;
+ if (touchending) clearTimeout(touchending);
+ touchending = setTimeout(function() { touchending = null; }, 500); // Ghost clicks are delayed!
+ } else {
+ yesdrag(event.view, moving);
+ view.on("keydown.brush keyup.brush mousemove.brush mouseup.brush", null);
+ }
+ group.attr("pointer-events", "all");
+ overlay.attr("cursor", cursors.overlay);
+ if (state.selection) selection = state.selection; // May be set by brush.move (on start)!
+ if (empty(selection)) state.selection = null, redraw.call(that);
+ emit.end(event, mode.name);
+ }
+
+ function keydowned(event) {
+ switch (event.keyCode) {
+ case 16: { // SHIFT
+ shifting = signX && signY;
+ break;
+ }
+ case 18: { // ALT
+ if (mode === MODE_HANDLE) {
+ if (signX) e0 = e1 - dx * signX, w0 = w1 + dx * signX;
+ if (signY) s0 = s1 - dy * signY, n0 = n1 + dy * signY;
+ mode = MODE_CENTER;
+ move(event);
+ }
+ break;
+ }
+ case 32: { // SPACE; takes priority over ALT
+ if (mode === MODE_HANDLE || mode === MODE_CENTER) {
+ if (signX < 0) e0 = e1 - dx; else if (signX > 0) w0 = w1 - dx;
+ if (signY < 0) s0 = s1 - dy; else if (signY > 0) n0 = n1 - dy;
+ mode = MODE_SPACE;
+ overlay.attr("cursor", cursors.selection);
+ move(event);
+ }
+ break;
+ }
+ default: return;
+ }
+ noevent$1(event);
+ }
+
+ function keyupped(event) {
+ switch (event.keyCode) {
+ case 16: { // SHIFT
+ if (shifting) {
+ lockX = lockY = shifting = false;
+ move(event);
+ }
+ break;
+ }
+ case 18: { // ALT
+ if (mode === MODE_CENTER) {
+ if (signX < 0) e0 = e1; else if (signX > 0) w0 = w1;
+ if (signY < 0) s0 = s1; else if (signY > 0) n0 = n1;
+ mode = MODE_HANDLE;
+ move(event);
+ }
+ break;
+ }
+ case 32: { // SPACE
+ if (mode === MODE_SPACE) {
+ if (event.altKey) {
+ if (signX) e0 = e1 - dx * signX, w0 = w1 + dx * signX;
+ if (signY) s0 = s1 - dy * signY, n0 = n1 + dy * signY;
+ mode = MODE_CENTER;
+ } else {
+ if (signX < 0) e0 = e1; else if (signX > 0) w0 = w1;
+ if (signY < 0) s0 = s1; else if (signY > 0) n0 = n1;
+ mode = MODE_HANDLE;
+ }
+ overlay.attr("cursor", cursors[type]);
+ move(event);
+ }
+ break;
+ }
+ default: return;
+ }
+ noevent$1(event);
+ }
+ }
+
+ function touchmoved(event) {
+ emitter(this, arguments).moved(event);
+ }
+
+ function touchended(event) {
+ emitter(this, arguments).ended(event);
+ }
+
+ function initialize() {
+ var state = this.__brush || {selection: null};
+ state.extent = number2(extent.apply(this, arguments));
+ state.dim = dim;
+ return state;
+ }
+
+ brush.extent = function(_) {
+ return arguments.length ? (extent = typeof _ === "function" ? _ : constant$7(number2(_)), brush) : extent;
+ };
+
+ brush.filter = function(_) {
+ return arguments.length ? (filter = typeof _ === "function" ? _ : constant$7(!!_), brush) : filter;
+ };
+
+ brush.touchable = function(_) {
+ return arguments.length ? (touchable = typeof _ === "function" ? _ : constant$7(!!_), brush) : touchable;
+ };
+
+ brush.handleSize = function(_) {
+ return arguments.length ? (handleSize = +_, brush) : handleSize;
+ };
+
+ brush.keyModifiers = function(_) {
+ return arguments.length ? (keys = !!_, brush) : keys;
+ };
+
+ brush.on = function() {
+ var value = listeners.on.apply(listeners, arguments);
+ return value === listeners ? brush : value;
+ };
+
+ return brush;
+}
+
+var abs$2 = Math.abs;
+var cos$2 = Math.cos;
+var sin$2 = Math.sin;
+var pi$3 = Math.PI;
+var halfPi$2 = pi$3 / 2;
+var tau$4 = pi$3 * 2;
+var max$1 = Math.max;
+var epsilon$5 = 1e-12;
+
+function range$1(i, j) {
+ return Array.from({length: j - i}, (_, k) => i + k);
+}
+
+function compareValue(compare) {
+ return function(a, b) {
+ return compare(
+ a.source.value + a.target.value,
+ b.source.value + b.target.value
+ );
+ };
+}
+
+function chord() {
+ return chord$1(false, false);
+}
+
+function chordTranspose() {
+ return chord$1(false, true);
+}
+
+function chordDirected() {
+ return chord$1(true, false);
+}
+
+function chord$1(directed, transpose) {
+ var padAngle = 0,
+ sortGroups = null,
+ sortSubgroups = null,
+ sortChords = null;
+
+ function chord(matrix) {
+ var n = matrix.length,
+ groupSums = new Array(n),
+ groupIndex = range$1(0, n),
+ chords = new Array(n * n),
+ groups = new Array(n),
+ k = 0, dx;
+
+ matrix = Float64Array.from({length: n * n}, transpose
+ ? (_, i) => matrix[i % n][i / n | 0]
+ : (_, i) => matrix[i / n | 0][i % n]);
+
+ // Compute the scaling factor from value to angle in [0, 2pi].
+ for (let i = 0; i < n; ++i) {
+ let x = 0;
+ for (let j = 0; j < n; ++j) x += matrix[i * n + j] + directed * matrix[j * n + i];
+ k += groupSums[i] = x;
+ }
+ k = max$1(0, tau$4 - padAngle * n) / k;
+ dx = k ? padAngle : tau$4 / n;
+
+ // Compute the angles for each group and constituent chord.
+ {
+ let x = 0;
+ if (sortGroups) groupIndex.sort((a, b) => sortGroups(groupSums[a], groupSums[b]));
+ for (const i of groupIndex) {
+ const x0 = x;
+ if (directed) {
+ const subgroupIndex = range$1(~n + 1, n).filter(j => j < 0 ? matrix[~j * n + i] : matrix[i * n + j]);
+ if (sortSubgroups) subgroupIndex.sort((a, b) => sortSubgroups(a < 0 ? -matrix[~a * n + i] : matrix[i * n + a], b < 0 ? -matrix[~b * n + i] : matrix[i * n + b]));
+ for (const j of subgroupIndex) {
+ if (j < 0) {
+ const chord = chords[~j * n + i] || (chords[~j * n + i] = {source: null, target: null});
+ chord.target = {index: i, startAngle: x, endAngle: x += matrix[~j * n + i] * k, value: matrix[~j * n + i]};
+ } else {
+ const chord = chords[i * n + j] || (chords[i * n + j] = {source: null, target: null});
+ chord.source = {index: i, startAngle: x, endAngle: x += matrix[i * n + j] * k, value: matrix[i * n + j]};
+ }
+ }
+ groups[i] = {index: i, startAngle: x0, endAngle: x, value: groupSums[i]};
+ } else {
+ const subgroupIndex = range$1(0, n).filter(j => matrix[i * n + j] || matrix[j * n + i]);
+ if (sortSubgroups) subgroupIndex.sort((a, b) => sortSubgroups(matrix[i * n + a], matrix[i * n + b]));
+ for (const j of subgroupIndex) {
+ let chord;
+ if (i < j) {
+ chord = chords[i * n + j] || (chords[i * n + j] = {source: null, target: null});
+ chord.source = {index: i, startAngle: x, endAngle: x += matrix[i * n + j] * k, value: matrix[i * n + j]};
+ } else {
+ chord = chords[j * n + i] || (chords[j * n + i] = {source: null, target: null});
+ chord.target = {index: i, startAngle: x, endAngle: x += matrix[i * n + j] * k, value: matrix[i * n + j]};
+ if (i === j) chord.source = chord.target;
+ }
+ if (chord.source && chord.target && chord.source.value < chord.target.value) {
+ const source = chord.source;
+ chord.source = chord.target;
+ chord.target = source;
+ }
+ }
+ groups[i] = {index: i, startAngle: x0, endAngle: x, value: groupSums[i]};
+ }
+ x += dx;
+ }
+ }
+
+ // Remove empty chords.
+ chords = Object.values(chords);
+ chords.groups = groups;
+ return sortChords ? chords.sort(sortChords) : chords;
+ }
+
+ chord.padAngle = function(_) {
+ return arguments.length ? (padAngle = max$1(0, _), chord) : padAngle;
+ };
+
+ chord.sortGroups = function(_) {
+ return arguments.length ? (sortGroups = _, chord) : sortGroups;
+ };
+
+ chord.sortSubgroups = function(_) {
+ return arguments.length ? (sortSubgroups = _, chord) : sortSubgroups;
+ };
+
+ chord.sortChords = function(_) {
+ return arguments.length ? (_ == null ? sortChords = null : (sortChords = compareValue(_))._ = _, chord) : sortChords && sortChords._;
+ };
+
+ return chord;
+}
+
+const pi$2 = Math.PI,
+ tau$3 = 2 * pi$2,
+ epsilon$4 = 1e-6,
+ tauEpsilon = tau$3 - epsilon$4;
+
+function append$1(strings) {
+ this._ += strings[0];
+ for (let i = 1, n = strings.length; i < n; ++i) {
+ this._ += arguments[i] + strings[i];
+ }
+}
+
+function appendRound$1(digits) {
+ let d = Math.floor(digits);
+ if (!(d >= 0)) throw new Error(`invalid digits: ${digits}`);
+ if (d > 15) return append$1;
+ const k = 10 ** d;
+ return function(strings) {
+ this._ += strings[0];
+ for (let i = 1, n = strings.length; i < n; ++i) {
+ this._ += Math.round(arguments[i] * k) / k + strings[i];
+ }
+ };
+}
+
+let Path$1 = class Path {
+ constructor(digits) {
+ this._x0 = this._y0 = // start of current subpath
+ this._x1 = this._y1 = null; // end of current subpath
+ this._ = "";
+ this._append = digits == null ? append$1 : appendRound$1(digits);
+ }
+ moveTo(x, y) {
+ this._append`M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}`;
+ }
+ closePath() {
+ if (this._x1 !== null) {
+ this._x1 = this._x0, this._y1 = this._y0;
+ this._append`Z`;
+ }
+ }
+ lineTo(x, y) {
+ this._append`L${this._x1 = +x},${this._y1 = +y}`;
+ }
+ quadraticCurveTo(x1, y1, x, y) {
+ this._append`Q${+x1},${+y1},${this._x1 = +x},${this._y1 = +y}`;
+ }
+ bezierCurveTo(x1, y1, x2, y2, x, y) {
+ this._append`C${+x1},${+y1},${+x2},${+y2},${this._x1 = +x},${this._y1 = +y}`;
+ }
+ arcTo(x1, y1, x2, y2, r) {
+ x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;
+
+ // Is the radius negative? Error.
+ if (r < 0) throw new Error(`negative radius: ${r}`);
+
+ let x0 = this._x1,
+ y0 = this._y1,
+ x21 = x2 - x1,
+ y21 = y2 - y1,
+ x01 = x0 - x1,
+ y01 = y0 - y1,
+ l01_2 = x01 * x01 + y01 * y01;
+
+ // Is this path empty? Move to (x1,y1).
+ if (this._x1 === null) {
+ this._append`M${this._x1 = x1},${this._y1 = y1}`;
+ }
+
+ // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.
+ else if (!(l01_2 > epsilon$4));
+
+ // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?
+ // Equivalently, is (x1,y1) coincident with (x2,y2)?
+ // Or, is the radius zero? Line to (x1,y1).
+ else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon$4) || !r) {
+ this._append`L${this._x1 = x1},${this._y1 = y1}`;
+ }
+
+ // Otherwise, draw an arc!
+ else {
+ let x20 = x2 - x0,
+ y20 = y2 - y0,
+ l21_2 = x21 * x21 + y21 * y21,
+ l20_2 = x20 * x20 + y20 * y20,
+ l21 = Math.sqrt(l21_2),
+ l01 = Math.sqrt(l01_2),
+ l = r * Math.tan((pi$2 - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),
+ t01 = l / l01,
+ t21 = l / l21;
+
+ // If the start tangent is not coincident with (x0,y0), line to.
+ if (Math.abs(t01 - 1) > epsilon$4) {
+ this._append`L${x1 + t01 * x01},${y1 + t01 * y01}`;
+ }
+
+ this._append`A${r},${r},0,0,${+(y01 * x20 > x01 * y20)},${this._x1 = x1 + t21 * x21},${this._y1 = y1 + t21 * y21}`;
+ }
+ }
+ arc(x, y, r, a0, a1, ccw) {
+ x = +x, y = +y, r = +r, ccw = !!ccw;
+
+ // Is the radius negative? Error.
+ if (r < 0) throw new Error(`negative radius: ${r}`);
+
+ let dx = r * Math.cos(a0),
+ dy = r * Math.sin(a0),
+ x0 = x + dx,
+ y0 = y + dy,
+ cw = 1 ^ ccw,
+ da = ccw ? a0 - a1 : a1 - a0;
+
+ // Is this path empty? Move to (x0,y0).
+ if (this._x1 === null) {
+ this._append`M${x0},${y0}`;
+ }
+
+ // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).
+ else if (Math.abs(this._x1 - x0) > epsilon$4 || Math.abs(this._y1 - y0) > epsilon$4) {
+ this._append`L${x0},${y0}`;
+ }
+
+ // Is this arc empty? We’re done.
+ if (!r) return;
+
+ // Does the angle go the wrong way? Flip the direction.
+ if (da < 0) da = da % tau$3 + tau$3;
+
+ // Is this a complete circle? Draw two arcs to complete the circle.
+ if (da > tauEpsilon) {
+ this._append`A${r},${r},0,1,${cw},${x - dx},${y - dy}A${r},${r},0,1,${cw},${this._x1 = x0},${this._y1 = y0}`;
+ }
+
+ // Is this arc non-empty? Draw an arc!
+ else if (da > epsilon$4) {
+ this._append`A${r},${r},0,${+(da >= pi$2)},${cw},${this._x1 = x + r * Math.cos(a1)},${this._y1 = y + r * Math.sin(a1)}`;
+ }
+ }
+ rect(x, y, w, h) {
+ this._append`M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}h${w = +w}v${+h}h${-w}Z`;
+ }
+ toString() {
+ return this._;
+ }
+};
+
+function path() {
+ return new Path$1;
+}
+
+// Allow instanceof d3.path
+path.prototype = Path$1.prototype;
+
+function pathRound(digits = 3) {
+ return new Path$1(+digits);
+}
+
+var slice$2 = Array.prototype.slice;
+
+function constant$6(x) {
+ return function() {
+ return x;
+ };
+}
+
+function defaultSource$1(d) {
+ return d.source;
+}
+
+function defaultTarget(d) {
+ return d.target;
+}
+
+function defaultRadius$1(d) {
+ return d.radius;
+}
+
+function defaultStartAngle(d) {
+ return d.startAngle;
+}
+
+function defaultEndAngle(d) {
+ return d.endAngle;
+}
+
+function defaultPadAngle() {
+ return 0;
+}
+
+function defaultArrowheadRadius() {
+ return 10;
+}
+
+function ribbon(headRadius) {
+ var source = defaultSource$1,
+ target = defaultTarget,
+ sourceRadius = defaultRadius$1,
+ targetRadius = defaultRadius$1,
+ startAngle = defaultStartAngle,
+ endAngle = defaultEndAngle,
+ padAngle = defaultPadAngle,
+ context = null;
+
+ function ribbon() {
+ var buffer,
+ s = source.apply(this, arguments),
+ t = target.apply(this, arguments),
+ ap = padAngle.apply(this, arguments) / 2,
+ argv = slice$2.call(arguments),
+ sr = +sourceRadius.apply(this, (argv[0] = s, argv)),
+ sa0 = startAngle.apply(this, argv) - halfPi$2,
+ sa1 = endAngle.apply(this, argv) - halfPi$2,
+ tr = +targetRadius.apply(this, (argv[0] = t, argv)),
+ ta0 = startAngle.apply(this, argv) - halfPi$2,
+ ta1 = endAngle.apply(this, argv) - halfPi$2;
+
+ if (!context) context = buffer = path();
+
+ if (ap > epsilon$5) {
+ if (abs$2(sa1 - sa0) > ap * 2 + epsilon$5) sa1 > sa0 ? (sa0 += ap, sa1 -= ap) : (sa0 -= ap, sa1 += ap);
+ else sa0 = sa1 = (sa0 + sa1) / 2;
+ if (abs$2(ta1 - ta0) > ap * 2 + epsilon$5) ta1 > ta0 ? (ta0 += ap, ta1 -= ap) : (ta0 -= ap, ta1 += ap);
+ else ta0 = ta1 = (ta0 + ta1) / 2;
+ }
+
+ context.moveTo(sr * cos$2(sa0), sr * sin$2(sa0));
+ context.arc(0, 0, sr, sa0, sa1);
+ if (sa0 !== ta0 || sa1 !== ta1) {
+ if (headRadius) {
+ var hr = +headRadius.apply(this, arguments), tr2 = tr - hr, ta2 = (ta0 + ta1) / 2;
+ context.quadraticCurveTo(0, 0, tr2 * cos$2(ta0), tr2 * sin$2(ta0));
+ context.lineTo(tr * cos$2(ta2), tr * sin$2(ta2));
+ context.lineTo(tr2 * cos$2(ta1), tr2 * sin$2(ta1));
+ } else {
+ context.quadraticCurveTo(0, 0, tr * cos$2(ta0), tr * sin$2(ta0));
+ context.arc(0, 0, tr, ta0, ta1);
+ }
+ }
+ context.quadraticCurveTo(0, 0, sr * cos$2(sa0), sr * sin$2(sa0));
+ context.closePath();
+
+ if (buffer) return context = null, buffer + "" || null;
+ }
+
+ if (headRadius) ribbon.headRadius = function(_) {
+ return arguments.length ? (headRadius = typeof _ === "function" ? _ : constant$6(+_), ribbon) : headRadius;
+ };
+
+ ribbon.radius = function(_) {
+ return arguments.length ? (sourceRadius = targetRadius = typeof _ === "function" ? _ : constant$6(+_), ribbon) : sourceRadius;
+ };
+
+ ribbon.sourceRadius = function(_) {
+ return arguments.length ? (sourceRadius = typeof _ === "function" ? _ : constant$6(+_), ribbon) : sourceRadius;
+ };
+
+ ribbon.targetRadius = function(_) {
+ return arguments.length ? (targetRadius = typeof _ === "function" ? _ : constant$6(+_), ribbon) : targetRadius;
+ };
+
+ ribbon.startAngle = function(_) {
+ return arguments.length ? (startAngle = typeof _ === "function" ? _ : constant$6(+_), ribbon) : startAngle;
+ };
+
+ ribbon.endAngle = function(_) {
+ return arguments.length ? (endAngle = typeof _ === "function" ? _ : constant$6(+_), ribbon) : endAngle;
+ };
+
+ ribbon.padAngle = function(_) {
+ return arguments.length ? (padAngle = typeof _ === "function" ? _ : constant$6(+_), ribbon) : padAngle;
+ };
+
+ ribbon.source = function(_) {
+ return arguments.length ? (source = _, ribbon) : source;
+ };
+
+ ribbon.target = function(_) {
+ return arguments.length ? (target = _, ribbon) : target;
+ };
+
+ ribbon.context = function(_) {
+ return arguments.length ? ((context = _ == null ? null : _), ribbon) : context;
+ };
+
+ return ribbon;
+}
+
+function ribbon$1() {
+ return ribbon();
+}
+
+function ribbonArrow() {
+ return ribbon(defaultArrowheadRadius);
+}
+
+var array$2 = Array.prototype;
+
+var slice$1 = array$2.slice;
+
+function ascending$1(a, b) {
+ return a - b;
+}
+
+function area$3(ring) {
+ var i = 0, n = ring.length, area = ring[n - 1][1] * ring[0][0] - ring[n - 1][0] * ring[0][1];
+ while (++i < n) area += ring[i - 1][1] * ring[i][0] - ring[i - 1][0] * ring[i][1];
+ return area;
+}
+
+var constant$5 = x => () => x;
+
+function contains$2(ring, hole) {
+ var i = -1, n = hole.length, c;
+ while (++i < n) if (c = ringContains(ring, hole[i])) return c;
+ return 0;
+}
+
+function ringContains(ring, point) {
+ var x = point[0], y = point[1], contains = -1;
+ for (var i = 0, n = ring.length, j = n - 1; i < n; j = i++) {
+ var pi = ring[i], xi = pi[0], yi = pi[1], pj = ring[j], xj = pj[0], yj = pj[1];
+ if (segmentContains(pi, pj, point)) return 0;
+ if (((yi > y) !== (yj > y)) && ((x < (xj - xi) * (y - yi) / (yj - yi) + xi))) contains = -contains;
+ }
+ return contains;
+}
+
+function segmentContains(a, b, c) {
+ var i; return collinear$1(a, b, c) && within(a[i = +(a[0] === b[0])], c[i], b[i]);
+}
+
+function collinear$1(a, b, c) {
+ return (b[0] - a[0]) * (c[1] - a[1]) === (c[0] - a[0]) * (b[1] - a[1]);
+}
+
+function within(p, q, r) {
+ return p <= q && q <= r || r <= q && q <= p;
+}
+
+function noop$2() {}
+
+var cases = [
+ [],
+ [[[1.0, 1.5], [0.5, 1.0]]],
+ [[[1.5, 1.0], [1.0, 1.5]]],
+ [[[1.5, 1.0], [0.5, 1.0]]],
+ [[[1.0, 0.5], [1.5, 1.0]]],
+ [[[1.0, 1.5], [0.5, 1.0]], [[1.0, 0.5], [1.5, 1.0]]],
+ [[[1.0, 0.5], [1.0, 1.5]]],
+ [[[1.0, 0.5], [0.5, 1.0]]],
+ [[[0.5, 1.0], [1.0, 0.5]]],
+ [[[1.0, 1.5], [1.0, 0.5]]],
+ [[[0.5, 1.0], [1.0, 0.5]], [[1.5, 1.0], [1.0, 1.5]]],
+ [[[1.5, 1.0], [1.0, 0.5]]],
+ [[[0.5, 1.0], [1.5, 1.0]]],
+ [[[1.0, 1.5], [1.5, 1.0]]],
+ [[[0.5, 1.0], [1.0, 1.5]]],
+ []
+];
+
+function Contours() {
+ var dx = 1,
+ dy = 1,
+ threshold = thresholdSturges,
+ smooth = smoothLinear;
+
+ function contours(values) {
+ var tz = threshold(values);
+
+ // Convert number of thresholds into uniform thresholds.
+ if (!Array.isArray(tz)) {
+ const e = extent$1(values, finite);
+ tz = ticks(...nice$1(e[0], e[1], tz), tz);
+ while (tz[tz.length - 1] >= e[1]) tz.pop();
+ while (tz[1] < e[0]) tz.shift();
+ } else {
+ tz = tz.slice().sort(ascending$1);
+ }
+
+ return tz.map(value => contour(values, value));
+ }
+
+ // Accumulate, smooth contour rings, assign holes to exterior rings.
+ // Based on https://github.com/mbostock/shapefile/blob/v0.6.2/shp/polygon.js
+ function contour(values, value) {
+ const v = value == null ? NaN : +value;
+ if (isNaN(v)) throw new Error(`invalid value: ${value}`);
+
+ var polygons = [],
+ holes = [];
+
+ isorings(values, v, function(ring) {
+ smooth(ring, values, v);
+ if (area$3(ring) > 0) polygons.push([ring]);
+ else holes.push(ring);
+ });
+
+ holes.forEach(function(hole) {
+ for (var i = 0, n = polygons.length, polygon; i < n; ++i) {
+ if (contains$2((polygon = polygons[i])[0], hole) !== -1) {
+ polygon.push(hole);
+ return;
+ }
+ }
+ });
+
+ return {
+ type: "MultiPolygon",
+ value: value,
+ coordinates: polygons
+ };
+ }
+
+ // Marching squares with isolines stitched into rings.
+ // Based on https://github.com/topojson/topojson-client/blob/v3.0.0/src/stitch.js
+ function isorings(values, value, callback) {
+ var fragmentByStart = new Array,
+ fragmentByEnd = new Array,
+ x, y, t0, t1, t2, t3;
+
+ // Special case for the first row (y = -1, t2 = t3 = 0).
+ x = y = -1;
+ t1 = above(values[0], value);
+ cases[t1 << 1].forEach(stitch);
+ while (++x < dx - 1) {
+ t0 = t1, t1 = above(values[x + 1], value);
+ cases[t0 | t1 << 1].forEach(stitch);
+ }
+ cases[t1 << 0].forEach(stitch);
+
+ // General case for the intermediate rows.
+ while (++y < dy - 1) {
+ x = -1;
+ t1 = above(values[y * dx + dx], value);
+ t2 = above(values[y * dx], value);
+ cases[t1 << 1 | t2 << 2].forEach(stitch);
+ while (++x < dx - 1) {
+ t0 = t1, t1 = above(values[y * dx + dx + x + 1], value);
+ t3 = t2, t2 = above(values[y * dx + x + 1], value);
+ cases[t0 | t1 << 1 | t2 << 2 | t3 << 3].forEach(stitch);
+ }
+ cases[t1 | t2 << 3].forEach(stitch);
+ }
+
+ // Special case for the last row (y = dy - 1, t0 = t1 = 0).
+ x = -1;
+ t2 = values[y * dx] >= value;
+ cases[t2 << 2].forEach(stitch);
+ while (++x < dx - 1) {
+ t3 = t2, t2 = above(values[y * dx + x + 1], value);
+ cases[t2 << 2 | t3 << 3].forEach(stitch);
+ }
+ cases[t2 << 3].forEach(stitch);
+
+ function stitch(line) {
+ var start = [line[0][0] + x, line[0][1] + y],
+ end = [line[1][0] + x, line[1][1] + y],
+ startIndex = index(start),
+ endIndex = index(end),
+ f, g;
+ if (f = fragmentByEnd[startIndex]) {
+ if (g = fragmentByStart[endIndex]) {
+ delete fragmentByEnd[f.end];
+ delete fragmentByStart[g.start];
+ if (f === g) {
+ f.ring.push(end);
+ callback(f.ring);
+ } else {
+ fragmentByStart[f.start] = fragmentByEnd[g.end] = {start: f.start, end: g.end, ring: f.ring.concat(g.ring)};
+ }
+ } else {
+ delete fragmentByEnd[f.end];
+ f.ring.push(end);
+ fragmentByEnd[f.end = endIndex] = f;
+ }
+ } else if (f = fragmentByStart[endIndex]) {
+ if (g = fragmentByEnd[startIndex]) {
+ delete fragmentByStart[f.start];
+ delete fragmentByEnd[g.end];
+ if (f === g) {
+ f.ring.push(end);
+ callback(f.ring);
+ } else {
+ fragmentByStart[g.start] = fragmentByEnd[f.end] = {start: g.start, end: f.end, ring: g.ring.concat(f.ring)};
+ }
+ } else {
+ delete fragmentByStart[f.start];
+ f.ring.unshift(start);
+ fragmentByStart[f.start = startIndex] = f;
+ }
+ } else {
+ fragmentByStart[startIndex] = fragmentByEnd[endIndex] = {start: startIndex, end: endIndex, ring: [start, end]};
+ }
+ }
+ }
+
+ function index(point) {
+ return point[0] * 2 + point[1] * (dx + 1) * 4;
+ }
+
+ function smoothLinear(ring, values, value) {
+ ring.forEach(function(point) {
+ var x = point[0],
+ y = point[1],
+ xt = x | 0,
+ yt = y | 0,
+ v1 = valid(values[yt * dx + xt]);
+ if (x > 0 && x < dx && xt === x) {
+ point[0] = smooth1(x, valid(values[yt * dx + xt - 1]), v1, value);
+ }
+ if (y > 0 && y < dy && yt === y) {
+ point[1] = smooth1(y, valid(values[(yt - 1) * dx + xt]), v1, value);
+ }
+ });
+ }
+
+ contours.contour = contour;
+
+ contours.size = function(_) {
+ if (!arguments.length) return [dx, dy];
+ var _0 = Math.floor(_[0]), _1 = Math.floor(_[1]);
+ if (!(_0 >= 0 && _1 >= 0)) throw new Error("invalid size");
+ return dx = _0, dy = _1, contours;
+ };
+
+ contours.thresholds = function(_) {
+ return arguments.length ? (threshold = typeof _ === "function" ? _ : Array.isArray(_) ? constant$5(slice$1.call(_)) : constant$5(_), contours) : threshold;
+ };
+
+ contours.smooth = function(_) {
+ return arguments.length ? (smooth = _ ? smoothLinear : noop$2, contours) : smooth === smoothLinear;
+ };
+
+ return contours;
+}
+
+// When computing the extent, ignore infinite values (as well as invalid ones).
+function finite(x) {
+ return isFinite(x) ? x : NaN;
+}
+
+// Is the (possibly invalid) x greater than or equal to the (known valid) value?
+// Treat any invalid value as below negative infinity.
+function above(x, value) {
+ return x == null ? false : +x >= value;
+}
+
+// During smoothing, treat any invalid value as negative infinity.
+function valid(v) {
+ return v == null || isNaN(v = +v) ? -Infinity : v;
+}
+
+function smooth1(x, v0, v1, value) {
+ const a = value - v0;
+ const b = v1 - v0;
+ const d = isFinite(a) || isFinite(b) ? a / b : Math.sign(a) / Math.sign(b);
+ return isNaN(d) ? x : x + d - 0.5;
+}
+
+function defaultX$1(d) {
+ return d[0];
+}
+
+function defaultY$1(d) {
+ return d[1];
+}
+
+function defaultWeight() {
+ return 1;
+}
+
+function density() {
+ var x = defaultX$1,
+ y = defaultY$1,
+ weight = defaultWeight,
+ dx = 960,
+ dy = 500,
+ r = 20, // blur radius
+ k = 2, // log2(grid cell size)
+ o = r * 3, // grid offset, to pad for blur
+ n = (dx + o * 2) >> k, // grid width
+ m = (dy + o * 2) >> k, // grid height
+ threshold = constant$5(20);
+
+ function grid(data) {
+ var values = new Float32Array(n * m),
+ pow2k = Math.pow(2, -k),
+ i = -1;
+
+ for (const d of data) {
+ var xi = (x(d, ++i, data) + o) * pow2k,
+ yi = (y(d, i, data) + o) * pow2k,
+ wi = +weight(d, i, data);
+ if (wi && xi >= 0 && xi < n && yi >= 0 && yi < m) {
+ var x0 = Math.floor(xi),
+ y0 = Math.floor(yi),
+ xt = xi - x0 - 0.5,
+ yt = yi - y0 - 0.5;
+ values[x0 + y0 * n] += (1 - xt) * (1 - yt) * wi;
+ values[x0 + 1 + y0 * n] += xt * (1 - yt) * wi;
+ values[x0 + 1 + (y0 + 1) * n] += xt * yt * wi;
+ values[x0 + (y0 + 1) * n] += (1 - xt) * yt * wi;
+ }
+ }
+
+ blur2({data: values, width: n, height: m}, r * pow2k);
+ return values;
+ }
+
+ function density(data) {
+ var values = grid(data),
+ tz = threshold(values),
+ pow4k = Math.pow(2, 2 * k);
+
+ // Convert number of thresholds into uniform thresholds.
+ if (!Array.isArray(tz)) {
+ tz = ticks(Number.MIN_VALUE, max$3(values) / pow4k, tz);
+ }
+
+ return Contours()
+ .size([n, m])
+ .thresholds(tz.map(d => d * pow4k))
+ (values)
+ .map((c, i) => (c.value = +tz[i], transform(c)));
+ }
+
+ density.contours = function(data) {
+ var values = grid(data),
+ contours = Contours().size([n, m]),
+ pow4k = Math.pow(2, 2 * k),
+ contour = value => {
+ value = +value;
+ var c = transform(contours.contour(values, value * pow4k));
+ c.value = value; // preserve exact threshold value
+ return c;
+ };
+ Object.defineProperty(contour, "max", {get: () => max$3(values) / pow4k});
+ return contour;
+ };
+
+ function transform(geometry) {
+ geometry.coordinates.forEach(transformPolygon);
+ return geometry;
+ }
+
+ function transformPolygon(coordinates) {
+ coordinates.forEach(transformRing);
+ }
+
+ function transformRing(coordinates) {
+ coordinates.forEach(transformPoint);
+ }
+
+ // TODO Optimize.
+ function transformPoint(coordinates) {
+ coordinates[0] = coordinates[0] * Math.pow(2, k) - o;
+ coordinates[1] = coordinates[1] * Math.pow(2, k) - o;
+ }
+
+ function resize() {
+ o = r * 3;
+ n = (dx + o * 2) >> k;
+ m = (dy + o * 2) >> k;
+ return density;
+ }
+
+ density.x = function(_) {
+ return arguments.length ? (x = typeof _ === "function" ? _ : constant$5(+_), density) : x;
+ };
+
+ density.y = function(_) {
+ return arguments.length ? (y = typeof _ === "function" ? _ : constant$5(+_), density) : y;
+ };
+
+ density.weight = function(_) {
+ return arguments.length ? (weight = typeof _ === "function" ? _ : constant$5(+_), density) : weight;
+ };
+
+ density.size = function(_) {
+ if (!arguments.length) return [dx, dy];
+ var _0 = +_[0], _1 = +_[1];
+ if (!(_0 >= 0 && _1 >= 0)) throw new Error("invalid size");
+ return dx = _0, dy = _1, resize();
+ };
+
+ density.cellSize = function(_) {
+ if (!arguments.length) return 1 << k;
+ if (!((_ = +_) >= 1)) throw new Error("invalid cell size");
+ return k = Math.floor(Math.log(_) / Math.LN2), resize();
+ };
+
+ density.thresholds = function(_) {
+ return arguments.length ? (threshold = typeof _ === "function" ? _ : Array.isArray(_) ? constant$5(slice$1.call(_)) : constant$5(_), density) : threshold;
+ };
+
+ density.bandwidth = function(_) {
+ if (!arguments.length) return Math.sqrt(r * (r + 1));
+ if (!((_ = +_) >= 0)) throw new Error("invalid bandwidth");
+ return r = (Math.sqrt(4 * _ * _ + 1) - 1) / 2, resize();
+ };
+
+ return density;
+}
+
+const epsilon$3 = 1.1102230246251565e-16;
+const splitter = 134217729;
+const resulterrbound = (3 + 8 * epsilon$3) * epsilon$3;
+
+// fast_expansion_sum_zeroelim routine from oritinal code
+function sum$1(elen, e, flen, f, h) {
+ let Q, Qnew, hh, bvirt;
+ let enow = e[0];
+ let fnow = f[0];
+ let eindex = 0;
+ let findex = 0;
+ if ((fnow > enow) === (fnow > -enow)) {
+ Q = enow;
+ enow = e[++eindex];
+ } else {
+ Q = fnow;
+ fnow = f[++findex];
+ }
+ let hindex = 0;
+ if (eindex < elen && findex < flen) {
+ if ((fnow > enow) === (fnow > -enow)) {
+ Qnew = enow + Q;
+ hh = Q - (Qnew - enow);
+ enow = e[++eindex];
+ } else {
+ Qnew = fnow + Q;
+ hh = Q - (Qnew - fnow);
+ fnow = f[++findex];
+ }
+ Q = Qnew;
+ if (hh !== 0) {
+ h[hindex++] = hh;
+ }
+ while (eindex < elen && findex < flen) {
+ if ((fnow > enow) === (fnow > -enow)) {
+ Qnew = Q + enow;
+ bvirt = Qnew - Q;
+ hh = Q - (Qnew - bvirt) + (enow - bvirt);
+ enow = e[++eindex];
+ } else {
+ Qnew = Q + fnow;
+ bvirt = Qnew - Q;
+ hh = Q - (Qnew - bvirt) + (fnow - bvirt);
+ fnow = f[++findex];
+ }
+ Q = Qnew;
+ if (hh !== 0) {
+ h[hindex++] = hh;
+ }
+ }
+ }
+ while (eindex < elen) {
+ Qnew = Q + enow;
+ bvirt = Qnew - Q;
+ hh = Q - (Qnew - bvirt) + (enow - bvirt);
+ enow = e[++eindex];
+ Q = Qnew;
+ if (hh !== 0) {
+ h[hindex++] = hh;
+ }
+ }
+ while (findex < flen) {
+ Qnew = Q + fnow;
+ bvirt = Qnew - Q;
+ hh = Q - (Qnew - bvirt) + (fnow - bvirt);
+ fnow = f[++findex];
+ Q = Qnew;
+ if (hh !== 0) {
+ h[hindex++] = hh;
+ }
+ }
+ if (Q !== 0 || hindex === 0) {
+ h[hindex++] = Q;
+ }
+ return hindex;
+}
+
+function estimate(elen, e) {
+ let Q = e[0];
+ for (let i = 1; i < elen; i++) Q += e[i];
+ return Q;
+}
+
+function vec(n) {
+ return new Float64Array(n);
+}
+
+const ccwerrboundA = (3 + 16 * epsilon$3) * epsilon$3;
+const ccwerrboundB = (2 + 12 * epsilon$3) * epsilon$3;
+const ccwerrboundC = (9 + 64 * epsilon$3) * epsilon$3 * epsilon$3;
+
+const B = vec(4);
+const C1 = vec(8);
+const C2 = vec(12);
+const D = vec(16);
+const u = vec(4);
+
+function orient2dadapt(ax, ay, bx, by, cx, cy, detsum) {
+ let acxtail, acytail, bcxtail, bcytail;
+ let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;
+
+ const acx = ax - cx;
+ const bcx = bx - cx;
+ const acy = ay - cy;
+ const bcy = by - cy;
+
+ s1 = acx * bcy;
+ c = splitter * acx;
+ ahi = c - (c - acx);
+ alo = acx - ahi;
+ c = splitter * bcy;
+ bhi = c - (c - bcy);
+ blo = bcy - bhi;
+ s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);
+ t1 = acy * bcx;
+ c = splitter * acy;
+ ahi = c - (c - acy);
+ alo = acy - ahi;
+ c = splitter * bcx;
+ bhi = c - (c - bcx);
+ blo = bcx - bhi;
+ t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);
+ _i = s0 - t0;
+ bvirt = s0 - _i;
+ B[0] = s0 - (_i + bvirt) + (bvirt - t0);
+ _j = s1 + _i;
+ bvirt = _j - s1;
+ _0 = s1 - (_j - bvirt) + (_i - bvirt);
+ _i = _0 - t1;
+ bvirt = _0 - _i;
+ B[1] = _0 - (_i + bvirt) + (bvirt - t1);
+ u3 = _j + _i;
+ bvirt = u3 - _j;
+ B[2] = _j - (u3 - bvirt) + (_i - bvirt);
+ B[3] = u3;
+
+ let det = estimate(4, B);
+ let errbound = ccwerrboundB * detsum;
+ if (det >= errbound || -det >= errbound) {
+ return det;
+ }
+
+ bvirt = ax - acx;
+ acxtail = ax - (acx + bvirt) + (bvirt - cx);
+ bvirt = bx - bcx;
+ bcxtail = bx - (bcx + bvirt) + (bvirt - cx);
+ bvirt = ay - acy;
+ acytail = ay - (acy + bvirt) + (bvirt - cy);
+ bvirt = by - bcy;
+ bcytail = by - (bcy + bvirt) + (bvirt - cy);
+
+ if (acxtail === 0 && acytail === 0 && bcxtail === 0 && bcytail === 0) {
+ return det;
+ }
+
+ errbound = ccwerrboundC * detsum + resulterrbound * Math.abs(det);
+ det += (acx * bcytail + bcy * acxtail) - (acy * bcxtail + bcx * acytail);
+ if (det >= errbound || -det >= errbound) return det;
+
+ s1 = acxtail * bcy;
+ c = splitter * acxtail;
+ ahi = c - (c - acxtail);
+ alo = acxtail - ahi;
+ c = splitter * bcy;
+ bhi = c - (c - bcy);
+ blo = bcy - bhi;
+ s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);
+ t1 = acytail * bcx;
+ c = splitter * acytail;
+ ahi = c - (c - acytail);
+ alo = acytail - ahi;
+ c = splitter * bcx;
+ bhi = c - (c - bcx);
+ blo = bcx - bhi;
+ t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);
+ _i = s0 - t0;
+ bvirt = s0 - _i;
+ u[0] = s0 - (_i + bvirt) + (bvirt - t0);
+ _j = s1 + _i;
+ bvirt = _j - s1;
+ _0 = s1 - (_j - bvirt) + (_i - bvirt);
+ _i = _0 - t1;
+ bvirt = _0 - _i;
+ u[1] = _0 - (_i + bvirt) + (bvirt - t1);
+ u3 = _j + _i;
+ bvirt = u3 - _j;
+ u[2] = _j - (u3 - bvirt) + (_i - bvirt);
+ u[3] = u3;
+ const C1len = sum$1(4, B, 4, u, C1);
+
+ s1 = acx * bcytail;
+ c = splitter * acx;
+ ahi = c - (c - acx);
+ alo = acx - ahi;
+ c = splitter * bcytail;
+ bhi = c - (c - bcytail);
+ blo = bcytail - bhi;
+ s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);
+ t1 = acy * bcxtail;
+ c = splitter * acy;
+ ahi = c - (c - acy);
+ alo = acy - ahi;
+ c = splitter * bcxtail;
+ bhi = c - (c - bcxtail);
+ blo = bcxtail - bhi;
+ t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);
+ _i = s0 - t0;
+ bvirt = s0 - _i;
+ u[0] = s0 - (_i + bvirt) + (bvirt - t0);
+ _j = s1 + _i;
+ bvirt = _j - s1;
+ _0 = s1 - (_j - bvirt) + (_i - bvirt);
+ _i = _0 - t1;
+ bvirt = _0 - _i;
+ u[1] = _0 - (_i + bvirt) + (bvirt - t1);
+ u3 = _j + _i;
+ bvirt = u3 - _j;
+ u[2] = _j - (u3 - bvirt) + (_i - bvirt);
+ u[3] = u3;
+ const C2len = sum$1(C1len, C1, 4, u, C2);
+
+ s1 = acxtail * bcytail;
+ c = splitter * acxtail;
+ ahi = c - (c - acxtail);
+ alo = acxtail - ahi;
+ c = splitter * bcytail;
+ bhi = c - (c - bcytail);
+ blo = bcytail - bhi;
+ s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);
+ t1 = acytail * bcxtail;
+ c = splitter * acytail;
+ ahi = c - (c - acytail);
+ alo = acytail - ahi;
+ c = splitter * bcxtail;
+ bhi = c - (c - bcxtail);
+ blo = bcxtail - bhi;
+ t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);
+ _i = s0 - t0;
+ bvirt = s0 - _i;
+ u[0] = s0 - (_i + bvirt) + (bvirt - t0);
+ _j = s1 + _i;
+ bvirt = _j - s1;
+ _0 = s1 - (_j - bvirt) + (_i - bvirt);
+ _i = _0 - t1;
+ bvirt = _0 - _i;
+ u[1] = _0 - (_i + bvirt) + (bvirt - t1);
+ u3 = _j + _i;
+ bvirt = u3 - _j;
+ u[2] = _j - (u3 - bvirt) + (_i - bvirt);
+ u[3] = u3;
+ const Dlen = sum$1(C2len, C2, 4, u, D);
+
+ return D[Dlen - 1];
+}
+
+function orient2d(ax, ay, bx, by, cx, cy) {
+ const detleft = (ay - cy) * (bx - cx);
+ const detright = (ax - cx) * (by - cy);
+ const det = detleft - detright;
+
+ const detsum = Math.abs(detleft + detright);
+ if (Math.abs(det) >= ccwerrboundA * detsum) return det;
+
+ return -orient2dadapt(ax, ay, bx, by, cx, cy, detsum);
+}
+
+const EPSILON = Math.pow(2, -52);
+const EDGE_STACK = new Uint32Array(512);
+
+class Delaunator {
+
+ static from(points, getX = defaultGetX, getY = defaultGetY) {
+ const n = points.length;
+ const coords = new Float64Array(n * 2);
+
+ for (let i = 0; i < n; i++) {
+ const p = points[i];
+ coords[2 * i] = getX(p);
+ coords[2 * i + 1] = getY(p);
+ }
+
+ return new Delaunator(coords);
+ }
+
+ constructor(coords) {
+ const n = coords.length >> 1;
+ if (n > 0 && typeof coords[0] !== 'number') throw new Error('Expected coords to contain numbers.');
+
+ this.coords = coords;
+
+ // arrays that will store the triangulation graph
+ const maxTriangles = Math.max(2 * n - 5, 0);
+ this._triangles = new Uint32Array(maxTriangles * 3);
+ this._halfedges = new Int32Array(maxTriangles * 3);
+
+ // temporary arrays for tracking the edges of the advancing convex hull
+ this._hashSize = Math.ceil(Math.sqrt(n));
+ this._hullPrev = new Uint32Array(n); // edge to prev edge
+ this._hullNext = new Uint32Array(n); // edge to next edge
+ this._hullTri = new Uint32Array(n); // edge to adjacent triangle
+ this._hullHash = new Int32Array(this._hashSize); // angular edge hash
+
+ // temporary arrays for sorting points
+ this._ids = new Uint32Array(n);
+ this._dists = new Float64Array(n);
+
+ this.update();
+ }
+
+ update() {
+ const {coords, _hullPrev: hullPrev, _hullNext: hullNext, _hullTri: hullTri, _hullHash: hullHash} = this;
+ const n = coords.length >> 1;
+
+ // populate an array of point indices; calculate input data bbox
+ let minX = Infinity;
+ let minY = Infinity;
+ let maxX = -Infinity;
+ let maxY = -Infinity;
+
+ for (let i = 0; i < n; i++) {
+ const x = coords[2 * i];
+ const y = coords[2 * i + 1];
+ if (x < minX) minX = x;
+ if (y < minY) minY = y;
+ if (x > maxX) maxX = x;
+ if (y > maxY) maxY = y;
+ this._ids[i] = i;
+ }
+ const cx = (minX + maxX) / 2;
+ const cy = (minY + maxY) / 2;
+
+ let i0, i1, i2;
+
+ // pick a seed point close to the center
+ for (let i = 0, minDist = Infinity; i < n; i++) {
+ const d = dist(cx, cy, coords[2 * i], coords[2 * i + 1]);
+ if (d < minDist) {
+ i0 = i;
+ minDist = d;
+ }
+ }
+ const i0x = coords[2 * i0];
+ const i0y = coords[2 * i0 + 1];
+
+ // find the point closest to the seed
+ for (let i = 0, minDist = Infinity; i < n; i++) {
+ if (i === i0) continue;
+ const d = dist(i0x, i0y, coords[2 * i], coords[2 * i + 1]);
+ if (d < minDist && d > 0) {
+ i1 = i;
+ minDist = d;
+ }
+ }
+ let i1x = coords[2 * i1];
+ let i1y = coords[2 * i1 + 1];
+
+ let minRadius = Infinity;
+
+ // find the third point which forms the smallest circumcircle with the first two
+ for (let i = 0; i < n; i++) {
+ if (i === i0 || i === i1) continue;
+ const r = circumradius(i0x, i0y, i1x, i1y, coords[2 * i], coords[2 * i + 1]);
+ if (r < minRadius) {
+ i2 = i;
+ minRadius = r;
+ }
+ }
+ let i2x = coords[2 * i2];
+ let i2y = coords[2 * i2 + 1];
+
+ if (minRadius === Infinity) {
+ // order collinear points by dx (or dy if all x are identical)
+ // and return the list as a hull
+ for (let i = 0; i < n; i++) {
+ this._dists[i] = (coords[2 * i] - coords[0]) || (coords[2 * i + 1] - coords[1]);
+ }
+ quicksort(this._ids, this._dists, 0, n - 1);
+ const hull = new Uint32Array(n);
+ let j = 0;
+ for (let i = 0, d0 = -Infinity; i < n; i++) {
+ const id = this._ids[i];
+ const d = this._dists[id];
+ if (d > d0) {
+ hull[j++] = id;
+ d0 = d;
+ }
+ }
+ this.hull = hull.subarray(0, j);
+ this.triangles = new Uint32Array(0);
+ this.halfedges = new Uint32Array(0);
+ return;
+ }
+
+ // swap the order of the seed points for counter-clockwise orientation
+ if (orient2d(i0x, i0y, i1x, i1y, i2x, i2y) < 0) {
+ const i = i1;
+ const x = i1x;
+ const y = i1y;
+ i1 = i2;
+ i1x = i2x;
+ i1y = i2y;
+ i2 = i;
+ i2x = x;
+ i2y = y;
+ }
+
+ const center = circumcenter(i0x, i0y, i1x, i1y, i2x, i2y);
+ this._cx = center.x;
+ this._cy = center.y;
+
+ for (let i = 0; i < n; i++) {
+ this._dists[i] = dist(coords[2 * i], coords[2 * i + 1], center.x, center.y);
+ }
+
+ // sort the points by distance from the seed triangle circumcenter
+ quicksort(this._ids, this._dists, 0, n - 1);
+
+ // set up the seed triangle as the starting hull
+ this._hullStart = i0;
+ let hullSize = 3;
+
+ hullNext[i0] = hullPrev[i2] = i1;
+ hullNext[i1] = hullPrev[i0] = i2;
+ hullNext[i2] = hullPrev[i1] = i0;
+
+ hullTri[i0] = 0;
+ hullTri[i1] = 1;
+ hullTri[i2] = 2;
+
+ hullHash.fill(-1);
+ hullHash[this._hashKey(i0x, i0y)] = i0;
+ hullHash[this._hashKey(i1x, i1y)] = i1;
+ hullHash[this._hashKey(i2x, i2y)] = i2;
+
+ this.trianglesLen = 0;
+ this._addTriangle(i0, i1, i2, -1, -1, -1);
+
+ for (let k = 0, xp, yp; k < this._ids.length; k++) {
+ const i = this._ids[k];
+ const x = coords[2 * i];
+ const y = coords[2 * i + 1];
+
+ // skip near-duplicate points
+ if (k > 0 && Math.abs(x - xp) <= EPSILON && Math.abs(y - yp) <= EPSILON) continue;
+ xp = x;
+ yp = y;
+
+ // skip seed triangle points
+ if (i === i0 || i === i1 || i === i2) continue;
+
+ // find a visible edge on the convex hull using edge hash
+ let start = 0;
+ for (let j = 0, key = this._hashKey(x, y); j < this._hashSize; j++) {
+ start = hullHash[(key + j) % this._hashSize];
+ if (start !== -1 && start !== hullNext[start]) break;
+ }
+
+ start = hullPrev[start];
+ let e = start, q;
+ while (q = hullNext[e], orient2d(x, y, coords[2 * e], coords[2 * e + 1], coords[2 * q], coords[2 * q + 1]) >= 0) {
+ e = q;
+ if (e === start) {
+ e = -1;
+ break;
+ }
+ }
+ if (e === -1) continue; // likely a near-duplicate point; skip it
+
+ // add the first triangle from the point
+ let t = this._addTriangle(e, i, hullNext[e], -1, -1, hullTri[e]);
+
+ // recursively flip triangles from the point until they satisfy the Delaunay condition
+ hullTri[i] = this._legalize(t + 2);
+ hullTri[e] = t; // keep track of boundary triangles on the hull
+ hullSize++;
+
+ // walk forward through the hull, adding more triangles and flipping recursively
+ let n = hullNext[e];
+ while (q = hullNext[n], orient2d(x, y, coords[2 * n], coords[2 * n + 1], coords[2 * q], coords[2 * q + 1]) < 0) {
+ t = this._addTriangle(n, i, q, hullTri[i], -1, hullTri[n]);
+ hullTri[i] = this._legalize(t + 2);
+ hullNext[n] = n; // mark as removed
+ hullSize--;
+ n = q;
+ }
+
+ // walk backward from the other side, adding more triangles and flipping
+ if (e === start) {
+ while (q = hullPrev[e], orient2d(x, y, coords[2 * q], coords[2 * q + 1], coords[2 * e], coords[2 * e + 1]) < 0) {
+ t = this._addTriangle(q, i, e, -1, hullTri[e], hullTri[q]);
+ this._legalize(t + 2);
+ hullTri[q] = t;
+ hullNext[e] = e; // mark as removed
+ hullSize--;
+ e = q;
+ }
+ }
+
+ // update the hull indices
+ this._hullStart = hullPrev[i] = e;
+ hullNext[e] = hullPrev[n] = i;
+ hullNext[i] = n;
+
+ // save the two new edges in the hash table
+ hullHash[this._hashKey(x, y)] = i;
+ hullHash[this._hashKey(coords[2 * e], coords[2 * e + 1])] = e;
+ }
+
+ this.hull = new Uint32Array(hullSize);
+ for (let i = 0, e = this._hullStart; i < hullSize; i++) {
+ this.hull[i] = e;
+ e = hullNext[e];
+ }
+
+ // trim typed triangle mesh arrays
+ this.triangles = this._triangles.subarray(0, this.trianglesLen);
+ this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
+ }
+
+ _hashKey(x, y) {
+ return Math.floor(pseudoAngle(x - this._cx, y - this._cy) * this._hashSize) % this._hashSize;
+ }
+
+ _legalize(a) {
+ const {_triangles: triangles, _halfedges: halfedges, coords} = this;
+
+ let i = 0;
+ let ar = 0;
+
+ // recursion eliminated with a fixed-size stack
+ while (true) {
+ const b = halfedges[a];
+
+ /* if the pair of triangles doesn't satisfy the Delaunay condition
+ * (p1 is inside the circumcircle of [p0, pl, pr]), flip them,
+ * then do the same check/flip recursively for the new pair of triangles
+ *
+ * pl pl
+ * /||\ / \
+ * al/ || \bl al/ \a
+ * / || \ / \
+ * / a||b \ flip /___ar___\
+ * p0\ || /p1 => p0\---bl---/p1
+ * \ || / \ /
+ * ar\ || /br b\ /br
+ * \||/ \ /
+ * pr pr
+ */
+ const a0 = a - a % 3;
+ ar = a0 + (a + 2) % 3;
+
+ if (b === -1) { // convex hull edge
+ if (i === 0) break;
+ a = EDGE_STACK[--i];
+ continue;
+ }
+
+ const b0 = b - b % 3;
+ const al = a0 + (a + 1) % 3;
+ const bl = b0 + (b + 2) % 3;
+
+ const p0 = triangles[ar];
+ const pr = triangles[a];
+ const pl = triangles[al];
+ const p1 = triangles[bl];
+
+ const illegal = inCircle(
+ coords[2 * p0], coords[2 * p0 + 1],
+ coords[2 * pr], coords[2 * pr + 1],
+ coords[2 * pl], coords[2 * pl + 1],
+ coords[2 * p1], coords[2 * p1 + 1]);
+
+ if (illegal) {
+ triangles[a] = p1;
+ triangles[b] = p0;
+
+ const hbl = halfedges[bl];
+
+ // edge swapped on the other side of the hull (rare); fix the halfedge reference
+ if (hbl === -1) {
+ let e = this._hullStart;
+ do {
+ if (this._hullTri[e] === bl) {
+ this._hullTri[e] = a;
+ break;
+ }
+ e = this._hullPrev[e];
+ } while (e !== this._hullStart);
+ }
+ this._link(a, hbl);
+ this._link(b, halfedges[ar]);
+ this._link(ar, bl);
+
+ const br = b0 + (b + 1) % 3;
+
+ // don't worry about hitting the cap: it can only happen on extremely degenerate input
+ if (i < EDGE_STACK.length) {
+ EDGE_STACK[i++] = br;
+ }
+ } else {
+ if (i === 0) break;
+ a = EDGE_STACK[--i];
+ }
+ }
+
+ return ar;
+ }
+
+ _link(a, b) {
+ this._halfedges[a] = b;
+ if (b !== -1) this._halfedges[b] = a;
+ }
+
+ // add a new triangle given vertex indices and adjacent half-edge ids
+ _addTriangle(i0, i1, i2, a, b, c) {
+ const t = this.trianglesLen;
+
+ this._triangles[t] = i0;
+ this._triangles[t + 1] = i1;
+ this._triangles[t + 2] = i2;
+
+ this._link(t, a);
+ this._link(t + 1, b);
+ this._link(t + 2, c);
+
+ this.trianglesLen += 3;
+
+ return t;
+ }
+}
+
+// monotonically increases with real angle, but doesn't need expensive trigonometry
+function pseudoAngle(dx, dy) {
+ const p = dx / (Math.abs(dx) + Math.abs(dy));
+ return (dy > 0 ? 3 - p : 1 + p) / 4; // [0..1]
+}
+
+function dist(ax, ay, bx, by) {
+ const dx = ax - bx;
+ const dy = ay - by;
+ return dx * dx + dy * dy;
+}
+
+function inCircle(ax, ay, bx, by, cx, cy, px, py) {
+ const dx = ax - px;
+ const dy = ay - py;
+ const ex = bx - px;
+ const ey = by - py;
+ const fx = cx - px;
+ const fy = cy - py;
+
+ const ap = dx * dx + dy * dy;
+ const bp = ex * ex + ey * ey;
+ const cp = fx * fx + fy * fy;
+
+ return dx * (ey * cp - bp * fy) -
+ dy * (ex * cp - bp * fx) +
+ ap * (ex * fy - ey * fx) < 0;
+}
+
+function circumradius(ax, ay, bx, by, cx, cy) {
+ const dx = bx - ax;
+ const dy = by - ay;
+ const ex = cx - ax;
+ const ey = cy - ay;
+
+ const bl = dx * dx + dy * dy;
+ const cl = ex * ex + ey * ey;
+ const d = 0.5 / (dx * ey - dy * ex);
+
+ const x = (ey * bl - dy * cl) * d;
+ const y = (dx * cl - ex * bl) * d;
+
+ return x * x + y * y;
+}
+
+function circumcenter(ax, ay, bx, by, cx, cy) {
+ const dx = bx - ax;
+ const dy = by - ay;
+ const ex = cx - ax;
+ const ey = cy - ay;
+
+ const bl = dx * dx + dy * dy;
+ const cl = ex * ex + ey * ey;
+ const d = 0.5 / (dx * ey - dy * ex);
+
+ const x = ax + (ey * bl - dy * cl) * d;
+ const y = ay + (dx * cl - ex * bl) * d;
+
+ return {x, y};
+}
+
+function quicksort(ids, dists, left, right) {
+ if (right - left <= 20) {
+ for (let i = left + 1; i <= right; i++) {
+ const temp = ids[i];
+ const tempDist = dists[temp];
+ let j = i - 1;
+ while (j >= left && dists[ids[j]] > tempDist) ids[j + 1] = ids[j--];
+ ids[j + 1] = temp;
+ }
+ } else {
+ const median = (left + right) >> 1;
+ let i = left + 1;
+ let j = right;
+ swap(ids, median, i);
+ if (dists[ids[left]] > dists[ids[right]]) swap(ids, left, right);
+ if (dists[ids[i]] > dists[ids[right]]) swap(ids, i, right);
+ if (dists[ids[left]] > dists[ids[i]]) swap(ids, left, i);
+
+ const temp = ids[i];
+ const tempDist = dists[temp];
+ while (true) {
+ do i++; while (dists[ids[i]] < tempDist);
+ do j--; while (dists[ids[j]] > tempDist);
+ if (j < i) break;
+ swap(ids, i, j);
+ }
+ ids[left + 1] = ids[j];
+ ids[j] = temp;
+
+ if (right - i + 1 >= j - left) {
+ quicksort(ids, dists, i, right);
+ quicksort(ids, dists, left, j - 1);
+ } else {
+ quicksort(ids, dists, left, j - 1);
+ quicksort(ids, dists, i, right);
+ }
+ }
+}
+
+function swap(arr, i, j) {
+ const tmp = arr[i];
+ arr[i] = arr[j];
+ arr[j] = tmp;
+}
+
+function defaultGetX(p) {
+ return p[0];
+}
+function defaultGetY(p) {
+ return p[1];
+}
+
+const epsilon$2 = 1e-6;
+
+class Path {
+ constructor() {
+ this._x0 = this._y0 = // start of current subpath
+ this._x1 = this._y1 = null; // end of current subpath
+ this._ = "";
+ }
+ moveTo(x, y) {
+ this._ += `M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}`;
+ }
+ closePath() {
+ if (this._x1 !== null) {
+ this._x1 = this._x0, this._y1 = this._y0;
+ this._ += "Z";
+ }
+ }
+ lineTo(x, y) {
+ this._ += `L${this._x1 = +x},${this._y1 = +y}`;
+ }
+ arc(x, y, r) {
+ x = +x, y = +y, r = +r;
+ const x0 = x + r;
+ const y0 = y;
+ if (r < 0) throw new Error("negative radius");
+ if (this._x1 === null) this._ += `M${x0},${y0}`;
+ else if (Math.abs(this._x1 - x0) > epsilon$2 || Math.abs(this._y1 - y0) > epsilon$2) this._ += "L" + x0 + "," + y0;
+ if (!r) return;
+ this._ += `A${r},${r},0,1,1,${x - r},${y}A${r},${r},0,1,1,${this._x1 = x0},${this._y1 = y0}`;
+ }
+ rect(x, y, w, h) {
+ this._ += `M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}h${+w}v${+h}h${-w}Z`;
+ }
+ value() {
+ return this._ || null;
+ }
+}
+
+class Polygon {
+ constructor() {
+ this._ = [];
+ }
+ moveTo(x, y) {
+ this._.push([x, y]);
+ }
+ closePath() {
+ this._.push(this._[0].slice());
+ }
+ lineTo(x, y) {
+ this._.push([x, y]);
+ }
+ value() {
+ return this._.length ? this._ : null;
+ }
+}
+
+class Voronoi {
+ constructor(delaunay, [xmin, ymin, xmax, ymax] = [0, 0, 960, 500]) {
+ if (!((xmax = +xmax) >= (xmin = +xmin)) || !((ymax = +ymax) >= (ymin = +ymin))) throw new Error("invalid bounds");
+ this.delaunay = delaunay;
+ this._circumcenters = new Float64Array(delaunay.points.length * 2);
+ this.vectors = new Float64Array(delaunay.points.length * 2);
+ this.xmax = xmax, this.xmin = xmin;
+ this.ymax = ymax, this.ymin = ymin;
+ this._init();
+ }
+ update() {
+ this.delaunay.update();
+ this._init();
+ return this;
+ }
+ _init() {
+ const {delaunay: {points, hull, triangles}, vectors} = this;
+ let bx, by; // lazily computed barycenter of the hull
+
+ // Compute circumcenters.
+ const circumcenters = this.circumcenters = this._circumcenters.subarray(0, triangles.length / 3 * 2);
+ for (let i = 0, j = 0, n = triangles.length, x, y; i < n; i += 3, j += 2) {
+ const t1 = triangles[i] * 2;
+ const t2 = triangles[i + 1] * 2;
+ const t3 = triangles[i + 2] * 2;
+ const x1 = points[t1];
+ const y1 = points[t1 + 1];
+ const x2 = points[t2];
+ const y2 = points[t2 + 1];
+ const x3 = points[t3];
+ const y3 = points[t3 + 1];
+
+ const dx = x2 - x1;
+ const dy = y2 - y1;
+ const ex = x3 - x1;
+ const ey = y3 - y1;
+ const ab = (dx * ey - dy * ex) * 2;
+
+ if (Math.abs(ab) < 1e-9) {
+ // For a degenerate triangle, the circumcenter is at the infinity, in a
+ // direction orthogonal to the halfedge and away from the “center” of
+ // the diagram <bx, by>, defined as the hull’s barycenter.
+ if (bx === undefined) {
+ bx = by = 0;
+ for (const i of hull) bx += points[i * 2], by += points[i * 2 + 1];
+ bx /= hull.length, by /= hull.length;
+ }
+ const a = 1e9 * Math.sign((bx - x1) * ey - (by - y1) * ex);
+ x = (x1 + x3) / 2 - a * ey;
+ y = (y1 + y3) / 2 + a * ex;
+ } else {
+ const d = 1 / ab;
+ const bl = dx * dx + dy * dy;
+ const cl = ex * ex + ey * ey;
+ x = x1 + (ey * bl - dy * cl) * d;
+ y = y1 + (dx * cl - ex * bl) * d;
+ }
+ circumcenters[j] = x;
+ circumcenters[j + 1] = y;
+ }
+
+ // Compute exterior cell rays.
+ let h = hull[hull.length - 1];
+ let p0, p1 = h * 4;
+ let x0, x1 = points[2 * h];
+ let y0, y1 = points[2 * h + 1];
+ vectors.fill(0);
+ for (let i = 0; i < hull.length; ++i) {
+ h = hull[i];
+ p0 = p1, x0 = x1, y0 = y1;
+ p1 = h * 4, x1 = points[2 * h], y1 = points[2 * h + 1];
+ vectors[p0 + 2] = vectors[p1] = y0 - y1;
+ vectors[p0 + 3] = vectors[p1 + 1] = x1 - x0;
+ }
+ }
+ render(context) {
+ const buffer = context == null ? context = new Path : undefined;
+ const {delaunay: {halfedges, inedges, hull}, circumcenters, vectors} = this;
+ if (hull.length <= 1) return null;
+ for (let i = 0, n = halfedges.length; i < n; ++i) {
+ const j = halfedges[i];
+ if (j < i) continue;
+ const ti = Math.floor(i / 3) * 2;
+ const tj = Math.floor(j / 3) * 2;
+ const xi = circumcenters[ti];
+ const yi = circumcenters[ti + 1];
+ const xj = circumcenters[tj];
+ const yj = circumcenters[tj + 1];
+ this._renderSegment(xi, yi, xj, yj, context);
+ }
+ let h0, h1 = hull[hull.length - 1];
+ for (let i = 0; i < hull.length; ++i) {
+ h0 = h1, h1 = hull[i];
+ const t = Math.floor(inedges[h1] / 3) * 2;
+ const x = circumcenters[t];
+ const y = circumcenters[t + 1];
+ const v = h0 * 4;
+ const p = this._project(x, y, vectors[v + 2], vectors[v + 3]);
+ if (p) this._renderSegment(x, y, p[0], p[1], context);
+ }
+ return buffer && buffer.value();
+ }
+ renderBounds(context) {
+ const buffer = context == null ? context = new Path : undefined;
+ context.rect(this.xmin, this.ymin, this.xmax - this.xmin, this.ymax - this.ymin);
+ return buffer && buffer.value();
+ }
+ renderCell(i, context) {
+ const buffer = context == null ? context = new Path : undefined;
+ const points = this._clip(i);
+ if (points === null || !points.length) return;
+ context.moveTo(points[0], points[1]);
+ let n = points.length;
+ while (points[0] === points[n-2] && points[1] === points[n-1] && n > 1) n -= 2;
+ for (let i = 2; i < n; i += 2) {
+ if (points[i] !== points[i-2] || points[i+1] !== points[i-1])
+ context.lineTo(points[i], points[i + 1]);
+ }
+ context.closePath();
+ return buffer && buffer.value();
+ }
+ *cellPolygons() {
+ const {delaunay: {points}} = this;
+ for (let i = 0, n = points.length / 2; i < n; ++i) {
+ const cell = this.cellPolygon(i);
+ if (cell) cell.index = i, yield cell;
+ }
+ }
+ cellPolygon(i) {
+ const polygon = new Polygon;
+ this.renderCell(i, polygon);
+ return polygon.value();
+ }
+ _renderSegment(x0, y0, x1, y1, context) {
+ let S;
+ const c0 = this._regioncode(x0, y0);
+ const c1 = this._regioncode(x1, y1);
+ if (c0 === 0 && c1 === 0) {
+ context.moveTo(x0, y0);
+ context.lineTo(x1, y1);
+ } else if (S = this._clipSegment(x0, y0, x1, y1, c0, c1)) {
+ context.moveTo(S[0], S[1]);
+ context.lineTo(S[2], S[3]);
+ }
+ }
+ contains(i, x, y) {
+ if ((x = +x, x !== x) || (y = +y, y !== y)) return false;
+ return this.delaunay._step(i, x, y) === i;
+ }
+ *neighbors(i) {
+ const ci = this._clip(i);
+ if (ci) for (const j of this.delaunay.neighbors(i)) {
+ const cj = this._clip(j);
+ // find the common edge
+ if (cj) loop: for (let ai = 0, li = ci.length; ai < li; ai += 2) {
+ for (let aj = 0, lj = cj.length; aj < lj; aj += 2) {
+ if (ci[ai] === cj[aj]
+ && ci[ai + 1] === cj[aj + 1]
+ && ci[(ai + 2) % li] === cj[(aj + lj - 2) % lj]
+ && ci[(ai + 3) % li] === cj[(aj + lj - 1) % lj]) {
+ yield j;
+ break loop;
+ }
+ }
+ }
+ }
+ }
+ _cell(i) {
+ const {circumcenters, delaunay: {inedges, halfedges, triangles}} = this;
+ const e0 = inedges[i];
+ if (e0 === -1) return null; // coincident point
+ const points = [];
+ let e = e0;
+ do {
+ const t = Math.floor(e / 3);
+ points.push(circumcenters[t * 2], circumcenters[t * 2 + 1]);
+ e = e % 3 === 2 ? e - 2 : e + 1;
+ if (triangles[e] !== i) break; // bad triangulation
+ e = halfedges[e];
+ } while (e !== e0 && e !== -1);
+ return points;
+ }
+ _clip(i) {
+ // degenerate case (1 valid point: return the box)
+ if (i === 0 && this.delaunay.hull.length === 1) {
+ return [this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax, this.xmin, this.ymin];
+ }
+ const points = this._cell(i);
+ if (points === null) return null;
+ const {vectors: V} = this;
+ const v = i * 4;
+ return this._simplify(V[v] || V[v + 1]
+ ? this._clipInfinite(i, points, V[v], V[v + 1], V[v + 2], V[v + 3])
+ : this._clipFinite(i, points));
+ }
+ _clipFinite(i, points) {
+ const n = points.length;
+ let P = null;
+ let x0, y0, x1 = points[n - 2], y1 = points[n - 1];
+ let c0, c1 = this._regioncode(x1, y1);
+ let e0, e1 = 0;
+ for (let j = 0; j < n; j += 2) {
+ x0 = x1, y0 = y1, x1 = points[j], y1 = points[j + 1];
+ c0 = c1, c1 = this._regioncode(x1, y1);
+ if (c0 === 0 && c1 === 0) {
+ e0 = e1, e1 = 0;
+ if (P) P.push(x1, y1);
+ else P = [x1, y1];
+ } else {
+ let S, sx0, sy0, sx1, sy1;
+ if (c0 === 0) {
+ if ((S = this._clipSegment(x0, y0, x1, y1, c0, c1)) === null) continue;
+ [sx0, sy0, sx1, sy1] = S;
+ } else {
+ if ((S = this._clipSegment(x1, y1, x0, y0, c1, c0)) === null) continue;
+ [sx1, sy1, sx0, sy0] = S;
+ e0 = e1, e1 = this._edgecode(sx0, sy0);
+ if (e0 && e1) this._edge(i, e0, e1, P, P.length);
+ if (P) P.push(sx0, sy0);
+ else P = [sx0, sy0];
+ }
+ e0 = e1, e1 = this._edgecode(sx1, sy1);
+ if (e0 && e1) this._edge(i, e0, e1, P, P.length);
+ if (P) P.push(sx1, sy1);
+ else P = [sx1, sy1];
+ }
+ }
+ if (P) {
+ e0 = e1, e1 = this._edgecode(P[0], P[1]);
+ if (e0 && e1) this._edge(i, e0, e1, P, P.length);
+ } else if (this.contains(i, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2)) {
+ return [this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax, this.xmin, this.ymin];
+ }
+ return P;
+ }
+ _clipSegment(x0, y0, x1, y1, c0, c1) {
+ // for more robustness, always consider the segment in the same order
+ const flip = c0 < c1;
+ if (flip) [x0, y0, x1, y1, c0, c1] = [x1, y1, x0, y0, c1, c0];
+ while (true) {
+ if (c0 === 0 && c1 === 0) return flip ? [x1, y1, x0, y0] : [x0, y0, x1, y1];
+ if (c0 & c1) return null;
+ let x, y, c = c0 || c1;
+ if (c & 0b1000) x = x0 + (x1 - x0) * (this.ymax - y0) / (y1 - y0), y = this.ymax;
+ else if (c & 0b0100) x = x0 + (x1 - x0) * (this.ymin - y0) / (y1 - y0), y = this.ymin;
+ else if (c & 0b0010) y = y0 + (y1 - y0) * (this.xmax - x0) / (x1 - x0), x = this.xmax;
+ else y = y0 + (y1 - y0) * (this.xmin - x0) / (x1 - x0), x = this.xmin;
+ if (c0) x0 = x, y0 = y, c0 = this._regioncode(x0, y0);
+ else x1 = x, y1 = y, c1 = this._regioncode(x1, y1);
+ }
+ }
+ _clipInfinite(i, points, vx0, vy0, vxn, vyn) {
+ let P = Array.from(points), p;
+ if (p = this._project(P[0], P[1], vx0, vy0)) P.unshift(p[0], p[1]);
+ if (p = this._project(P[P.length - 2], P[P.length - 1], vxn, vyn)) P.push(p[0], p[1]);
+ if (P = this._clipFinite(i, P)) {
+ for (let j = 0, n = P.length, c0, c1 = this._edgecode(P[n - 2], P[n - 1]); j < n; j += 2) {
+ c0 = c1, c1 = this._edgecode(P[j], P[j + 1]);
+ if (c0 && c1) j = this._edge(i, c0, c1, P, j), n = P.length;
+ }
+ } else if (this.contains(i, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2)) {
+ P = [this.xmin, this.ymin, this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax];
+ }
+ return P;
+ }
+ _edge(i, e0, e1, P, j) {
+ while (e0 !== e1) {
+ let x, y;
+ switch (e0) {
+ case 0b0101: e0 = 0b0100; continue; // top-left
+ case 0b0100: e0 = 0b0110, x = this.xmax, y = this.ymin; break; // top
+ case 0b0110: e0 = 0b0010; continue; // top-right
+ case 0b0010: e0 = 0b1010, x = this.xmax, y = this.ymax; break; // right
+ case 0b1010: e0 = 0b1000; continue; // bottom-right
+ case 0b1000: e0 = 0b1001, x = this.xmin, y = this.ymax; break; // bottom
+ case 0b1001: e0 = 0b0001; continue; // bottom-left
+ case 0b0001: e0 = 0b0101, x = this.xmin, y = this.ymin; break; // left
+ }
+ // Note: this implicitly checks for out of bounds: if P[j] or P[j+1] are
+ // undefined, the conditional statement will be executed.
+ if ((P[j] !== x || P[j + 1] !== y) && this.contains(i, x, y)) {
+ P.splice(j, 0, x, y), j += 2;
+ }
+ }
+ return j;
+ }
+ _project(x0, y0, vx, vy) {
+ let t = Infinity, c, x, y;
+ if (vy < 0) { // top
+ if (y0 <= this.ymin) return null;
+ if ((c = (this.ymin - y0) / vy) < t) y = this.ymin, x = x0 + (t = c) * vx;
+ } else if (vy > 0) { // bottom
+ if (y0 >= this.ymax) return null;
+ if ((c = (this.ymax - y0) / vy) < t) y = this.ymax, x = x0 + (t = c) * vx;
+ }
+ if (vx > 0) { // right
+ if (x0 >= this.xmax) return null;
+ if ((c = (this.xmax - x0) / vx) < t) x = this.xmax, y = y0 + (t = c) * vy;
+ } else if (vx < 0) { // left
+ if (x0 <= this.xmin) return null;
+ if ((c = (this.xmin - x0) / vx) < t) x = this.xmin, y = y0 + (t = c) * vy;
+ }
+ return [x, y];
+ }
+ _edgecode(x, y) {
+ return (x === this.xmin ? 0b0001
+ : x === this.xmax ? 0b0010 : 0b0000)
+ | (y === this.ymin ? 0b0100
+ : y === this.ymax ? 0b1000 : 0b0000);
+ }
+ _regioncode(x, y) {
+ return (x < this.xmin ? 0b0001
+ : x > this.xmax ? 0b0010 : 0b0000)
+ | (y < this.ymin ? 0b0100
+ : y > this.ymax ? 0b1000 : 0b0000);
+ }
+ _simplify(P) {
+ if (P && P.length > 4) {
+ for (let i = 0; i < P.length; i+= 2) {
+ const j = (i + 2) % P.length, k = (i + 4) % P.length;
+ if (P[i] === P[j] && P[j] === P[k] || P[i + 1] === P[j + 1] && P[j + 1] === P[k + 1]) {
+ P.splice(j, 2), i -= 2;
+ }
+ }
+ if (!P.length) P = null;
+ }
+ return P;
+ }
+}
+
+const tau$2 = 2 * Math.PI, pow$2 = Math.pow;
+
+function pointX(p) {
+ return p[0];
+}
+
+function pointY(p) {
+ return p[1];
+}
+
+// A triangulation is collinear if all its triangles have a non-null area
+function collinear(d) {
+ const {triangles, coords} = d;
+ for (let i = 0; i < triangles.length; i += 3) {
+ const a = 2 * triangles[i],
+ b = 2 * triangles[i + 1],
+ c = 2 * triangles[i + 2],
+ cross = (coords[c] - coords[a]) * (coords[b + 1] - coords[a + 1])
+ - (coords[b] - coords[a]) * (coords[c + 1] - coords[a + 1]);
+ if (cross > 1e-10) return false;
+ }
+ return true;
+}
+
+function jitter(x, y, r) {
+ return [x + Math.sin(x + y) * r, y + Math.cos(x - y) * r];
+}
+
+class Delaunay {
+ static from(points, fx = pointX, fy = pointY, that) {
+ return new Delaunay("length" in points
+ ? flatArray(points, fx, fy, that)
+ : Float64Array.from(flatIterable(points, fx, fy, that)));
+ }
+ constructor(points) {
+ this._delaunator = new Delaunator(points);
+ this.inedges = new Int32Array(points.length / 2);
+ this._hullIndex = new Int32Array(points.length / 2);
+ this.points = this._delaunator.coords;
+ this._init();
+ }
+ update() {
+ this._delaunator.update();
+ this._init();
+ return this;
+ }
+ _init() {
+ const d = this._delaunator, points = this.points;
+
+ // check for collinear
+ if (d.hull && d.hull.length > 2 && collinear(d)) {
+ this.collinear = Int32Array.from({length: points.length/2}, (_,i) => i)
+ .sort((i, j) => points[2 * i] - points[2 * j] || points[2 * i + 1] - points[2 * j + 1]); // for exact neighbors
+ const e = this.collinear[0], f = this.collinear[this.collinear.length - 1],
+ bounds = [ points[2 * e], points[2 * e + 1], points[2 * f], points[2 * f + 1] ],
+ r = 1e-8 * Math.hypot(bounds[3] - bounds[1], bounds[2] - bounds[0]);
+ for (let i = 0, n = points.length / 2; i < n; ++i) {
+ const p = jitter(points[2 * i], points[2 * i + 1], r);
+ points[2 * i] = p[0];
+ points[2 * i + 1] = p[1];
+ }
+ this._delaunator = new Delaunator(points);
+ } else {
+ delete this.collinear;
+ }
+
+ const halfedges = this.halfedges = this._delaunator.halfedges;
+ const hull = this.hull = this._delaunator.hull;
+ const triangles = this.triangles = this._delaunator.triangles;
+ const inedges = this.inedges.fill(-1);
+ const hullIndex = this._hullIndex.fill(-1);
+
+ // Compute an index from each point to an (arbitrary) incoming halfedge
+ // Used to give the first neighbor of each point; for this reason,
+ // on the hull we give priority to exterior halfedges
+ for (let e = 0, n = halfedges.length; e < n; ++e) {
+ const p = triangles[e % 3 === 2 ? e - 2 : e + 1];
+ if (halfedges[e] === -1 || inedges[p] === -1) inedges[p] = e;
+ }
+ for (let i = 0, n = hull.length; i < n; ++i) {
+ hullIndex[hull[i]] = i;
+ }
+
+ // degenerate case: 1 or 2 (distinct) points
+ if (hull.length <= 2 && hull.length > 0) {
+ this.triangles = new Int32Array(3).fill(-1);
+ this.halfedges = new Int32Array(3).fill(-1);
+ this.triangles[0] = hull[0];
+ inedges[hull[0]] = 1;
+ if (hull.length === 2) {
+ inedges[hull[1]] = 0;
+ this.triangles[1] = hull[1];
+ this.triangles[2] = hull[1];
+ }
+ }
+ }
+ voronoi(bounds) {
+ return new Voronoi(this, bounds);
+ }
+ *neighbors(i) {
+ const {inedges, hull, _hullIndex, halfedges, triangles, collinear} = this;
+
+ // degenerate case with several collinear points
+ if (collinear) {
+ const l = collinear.indexOf(i);
+ if (l > 0) yield collinear[l - 1];
+ if (l < collinear.length - 1) yield collinear[l + 1];
+ return;
+ }
+
+ const e0 = inedges[i];
+ if (e0 === -1) return; // coincident point
+ let e = e0, p0 = -1;
+ do {
+ yield p0 = triangles[e];
+ e = e % 3 === 2 ? e - 2 : e + 1;
+ if (triangles[e] !== i) return; // bad triangulation
+ e = halfedges[e];
+ if (e === -1) {
+ const p = hull[(_hullIndex[i] + 1) % hull.length];
+ if (p !== p0) yield p;
+ return;
+ }
+ } while (e !== e0);
+ }
+ find(x, y, i = 0) {
+ if ((x = +x, x !== x) || (y = +y, y !== y)) return -1;
+ const i0 = i;
+ let c;
+ while ((c = this._step(i, x, y)) >= 0 && c !== i && c !== i0) i = c;
+ return c;
+ }
+ _step(i, x, y) {
+ const {inedges, hull, _hullIndex, halfedges, triangles, points} = this;
+ if (inedges[i] === -1 || !points.length) return (i + 1) % (points.length >> 1);
+ let c = i;
+ let dc = pow$2(x - points[i * 2], 2) + pow$2(y - points[i * 2 + 1], 2);
+ const e0 = inedges[i];
+ let e = e0;
+ do {
+ let t = triangles[e];
+ const dt = pow$2(x - points[t * 2], 2) + pow$2(y - points[t * 2 + 1], 2);
+ if (dt < dc) dc = dt, c = t;
+ e = e % 3 === 2 ? e - 2 : e + 1;
+ if (triangles[e] !== i) break; // bad triangulation
+ e = halfedges[e];
+ if (e === -1) {
+ e = hull[(_hullIndex[i] + 1) % hull.length];
+ if (e !== t) {
+ if (pow$2(x - points[e * 2], 2) + pow$2(y - points[e * 2 + 1], 2) < dc) return e;
+ }
+ break;
+ }
+ } while (e !== e0);
+ return c;
+ }
+ render(context) {
+ const buffer = context == null ? context = new Path : undefined;
+ const {points, halfedges, triangles} = this;
+ for (let i = 0, n = halfedges.length; i < n; ++i) {
+ const j = halfedges[i];
+ if (j < i) continue;
+ const ti = triangles[i] * 2;
+ const tj = triangles[j] * 2;
+ context.moveTo(points[ti], points[ti + 1]);
+ context.lineTo(points[tj], points[tj + 1]);
+ }
+ this.renderHull(context);
+ return buffer && buffer.value();
+ }
+ renderPoints(context, r) {
+ if (r === undefined && (!context || typeof context.moveTo !== "function")) r = context, context = null;
+ r = r == undefined ? 2 : +r;
+ const buffer = context == null ? context = new Path : undefined;
+ const {points} = this;
+ for (let i = 0, n = points.length; i < n; i += 2) {
+ const x = points[i], y = points[i + 1];
+ context.moveTo(x + r, y);
+ context.arc(x, y, r, 0, tau$2);
+ }
+ return buffer && buffer.value();
+ }
+ renderHull(context) {
+ const buffer = context == null ? context = new Path : undefined;
+ const {hull, points} = this;
+ const h = hull[0] * 2, n = hull.length;
+ context.moveTo(points[h], points[h + 1]);
+ for (let i = 1; i < n; ++i) {
+ const h = 2 * hull[i];
+ context.lineTo(points[h], points[h + 1]);
+ }
+ context.closePath();
+ return buffer && buffer.value();
+ }
+ hullPolygon() {
+ const polygon = new Polygon;
+ this.renderHull(polygon);
+ return polygon.value();
+ }
+ renderTriangle(i, context) {
+ const buffer = context == null ? context = new Path : undefined;
+ const {points, triangles} = this;
+ const t0 = triangles[i *= 3] * 2;
+ const t1 = triangles[i + 1] * 2;
+ const t2 = triangles[i + 2] * 2;
+ context.moveTo(points[t0], points[t0 + 1]);
+ context.lineTo(points[t1], points[t1 + 1]);
+ context.lineTo(points[t2], points[t2 + 1]);
+ context.closePath();
+ return buffer && buffer.value();
+ }
+ *trianglePolygons() {
+ const {triangles} = this;
+ for (let i = 0, n = triangles.length / 3; i < n; ++i) {
+ yield this.trianglePolygon(i);
+ }
+ }
+ trianglePolygon(i) {
+ const polygon = new Polygon;
+ this.renderTriangle(i, polygon);
+ return polygon.value();
+ }
+}
+
+function flatArray(points, fx, fy, that) {
+ const n = points.length;
+ const array = new Float64Array(n * 2);
+ for (let i = 0; i < n; ++i) {
+ const p = points[i];
+ array[i * 2] = fx.call(that, p, i, points);
+ array[i * 2 + 1] = fy.call(that, p, i, points);
+ }
+ return array;
+}
+
+function* flatIterable(points, fx, fy, that) {
+ let i = 0;
+ for (const p of points) {
+ yield fx.call(that, p, i, points);
+ yield fy.call(that, p, i, points);
+ ++i;
+ }
+}
+
+var EOL = {},
+ EOF = {},
+ QUOTE = 34,
+ NEWLINE = 10,
+ RETURN = 13;
+
+function objectConverter(columns) {
+ return new Function("d", "return {" + columns.map(function(name, i) {
+ return JSON.stringify(name) + ": d[" + i + "] || \"\"";
+ }).join(",") + "}");
+}
+
+function customConverter(columns, f) {
+ var object = objectConverter(columns);
+ return function(row, i) {
+ return f(object(row), i, columns);
+ };
+}
+
+// Compute unique columns in order of discovery.
+function inferColumns(rows) {
+ var columnSet = Object.create(null),
+ columns = [];
+
+ rows.forEach(function(row) {
+ for (var column in row) {
+ if (!(column in columnSet)) {
+ columns.push(columnSet[column] = column);
+ }
+ }
+ });
+
+ return columns;
+}
+
+function pad$1(value, width) {
+ var s = value + "", length = s.length;
+ return length < width ? new Array(width - length + 1).join(0) + s : s;
+}
+
+function formatYear$1(year) {
+ return year < 0 ? "-" + pad$1(-year, 6)
+ : year > 9999 ? "+" + pad$1(year, 6)
+ : pad$1(year, 4);
+}
+
+function formatDate(date) {
+ var hours = date.getUTCHours(),
+ minutes = date.getUTCMinutes(),
+ seconds = date.getUTCSeconds(),
+ milliseconds = date.getUTCMilliseconds();
+ return isNaN(date) ? "Invalid Date"
+ : formatYear$1(date.getUTCFullYear()) + "-" + pad$1(date.getUTCMonth() + 1, 2) + "-" + pad$1(date.getUTCDate(), 2)
+ + (milliseconds ? "T" + pad$1(hours, 2) + ":" + pad$1(minutes, 2) + ":" + pad$1(seconds, 2) + "." + pad$1(milliseconds, 3) + "Z"
+ : seconds ? "T" + pad$1(hours, 2) + ":" + pad$1(minutes, 2) + ":" + pad$1(seconds, 2) + "Z"
+ : minutes || hours ? "T" + pad$1(hours, 2) + ":" + pad$1(minutes, 2) + "Z"
+ : "");
+}
+
+function dsvFormat(delimiter) {
+ var reFormat = new RegExp("[\"" + delimiter + "\n\r]"),
+ DELIMITER = delimiter.charCodeAt(0);
+
+ function parse(text, f) {
+ var convert, columns, rows = parseRows(text, function(row, i) {
+ if (convert) return convert(row, i - 1);
+ columns = row, convert = f ? customConverter(row, f) : objectConverter(row);
+ });
+ rows.columns = columns || [];
+ return rows;
+ }
+
+ function parseRows(text, f) {
+ var rows = [], // output rows
+ N = text.length,
+ I = 0, // current character index
+ n = 0, // current line number
+ t, // current token
+ eof = N <= 0, // current token followed by EOF?
+ eol = false; // current token followed by EOL?
+
+ // Strip the trailing newline.
+ if (text.charCodeAt(N - 1) === NEWLINE) --N;
+ if (text.charCodeAt(N - 1) === RETURN) --N;
+
+ function token() {
+ if (eof) return EOF;
+ if (eol) return eol = false, EOL;
+
+ // Unescape quotes.
+ var i, j = I, c;
+ if (text.charCodeAt(j) === QUOTE) {
+ while (I++ < N && text.charCodeAt(I) !== QUOTE || text.charCodeAt(++I) === QUOTE);
+ if ((i = I) >= N) eof = true;
+ else if ((c = text.charCodeAt(I++)) === NEWLINE) eol = true;
+ else if (c === RETURN) { eol = true; if (text.charCodeAt(I) === NEWLINE) ++I; }
+ return text.slice(j + 1, i - 1).replace(/""/g, "\"");
+ }
+
+ // Find next delimiter or newline.
+ while (I < N) {
+ if ((c = text.charCodeAt(i = I++)) === NEWLINE) eol = true;
+ else if (c === RETURN) { eol = true; if (text.charCodeAt(I) === NEWLINE) ++I; }
+ else if (c !== DELIMITER) continue;
+ return text.slice(j, i);
+ }
+
+ // Return last token before EOF.
+ return eof = true, text.slice(j, N);
+ }
+
+ while ((t = token()) !== EOF) {
+ var row = [];
+ while (t !== EOL && t !== EOF) row.push(t), t = token();
+ if (f && (row = f(row, n++)) == null) continue;
+ rows.push(row);
+ }
+
+ return rows;
+ }
+
+ function preformatBody(rows, columns) {
+ return rows.map(function(row) {
+ return columns.map(function(column) {
+ return formatValue(row[column]);
+ }).join(delimiter);
+ });
+ }
+
+ function format(rows, columns) {
+ if (columns == null) columns = inferColumns(rows);
+ return [columns.map(formatValue).join(delimiter)].concat(preformatBody(rows, columns)).join("\n");
+ }
+
+ function formatBody(rows, columns) {
+ if (columns == null) columns = inferColumns(rows);
+ return preformatBody(rows, columns).join("\n");
+ }
+
+ function formatRows(rows) {
+ return rows.map(formatRow).join("\n");
+ }
+
+ function formatRow(row) {
+ return row.map(formatValue).join(delimiter);
+ }
+
+ function formatValue(value) {
+ return value == null ? ""
+ : value instanceof Date ? formatDate(value)
+ : reFormat.test(value += "") ? "\"" + value.replace(/"/g, "\"\"") + "\""
+ : value;
+ }
+
+ return {
+ parse: parse,
+ parseRows: parseRows,
+ format: format,
+ formatBody: formatBody,
+ formatRows: formatRows,
+ formatRow: formatRow,
+ formatValue: formatValue
+ };
+}
+
+var csv$1 = dsvFormat(",");
+
+var csvParse = csv$1.parse;
+var csvParseRows = csv$1.parseRows;
+var csvFormat = csv$1.format;
+var csvFormatBody = csv$1.formatBody;
+var csvFormatRows = csv$1.formatRows;
+var csvFormatRow = csv$1.formatRow;
+var csvFormatValue = csv$1.formatValue;
+
+var tsv$1 = dsvFormat("\t");
+
+var tsvParse = tsv$1.parse;
+var tsvParseRows = tsv$1.parseRows;
+var tsvFormat = tsv$1.format;
+var tsvFormatBody = tsv$1.formatBody;
+var tsvFormatRows = tsv$1.formatRows;
+var tsvFormatRow = tsv$1.formatRow;
+var tsvFormatValue = tsv$1.formatValue;
+
+function autoType(object) {
+ for (var key in object) {
+ var value = object[key].trim(), number, m;
+ if (!value) value = null;
+ else if (value === "true") value = true;
+ else if (value === "false") value = false;
+ else if (value === "NaN") value = NaN;
+ else if (!isNaN(number = +value)) value = number;
+ else if (m = value.match(/^([-+]\d{2})?\d{4}(-\d{2}(-\d{2})?)?(T\d{2}:\d{2}(:\d{2}(\.\d{3})?)?(Z|[-+]\d{2}:\d{2})?)?$/)) {
+ if (fixtz && !!m[4] && !m[7]) value = value.replace(/-/g, "/").replace(/T/, " ");
+ value = new Date(value);
+ }
+ else continue;
+ object[key] = value;
+ }
+ return object;
+}
+
+// https://github.com/d3/d3-dsv/issues/45
+const fixtz = new Date("2019-01-01T00:00").getHours() || new Date("2019-07-01T00:00").getHours();
+
+function responseBlob(response) {
+ if (!response.ok) throw new Error(response.status + " " + response.statusText);
+ return response.blob();
+}
+
+function blob(input, init) {
+ return fetch(input, init).then(responseBlob);
+}
+
+function responseArrayBuffer(response) {
+ if (!response.ok) throw new Error(response.status + " " + response.statusText);
+ return response.arrayBuffer();
+}
+
+function buffer(input, init) {
+ return fetch(input, init).then(responseArrayBuffer);
+}
+
+function responseText(response) {
+ if (!response.ok) throw new Error(response.status + " " + response.statusText);
+ return response.text();
+}
+
+function text(input, init) {
+ return fetch(input, init).then(responseText);
+}
+
+function dsvParse(parse) {
+ return function(input, init, row) {
+ if (arguments.length === 2 && typeof init === "function") row = init, init = undefined;
+ return text(input, init).then(function(response) {
+ return parse(response, row);
+ });
+ };
+}
+
+function dsv(delimiter, input, init, row) {
+ if (arguments.length === 3 && typeof init === "function") row = init, init = undefined;
+ var format = dsvFormat(delimiter);
+ return text(input, init).then(function(response) {
+ return format.parse(response, row);
+ });
+}
+
+var csv = dsvParse(csvParse);
+var tsv = dsvParse(tsvParse);
+
+function image(input, init) {
+ return new Promise(function(resolve, reject) {
+ var image = new Image;
+ for (var key in init) image[key] = init[key];
+ image.onerror = reject;
+ image.onload = function() { resolve(image); };
+ image.src = input;
+ });
+}
+
+function responseJson(response) {
+ if (!response.ok) throw new Error(response.status + " " + response.statusText);
+ if (response.status === 204 || response.status === 205) return;
+ return response.json();
+}
+
+function json(input, init) {
+ return fetch(input, init).then(responseJson);
+}
+
+function parser(type) {
+ return (input, init) => text(input, init)
+ .then(text => (new DOMParser).parseFromString(text, type));
+}
+
+var xml = parser("application/xml");
+
+var html = parser("text/html");
+
+var svg = parser("image/svg+xml");
+
+function center(x, y) {
+ var nodes, strength = 1;
+
+ if (x == null) x = 0;
+ if (y == null) y = 0;
+
+ function force() {
+ var i,
+ n = nodes.length,
+ node,
+ sx = 0,
+ sy = 0;
+
+ for (i = 0; i < n; ++i) {
+ node = nodes[i], sx += node.x, sy += node.y;
+ }
+
+ for (sx = (sx / n - x) * strength, sy = (sy / n - y) * strength, i = 0; i < n; ++i) {
+ node = nodes[i], node.x -= sx, node.y -= sy;
+ }
+ }
+
+ force.initialize = function(_) {
+ nodes = _;
+ };
+
+ force.x = function(_) {
+ return arguments.length ? (x = +_, force) : x;
+ };
+
+ force.y = function(_) {
+ return arguments.length ? (y = +_, force) : y;
+ };
+
+ force.strength = function(_) {
+ return arguments.length ? (strength = +_, force) : strength;
+ };
+
+ return force;
+}
+
+function tree_add(d) {
+ const x = +this._x.call(null, d),
+ y = +this._y.call(null, d);
+ return add(this.cover(x, y), x, y, d);
+}
+
+function add(tree, x, y, d) {
+ if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points
+
+ var parent,
+ node = tree._root,
+ leaf = {data: d},
+ x0 = tree._x0,
+ y0 = tree._y0,
+ x1 = tree._x1,
+ y1 = tree._y1,
+ xm,
+ ym,
+ xp,
+ yp,
+ right,
+ bottom,
+ i,
+ j;
+
+ // If the tree is empty, initialize the root as a leaf.
+ if (!node) return tree._root = leaf, tree;
+
+ // Find the existing leaf for the new point, or add it.
+ while (node.length) {
+ if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;
+ if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;
+ if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;
+ }
+
+ // Is the new point is exactly coincident with the existing point?
+ xp = +tree._x.call(null, node.data);
+ yp = +tree._y.call(null, node.data);
+ if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;
+
+ // Otherwise, split the leaf node until the old and new point are separated.
+ do {
+ parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);
+ if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;
+ if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;
+ } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));
+ return parent[j] = node, parent[i] = leaf, tree;
+}
+
+function addAll(data) {
+ var d, i, n = data.length,
+ x,
+ y,
+ xz = new Array(n),
+ yz = new Array(n),
+ x0 = Infinity,
+ y0 = Infinity,
+ x1 = -Infinity,
+ y1 = -Infinity;
+
+ // Compute the points and their extent.
+ for (i = 0; i < n; ++i) {
+ if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;
+ xz[i] = x;
+ yz[i] = y;
+ if (x < x0) x0 = x;
+ if (x > x1) x1 = x;
+ if (y < y0) y0 = y;
+ if (y > y1) y1 = y;
+ }
+
+ // If there were no (valid) points, abort.
+ if (x0 > x1 || y0 > y1) return this;
+
+ // Expand the tree to cover the new points.
+ this.cover(x0, y0).cover(x1, y1);
+
+ // Add the new points.
+ for (i = 0; i < n; ++i) {
+ add(this, xz[i], yz[i], data[i]);
+ }
+
+ return this;
+}
+
+function tree_cover(x, y) {
+ if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points
+
+ var x0 = this._x0,
+ y0 = this._y0,
+ x1 = this._x1,
+ y1 = this._y1;
+
+ // If the quadtree has no extent, initialize them.
+ // Integer extent are necessary so that if we later double the extent,
+ // the existing quadrant boundaries don’t change due to floating point error!
+ if (isNaN(x0)) {
+ x1 = (x0 = Math.floor(x)) + 1;
+ y1 = (y0 = Math.floor(y)) + 1;
+ }
+
+ // Otherwise, double repeatedly to cover.
+ else {
+ var z = x1 - x0 || 1,
+ node = this._root,
+ parent,
+ i;
+
+ while (x0 > x || x >= x1 || y0 > y || y >= y1) {
+ i = (y < y0) << 1 | (x < x0);
+ parent = new Array(4), parent[i] = node, node = parent, z *= 2;
+ switch (i) {
+ case 0: x1 = x0 + z, y1 = y0 + z; break;
+ case 1: x0 = x1 - z, y1 = y0 + z; break;
+ case 2: x1 = x0 + z, y0 = y1 - z; break;
+ case 3: x0 = x1 - z, y0 = y1 - z; break;
+ }
+ }
+
+ if (this._root && this._root.length) this._root = node;
+ }
+
+ this._x0 = x0;
+ this._y0 = y0;
+ this._x1 = x1;
+ this._y1 = y1;
+ return this;
+}
+
+function tree_data() {
+ var data = [];
+ this.visit(function(node) {
+ if (!node.length) do data.push(node.data); while (node = node.next)
+ });
+ return data;
+}
+
+function tree_extent(_) {
+ return arguments.length
+ ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])
+ : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];
+}
+
+function Quad(node, x0, y0, x1, y1) {
+ this.node = node;
+ this.x0 = x0;
+ this.y0 = y0;
+ this.x1 = x1;
+ this.y1 = y1;
+}
+
+function tree_find(x, y, radius) {
+ var data,
+ x0 = this._x0,
+ y0 = this._y0,
+ x1,
+ y1,
+ x2,
+ y2,
+ x3 = this._x1,
+ y3 = this._y1,
+ quads = [],
+ node = this._root,
+ q,
+ i;
+
+ if (node) quads.push(new Quad(node, x0, y0, x3, y3));
+ if (radius == null) radius = Infinity;
+ else {
+ x0 = x - radius, y0 = y - radius;
+ x3 = x + radius, y3 = y + radius;
+ radius *= radius;
+ }
+
+ while (q = quads.pop()) {
+
+ // Stop searching if this quadrant can’t contain a closer node.
+ if (!(node = q.node)
+ || (x1 = q.x0) > x3
+ || (y1 = q.y0) > y3
+ || (x2 = q.x1) < x0
+ || (y2 = q.y1) < y0) continue;
+
+ // Bisect the current quadrant.
+ if (node.length) {
+ var xm = (x1 + x2) / 2,
+ ym = (y1 + y2) / 2;
+
+ quads.push(
+ new Quad(node[3], xm, ym, x2, y2),
+ new Quad(node[2], x1, ym, xm, y2),
+ new Quad(node[1], xm, y1, x2, ym),
+ new Quad(node[0], x1, y1, xm, ym)
+ );
+
+ // Visit the closest quadrant first.
+ if (i = (y >= ym) << 1 | (x >= xm)) {
+ q = quads[quads.length - 1];
+ quads[quads.length - 1] = quads[quads.length - 1 - i];
+ quads[quads.length - 1 - i] = q;
+ }
+ }
+
+ // Visit this point. (Visiting coincident points isn’t necessary!)
+ else {
+ var dx = x - +this._x.call(null, node.data),
+ dy = y - +this._y.call(null, node.data),
+ d2 = dx * dx + dy * dy;
+ if (d2 < radius) {
+ var d = Math.sqrt(radius = d2);
+ x0 = x - d, y0 = y - d;
+ x3 = x + d, y3 = y + d;
+ data = node.data;
+ }
+ }
+ }
+
+ return data;
+}
+
+function tree_remove(d) {
+ if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points
+
+ var parent,
+ node = this._root,
+ retainer,
+ previous,
+ next,
+ x0 = this._x0,
+ y0 = this._y0,
+ x1 = this._x1,
+ y1 = this._y1,
+ x,
+ y,
+ xm,
+ ym,
+ right,
+ bottom,
+ i,
+ j;
+
+ // If the tree is empty, initialize the root as a leaf.
+ if (!node) return this;
+
+ // Find the leaf node for the point.
+ // While descending, also retain the deepest parent with a non-removed sibling.
+ if (node.length) while (true) {
+ if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;
+ if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;
+ if (!(parent = node, node = node[i = bottom << 1 | right])) return this;
+ if (!node.length) break;
+ if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;
+ }
+
+ // Find the point to remove.
+ while (node.data !== d) if (!(previous = node, node = node.next)) return this;
+ if (next = node.next) delete node.next;
+
+ // If there are multiple coincident points, remove just the point.
+ if (previous) return (next ? previous.next = next : delete previous.next), this;
+
+ // If this is the root point, remove it.
+ if (!parent) return this._root = next, this;
+
+ // Remove this leaf.
+ next ? parent[i] = next : delete parent[i];
+
+ // If the parent now contains exactly one leaf, collapse superfluous parents.
+ if ((node = parent[0] || parent[1] || parent[2] || parent[3])
+ && node === (parent[3] || parent[2] || parent[1] || parent[0])
+ && !node.length) {
+ if (retainer) retainer[j] = node;
+ else this._root = node;
+ }
+
+ return this;
+}
+
+function removeAll(data) {
+ for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);
+ return this;
+}
+
+function tree_root() {
+ return this._root;
+}
+
+function tree_size() {
+ var size = 0;
+ this.visit(function(node) {
+ if (!node.length) do ++size; while (node = node.next)
+ });
+ return size;
+}
+
+function tree_visit(callback) {
+ var quads = [], q, node = this._root, child, x0, y0, x1, y1;
+ if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));
+ while (q = quads.pop()) {
+ if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {
+ var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;
+ if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));
+ if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));
+ if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));
+ if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));
+ }
+ }
+ return this;
+}
+
+function tree_visitAfter(callback) {
+ var quads = [], next = [], q;
+ if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));
+ while (q = quads.pop()) {
+ var node = q.node;
+ if (node.length) {
+ var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;
+ if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));
+ if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));
+ if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));
+ if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));
+ }
+ next.push(q);
+ }
+ while (q = next.pop()) {
+ callback(q.node, q.x0, q.y0, q.x1, q.y1);
+ }
+ return this;
+}
+
+function defaultX(d) {
+ return d[0];
+}
+
+function tree_x(_) {
+ return arguments.length ? (this._x = _, this) : this._x;
+}
+
+function defaultY(d) {
+ return d[1];
+}
+
+function tree_y(_) {
+ return arguments.length ? (this._y = _, this) : this._y;
+}
+
+function quadtree(nodes, x, y) {
+ var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);
+ return nodes == null ? tree : tree.addAll(nodes);
+}
+
+function Quadtree(x, y, x0, y0, x1, y1) {
+ this._x = x;
+ this._y = y;
+ this._x0 = x0;
+ this._y0 = y0;
+ this._x1 = x1;
+ this._y1 = y1;
+ this._root = undefined;
+}
+
+function leaf_copy(leaf) {
+ var copy = {data: leaf.data}, next = copy;
+ while (leaf = leaf.next) next = next.next = {data: leaf.data};
+ return copy;
+}
+
+var treeProto = quadtree.prototype = Quadtree.prototype;
+
+treeProto.copy = function() {
+ var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),
+ node = this._root,
+ nodes,
+ child;
+
+ if (!node) return copy;
+
+ if (!node.length) return copy._root = leaf_copy(node), copy;
+
+ nodes = [{source: node, target: copy._root = new Array(4)}];
+ while (node = nodes.pop()) {
+ for (var i = 0; i < 4; ++i) {
+ if (child = node.source[i]) {
+ if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});
+ else node.target[i] = leaf_copy(child);
+ }
+ }
+ }
+
+ return copy;
+};
+
+treeProto.add = tree_add;
+treeProto.addAll = addAll;
+treeProto.cover = tree_cover;
+treeProto.data = tree_data;
+treeProto.extent = tree_extent;
+treeProto.find = tree_find;
+treeProto.remove = tree_remove;
+treeProto.removeAll = removeAll;
+treeProto.root = tree_root;
+treeProto.size = tree_size;
+treeProto.visit = tree_visit;
+treeProto.visitAfter = tree_visitAfter;
+treeProto.x = tree_x;
+treeProto.y = tree_y;
+
+function constant$4(x) {
+ return function() {
+ return x;
+ };
+}
+
+function jiggle(random) {
+ return (random() - 0.5) * 1e-6;
+}
+
+function x$3(d) {
+ return d.x + d.vx;
+}
+
+function y$3(d) {
+ return d.y + d.vy;
+}
+
+function collide(radius) {
+ var nodes,
+ radii,
+ random,
+ strength = 1,
+ iterations = 1;
+
+ if (typeof radius !== "function") radius = constant$4(radius == null ? 1 : +radius);
+
+ function force() {
+ var i, n = nodes.length,
+ tree,
+ node,
+ xi,
+ yi,
+ ri,
+ ri2;
+
+ for (var k = 0; k < iterations; ++k) {
+ tree = quadtree(nodes, x$3, y$3).visitAfter(prepare);
+ for (i = 0; i < n; ++i) {
+ node = nodes[i];
+ ri = radii[node.index], ri2 = ri * ri;
+ xi = node.x + node.vx;
+ yi = node.y + node.vy;
+ tree.visit(apply);
+ }
+ }
+
+ function apply(quad, x0, y0, x1, y1) {
+ var data = quad.data, rj = quad.r, r = ri + rj;
+ if (data) {
+ if (data.index > node.index) {
+ var x = xi - data.x - data.vx,
+ y = yi - data.y - data.vy,
+ l = x * x + y * y;
+ if (l < r * r) {
+ if (x === 0) x = jiggle(random), l += x * x;
+ if (y === 0) y = jiggle(random), l += y * y;
+ l = (r - (l = Math.sqrt(l))) / l * strength;
+ node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));
+ node.vy += (y *= l) * r;
+ data.vx -= x * (r = 1 - r);
+ data.vy -= y * r;
+ }
+ }
+ return;
+ }
+ return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;
+ }
+ }
+
+ function prepare(quad) {
+ if (quad.data) return quad.r = radii[quad.data.index];
+ for (var i = quad.r = 0; i < 4; ++i) {
+ if (quad[i] && quad[i].r > quad.r) {
+ quad.r = quad[i].r;
+ }
+ }
+ }
+
+ function initialize() {
+ if (!nodes) return;
+ var i, n = nodes.length, node;
+ radii = new Array(n);
+ for (i = 0; i < n; ++i) node = nodes[i], radii[node.index] = +radius(node, i, nodes);
+ }
+
+ force.initialize = function(_nodes, _random) {
+ nodes = _nodes;
+ random = _random;
+ initialize();
+ };
+
+ force.iterations = function(_) {
+ return arguments.length ? (iterations = +_, force) : iterations;
+ };
+
+ force.strength = function(_) {
+ return arguments.length ? (strength = +_, force) : strength;
+ };
+
+ force.radius = function(_) {
+ return arguments.length ? (radius = typeof _ === "function" ? _ : constant$4(+_), initialize(), force) : radius;
+ };
+
+ return force;
+}
+
+function index$3(d) {
+ return d.index;
+}
+
+function find(nodeById, nodeId) {
+ var node = nodeById.get(nodeId);
+ if (!node) throw new Error("node not found: " + nodeId);
+ return node;
+}
+
+function link$2(links) {
+ var id = index$3,
+ strength = defaultStrength,
+ strengths,
+ distance = constant$4(30),
+ distances,
+ nodes,
+ count,
+ bias,
+ random,
+ iterations = 1;
+
+ if (links == null) links = [];
+
+ function defaultStrength(link) {
+ return 1 / Math.min(count[link.source.index], count[link.target.index]);
+ }
+
+ function force(alpha) {
+ for (var k = 0, n = links.length; k < iterations; ++k) {
+ for (var i = 0, link, source, target, x, y, l, b; i < n; ++i) {
+ link = links[i], source = link.source, target = link.target;
+ x = target.x + target.vx - source.x - source.vx || jiggle(random);
+ y = target.y + target.vy - source.y - source.vy || jiggle(random);
+ l = Math.sqrt(x * x + y * y);
+ l = (l - distances[i]) / l * alpha * strengths[i];
+ x *= l, y *= l;
+ target.vx -= x * (b = bias[i]);
+ target.vy -= y * b;
+ source.vx += x * (b = 1 - b);
+ source.vy += y * b;
+ }
+ }
+ }
+
+ function initialize() {
+ if (!nodes) return;
+
+ var i,
+ n = nodes.length,
+ m = links.length,
+ nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d])),
+ link;
+
+ for (i = 0, count = new Array(n); i < m; ++i) {
+ link = links[i], link.index = i;
+ if (typeof link.source !== "object") link.source = find(nodeById, link.source);
+ if (typeof link.target !== "object") link.target = find(nodeById, link.target);
+ count[link.source.index] = (count[link.source.index] || 0) + 1;
+ count[link.target.index] = (count[link.target.index] || 0) + 1;
+ }
+
+ for (i = 0, bias = new Array(m); i < m; ++i) {
+ link = links[i], bias[i] = count[link.source.index] / (count[link.source.index] + count[link.target.index]);
+ }
+
+ strengths = new Array(m), initializeStrength();
+ distances = new Array(m), initializeDistance();
+ }
+
+ function initializeStrength() {
+ if (!nodes) return;
+
+ for (var i = 0, n = links.length; i < n; ++i) {
+ strengths[i] = +strength(links[i], i, links);
+ }
+ }
+
+ function initializeDistance() {
+ if (!nodes) return;
+
+ for (var i = 0, n = links.length; i < n; ++i) {
+ distances[i] = +distance(links[i], i, links);
+ }
+ }
+
+ force.initialize = function(_nodes, _random) {
+ nodes = _nodes;
+ random = _random;
+ initialize();
+ };
+
+ force.links = function(_) {
+ return arguments.length ? (links = _, initialize(), force) : links;
+ };
+
+ force.id = function(_) {
+ return arguments.length ? (id = _, force) : id;
+ };
+
+ force.iterations = function(_) {
+ return arguments.length ? (iterations = +_, force) : iterations;
+ };
+
+ force.strength = function(_) {
+ return arguments.length ? (strength = typeof _ === "function" ? _ : constant$4(+_), initializeStrength(), force) : strength;
+ };
+
+ force.distance = function(_) {
+ return arguments.length ? (distance = typeof _ === "function" ? _ : constant$4(+_), initializeDistance(), force) : distance;
+ };
+
+ return force;
+}
+
+// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use
+const a$2 = 1664525;
+const c$4 = 1013904223;
+const m$1 = 4294967296; // 2^32
+
+function lcg$2() {
+ let s = 1;
+ return () => (s = (a$2 * s + c$4) % m$1) / m$1;
+}
+
+function x$2(d) {
+ return d.x;
+}
+
+function y$2(d) {
+ return d.y;
+}
+
+var initialRadius = 10,
+ initialAngle = Math.PI * (3 - Math.sqrt(5));
+
+function simulation(nodes) {
+ var simulation,
+ alpha = 1,
+ alphaMin = 0.001,
+ alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),
+ alphaTarget = 0,
+ velocityDecay = 0.6,
+ forces = new Map(),
+ stepper = timer(step),
+ event = dispatch("tick", "end"),
+ random = lcg$2();
+
+ if (nodes == null) nodes = [];
+
+ function step() {
+ tick();
+ event.call("tick", simulation);
+ if (alpha < alphaMin) {
+ stepper.stop();
+ event.call("end", simulation);
+ }
+ }
+
+ function tick(iterations) {
+ var i, n = nodes.length, node;
+
+ if (iterations === undefined) iterations = 1;
+
+ for (var k = 0; k < iterations; ++k) {
+ alpha += (alphaTarget - alpha) * alphaDecay;
+
+ forces.forEach(function(force) {
+ force(alpha);
+ });
+
+ for (i = 0; i < n; ++i) {
+ node = nodes[i];
+ if (node.fx == null) node.x += node.vx *= velocityDecay;
+ else node.x = node.fx, node.vx = 0;
+ if (node.fy == null) node.y += node.vy *= velocityDecay;
+ else node.y = node.fy, node.vy = 0;
+ }
+ }
+
+ return simulation;
+ }
+
+ function initializeNodes() {
+ for (var i = 0, n = nodes.length, node; i < n; ++i) {
+ node = nodes[i], node.index = i;
+ if (node.fx != null) node.x = node.fx;
+ if (node.fy != null) node.y = node.fy;
+ if (isNaN(node.x) || isNaN(node.y)) {
+ var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;
+ node.x = radius * Math.cos(angle);
+ node.y = radius * Math.sin(angle);
+ }
+ if (isNaN(node.vx) || isNaN(node.vy)) {
... 19027 lines suppressed ...