@guardian/interactive-component-library 0.2.0-rc2 → 0.2.0-rc4
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/components/molecules/canvas-map/lib/Map.js +2 -2
- package/dist/components/molecules/canvas-map/lib/projection/index.js +1 -1
- package/dist/components/molecules/canvas-map/lib/renderers/MapRenderer.js +1 -1
- package/dist/components/molecules/canvas-map/lib/sources/VectorSource.js +2 -2
- package/dist/components/molecules/modal/index.js +2 -2
- package/dist/components/molecules/result-summary/index.js +3 -1
- package/dist/components/molecules/svg-map/index.js +2 -1
- package/dist/components/molecules/svg-map/layers/Polygon.js +1 -1
- package/dist/components/particles/relative-time-sentence/index.js +2 -2
- package/package.json +14 -2
- package/dist/_virtual/_commonjsHelpers.js +0 -8
- package/dist/_virtual/dayjs.min.js +0 -4
- package/dist/_virtual/relativeTime.js +0 -4
- package/dist/node_modules/.pnpm/d3-color@3.1.0/node_modules/d3-color/src/color.js +0 -338
- package/dist/node_modules/.pnpm/d3-color@3.1.0/node_modules/d3-color/src/define.js +0 -13
- package/dist/node_modules/.pnpm/d3-composite-projections@1.4.0/node_modules/d3-composite-projections/src/albersUk.js +0 -108
- package/dist/node_modules/.pnpm/d3-composite-projections@1.4.0/node_modules/d3-composite-projections/src/bounds.js +0 -24
- package/dist/node_modules/.pnpm/d3-composite-projections@1.4.0/node_modules/d3-composite-projections/src/fit.js +0 -18
- package/dist/node_modules/.pnpm/d3-composite-projections@1.4.0/node_modules/d3-composite-projections/src/math.js +0 -4
- package/dist/node_modules/.pnpm/d3-dispatch@3.0.1/node_modules/d3-dispatch/src/dispatch.js +0 -70
- package/dist/node_modules/.pnpm/d3-ease@3.0.1/node_modules/d3-ease/src/cubic.js +0 -6
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/color.js +0 -24
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/constant.js +0 -4
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/number.js +0 -8
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/rgb.js +0 -20
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/string.js +0 -43
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/transform/decompose.js +0 -28
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/transform/index.js +0 -59
- package/dist/node_modules/.pnpm/d3-interpolate@3.0.1/node_modules/d3-interpolate/src/transform/parse.js +0 -18
- package/dist/node_modules/.pnpm/d3-path@2.0.0/node_modules/d3-path/src/path.js +0 -73
- package/dist/node_modules/.pnpm/d3-timer@3.0.1/node_modules/d3-timer/src/timeout.js +0 -13
- package/dist/node_modules/.pnpm/d3-timer@3.0.1/node_modules/d3-timer/src/timer.js +0 -96
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/interrupt.js +0 -21
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/selection/index.js +0 -5
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/selection/interrupt.js +0 -9
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/selection/transition.js +0 -39
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/attr.js +0 -55
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/attrTween.js +0 -42
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/delay.js +0 -18
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/duration.js +0 -18
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/ease.js +0 -14
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/easeVarying.js +0 -15
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/end.js +0 -23
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/filter.js +0 -16
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/index.js +0 -68
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/interpolate.js +0 -11
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/merge.js +0 -18
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/on.js +0 -23
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/remove.js +0 -13
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/schedule.js +0 -125
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/select.js +0 -20
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/selectAll.js +0 -24
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/selection.js +0 -8
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/style.js +0 -47
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/styleTween.js +0 -25
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/text.js +0 -18
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/textTween.js +0 -25
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/transition.js +0 -22
- package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/tween.js +0 -64
- package/dist/node_modules/.pnpm/dayjs@1.11.12/node_modules/dayjs/dayjs.min.js +0 -282
- package/dist/node_modules/.pnpm/dayjs@1.11.12/node_modules/dayjs/plugin/relativeTime.js +0 -48
- package/dist/node_modules/.pnpm/flatbush@4.4.0/node_modules/flatbush/index.js +0 -339
- package/dist/node_modules/.pnpm/flatqueue@2.0.3/node_modules/flatqueue/index.js +0 -67
- package/dist/node_modules/.pnpm/preact-merge-refs@1.0.2_preact@10.21.0/node_modules/preact-merge-refs/lib/preact-merge-refs.modern.js +0 -10
- package/dist/node_modules/.pnpm/preact-transitioning@1.4.1_preact@10.21.0/node_modules/preact-transitioning/lib/preact-transitioning.modern.js +0 -63
- package/dist/node_modules/.pnpm/quickselect@2.0.0/node_modules/quickselect/index.js +0 -47
- package/dist/node_modules/.pnpm/rbush-knn@4.0.0/node_modules/rbush-knn/index.js +0 -42
- package/dist/node_modules/.pnpm/rbush@4.0.0/node_modules/rbush/index.js +0 -378
- package/dist/node_modules/.pnpm/tinyqueue@2.0.3/node_modules/tinyqueue/index.js +0 -65
|
@@ -1,282 +0,0 @@
|
|
|
1
|
-
import { commonjsGlobal, getDefaultExportFromCjs } from "../../../../../_virtual/_commonjsHelpers.js";
|
|
2
|
-
import { __module as dayjs_min } from "../../../../../_virtual/dayjs.min.js";
|
|
3
|
-
(function(module, exports) {
|
|
4
|
-
!function(t, e) {
|
|
5
|
-
module.exports = e();
|
|
6
|
-
}(commonjsGlobal, function() {
|
|
7
|
-
var t = 1e3, e = 6e4, n = 36e5, r = "millisecond", i = "second", s = "minute", u = "hour", a = "day", o = "week", c = "month", f = "quarter", h = "year", d = "date", l = "Invalid Date", $ = /^(\d{4})[-/]?(\d{1,2})?[-/]?(\d{0,2})[Tt\s]*(\d{1,2})?:?(\d{1,2})?:?(\d{1,2})?[.:]?(\d+)?$/, y = /\[([^\]]+)]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS/g, M = { name: "en", weekdays: "Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"), months: "January_February_March_April_May_June_July_August_September_October_November_December".split("_"), ordinal: function(t2) {
|
|
8
|
-
var e2 = ["th", "st", "nd", "rd"], n2 = t2 % 100;
|
|
9
|
-
return "[" + t2 + (e2[(n2 - 20) % 10] || e2[n2] || e2[0]) + "]";
|
|
10
|
-
} }, m = function(t2, e2, n2) {
|
|
11
|
-
var r2 = String(t2);
|
|
12
|
-
return !r2 || r2.length >= e2 ? t2 : "" + Array(e2 + 1 - r2.length).join(n2) + t2;
|
|
13
|
-
}, v = { s: m, z: function(t2) {
|
|
14
|
-
var e2 = -t2.utcOffset(), n2 = Math.abs(e2), r2 = Math.floor(n2 / 60), i2 = n2 % 60;
|
|
15
|
-
return (e2 <= 0 ? "+" : "-") + m(r2, 2, "0") + ":" + m(i2, 2, "0");
|
|
16
|
-
}, m: function t2(e2, n2) {
|
|
17
|
-
if (e2.date() < n2.date()) return -t2(n2, e2);
|
|
18
|
-
var r2 = 12 * (n2.year() - e2.year()) + (n2.month() - e2.month()), i2 = e2.clone().add(r2, c), s2 = n2 - i2 < 0, u2 = e2.clone().add(r2 + (s2 ? -1 : 1), c);
|
|
19
|
-
return +(-(r2 + (n2 - i2) / (s2 ? i2 - u2 : u2 - i2)) || 0);
|
|
20
|
-
}, a: function(t2) {
|
|
21
|
-
return t2 < 0 ? Math.ceil(t2) || 0 : Math.floor(t2);
|
|
22
|
-
}, p: function(t2) {
|
|
23
|
-
return { M: c, y: h, w: o, d: a, D: d, h: u, m: s, s: i, ms: r, Q: f }[t2] || String(t2 || "").toLowerCase().replace(/s$/, "");
|
|
24
|
-
}, u: function(t2) {
|
|
25
|
-
return void 0 === t2;
|
|
26
|
-
} }, g = "en", D = {};
|
|
27
|
-
D[g] = M;
|
|
28
|
-
var p = "$isDayjsObject", S = function(t2) {
|
|
29
|
-
return t2 instanceof _ || !(!t2 || !t2[p]);
|
|
30
|
-
}, w = function t2(e2, n2, r2) {
|
|
31
|
-
var i2;
|
|
32
|
-
if (!e2) return g;
|
|
33
|
-
if ("string" == typeof e2) {
|
|
34
|
-
var s2 = e2.toLowerCase();
|
|
35
|
-
D[s2] && (i2 = s2), n2 && (D[s2] = n2, i2 = s2);
|
|
36
|
-
var u2 = e2.split("-");
|
|
37
|
-
if (!i2 && u2.length > 1) return t2(u2[0]);
|
|
38
|
-
} else {
|
|
39
|
-
var a2 = e2.name;
|
|
40
|
-
D[a2] = e2, i2 = a2;
|
|
41
|
-
}
|
|
42
|
-
return !r2 && i2 && (g = i2), i2 || !r2 && g;
|
|
43
|
-
}, O = function(t2, e2) {
|
|
44
|
-
if (S(t2)) return t2.clone();
|
|
45
|
-
var n2 = "object" == typeof e2 ? e2 : {};
|
|
46
|
-
return n2.date = t2, n2.args = arguments, new _(n2);
|
|
47
|
-
}, b = v;
|
|
48
|
-
b.l = w, b.i = S, b.w = function(t2, e2) {
|
|
49
|
-
return O(t2, { locale: e2.$L, utc: e2.$u, x: e2.$x, $offset: e2.$offset });
|
|
50
|
-
};
|
|
51
|
-
var _ = function() {
|
|
52
|
-
function M2(t2) {
|
|
53
|
-
this.$L = w(t2.locale, null, true), this.parse(t2), this.$x = this.$x || t2.x || {}, this[p] = true;
|
|
54
|
-
}
|
|
55
|
-
var m2 = M2.prototype;
|
|
56
|
-
return m2.parse = function(t2) {
|
|
57
|
-
this.$d = function(t3) {
|
|
58
|
-
var e2 = t3.date, n2 = t3.utc;
|
|
59
|
-
if (null === e2) return /* @__PURE__ */ new Date(NaN);
|
|
60
|
-
if (b.u(e2)) return /* @__PURE__ */ new Date();
|
|
61
|
-
if (e2 instanceof Date) return new Date(e2);
|
|
62
|
-
if ("string" == typeof e2 && !/Z$/i.test(e2)) {
|
|
63
|
-
var r2 = e2.match($);
|
|
64
|
-
if (r2) {
|
|
65
|
-
var i2 = r2[2] - 1 || 0, s2 = (r2[7] || "0").substring(0, 3);
|
|
66
|
-
return n2 ? new Date(Date.UTC(r2[1], i2, r2[3] || 1, r2[4] || 0, r2[5] || 0, r2[6] || 0, s2)) : new Date(r2[1], i2, r2[3] || 1, r2[4] || 0, r2[5] || 0, r2[6] || 0, s2);
|
|
67
|
-
}
|
|
68
|
-
}
|
|
69
|
-
return new Date(e2);
|
|
70
|
-
}(t2), this.init();
|
|
71
|
-
}, m2.init = function() {
|
|
72
|
-
var t2 = this.$d;
|
|
73
|
-
this.$y = t2.getFullYear(), this.$M = t2.getMonth(), this.$D = t2.getDate(), this.$W = t2.getDay(), this.$H = t2.getHours(), this.$m = t2.getMinutes(), this.$s = t2.getSeconds(), this.$ms = t2.getMilliseconds();
|
|
74
|
-
}, m2.$utils = function() {
|
|
75
|
-
return b;
|
|
76
|
-
}, m2.isValid = function() {
|
|
77
|
-
return !(this.$d.toString() === l);
|
|
78
|
-
}, m2.isSame = function(t2, e2) {
|
|
79
|
-
var n2 = O(t2);
|
|
80
|
-
return this.startOf(e2) <= n2 && n2 <= this.endOf(e2);
|
|
81
|
-
}, m2.isAfter = function(t2, e2) {
|
|
82
|
-
return O(t2) < this.startOf(e2);
|
|
83
|
-
}, m2.isBefore = function(t2, e2) {
|
|
84
|
-
return this.endOf(e2) < O(t2);
|
|
85
|
-
}, m2.$g = function(t2, e2, n2) {
|
|
86
|
-
return b.u(t2) ? this[e2] : this.set(n2, t2);
|
|
87
|
-
}, m2.unix = function() {
|
|
88
|
-
return Math.floor(this.valueOf() / 1e3);
|
|
89
|
-
}, m2.valueOf = function() {
|
|
90
|
-
return this.$d.getTime();
|
|
91
|
-
}, m2.startOf = function(t2, e2) {
|
|
92
|
-
var n2 = this, r2 = !!b.u(e2) || e2, f2 = b.p(t2), l2 = function(t3, e3) {
|
|
93
|
-
var i2 = b.w(n2.$u ? Date.UTC(n2.$y, e3, t3) : new Date(n2.$y, e3, t3), n2);
|
|
94
|
-
return r2 ? i2 : i2.endOf(a);
|
|
95
|
-
}, $2 = function(t3, e3) {
|
|
96
|
-
return b.w(n2.toDate()[t3].apply(n2.toDate("s"), (r2 ? [0, 0, 0, 0] : [23, 59, 59, 999]).slice(e3)), n2);
|
|
97
|
-
}, y2 = this.$W, M3 = this.$M, m3 = this.$D, v2 = "set" + (this.$u ? "UTC" : "");
|
|
98
|
-
switch (f2) {
|
|
99
|
-
case h:
|
|
100
|
-
return r2 ? l2(1, 0) : l2(31, 11);
|
|
101
|
-
case c:
|
|
102
|
-
return r2 ? l2(1, M3) : l2(0, M3 + 1);
|
|
103
|
-
case o:
|
|
104
|
-
var g2 = this.$locale().weekStart || 0, D2 = (y2 < g2 ? y2 + 7 : y2) - g2;
|
|
105
|
-
return l2(r2 ? m3 - D2 : m3 + (6 - D2), M3);
|
|
106
|
-
case a:
|
|
107
|
-
case d:
|
|
108
|
-
return $2(v2 + "Hours", 0);
|
|
109
|
-
case u:
|
|
110
|
-
return $2(v2 + "Minutes", 1);
|
|
111
|
-
case s:
|
|
112
|
-
return $2(v2 + "Seconds", 2);
|
|
113
|
-
case i:
|
|
114
|
-
return $2(v2 + "Milliseconds", 3);
|
|
115
|
-
default:
|
|
116
|
-
return this.clone();
|
|
117
|
-
}
|
|
118
|
-
}, m2.endOf = function(t2) {
|
|
119
|
-
return this.startOf(t2, false);
|
|
120
|
-
}, m2.$set = function(t2, e2) {
|
|
121
|
-
var n2, o2 = b.p(t2), f2 = "set" + (this.$u ? "UTC" : ""), l2 = (n2 = {}, n2[a] = f2 + "Date", n2[d] = f2 + "Date", n2[c] = f2 + "Month", n2[h] = f2 + "FullYear", n2[u] = f2 + "Hours", n2[s] = f2 + "Minutes", n2[i] = f2 + "Seconds", n2[r] = f2 + "Milliseconds", n2)[o2], $2 = o2 === a ? this.$D + (e2 - this.$W) : e2;
|
|
122
|
-
if (o2 === c || o2 === h) {
|
|
123
|
-
var y2 = this.clone().set(d, 1);
|
|
124
|
-
y2.$d[l2]($2), y2.init(), this.$d = y2.set(d, Math.min(this.$D, y2.daysInMonth())).$d;
|
|
125
|
-
} else l2 && this.$d[l2]($2);
|
|
126
|
-
return this.init(), this;
|
|
127
|
-
}, m2.set = function(t2, e2) {
|
|
128
|
-
return this.clone().$set(t2, e2);
|
|
129
|
-
}, m2.get = function(t2) {
|
|
130
|
-
return this[b.p(t2)]();
|
|
131
|
-
}, m2.add = function(r2, f2) {
|
|
132
|
-
var d2, l2 = this;
|
|
133
|
-
r2 = Number(r2);
|
|
134
|
-
var $2 = b.p(f2), y2 = function(t2) {
|
|
135
|
-
var e2 = O(l2);
|
|
136
|
-
return b.w(e2.date(e2.date() + Math.round(t2 * r2)), l2);
|
|
137
|
-
};
|
|
138
|
-
if ($2 === c) return this.set(c, this.$M + r2);
|
|
139
|
-
if ($2 === h) return this.set(h, this.$y + r2);
|
|
140
|
-
if ($2 === a) return y2(1);
|
|
141
|
-
if ($2 === o) return y2(7);
|
|
142
|
-
var M3 = (d2 = {}, d2[s] = e, d2[u] = n, d2[i] = t, d2)[$2] || 1, m3 = this.$d.getTime() + r2 * M3;
|
|
143
|
-
return b.w(m3, this);
|
|
144
|
-
}, m2.subtract = function(t2, e2) {
|
|
145
|
-
return this.add(-1 * t2, e2);
|
|
146
|
-
}, m2.format = function(t2) {
|
|
147
|
-
var e2 = this, n2 = this.$locale();
|
|
148
|
-
if (!this.isValid()) return n2.invalidDate || l;
|
|
149
|
-
var r2 = t2 || "YYYY-MM-DDTHH:mm:ssZ", i2 = b.z(this), s2 = this.$H, u2 = this.$m, a2 = this.$M, o2 = n2.weekdays, c2 = n2.months, f2 = n2.meridiem, h2 = function(t3, n3, i3, s3) {
|
|
150
|
-
return t3 && (t3[n3] || t3(e2, r2)) || i3[n3].slice(0, s3);
|
|
151
|
-
}, d2 = function(t3) {
|
|
152
|
-
return b.s(s2 % 12 || 12, t3, "0");
|
|
153
|
-
}, $2 = f2 || function(t3, e3, n3) {
|
|
154
|
-
var r3 = t3 < 12 ? "AM" : "PM";
|
|
155
|
-
return n3 ? r3.toLowerCase() : r3;
|
|
156
|
-
};
|
|
157
|
-
return r2.replace(y, function(t3, r3) {
|
|
158
|
-
return r3 || function(t4) {
|
|
159
|
-
switch (t4) {
|
|
160
|
-
case "YY":
|
|
161
|
-
return String(e2.$y).slice(-2);
|
|
162
|
-
case "YYYY":
|
|
163
|
-
return b.s(e2.$y, 4, "0");
|
|
164
|
-
case "M":
|
|
165
|
-
return a2 + 1;
|
|
166
|
-
case "MM":
|
|
167
|
-
return b.s(a2 + 1, 2, "0");
|
|
168
|
-
case "MMM":
|
|
169
|
-
return h2(n2.monthsShort, a2, c2, 3);
|
|
170
|
-
case "MMMM":
|
|
171
|
-
return h2(c2, a2);
|
|
172
|
-
case "D":
|
|
173
|
-
return e2.$D;
|
|
174
|
-
case "DD":
|
|
175
|
-
return b.s(e2.$D, 2, "0");
|
|
176
|
-
case "d":
|
|
177
|
-
return String(e2.$W);
|
|
178
|
-
case "dd":
|
|
179
|
-
return h2(n2.weekdaysMin, e2.$W, o2, 2);
|
|
180
|
-
case "ddd":
|
|
181
|
-
return h2(n2.weekdaysShort, e2.$W, o2, 3);
|
|
182
|
-
case "dddd":
|
|
183
|
-
return o2[e2.$W];
|
|
184
|
-
case "H":
|
|
185
|
-
return String(s2);
|
|
186
|
-
case "HH":
|
|
187
|
-
return b.s(s2, 2, "0");
|
|
188
|
-
case "h":
|
|
189
|
-
return d2(1);
|
|
190
|
-
case "hh":
|
|
191
|
-
return d2(2);
|
|
192
|
-
case "a":
|
|
193
|
-
return $2(s2, u2, true);
|
|
194
|
-
case "A":
|
|
195
|
-
return $2(s2, u2, false);
|
|
196
|
-
case "m":
|
|
197
|
-
return String(u2);
|
|
198
|
-
case "mm":
|
|
199
|
-
return b.s(u2, 2, "0");
|
|
200
|
-
case "s":
|
|
201
|
-
return String(e2.$s);
|
|
202
|
-
case "ss":
|
|
203
|
-
return b.s(e2.$s, 2, "0");
|
|
204
|
-
case "SSS":
|
|
205
|
-
return b.s(e2.$ms, 3, "0");
|
|
206
|
-
case "Z":
|
|
207
|
-
return i2;
|
|
208
|
-
}
|
|
209
|
-
return null;
|
|
210
|
-
}(t3) || i2.replace(":", "");
|
|
211
|
-
});
|
|
212
|
-
}, m2.utcOffset = function() {
|
|
213
|
-
return 15 * -Math.round(this.$d.getTimezoneOffset() / 15);
|
|
214
|
-
}, m2.diff = function(r2, d2, l2) {
|
|
215
|
-
var $2, y2 = this, M3 = b.p(d2), m3 = O(r2), v2 = (m3.utcOffset() - this.utcOffset()) * e, g2 = this - m3, D2 = function() {
|
|
216
|
-
return b.m(y2, m3);
|
|
217
|
-
};
|
|
218
|
-
switch (M3) {
|
|
219
|
-
case h:
|
|
220
|
-
$2 = D2() / 12;
|
|
221
|
-
break;
|
|
222
|
-
case c:
|
|
223
|
-
$2 = D2();
|
|
224
|
-
break;
|
|
225
|
-
case f:
|
|
226
|
-
$2 = D2() / 3;
|
|
227
|
-
break;
|
|
228
|
-
case o:
|
|
229
|
-
$2 = (g2 - v2) / 6048e5;
|
|
230
|
-
break;
|
|
231
|
-
case a:
|
|
232
|
-
$2 = (g2 - v2) / 864e5;
|
|
233
|
-
break;
|
|
234
|
-
case u:
|
|
235
|
-
$2 = g2 / n;
|
|
236
|
-
break;
|
|
237
|
-
case s:
|
|
238
|
-
$2 = g2 / e;
|
|
239
|
-
break;
|
|
240
|
-
case i:
|
|
241
|
-
$2 = g2 / t;
|
|
242
|
-
break;
|
|
243
|
-
default:
|
|
244
|
-
$2 = g2;
|
|
245
|
-
}
|
|
246
|
-
return l2 ? $2 : b.a($2);
|
|
247
|
-
}, m2.daysInMonth = function() {
|
|
248
|
-
return this.endOf(c).$D;
|
|
249
|
-
}, m2.$locale = function() {
|
|
250
|
-
return D[this.$L];
|
|
251
|
-
}, m2.locale = function(t2, e2) {
|
|
252
|
-
if (!t2) return this.$L;
|
|
253
|
-
var n2 = this.clone(), r2 = w(t2, e2, true);
|
|
254
|
-
return r2 && (n2.$L = r2), n2;
|
|
255
|
-
}, m2.clone = function() {
|
|
256
|
-
return b.w(this.$d, this);
|
|
257
|
-
}, m2.toDate = function() {
|
|
258
|
-
return new Date(this.valueOf());
|
|
259
|
-
}, m2.toJSON = function() {
|
|
260
|
-
return this.isValid() ? this.toISOString() : null;
|
|
261
|
-
}, m2.toISOString = function() {
|
|
262
|
-
return this.$d.toISOString();
|
|
263
|
-
}, m2.toString = function() {
|
|
264
|
-
return this.$d.toUTCString();
|
|
265
|
-
}, M2;
|
|
266
|
-
}(), k = _.prototype;
|
|
267
|
-
return O.prototype = k, [["$ms", r], ["$s", i], ["$m", s], ["$H", u], ["$W", a], ["$M", c], ["$y", h], ["$D", d]].forEach(function(t2) {
|
|
268
|
-
k[t2[1]] = function(e2) {
|
|
269
|
-
return this.$g(e2, t2[0], t2[1]);
|
|
270
|
-
};
|
|
271
|
-
}), O.extend = function(t2, e2) {
|
|
272
|
-
return t2.$i || (t2(e2, _, O), t2.$i = true), O;
|
|
273
|
-
}, O.locale = w, O.isDayjs = S, O.unix = function(t2) {
|
|
274
|
-
return O(1e3 * t2);
|
|
275
|
-
}, O.en = D[g], O.Ls = D, O.p = {}, O;
|
|
276
|
-
});
|
|
277
|
-
})(dayjs_min);
|
|
278
|
-
var dayjs_minExports = dayjs_min.exports;
|
|
279
|
-
const dayjs = /* @__PURE__ */ getDefaultExportFromCjs(dayjs_minExports);
|
|
280
|
-
export {
|
|
281
|
-
dayjs as default
|
|
282
|
-
};
|
|
@@ -1,48 +0,0 @@
|
|
|
1
|
-
import { commonjsGlobal, getDefaultExportFromCjs } from "../../../../../../_virtual/_commonjsHelpers.js";
|
|
2
|
-
import { __module as relativeTime$1 } from "../../../../../../_virtual/relativeTime.js";
|
|
3
|
-
(function(module, exports) {
|
|
4
|
-
!function(r, e) {
|
|
5
|
-
module.exports = e();
|
|
6
|
-
}(commonjsGlobal, function() {
|
|
7
|
-
return function(r, e, t) {
|
|
8
|
-
r = r || {};
|
|
9
|
-
var n = e.prototype, o = { future: "in %s", past: "%s ago", s: "a few seconds", m: "a minute", mm: "%d minutes", h: "an hour", hh: "%d hours", d: "a day", dd: "%d days", M: "a month", MM: "%d months", y: "a year", yy: "%d years" };
|
|
10
|
-
function i(r2, e2, t2, o2) {
|
|
11
|
-
return n.fromToBase(r2, e2, t2, o2);
|
|
12
|
-
}
|
|
13
|
-
t.en.relativeTime = o, n.fromToBase = function(e2, n2, i2, d2, u) {
|
|
14
|
-
for (var f, a, s, l = i2.$locale().relativeTime || o, h = r.thresholds || [{ l: "s", r: 44, d: "second" }, { l: "m", r: 89 }, { l: "mm", r: 44, d: "minute" }, { l: "h", r: 89 }, { l: "hh", r: 21, d: "hour" }, { l: "d", r: 35 }, { l: "dd", r: 25, d: "day" }, { l: "M", r: 45 }, { l: "MM", r: 10, d: "month" }, { l: "y", r: 17 }, { l: "yy", d: "year" }], m = h.length, c = 0; c < m; c += 1) {
|
|
15
|
-
var y = h[c];
|
|
16
|
-
y.d && (f = d2 ? t(e2).diff(i2, y.d, true) : i2.diff(e2, y.d, true));
|
|
17
|
-
var p = (r.rounding || Math.round)(Math.abs(f));
|
|
18
|
-
if (s = f > 0, p <= y.r || !y.r) {
|
|
19
|
-
p <= 1 && c > 0 && (y = h[c - 1]);
|
|
20
|
-
var v = l[y.l];
|
|
21
|
-
u && (p = u("" + p)), a = "string" == typeof v ? v.replace("%d", p) : v(p, n2, y.l, s);
|
|
22
|
-
break;
|
|
23
|
-
}
|
|
24
|
-
}
|
|
25
|
-
if (n2) return a;
|
|
26
|
-
var M = s ? l.future : l.past;
|
|
27
|
-
return "function" == typeof M ? M(a) : M.replace("%s", a);
|
|
28
|
-
}, n.to = function(r2, e2) {
|
|
29
|
-
return i(r2, e2, this, true);
|
|
30
|
-
}, n.from = function(r2, e2) {
|
|
31
|
-
return i(r2, e2, this);
|
|
32
|
-
};
|
|
33
|
-
var d = function(r2) {
|
|
34
|
-
return r2.$u ? t.utc() : t();
|
|
35
|
-
};
|
|
36
|
-
n.toNow = function(r2) {
|
|
37
|
-
return this.to(d(this), r2);
|
|
38
|
-
}, n.fromNow = function(r2) {
|
|
39
|
-
return this.from(d(this), r2);
|
|
40
|
-
};
|
|
41
|
-
};
|
|
42
|
-
});
|
|
43
|
-
})(relativeTime$1);
|
|
44
|
-
var relativeTimeExports = relativeTime$1.exports;
|
|
45
|
-
const relativeTime = /* @__PURE__ */ getDefaultExportFromCjs(relativeTimeExports);
|
|
46
|
-
export {
|
|
47
|
-
relativeTime as default
|
|
48
|
-
};
|
|
@@ -1,339 +0,0 @@
|
|
|
1
|
-
import FlatQueue from "../../../flatqueue@2.0.3/node_modules/flatqueue/index.js";
|
|
2
|
-
const ARRAY_TYPES = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array];
|
|
3
|
-
const VERSION = 3;
|
|
4
|
-
class Flatbush {
|
|
5
|
-
/**
|
|
6
|
-
* Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
|
|
7
|
-
* @param {ArrayBuffer | SharedArrayBuffer} data
|
|
8
|
-
* @param {number} [byteOffset=0] byte offset to the start of the Flatbush buffer in the referenced ArrayBuffer.
|
|
9
|
-
* @returns {Flatbush} index
|
|
10
|
-
*/
|
|
11
|
-
static from(data, byteOffset = 0) {
|
|
12
|
-
if (byteOffset % 8 !== 0) {
|
|
13
|
-
throw new Error("byteOffset must be 8-byte aligned.");
|
|
14
|
-
}
|
|
15
|
-
if (!data || data.byteLength === void 0 || data.buffer) {
|
|
16
|
-
throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
|
|
17
|
-
}
|
|
18
|
-
const [magic, versionAndType] = new Uint8Array(data, byteOffset + 0, 2);
|
|
19
|
-
if (magic !== 251) {
|
|
20
|
-
throw new Error("Data does not appear to be in a Flatbush format.");
|
|
21
|
-
}
|
|
22
|
-
const version = versionAndType >> 4;
|
|
23
|
-
if (version !== VERSION) {
|
|
24
|
-
throw new Error(`Got v${version} data when expected v${VERSION}.`);
|
|
25
|
-
}
|
|
26
|
-
const ArrayType = ARRAY_TYPES[versionAndType & 15];
|
|
27
|
-
if (!ArrayType) {
|
|
28
|
-
throw new Error("Unrecognized array type.");
|
|
29
|
-
}
|
|
30
|
-
const [nodeSize] = new Uint16Array(data, byteOffset + 2, 1);
|
|
31
|
-
const [numItems] = new Uint32Array(data, byteOffset + 4, 1);
|
|
32
|
-
return new Flatbush(numItems, nodeSize, ArrayType, void 0, data, byteOffset);
|
|
33
|
-
}
|
|
34
|
-
/**
|
|
35
|
-
* Create a Flatbush index that will hold a given number of items.
|
|
36
|
-
* @param {number} numItems
|
|
37
|
-
* @param {number} [nodeSize=16] Size of the tree node (16 by default).
|
|
38
|
-
* @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
|
|
39
|
-
* @param {ArrayBufferConstructor | SharedArrayBufferConstructor} [ArrayBufferType=ArrayBuffer] The array buffer type used to store data (`ArrayBuffer` by default).
|
|
40
|
-
* @param {ArrayBuffer | SharedArrayBuffer} [data] (Only used internally)
|
|
41
|
-
* @param {number} [byteOffset=0] (Only used internally)
|
|
42
|
-
*/
|
|
43
|
-
constructor(numItems, nodeSize = 16, ArrayType = Float64Array, ArrayBufferType = ArrayBuffer, data, byteOffset = 0) {
|
|
44
|
-
if (numItems === void 0) throw new Error("Missing required argument: numItems.");
|
|
45
|
-
if (isNaN(numItems) || numItems <= 0) throw new Error(`Unexpected numItems value: ${numItems}.`);
|
|
46
|
-
this.numItems = +numItems;
|
|
47
|
-
this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);
|
|
48
|
-
this.byteOffset = byteOffset;
|
|
49
|
-
let n = numItems;
|
|
50
|
-
let numNodes = n;
|
|
51
|
-
this._levelBounds = [n * 4];
|
|
52
|
-
do {
|
|
53
|
-
n = Math.ceil(n / this.nodeSize);
|
|
54
|
-
numNodes += n;
|
|
55
|
-
this._levelBounds.push(numNodes * 4);
|
|
56
|
-
} while (n !== 1);
|
|
57
|
-
this.ArrayType = ArrayType;
|
|
58
|
-
this.IndexArrayType = numNodes < 16384 ? Uint16Array : Uint32Array;
|
|
59
|
-
const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);
|
|
60
|
-
const nodesByteSize = numNodes * 4 * this.ArrayType.BYTES_PER_ELEMENT;
|
|
61
|
-
if (arrayTypeIndex < 0) {
|
|
62
|
-
throw new Error(`Unexpected typed array class: ${ArrayType}.`);
|
|
63
|
-
}
|
|
64
|
-
if (data && data.byteLength !== void 0 && !data.buffer) {
|
|
65
|
-
this.data = data;
|
|
66
|
-
this._boxes = new this.ArrayType(this.data, byteOffset + 8, numNodes * 4);
|
|
67
|
-
this._indices = new this.IndexArrayType(this.data, byteOffset + 8 + nodesByteSize, numNodes);
|
|
68
|
-
this._pos = numNodes * 4;
|
|
69
|
-
this.minX = this._boxes[this._pos - 4];
|
|
70
|
-
this.minY = this._boxes[this._pos - 3];
|
|
71
|
-
this.maxX = this._boxes[this._pos - 2];
|
|
72
|
-
this.maxY = this._boxes[this._pos - 1];
|
|
73
|
-
} else {
|
|
74
|
-
this.data = new ArrayBufferType(8 + nodesByteSize + numNodes * this.IndexArrayType.BYTES_PER_ELEMENT);
|
|
75
|
-
this._boxes = new this.ArrayType(this.data, 8, numNodes * 4);
|
|
76
|
-
this._indices = new this.IndexArrayType(this.data, 8 + nodesByteSize, numNodes);
|
|
77
|
-
this._pos = 0;
|
|
78
|
-
this.minX = Infinity;
|
|
79
|
-
this.minY = Infinity;
|
|
80
|
-
this.maxX = -Infinity;
|
|
81
|
-
this.maxY = -Infinity;
|
|
82
|
-
new Uint8Array(this.data, 0, 2).set([251, (VERSION << 4) + arrayTypeIndex]);
|
|
83
|
-
new Uint16Array(this.data, 2, 1)[0] = nodeSize;
|
|
84
|
-
new Uint32Array(this.data, 4, 1)[0] = numItems;
|
|
85
|
-
}
|
|
86
|
-
this._queue = new FlatQueue();
|
|
87
|
-
}
|
|
88
|
-
/**
|
|
89
|
-
* Add a given rectangle to the index.
|
|
90
|
-
* @param {number} minX
|
|
91
|
-
* @param {number} minY
|
|
92
|
-
* @param {number} maxX
|
|
93
|
-
* @param {number} maxY
|
|
94
|
-
* @returns {number} A zero-based, incremental number that represents the newly added rectangle.
|
|
95
|
-
*/
|
|
96
|
-
add(minX, minY, maxX = minX, maxY = minY) {
|
|
97
|
-
const index = this._pos >> 2;
|
|
98
|
-
const boxes = this._boxes;
|
|
99
|
-
this._indices[index] = index;
|
|
100
|
-
boxes[this._pos++] = minX;
|
|
101
|
-
boxes[this._pos++] = minY;
|
|
102
|
-
boxes[this._pos++] = maxX;
|
|
103
|
-
boxes[this._pos++] = maxY;
|
|
104
|
-
if (minX < this.minX) this.minX = minX;
|
|
105
|
-
if (minY < this.minY) this.minY = minY;
|
|
106
|
-
if (maxX > this.maxX) this.maxX = maxX;
|
|
107
|
-
if (maxY > this.maxY) this.maxY = maxY;
|
|
108
|
-
return index;
|
|
109
|
-
}
|
|
110
|
-
/** Perform indexing of the added rectangles. */
|
|
111
|
-
finish() {
|
|
112
|
-
if (this._pos >> 2 !== this.numItems) {
|
|
113
|
-
throw new Error(`Added ${this._pos >> 2} items when expected ${this.numItems}.`);
|
|
114
|
-
}
|
|
115
|
-
const boxes = this._boxes;
|
|
116
|
-
if (this.numItems <= this.nodeSize) {
|
|
117
|
-
boxes[this._pos++] = this.minX;
|
|
118
|
-
boxes[this._pos++] = this.minY;
|
|
119
|
-
boxes[this._pos++] = this.maxX;
|
|
120
|
-
boxes[this._pos++] = this.maxY;
|
|
121
|
-
return;
|
|
122
|
-
}
|
|
123
|
-
const width = this.maxX - this.minX || 1;
|
|
124
|
-
const height = this.maxY - this.minY || 1;
|
|
125
|
-
const hilbertValues = new Uint32Array(this.numItems);
|
|
126
|
-
const hilbertMax = (1 << 16) - 1;
|
|
127
|
-
for (let i = 0, pos = 0; i < this.numItems; i++) {
|
|
128
|
-
const minX = boxes[pos++];
|
|
129
|
-
const minY = boxes[pos++];
|
|
130
|
-
const maxX = boxes[pos++];
|
|
131
|
-
const maxY = boxes[pos++];
|
|
132
|
-
const x = Math.floor(hilbertMax * ((minX + maxX) / 2 - this.minX) / width);
|
|
133
|
-
const y = Math.floor(hilbertMax * ((minY + maxY) / 2 - this.minY) / height);
|
|
134
|
-
hilbertValues[i] = hilbert(x, y);
|
|
135
|
-
}
|
|
136
|
-
sort(hilbertValues, boxes, this._indices, 0, this.numItems - 1, this.nodeSize);
|
|
137
|
-
for (let i = 0, pos = 0; i < this._levelBounds.length - 1; i++) {
|
|
138
|
-
const end = this._levelBounds[i];
|
|
139
|
-
while (pos < end) {
|
|
140
|
-
const nodeIndex = pos;
|
|
141
|
-
let nodeMinX = boxes[pos++];
|
|
142
|
-
let nodeMinY = boxes[pos++];
|
|
143
|
-
let nodeMaxX = boxes[pos++];
|
|
144
|
-
let nodeMaxY = boxes[pos++];
|
|
145
|
-
for (let j = 1; j < this.nodeSize && pos < end; j++) {
|
|
146
|
-
nodeMinX = Math.min(nodeMinX, boxes[pos++]);
|
|
147
|
-
nodeMinY = Math.min(nodeMinY, boxes[pos++]);
|
|
148
|
-
nodeMaxX = Math.max(nodeMaxX, boxes[pos++]);
|
|
149
|
-
nodeMaxY = Math.max(nodeMaxY, boxes[pos++]);
|
|
150
|
-
}
|
|
151
|
-
this._indices[this._pos >> 2] = nodeIndex;
|
|
152
|
-
boxes[this._pos++] = nodeMinX;
|
|
153
|
-
boxes[this._pos++] = nodeMinY;
|
|
154
|
-
boxes[this._pos++] = nodeMaxX;
|
|
155
|
-
boxes[this._pos++] = nodeMaxY;
|
|
156
|
-
}
|
|
157
|
-
}
|
|
158
|
-
}
|
|
159
|
-
/**
|
|
160
|
-
* Search the index by a bounding box.
|
|
161
|
-
* @param {number} minX
|
|
162
|
-
* @param {number} minY
|
|
163
|
-
* @param {number} maxX
|
|
164
|
-
* @param {number} maxY
|
|
165
|
-
* @param {(index: number) => boolean} [filterFn] An optional function for filtering the results.
|
|
166
|
-
* @returns {number[]} An array of indices of items intersecting or touching the given bounding box.
|
|
167
|
-
*/
|
|
168
|
-
search(minX, minY, maxX, maxY, filterFn) {
|
|
169
|
-
if (this._pos !== this._boxes.length) {
|
|
170
|
-
throw new Error("Data not yet indexed - call index.finish().");
|
|
171
|
-
}
|
|
172
|
-
let nodeIndex = this._boxes.length - 4;
|
|
173
|
-
const queue = [];
|
|
174
|
-
const results = [];
|
|
175
|
-
while (nodeIndex !== void 0) {
|
|
176
|
-
const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
|
|
177
|
-
for (let pos = nodeIndex; pos < end; pos += 4) {
|
|
178
|
-
if (maxX < this._boxes[pos]) continue;
|
|
179
|
-
if (maxY < this._boxes[pos + 1]) continue;
|
|
180
|
-
if (minX > this._boxes[pos + 2]) continue;
|
|
181
|
-
if (minY > this._boxes[pos + 3]) continue;
|
|
182
|
-
const index = this._indices[pos >> 2] | 0;
|
|
183
|
-
if (nodeIndex >= this.numItems * 4) {
|
|
184
|
-
queue.push(index);
|
|
185
|
-
} else if (filterFn === void 0 || filterFn(index)) {
|
|
186
|
-
results.push(index);
|
|
187
|
-
}
|
|
188
|
-
}
|
|
189
|
-
nodeIndex = queue.pop();
|
|
190
|
-
}
|
|
191
|
-
return results;
|
|
192
|
-
}
|
|
193
|
-
/**
|
|
194
|
-
* Search items in order of distance from the given point.
|
|
195
|
-
* @param {number} x
|
|
196
|
-
* @param {number} y
|
|
197
|
-
* @param {number} [maxResults=Infinity]
|
|
198
|
-
* @param {number} [maxDistance=Infinity]
|
|
199
|
-
* @param {(index: number) => boolean} [filterFn] An optional function for filtering the results.
|
|
200
|
-
* @returns {number[]} An array of indices of items found.
|
|
201
|
-
*/
|
|
202
|
-
neighbors(x, y, maxResults = Infinity, maxDistance = Infinity, filterFn) {
|
|
203
|
-
if (this._pos !== this._boxes.length) {
|
|
204
|
-
throw new Error("Data not yet indexed - call index.finish().");
|
|
205
|
-
}
|
|
206
|
-
let nodeIndex = this._boxes.length - 4;
|
|
207
|
-
const q = this._queue;
|
|
208
|
-
const results = [];
|
|
209
|
-
const maxDistSquared = maxDistance * maxDistance;
|
|
210
|
-
outer: while (nodeIndex !== void 0) {
|
|
211
|
-
const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
|
|
212
|
-
for (let pos = nodeIndex; pos < end; pos += 4) {
|
|
213
|
-
const index = this._indices[pos >> 2] | 0;
|
|
214
|
-
const dx = axisDist(x, this._boxes[pos], this._boxes[pos + 2]);
|
|
215
|
-
const dy = axisDist(y, this._boxes[pos + 1], this._boxes[pos + 3]);
|
|
216
|
-
const dist = dx * dx + dy * dy;
|
|
217
|
-
if (dist > maxDistSquared) continue;
|
|
218
|
-
if (nodeIndex >= this.numItems * 4) {
|
|
219
|
-
q.push(index << 1, dist);
|
|
220
|
-
} else if (filterFn === void 0 || filterFn(index)) {
|
|
221
|
-
q.push((index << 1) + 1, dist);
|
|
222
|
-
}
|
|
223
|
-
}
|
|
224
|
-
while (q.length && q.peek() & 1) {
|
|
225
|
-
const dist = q.peekValue();
|
|
226
|
-
if (dist > maxDistSquared) break outer;
|
|
227
|
-
results.push(q.pop() >> 1);
|
|
228
|
-
if (results.length === maxResults) break outer;
|
|
229
|
-
}
|
|
230
|
-
nodeIndex = q.length ? q.pop() >> 1 : void 0;
|
|
231
|
-
}
|
|
232
|
-
q.clear();
|
|
233
|
-
return results;
|
|
234
|
-
}
|
|
235
|
-
}
|
|
236
|
-
function axisDist(k, min, max) {
|
|
237
|
-
return k < min ? min - k : k <= max ? 0 : k - max;
|
|
238
|
-
}
|
|
239
|
-
function upperBound(value, arr) {
|
|
240
|
-
let i = 0;
|
|
241
|
-
let j = arr.length - 1;
|
|
242
|
-
while (i < j) {
|
|
243
|
-
const m = i + j >> 1;
|
|
244
|
-
if (arr[m] > value) {
|
|
245
|
-
j = m;
|
|
246
|
-
} else {
|
|
247
|
-
i = m + 1;
|
|
248
|
-
}
|
|
249
|
-
}
|
|
250
|
-
return arr[i];
|
|
251
|
-
}
|
|
252
|
-
function sort(values, boxes, indices, left, right, nodeSize) {
|
|
253
|
-
if (Math.floor(left / nodeSize) >= Math.floor(right / nodeSize)) return;
|
|
254
|
-
const pivot = values[left + right >> 1];
|
|
255
|
-
let i = left - 1;
|
|
256
|
-
let j = right + 1;
|
|
257
|
-
while (true) {
|
|
258
|
-
do
|
|
259
|
-
i++;
|
|
260
|
-
while (values[i] < pivot);
|
|
261
|
-
do
|
|
262
|
-
j--;
|
|
263
|
-
while (values[j] > pivot);
|
|
264
|
-
if (i >= j) break;
|
|
265
|
-
swap(values, boxes, indices, i, j);
|
|
266
|
-
}
|
|
267
|
-
sort(values, boxes, indices, left, j, nodeSize);
|
|
268
|
-
sort(values, boxes, indices, j + 1, right, nodeSize);
|
|
269
|
-
}
|
|
270
|
-
function swap(values, boxes, indices, i, j) {
|
|
271
|
-
const temp = values[i];
|
|
272
|
-
values[i] = values[j];
|
|
273
|
-
values[j] = temp;
|
|
274
|
-
const k = 4 * i;
|
|
275
|
-
const m = 4 * j;
|
|
276
|
-
const a = boxes[k];
|
|
277
|
-
const b = boxes[k + 1];
|
|
278
|
-
const c = boxes[k + 2];
|
|
279
|
-
const d = boxes[k + 3];
|
|
280
|
-
boxes[k] = boxes[m];
|
|
281
|
-
boxes[k + 1] = boxes[m + 1];
|
|
282
|
-
boxes[k + 2] = boxes[m + 2];
|
|
283
|
-
boxes[k + 3] = boxes[m + 3];
|
|
284
|
-
boxes[m] = a;
|
|
285
|
-
boxes[m + 1] = b;
|
|
286
|
-
boxes[m + 2] = c;
|
|
287
|
-
boxes[m + 3] = d;
|
|
288
|
-
const e = indices[i];
|
|
289
|
-
indices[i] = indices[j];
|
|
290
|
-
indices[j] = e;
|
|
291
|
-
}
|
|
292
|
-
function hilbert(x, y) {
|
|
293
|
-
let a = x ^ y;
|
|
294
|
-
let b = 65535 ^ a;
|
|
295
|
-
let c = 65535 ^ (x | y);
|
|
296
|
-
let d = x & (y ^ 65535);
|
|
297
|
-
let A = a | b >> 1;
|
|
298
|
-
let B = a >> 1 ^ a;
|
|
299
|
-
let C = c >> 1 ^ b & d >> 1 ^ c;
|
|
300
|
-
let D = a & c >> 1 ^ d >> 1 ^ d;
|
|
301
|
-
a = A;
|
|
302
|
-
b = B;
|
|
303
|
-
c = C;
|
|
304
|
-
d = D;
|
|
305
|
-
A = a & a >> 2 ^ b & b >> 2;
|
|
306
|
-
B = a & b >> 2 ^ b & (a ^ b) >> 2;
|
|
307
|
-
C ^= a & c >> 2 ^ b & d >> 2;
|
|
308
|
-
D ^= b & c >> 2 ^ (a ^ b) & d >> 2;
|
|
309
|
-
a = A;
|
|
310
|
-
b = B;
|
|
311
|
-
c = C;
|
|
312
|
-
d = D;
|
|
313
|
-
A = a & a >> 4 ^ b & b >> 4;
|
|
314
|
-
B = a & b >> 4 ^ b & (a ^ b) >> 4;
|
|
315
|
-
C ^= a & c >> 4 ^ b & d >> 4;
|
|
316
|
-
D ^= b & c >> 4 ^ (a ^ b) & d >> 4;
|
|
317
|
-
a = A;
|
|
318
|
-
b = B;
|
|
319
|
-
c = C;
|
|
320
|
-
d = D;
|
|
321
|
-
C ^= a & c >> 8 ^ b & d >> 8;
|
|
322
|
-
D ^= b & c >> 8 ^ (a ^ b) & d >> 8;
|
|
323
|
-
a = C ^ C >> 1;
|
|
324
|
-
b = D ^ D >> 1;
|
|
325
|
-
let i0 = x ^ y;
|
|
326
|
-
let i1 = b | 65535 ^ (i0 | a);
|
|
327
|
-
i0 = (i0 | i0 << 8) & 16711935;
|
|
328
|
-
i0 = (i0 | i0 << 4) & 252645135;
|
|
329
|
-
i0 = (i0 | i0 << 2) & 858993459;
|
|
330
|
-
i0 = (i0 | i0 << 1) & 1431655765;
|
|
331
|
-
i1 = (i1 | i1 << 8) & 16711935;
|
|
332
|
-
i1 = (i1 | i1 << 4) & 252645135;
|
|
333
|
-
i1 = (i1 | i1 << 2) & 858993459;
|
|
334
|
-
i1 = (i1 | i1 << 1) & 1431655765;
|
|
335
|
-
return (i1 << 1 | i0) >>> 0;
|
|
336
|
-
}
|
|
337
|
-
export {
|
|
338
|
-
Flatbush as default
|
|
339
|
-
};
|