davis-components 0.2.76 → 0.2.78

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.
@@ -1,2632 +0,0 @@
1
- import { c as Ln } from "./main-BmaRtLds.js";
2
- var Br = { exports: {} }, xe;
3
- function Kn() {
4
- return xe || (xe = 1, function(tn, Dn) {
5
- (function(B, S) {
6
- tn.exports = S();
7
- })(Ln, function() {
8
- var B = Array.prototype.slice;
9
- function S(t, r) {
10
- r && (t.prototype = Object.create(r.prototype)), t.prototype.constructor = t;
11
- }
12
- function q(t) {
13
- return D(t) ? t : L(t);
14
- }
15
- S(P, q);
16
- function P(t) {
17
- return T(t) ? t : b(t);
18
- }
19
- S(tt, q);
20
- function tt(t) {
21
- return G(t) ? t : O(t);
22
- }
23
- S($, q);
24
- function $(t) {
25
- return D(t) && !ir(t) ? t : ot(t);
26
- }
27
- function D(t) {
28
- return !!(t && t[Yr]);
29
- }
30
- function T(t) {
31
- return !!(t && t[Jr]);
32
- }
33
- function G(t) {
34
- return !!(t && t[Hr]);
35
- }
36
- function ir(t) {
37
- return T(t) || G(t);
38
- }
39
- function nt(t) {
40
- return !!(t && t[St]);
41
- }
42
- q.isIterable = D, q.isKeyed = T, q.isIndexed = G, q.isAssociative = ir, q.isOrdered = nt, q.Keyed = P, q.Indexed = tt, q.Set = $;
43
- var Yr = "@@__IMMUTABLE_ITERABLE__@@", Jr = "@@__IMMUTABLE_KEYED__@@", Hr = "@@__IMMUTABLE_INDEXED__@@", St = "@@__IMMUTABLE_ORDERED__@@", Rt = "delete", I = 5, X = 1 << I, C = X - 1, l = {}, rn = { value: !1 }, Vr = { value: !1 };
44
- function or(t) {
45
- return t.value = !1, t;
46
- }
47
- function Z(t) {
48
- t && (t.value = !0);
49
- }
50
- function ur() {
51
- }
52
- function _t(t, r) {
53
- r = r || 0;
54
- for (var e = Math.max(0, t.length - r), n = new Array(e), i = 0; i < e; i++)
55
- n[i] = t[i + r];
56
- return n;
57
- }
58
- function sr(t) {
59
- return t.size === void 0 && (t.size = t.__iterate(Gr)), t.size;
60
- }
61
- function pt(t, r) {
62
- if (typeof r != "number") {
63
- var e = r >>> 0;
64
- if ("" + e !== r || e === 4294967295)
65
- return NaN;
66
- r = e;
67
- }
68
- return r < 0 ? sr(t) + r : r;
69
- }
70
- function Gr() {
71
- return !0;
72
- }
73
- function Nt(t, r, e) {
74
- return (t === 0 || e !== void 0 && t <= -e) && (r === void 0 || e !== void 0 && r >= e);
75
- }
76
- function gt(t, r) {
77
- return Xr(t, r, 0);
78
- }
79
- function Lt(t, r) {
80
- return Xr(t, r, r);
81
- }
82
- function Xr(t, r, e) {
83
- return t === void 0 ? e : t < 0 ? Math.max(0, r + t) : r === void 0 ? t : Math.min(r, t);
84
- }
85
- var Dt = 0, Q = 1, it = 2, ar = typeof Symbol == "function" && Symbol.iterator, Zr = "@@iterator", fr = ar || Zr;
86
- function m(t) {
87
- this.next = t;
88
- }
89
- m.prototype.toString = function() {
90
- return "[Iterator]";
91
- }, m.KEYS = Dt, m.VALUES = Q, m.ENTRIES = it, m.prototype.inspect = m.prototype.toSource = function() {
92
- return this.toString();
93
- }, m.prototype[fr] = function() {
94
- return this;
95
- };
96
- function w(t, r, e, n) {
97
- var i = t === 0 ? r : t === 1 ? e : [r, e];
98
- return n ? n.value = i : n = {
99
- value: i,
100
- done: !1
101
- }, n;
102
- }
103
- function j() {
104
- return { value: void 0, done: !0 };
105
- }
106
- function Qr(t) {
107
- return !!br(t);
108
- }
109
- function Jt(t) {
110
- return t && typeof t.next == "function";
111
- }
112
- function kt(t) {
113
- var r = br(t);
114
- return r && r.call(t);
115
- }
116
- function br(t) {
117
- var r = t && (ar && t[ar] || t[Zr]);
118
- if (typeof r == "function")
119
- return r;
120
- }
121
- function xr(t) {
122
- return t && typeof t.length == "number";
123
- }
124
- S(L, q);
125
- function L(t) {
126
- return t == null ? Ht() : D(t) ? t.toSeq() : en(t);
127
- }
128
- L.of = function() {
129
- return L(arguments);
130
- }, L.prototype.toSeq = function() {
131
- return this;
132
- }, L.prototype.toString = function() {
133
- return this.__toString("Seq {", "}");
134
- }, L.prototype.cacheResult = function() {
135
- return !this._cache && this.__iterateUncached && (this._cache = this.entrySeq().toArray(), this.size = this._cache.length), this;
136
- }, L.prototype.__iterate = function(t, r) {
137
- return ie(this, t, r, !0);
138
- }, L.prototype.__iterator = function(t, r) {
139
- return oe(this, t, r, !0);
140
- }, S(b, L);
141
- function b(t) {
142
- return t == null ? Ht().toKeyedSeq() : D(t) ? T(t) ? t.toSeq() : t.fromEntrySeq() : ee(t);
143
- }
144
- b.prototype.toKeyedSeq = function() {
145
- return this;
146
- }, S(O, L);
147
- function O(t) {
148
- return t == null ? Ht() : D(t) ? T(t) ? t.entrySeq() : t.toIndexedSeq() : cr(t);
149
- }
150
- O.of = function() {
151
- return O(arguments);
152
- }, O.prototype.toIndexedSeq = function() {
153
- return this;
154
- }, O.prototype.toString = function() {
155
- return this.__toString("Seq [", "]");
156
- }, O.prototype.__iterate = function(t, r) {
157
- return ie(this, t, r, !1);
158
- }, O.prototype.__iterator = function(t, r) {
159
- return oe(this, t, r, !1);
160
- }, S(ot, L);
161
- function ot(t) {
162
- return (t == null ? Ht() : D(t) ? T(t) ? t.entrySeq() : t : cr(t)).toSetSeq();
163
- }
164
- ot.of = function() {
165
- return ot(arguments);
166
- }, ot.prototype.toSetSeq = function() {
167
- return this;
168
- }, L.isSeq = hr, L.Keyed = b, L.Set = ot, L.Indexed = O;
169
- var te = "@@__IMMUTABLE_SEQ__@@";
170
- L.prototype[te] = !0, S(ut, O);
171
- function ut(t) {
172
- this._array = t, this.size = t.length;
173
- }
174
- ut.prototype.get = function(t, r) {
175
- return this.has(t) ? this._array[pt(this, t)] : r;
176
- }, ut.prototype.__iterate = function(t, r) {
177
- for (var e = this._array, n = e.length - 1, i = 0; i <= n; i++)
178
- if (t(e[r ? n - i : i], i, this) === !1)
179
- return i + 1;
180
- return i;
181
- }, ut.prototype.__iterator = function(t, r) {
182
- var e = this._array, n = e.length - 1, i = 0;
183
- return new m(
184
- function() {
185
- return i > n ? j() : w(t, i, e[r ? n - i++ : i++]);
186
- }
187
- );
188
- }, S(vt, b);
189
- function vt(t) {
190
- var r = Object.keys(t);
191
- this._object = t, this._keys = r, this.size = r.length;
192
- }
193
- vt.prototype.get = function(t, r) {
194
- return r !== void 0 && !this.has(t) ? r : this._object[t];
195
- }, vt.prototype.has = function(t) {
196
- return this._object.hasOwnProperty(t);
197
- }, vt.prototype.__iterate = function(t, r) {
198
- for (var e = this._object, n = this._keys, i = n.length - 1, o = 0; o <= i; o++) {
199
- var u = n[r ? i - o : o];
200
- if (t(e[u], u, this) === !1)
201
- return o + 1;
202
- }
203
- return o;
204
- }, vt.prototype.__iterator = function(t, r) {
205
- var e = this._object, n = this._keys, i = n.length - 1, o = 0;
206
- return new m(function() {
207
- var u = n[r ? i - o : o];
208
- return o++ > i ? j() : w(t, u, e[u]);
209
- });
210
- }, vt.prototype[St] = !0, S(Kt, O);
211
- function Kt(t) {
212
- this._iterable = t, this.size = t.length || t.size;
213
- }
214
- Kt.prototype.__iterateUncached = function(t, r) {
215
- if (r)
216
- return this.cacheResult().__iterate(t, r);
217
- var e = this._iterable, n = kt(e), i = 0;
218
- if (Jt(n))
219
- for (var o; !(o = n.next()).done && t(o.value, i++, this) !== !1; )
220
- ;
221
- return i;
222
- }, Kt.prototype.__iteratorUncached = function(t, r) {
223
- if (r)
224
- return this.cacheResult().__iterator(t, r);
225
- var e = this._iterable, n = kt(e);
226
- if (!Jt(n))
227
- return new m(j);
228
- var i = 0;
229
- return new m(function() {
230
- var o = n.next();
231
- return o.done ? o : w(t, i++, o.value);
232
- });
233
- }, S(Ut, O);
234
- function Ut(t) {
235
- this._iterator = t, this._iteratorCache = [];
236
- }
237
- Ut.prototype.__iterateUncached = function(t, r) {
238
- if (r)
239
- return this.cacheResult().__iterate(t, r);
240
- for (var e = this._iterator, n = this._iteratorCache, i = 0; i < n.length; )
241
- if (t(n[i], i++, this) === !1)
242
- return i;
243
- for (var o; !(o = e.next()).done; ) {
244
- var u = o.value;
245
- if (n[i] = u, t(u, i++, this) === !1)
246
- break;
247
- }
248
- return i;
249
- }, Ut.prototype.__iteratorUncached = function(t, r) {
250
- if (r)
251
- return this.cacheResult().__iterator(t, r);
252
- var e = this._iterator, n = this._iteratorCache, i = 0;
253
- return new m(function() {
254
- if (i >= n.length) {
255
- var o = e.next();
256
- if (o.done)
257
- return o;
258
- n[i] = o.value;
259
- }
260
- return w(t, i, n[i++]);
261
- });
262
- };
263
- function hr(t) {
264
- return !!(t && t[te]);
265
- }
266
- var re;
267
- function Ht() {
268
- return re || (re = new ut([]));
269
- }
270
- function ee(t) {
271
- var r = Array.isArray(t) ? new ut(t).fromEntrySeq() : Jt(t) ? new Ut(t).fromEntrySeq() : Qr(t) ? new Kt(t).fromEntrySeq() : typeof t == "object" ? new vt(t) : void 0;
272
- if (!r)
273
- throw new TypeError(
274
- "Expected Array or iterable object of [k, v] entries, or keyed object: " + t
275
- );
276
- return r;
277
- }
278
- function cr(t) {
279
- var r = ne(t);
280
- if (!r)
281
- throw new TypeError(
282
- "Expected Array or iterable object of values: " + t
283
- );
284
- return r;
285
- }
286
- function en(t) {
287
- var r = ne(t) || typeof t == "object" && new vt(t);
288
- if (!r)
289
- throw new TypeError(
290
- "Expected Array or iterable object of values, or keyed object: " + t
291
- );
292
- return r;
293
- }
294
- function ne(t) {
295
- return xr(t) ? new ut(t) : Jt(t) ? new Ut(t) : Qr(t) ? new Kt(t) : void 0;
296
- }
297
- function ie(t, r, e, n) {
298
- var i = t._cache;
299
- if (i) {
300
- for (var o = i.length - 1, u = 0; u <= o; u++) {
301
- var s = i[e ? o - u : u];
302
- if (r(s[1], n ? s[0] : u, t) === !1)
303
- return u + 1;
304
- }
305
- return u;
306
- }
307
- return t.__iterateUncached(r, e);
308
- }
309
- function oe(t, r, e, n) {
310
- var i = t._cache;
311
- if (i) {
312
- var o = i.length - 1, u = 0;
313
- return new m(function() {
314
- var s = i[e ? o - u : u];
315
- return u++ > o ? j() : w(r, n ? s[0] : u - 1, s[1]);
316
- });
317
- }
318
- return t.__iteratorUncached(r, e);
319
- }
320
- function _r(t, r) {
321
- return r ? pr(r, t, "", { "": t }) : vr(t);
322
- }
323
- function pr(t, r, e, n) {
324
- return Array.isArray(r) ? t.call(n, e, O(r).map(function(i, o) {
325
- return pr(t, i, o, r);
326
- })) : ue(r) ? t.call(n, e, b(r).map(function(i, o) {
327
- return pr(t, i, o, r);
328
- })) : r;
329
- }
330
- function vr(t) {
331
- return Array.isArray(t) ? O(t).map(vr).toList() : ue(t) ? b(t).map(vr).toMap() : t;
332
- }
333
- function ue(t) {
334
- return t && (t.constructor === Object || t.constructor === void 0);
335
- }
336
- function R(t, r) {
337
- if (t === r || t !== t && r !== r)
338
- return !0;
339
- if (!t || !r)
340
- return !1;
341
- if (typeof t.valueOf == "function" && typeof r.valueOf == "function") {
342
- if (t = t.valueOf(), r = r.valueOf(), t === r || t !== t && r !== r)
343
- return !0;
344
- if (!t || !r)
345
- return !1;
346
- }
347
- return !!(typeof t.equals == "function" && typeof r.equals == "function" && t.equals(r));
348
- }
349
- function yr(t, r) {
350
- if (t === r)
351
- return !0;
352
- if (!D(r) || t.size !== void 0 && r.size !== void 0 && t.size !== r.size || t.__hash !== void 0 && r.__hash !== void 0 && t.__hash !== r.__hash || T(t) !== T(r) || G(t) !== G(r) || nt(t) !== nt(r))
353
- return !1;
354
- if (t.size === 0 && r.size === 0)
355
- return !0;
356
- var e = !ir(t);
357
- if (nt(t)) {
358
- var n = t.entries();
359
- return r.every(function(a, f) {
360
- var h = n.next().value;
361
- return h && R(h[1], a) && (e || R(h[0], f));
362
- }) && n.next().done;
363
- }
364
- var i = !1;
365
- if (t.size === void 0)
366
- if (r.size === void 0)
367
- typeof t.cacheResult == "function" && t.cacheResult();
368
- else {
369
- i = !0;
370
- var o = t;
371
- t = r, r = o;
372
- }
373
- var u = !0, s = r.__iterate(function(a, f) {
374
- if (e ? !t.has(a) : i ? !R(a, t.get(f, l)) : !R(t.get(f, l), a))
375
- return u = !1, !1;
376
- });
377
- return u && t.size === s;
378
- }
379
- S(U, O);
380
- function U(t, r) {
381
- if (!(this instanceof U))
382
- return new U(t, r);
383
- if (this._value = t, this.size = r === void 0 ? 1 / 0 : Math.max(0, r), this.size === 0) {
384
- if (lr)
385
- return lr;
386
- lr = this;
387
- }
388
- }
389
- U.prototype.toString = function() {
390
- return this.size === 0 ? "Repeat []" : "Repeat [ " + this._value + " " + this.size + " times ]";
391
- }, U.prototype.get = function(t, r) {
392
- return this.has(t) ? this._value : r;
393
- }, U.prototype.includes = function(t) {
394
- return R(this._value, t);
395
- }, U.prototype.slice = function(t, r) {
396
- var e = this.size;
397
- return Nt(t, r, e) ? this : new U(this._value, Lt(r, e) - gt(t, e));
398
- }, U.prototype.reverse = function() {
399
- return this;
400
- }, U.prototype.indexOf = function(t) {
401
- return R(this._value, t) ? 0 : -1;
402
- }, U.prototype.lastIndexOf = function(t) {
403
- return R(this._value, t) ? this.size : -1;
404
- }, U.prototype.__iterate = function(t, r) {
405
- for (var e = 0; e < this.size; e++)
406
- if (t(this._value, e, this) === !1)
407
- return e + 1;
408
- return e;
409
- }, U.prototype.__iterator = function(t, r) {
410
- var e = this, n = 0;
411
- return new m(
412
- function() {
413
- return n < e.size ? w(t, n++, e._value) : j();
414
- }
415
- );
416
- }, U.prototype.equals = function(t) {
417
- return t instanceof U ? R(this._value, t._value) : yr(t);
418
- };
419
- var lr;
420
- function Vt(t, r) {
421
- if (!t) throw new Error(r);
422
- }
423
- S(k, O);
424
- function k(t, r, e) {
425
- if (!(this instanceof k))
426
- return new k(t, r, e);
427
- if (Vt(e !== 0, "Cannot step a Range by 0"), t = t || 0, r === void 0 && (r = 1 / 0), e = e === void 0 ? 1 : Math.abs(e), r < t && (e = -e), this._start = t, this._end = r, this._step = e, this.size = Math.max(0, Math.ceil((r - t) / e - 1) + 1), this.size === 0) {
428
- if (dr)
429
- return dr;
430
- dr = this;
431
- }
432
- }
433
- k.prototype.toString = function() {
434
- return this.size === 0 ? "Range []" : "Range [ " + this._start + "..." + this._end + (this._step !== 1 ? " by " + this._step : "") + " ]";
435
- }, k.prototype.get = function(t, r) {
436
- return this.has(t) ? this._start + pt(this, t) * this._step : r;
437
- }, k.prototype.includes = function(t) {
438
- var r = (t - this._start) / this._step;
439
- return r >= 0 && r < this.size && r === Math.floor(r);
440
- }, k.prototype.slice = function(t, r) {
441
- return Nt(t, r, this.size) ? this : (t = gt(t, this.size), r = Lt(r, this.size), r <= t ? new k(0, 0) : new k(this.get(t, this._end), this.get(r, this._end), this._step));
442
- }, k.prototype.indexOf = function(t) {
443
- var r = t - this._start;
444
- if (r % this._step === 0) {
445
- var e = r / this._step;
446
- if (e >= 0 && e < this.size)
447
- return e;
448
- }
449
- return -1;
450
- }, k.prototype.lastIndexOf = function(t) {
451
- return this.indexOf(t);
452
- }, k.prototype.__iterate = function(t, r) {
453
- for (var e = this.size - 1, n = this._step, i = r ? this._start + e * n : this._start, o = 0; o <= e; o++) {
454
- if (t(i, o, this) === !1)
455
- return o + 1;
456
- i += r ? -n : n;
457
- }
458
- return o;
459
- }, k.prototype.__iterator = function(t, r) {
460
- var e = this.size - 1, n = this._step, i = r ? this._start + e * n : this._start, o = 0;
461
- return new m(function() {
462
- var u = i;
463
- return i += r ? -n : n, o > e ? j() : w(t, o++, u);
464
- });
465
- }, k.prototype.equals = function(t) {
466
- return t instanceof k ? this._start === t._start && this._end === t._end && this._step === t._step : yr(this, t);
467
- };
468
- var dr;
469
- S(yt, q);
470
- function yt() {
471
- throw TypeError("Abstract");
472
- }
473
- S(Pt, yt);
474
- function Pt() {
475
- }
476
- S(wt, yt);
477
- function wt() {
478
- }
479
- S(Gt, yt);
480
- function Gt() {
481
- }
482
- yt.Keyed = Pt, yt.Indexed = wt, yt.Set = Gt;
483
- var Ct = typeof Math.imul == "function" && Math.imul(4294967295, 2) === -2 ? Math.imul : function(r, e) {
484
- r = r | 0, e = e | 0;
485
- var n = r & 65535, i = e & 65535;
486
- return n * i + ((r >>> 16) * i + n * (e >>> 16) << 16 >>> 0) | 0;
487
- };
488
- function mr(t) {
489
- return t >>> 1 & 1073741824 | t & 3221225471;
490
- }
491
- function Y(t) {
492
- if (t === !1 || t === null || t === void 0 || typeof t.valueOf == "function" && (t = t.valueOf(), t === !1 || t === null || t === void 0))
493
- return 0;
494
- if (t === !0)
495
- return 1;
496
- var r = typeof t;
497
- if (r === "number") {
498
- if (t !== t || t === 1 / 0)
499
- return 0;
500
- var e = t | 0;
501
- for (e !== t && (e ^= t * 4294967295); t > 4294967295; )
502
- t /= 4294967295, e ^= t;
503
- return mr(e);
504
- }
505
- if (r === "string")
506
- return t.length > sn ? nn(t) : Sr(t);
507
- if (typeof t.hashCode == "function")
508
- return t.hashCode();
509
- if (r === "object")
510
- return on(t);
511
- if (typeof t.toString == "function")
512
- return Sr(t.toString());
513
- throw new Error("Value type " + r + " cannot be hashed.");
514
- }
515
- function nn(t) {
516
- var r = zr[t];
517
- return r === void 0 && (r = Sr(t), Er === an && (Er = 0, zr = {}), Er++, zr[t] = r), r;
518
- }
519
- function Sr(t) {
520
- for (var r = 0, e = 0; e < t.length; e++)
521
- r = 31 * r + t.charCodeAt(e) | 0;
522
- return mr(r);
523
- }
524
- function on(t) {
525
- var r;
526
- if (gr && (r = wr.get(t), r !== void 0) || (r = t[mt], r !== void 0) || !ae && (r = t.propertyIsEnumerable && t.propertyIsEnumerable[mt], r !== void 0 || (r = un(t), r !== void 0)))
527
- return r;
528
- if (r = ++Ir, Ir & 1073741824 && (Ir = 0), gr)
529
- wr.set(t, r);
530
- else {
531
- if (se !== void 0 && se(t) === !1)
532
- throw new Error("Non-extensible objects are not allowed as keys.");
533
- if (ae)
534
- Object.defineProperty(t, mt, {
535
- enumerable: !1,
536
- configurable: !1,
537
- writable: !1,
538
- value: r
539
- });
540
- else if (t.propertyIsEnumerable !== void 0 && t.propertyIsEnumerable === t.constructor.prototype.propertyIsEnumerable)
541
- t.propertyIsEnumerable = function() {
542
- return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);
543
- }, t.propertyIsEnumerable[mt] = r;
544
- else if (t.nodeType !== void 0)
545
- t[mt] = r;
546
- else
547
- throw new Error("Unable to set a non-enumerable property on object.");
548
- }
549
- return r;
550
- }
551
- var se = Object.isExtensible, ae = function() {
552
- try {
553
- return Object.defineProperty({}, "@", {}), !0;
554
- } catch {
555
- return !1;
556
- }
557
- }();
558
- function un(t) {
559
- if (t && t.nodeType > 0)
560
- switch (t.nodeType) {
561
- case 1:
562
- return t.uniqueID;
563
- case 9:
564
- return t.documentElement && t.documentElement.uniqueID;
565
- }
566
- }
567
- var gr = typeof WeakMap == "function", wr;
568
- gr && (wr = /* @__PURE__ */ new WeakMap());
569
- var Ir = 0, mt = "__immutablehash__";
570
- typeof Symbol == "function" && (mt = Symbol(mt));
571
- var sn = 16, an = 255, Er = 0, zr = {};
572
- function J(t) {
573
- Vt(
574
- t !== 1 / 0,
575
- "Cannot perform this action with an infinite size."
576
- );
577
- }
578
- S(d, Pt);
579
- function d(t) {
580
- return t == null ? rt() : Mr(t) && !nt(t) ? t : rt().withMutations(function(r) {
581
- var e = P(t);
582
- J(e.size), e.forEach(function(n, i) {
583
- return r.set(i, n);
584
- });
585
- });
586
- }
587
- d.of = function() {
588
- var t = B.call(arguments, 0);
589
- return rt().withMutations(function(r) {
590
- for (var e = 0; e < t.length; e += 2) {
591
- if (e + 1 >= t.length)
592
- throw new Error("Missing value for key: " + t[e]);
593
- r.set(t[e], t[e + 1]);
594
- }
595
- });
596
- }, d.prototype.toString = function() {
597
- return this.__toString("Map {", "}");
598
- }, d.prototype.get = function(t, r) {
599
- return this._root ? this._root.get(0, void 0, t, r) : r;
600
- }, d.prototype.set = function(t, r) {
601
- return _e(this, t, r);
602
- }, d.prototype.setIn = function(t, r) {
603
- return this.updateIn(t, l, function() {
604
- return r;
605
- });
606
- }, d.prototype.remove = function(t) {
607
- return _e(this, t, l);
608
- }, d.prototype.deleteIn = function(t) {
609
- return this.updateIn(t, function() {
610
- return l;
611
- });
612
- }, d.prototype.update = function(t, r, e) {
613
- return arguments.length === 1 ? t(this) : this.updateIn([t], r, e);
614
- }, d.prototype.updateIn = function(t, r, e) {
615
- e || (e = r, r = void 0);
616
- var n = de(
617
- this,
618
- Ce(t),
619
- r,
620
- e
621
- );
622
- return n === l ? void 0 : n;
623
- }, d.prototype.clear = function() {
624
- return this.size === 0 ? this : this.__ownerID ? (this.size = 0, this._root = null, this.__hash = void 0, this.__altered = !0, this) : rt();
625
- }, d.prototype.merge = function() {
626
- return Xt(this, void 0, arguments);
627
- }, d.prototype.mergeWith = function(t) {
628
- var r = B.call(arguments, 1);
629
- return Xt(this, t, r);
630
- }, d.prototype.mergeIn = function(t) {
631
- var r = B.call(arguments, 1);
632
- return this.updateIn(
633
- t,
634
- rt(),
635
- function(e) {
636
- return typeof e.merge == "function" ? e.merge.apply(e, r) : r[r.length - 1];
637
- }
638
- );
639
- }, d.prototype.mergeDeep = function() {
640
- return Xt(this, ve, arguments);
641
- }, d.prototype.mergeDeepWith = function(t) {
642
- var r = B.call(arguments, 1);
643
- return Xt(this, ye(t), r);
644
- }, d.prototype.mergeDeepIn = function(t) {
645
- var r = B.call(arguments, 1);
646
- return this.updateIn(
647
- t,
648
- rt(),
649
- function(e) {
650
- return typeof e.mergeDeep == "function" ? e.mergeDeep.apply(e, r) : r[r.length - 1];
651
- }
652
- );
653
- }, d.prototype.sort = function(t) {
654
- return A(At(this, t));
655
- }, d.prototype.sortBy = function(t, r) {
656
- return A(At(this, r, t));
657
- }, d.prototype.withMutations = function(t) {
658
- var r = this.asMutable();
659
- return t(r), r.wasAltered() ? r.__ensureOwner(this.__ownerID) : this;
660
- }, d.prototype.asMutable = function() {
661
- return this.__ownerID ? this : this.__ensureOwner(new ur());
662
- }, d.prototype.asImmutable = function() {
663
- return this.__ensureOwner();
664
- }, d.prototype.wasAltered = function() {
665
- return this.__altered;
666
- }, d.prototype.__iterator = function(t, r) {
667
- return new qr(this, t, r);
668
- }, d.prototype.__iterate = function(t, r) {
669
- var e = this, n = 0;
670
- return this._root && this._root.iterate(function(i) {
671
- return n++, t(i[1], i[0], e);
672
- }, r), n;
673
- }, d.prototype.__ensureOwner = function(t) {
674
- return t === this.__ownerID ? this : t ? Ar(this.size, this._root, t, this.__hash) : (this.__ownerID = t, this.__altered = !1, this);
675
- };
676
- function Mr(t) {
677
- return !!(t && t[fe]);
678
- }
679
- d.isMap = Mr;
680
- var fe = "@@__IMMUTABLE_MAP__@@", y = d.prototype;
681
- y[fe] = !0, y[Rt] = y.remove, y.removeIn = y.deleteIn;
682
- function Ft(t, r) {
683
- this.ownerID = t, this.entries = r;
684
- }
685
- Ft.prototype.get = function(t, r, e, n) {
686
- for (var i = this.entries, o = 0, u = i.length; o < u; o++)
687
- if (R(e, i[o][0]))
688
- return i[o][1];
689
- return n;
690
- }, Ft.prototype.update = function(t, r, e, n, i, o, u) {
691
- for (var s = i === l, a = this.entries, f = 0, h = a.length; f < h && !R(n, a[f][0]); f++)
692
- ;
693
- var c = f < h;
694
- if (c ? a[f][1] === i : s)
695
- return this;
696
- if (Z(u), (s || !c) && Z(o), !(s && a.length === 1)) {
697
- if (!c && !s && a.length >= vn)
698
- return fn(t, a, n, i);
699
- var _ = t && t === this.ownerID, p = _ ? a : _t(a);
700
- return c ? s ? f === h - 1 ? p.pop() : p[f] = p.pop() : p[f] = [n, i] : p.push([n, i]), _ ? (this.entries = p, this) : new Ft(t, p);
701
- }
702
- };
703
- function It(t, r, e) {
704
- this.ownerID = t, this.bitmap = r, this.nodes = e;
705
- }
706
- It.prototype.get = function(t, r, e, n) {
707
- r === void 0 && (r = Y(e));
708
- var i = 1 << ((t === 0 ? r : r >>> t) & C), o = this.bitmap;
709
- return o & i ? this.nodes[me(o & i - 1)].get(t + I, r, e, n) : n;
710
- }, It.prototype.update = function(t, r, e, n, i, o, u) {
711
- e === void 0 && (e = Y(n));
712
- var s = (r === 0 ? e : e >>> r) & C, a = 1 << s, f = this.bitmap, h = (f & a) !== 0;
713
- if (!h && i === l)
714
- return this;
715
- var c = me(f & a - 1), _ = this.nodes, p = h ? _[c] : void 0, v = Tr(p, t, r + I, e, n, i, o, u);
716
- if (v === p)
717
- return this;
718
- if (!h && v && _.length >= yn)
719
- return cn(t, _, f, s, v);
720
- if (h && !v && _.length === 2 && pe(_[c ^ 1]))
721
- return _[c ^ 1];
722
- if (h && v && _.length === 1 && pe(v))
723
- return v;
724
- var M = t && t === this.ownerID, et = h ? v ? f : f ^ a : f | a, ht = h ? v ? Se(_, c, v, M) : pn(_, c, M) : _n(_, c, v, M);
725
- return M ? (this.bitmap = et, this.nodes = ht, this) : new It(t, et, ht);
726
- };
727
- function Wt(t, r, e) {
728
- this.ownerID = t, this.count = r, this.nodes = e;
729
- }
730
- Wt.prototype.get = function(t, r, e, n) {
731
- r === void 0 && (r = Y(e));
732
- var i = (t === 0 ? r : r >>> t) & C, o = this.nodes[i];
733
- return o ? o.get(t + I, r, e, n) : n;
734
- }, Wt.prototype.update = function(t, r, e, n, i, o, u) {
735
- e === void 0 && (e = Y(n));
736
- var s = (r === 0 ? e : e >>> r) & C, a = i === l, f = this.nodes, h = f[s];
737
- if (a && !h)
738
- return this;
739
- var c = Tr(h, t, r + I, e, n, i, o, u);
740
- if (c === h)
741
- return this;
742
- var _ = this.count;
743
- if (!h)
744
- _++;
745
- else if (!c && (_--, _ < ln))
746
- return hn(t, f, _, s);
747
- var p = t && t === this.ownerID, v = Se(f, s, c, p);
748
- return p ? (this.count = _, this.nodes = v, this) : new Wt(t, _, v);
749
- };
750
- function Et(t, r, e) {
751
- this.ownerID = t, this.keyHash = r, this.entries = e;
752
- }
753
- Et.prototype.get = function(t, r, e, n) {
754
- for (var i = this.entries, o = 0, u = i.length; o < u; o++)
755
- if (R(e, i[o][0]))
756
- return i[o][1];
757
- return n;
758
- }, Et.prototype.update = function(t, r, e, n, i, o, u) {
759
- e === void 0 && (e = Y(n));
760
- var s = i === l;
761
- if (e !== this.keyHash)
762
- return s ? this : (Z(u), Z(o), Rr(this, t, r, e, [n, i]));
763
- for (var a = this.entries, f = 0, h = a.length; f < h && !R(n, a[f][0]); f++)
764
- ;
765
- var c = f < h;
766
- if (c ? a[f][1] === i : s)
767
- return this;
768
- if (Z(u), (s || !c) && Z(o), s && h === 2)
769
- return new ct(t, this.keyHash, a[f ^ 1]);
770
- var _ = t && t === this.ownerID, p = _ ? a : _t(a);
771
- return c ? s ? f === h - 1 ? p.pop() : p[f] = p.pop() : p[f] = [n, i] : p.push([n, i]), _ ? (this.entries = p, this) : new Et(t, this.keyHash, p);
772
- };
773
- function ct(t, r, e) {
774
- this.ownerID = t, this.keyHash = r, this.entry = e;
775
- }
776
- ct.prototype.get = function(t, r, e, n) {
777
- return R(e, this.entry[0]) ? this.entry[1] : n;
778
- }, ct.prototype.update = function(t, r, e, n, i, o, u) {
779
- var s = i === l, a = R(n, this.entry[0]);
780
- if (a ? i === this.entry[1] : s)
781
- return this;
782
- if (Z(u), s) {
783
- Z(o);
784
- return;
785
- }
786
- return a ? t && t === this.ownerID ? (this.entry[1] = i, this) : new ct(t, this.keyHash, [n, i]) : (Z(o), Rr(this, t, r, Y(n), [n, i]));
787
- }, Ft.prototype.iterate = Et.prototype.iterate = function(t, r) {
788
- for (var e = this.entries, n = 0, i = e.length - 1; n <= i; n++)
789
- if (t(e[r ? i - n : n]) === !1)
790
- return !1;
791
- }, It.prototype.iterate = Wt.prototype.iterate = function(t, r) {
792
- for (var e = this.nodes, n = 0, i = e.length - 1; n <= i; n++) {
793
- var o = e[r ? i - n : n];
794
- if (o && o.iterate(t, r) === !1)
795
- return !1;
796
- }
797
- }, ct.prototype.iterate = function(t, r) {
798
- return t(this.entry);
799
- }, S(qr, m);
800
- function qr(t, r, e) {
801
- this._type = r, this._reverse = e, this._stack = t._root && he(t._root);
802
- }
803
- qr.prototype.next = function() {
804
- for (var t = this._type, r = this._stack; r; ) {
805
- var e = r.node, n = r.index++, i;
806
- if (e.entry) {
807
- if (n === 0)
808
- return Or(t, e.entry);
809
- } else if (e.entries) {
810
- if (i = e.entries.length - 1, n <= i)
811
- return Or(t, e.entries[this._reverse ? i - n : n]);
812
- } else if (i = e.nodes.length - 1, n <= i) {
813
- var o = e.nodes[this._reverse ? i - n : n];
814
- if (o) {
815
- if (o.entry)
816
- return Or(t, o.entry);
817
- r = this._stack = he(o, r);
818
- }
819
- continue;
820
- }
821
- r = this._stack = this._stack.__prev;
822
- }
823
- return j();
824
- };
825
- function Or(t, r) {
826
- return w(t, r[0], r[1]);
827
- }
828
- function he(t, r) {
829
- return {
830
- node: t,
831
- index: 0,
832
- __prev: r
833
- };
834
- }
835
- function Ar(t, r, e, n) {
836
- var i = Object.create(y);
837
- return i.size = t, i._root = r, i.__ownerID = e, i.__hash = n, i.__altered = !1, i;
838
- }
839
- var ce;
840
- function rt() {
841
- return ce || (ce = Ar(0));
842
- }
843
- function _e(t, r, e) {
844
- var n, i;
845
- if (t._root) {
846
- var o = or(rn), u = or(Vr);
847
- if (n = Tr(t._root, t.__ownerID, 0, void 0, r, e, o, u), !u.value)
848
- return t;
849
- i = t.size + (o.value ? e === l ? -1 : 1 : 0);
850
- } else {
851
- if (e === l)
852
- return t;
853
- i = 1, n = new Ft(t.__ownerID, [[r, e]]);
854
- }
855
- return t.__ownerID ? (t.size = i, t._root = n, t.__hash = void 0, t.__altered = !0, t) : n ? Ar(i, n) : rt();
856
- }
857
- function Tr(t, r, e, n, i, o, u, s) {
858
- return t ? t.update(r, e, n, i, o, u, s) : o === l ? t : (Z(s), Z(u), new ct(r, n, [i, o]));
859
- }
860
- function pe(t) {
861
- return t.constructor === ct || t.constructor === Et;
862
- }
863
- function Rr(t, r, e, n, i) {
864
- if (t.keyHash === n)
865
- return new Et(r, n, [t.entry, i]);
866
- var o = (e === 0 ? t.keyHash : t.keyHash >>> e) & C, u = (e === 0 ? n : n >>> e) & C, s, a = o === u ? [Rr(t, r, e + I, n, i)] : (s = new ct(r, n, i), o < u ? [t, s] : [s, t]);
867
- return new It(r, 1 << o | 1 << u, a);
868
- }
869
- function fn(t, r, e, n) {
870
- t || (t = new ur());
871
- for (var i = new ct(t, Y(e), [e, n]), o = 0; o < r.length; o++) {
872
- var u = r[o];
873
- i = i.update(t, 0, void 0, u[0], u[1]);
874
- }
875
- return i;
876
- }
877
- function hn(t, r, e, n) {
878
- for (var i = 0, o = 0, u = new Array(e), s = 0, a = 1, f = r.length; s < f; s++, a <<= 1) {
879
- var h = r[s];
880
- h !== void 0 && s !== n && (i |= a, u[o++] = h);
881
- }
882
- return new It(t, i, u);
883
- }
884
- function cn(t, r, e, n, i) {
885
- for (var o = 0, u = new Array(X), s = 0; e !== 0; s++, e >>>= 1)
886
- u[s] = e & 1 ? r[o++] : void 0;
887
- return u[n] = i, new Wt(t, o + 1, u);
888
- }
889
- function Xt(t, r, e) {
890
- for (var n = [], i = 0; i < e.length; i++) {
891
- var o = e[i], u = P(o);
892
- D(o) || (u = u.map(function(s) {
893
- return _r(s);
894
- })), n.push(u);
895
- }
896
- return le(t, r, n);
897
- }
898
- function ve(t, r, e) {
899
- return t && t.mergeDeep && D(r) ? t.mergeDeep(r) : R(t, r) ? t : r;
900
- }
901
- function ye(t) {
902
- return function(r, e, n) {
903
- if (r && r.mergeDeepWith && D(e))
904
- return r.mergeDeepWith(t, e);
905
- var i = t(r, e, n);
906
- return R(r, i) ? r : i;
907
- };
908
- }
909
- function le(t, r, e) {
910
- return e = e.filter(function(n) {
911
- return n.size !== 0;
912
- }), e.length === 0 ? t : t.size === 0 && !t.__ownerID && e.length === 1 ? t.constructor(e[0]) : t.withMutations(function(n) {
913
- for (var i = r ? function(u, s) {
914
- n.update(
915
- s,
916
- l,
917
- function(a) {
918
- return a === l ? u : r(a, u, s);
919
- }
920
- );
921
- } : function(u, s) {
922
- n.set(s, u);
923
- }, o = 0; o < e.length; o++)
924
- e[o].forEach(i);
925
- });
926
- }
927
- function de(t, r, e, n) {
928
- var i = t === l, o = r.next();
929
- if (o.done) {
930
- var u = i ? e : t, s = n(u);
931
- return s === u ? t : s;
932
- }
933
- Vt(
934
- i || t && t.set,
935
- "invalid keyPath"
936
- );
937
- var a = o.value, f = i ? l : t.get(a, l), h = de(
938
- f,
939
- r,
940
- e,
941
- n
942
- );
943
- return h === f ? t : h === l ? t.remove(a) : (i ? rt() : t).set(a, h);
944
- }
945
- function me(t) {
946
- return t = t - (t >> 1 & 1431655765), t = (t & 858993459) + (t >> 2 & 858993459), t = t + (t >> 4) & 252645135, t = t + (t >> 8), t = t + (t >> 16), t & 127;
947
- }
948
- function Se(t, r, e, n) {
949
- var i = n ? t : _t(t);
950
- return i[r] = e, i;
951
- }
952
- function _n(t, r, e, n) {
953
- var i = t.length + 1;
954
- if (n && r + 1 === i)
955
- return t[r] = e, t;
956
- for (var o = new Array(i), u = 0, s = 0; s < i; s++)
957
- s === r ? (o[s] = e, u = -1) : o[s] = t[s + u];
958
- return o;
959
- }
960
- function pn(t, r, e) {
961
- var n = t.length - 1;
962
- if (e && r === n)
963
- return t.pop(), t;
964
- for (var i = new Array(n), o = 0, u = 0; u < n; u++)
965
- u === r && (o = 1), i[u] = t[u + o];
966
- return i;
967
- }
968
- var vn = X / 4, yn = X / 2, ln = X / 4;
969
- S(E, wt);
970
- function E(t) {
971
- var r = Nr();
972
- if (t == null)
973
- return r;
974
- if (ge(t))
975
- return t;
976
- var e = tt(t), n = e.size;
977
- return n === 0 ? r : (J(n), n > 0 && n < X ? jt(0, n, I, null, new lt(e.toArray())) : r.withMutations(function(i) {
978
- i.setSize(n), e.forEach(function(o, u) {
979
- return i.set(u, o);
980
- });
981
- }));
982
- }
983
- E.of = function() {
984
- return this(arguments);
985
- }, E.prototype.toString = function() {
986
- return this.__toString("List [", "]");
987
- }, E.prototype.get = function(t, r) {
988
- if (t = pt(this, t), t >= 0 && t < this.size) {
989
- t += this._origin;
990
- var e = ze(this, t);
991
- return e && e.array[t & C];
992
- }
993
- return r;
994
- }, E.prototype.set = function(t, r) {
995
- return dn(this, t, r);
996
- }, E.prototype.remove = function(t) {
997
- return this.has(t) ? t === 0 ? this.shift() : t === this.size - 1 ? this.pop() : this.splice(t, 1) : this;
998
- }, E.prototype.insert = function(t, r) {
999
- return this.splice(t, 0, r);
1000
- }, E.prototype.clear = function() {
1001
- return this.size === 0 ? this : this.__ownerID ? (this.size = this._origin = this._capacity = 0, this._level = I, this._root = this._tail = null, this.__hash = void 0, this.__altered = !0, this) : Nr();
1002
- }, E.prototype.push = function() {
1003
- var t = arguments, r = this.size;
1004
- return this.withMutations(function(e) {
1005
- dt(e, 0, r + t.length);
1006
- for (var n = 0; n < t.length; n++)
1007
- e.set(r + n, t[n]);
1008
- });
1009
- }, E.prototype.pop = function() {
1010
- return dt(this, 0, -1);
1011
- }, E.prototype.unshift = function() {
1012
- var t = arguments;
1013
- return this.withMutations(function(r) {
1014
- dt(r, -t.length);
1015
- for (var e = 0; e < t.length; e++)
1016
- r.set(e, t[e]);
1017
- });
1018
- }, E.prototype.shift = function() {
1019
- return dt(this, 1);
1020
- }, E.prototype.merge = function() {
1021
- return Zt(this, void 0, arguments);
1022
- }, E.prototype.mergeWith = function(t) {
1023
- var r = B.call(arguments, 1);
1024
- return Zt(this, t, r);
1025
- }, E.prototype.mergeDeep = function() {
1026
- return Zt(this, ve, arguments);
1027
- }, E.prototype.mergeDeepWith = function(t) {
1028
- var r = B.call(arguments, 1);
1029
- return Zt(this, ye(t), r);
1030
- }, E.prototype.setSize = function(t) {
1031
- return dt(this, 0, t);
1032
- }, E.prototype.slice = function(t, r) {
1033
- var e = this.size;
1034
- return Nt(t, r, e) ? this : dt(
1035
- this,
1036
- gt(t, e),
1037
- Lt(r, e)
1038
- );
1039
- }, E.prototype.__iterator = function(t, r) {
1040
- var e = 0, n = Ie(this, r);
1041
- return new m(function() {
1042
- var i = n();
1043
- return i === $t ? j() : w(t, e++, i);
1044
- });
1045
- }, E.prototype.__iterate = function(t, r) {
1046
- for (var e = 0, n = Ie(this, r), i; (i = n()) !== $t && t(i, e++, this) !== !1; )
1047
- ;
1048
- return e;
1049
- }, E.prototype.__ensureOwner = function(t) {
1050
- return t === this.__ownerID ? this : t ? jt(this._origin, this._capacity, this._level, this._root, this._tail, t, this.__hash) : (this.__ownerID = t, this);
1051
- };
1052
- function ge(t) {
1053
- return !!(t && t[we]);
1054
- }
1055
- E.isList = ge;
1056
- var we = "@@__IMMUTABLE_LIST__@@", F = E.prototype;
1057
- F[we] = !0, F[Rt] = F.remove, F.setIn = y.setIn, F.deleteIn = F.removeIn = y.removeIn, F.update = y.update, F.updateIn = y.updateIn, F.mergeIn = y.mergeIn, F.mergeDeepIn = y.mergeDeepIn, F.withMutations = y.withMutations, F.asMutable = y.asMutable, F.asImmutable = y.asImmutable, F.wasAltered = y.wasAltered;
1058
- function lt(t, r) {
1059
- this.array = t, this.ownerID = r;
1060
- }
1061
- lt.prototype.removeBefore = function(t, r, e) {
1062
- if (e === r ? 1 << r : this.array.length === 0)
1063
- return this;
1064
- var n = e >>> r & C;
1065
- if (n >= this.array.length)
1066
- return new lt([], t);
1067
- var i = n === 0, o;
1068
- if (r > 0) {
1069
- var u = this.array[n];
1070
- if (o = u && u.removeBefore(t, r - I, e), o === u && i)
1071
- return this;
1072
- }
1073
- if (i && !o)
1074
- return this;
1075
- var s = zt(this, t);
1076
- if (!i)
1077
- for (var a = 0; a < n; a++)
1078
- s.array[a] = void 0;
1079
- return o && (s.array[n] = o), s;
1080
- }, lt.prototype.removeAfter = function(t, r, e) {
1081
- if (e === (r ? 1 << r : 0) || this.array.length === 0)
1082
- return this;
1083
- var n = e - 1 >>> r & C;
1084
- if (n >= this.array.length)
1085
- return this;
1086
- var i;
1087
- if (r > 0) {
1088
- var o = this.array[n];
1089
- if (i = o && o.removeAfter(t, r - I, e), i === o && n === this.array.length - 1)
1090
- return this;
1091
- }
1092
- var u = zt(this, t);
1093
- return u.array.splice(n + 1), i && (u.array[n] = i), u;
1094
- };
1095
- var $t = {};
1096
- function Ie(t, r) {
1097
- var e = t._origin, n = t._capacity, i = Bt(n), o = t._tail;
1098
- return u(t._root, t._level, 0);
1099
- function u(f, h, c) {
1100
- return h === 0 ? s(f, c) : a(f, h, c);
1101
- }
1102
- function s(f, h) {
1103
- var c = h === i ? o && o.array : f && f.array, _ = h > e ? 0 : e - h, p = n - h;
1104
- return p > X && (p = X), function() {
1105
- if (_ === p)
1106
- return $t;
1107
- var v = r ? --p : _++;
1108
- return c && c[v];
1109
- };
1110
- }
1111
- function a(f, h, c) {
1112
- var _, p = f && f.array, v = c > e ? 0 : e - c >> h, M = (n - c >> h) + 1;
1113
- return M > X && (M = X), function() {
1114
- do {
1115
- if (_) {
1116
- var et = _();
1117
- if (et !== $t)
1118
- return et;
1119
- _ = null;
1120
- }
1121
- if (v === M)
1122
- return $t;
1123
- var ht = r ? --M : v++;
1124
- _ = u(
1125
- p && p[ht],
1126
- h - I,
1127
- c + (ht << h)
1128
- );
1129
- } while (!0);
1130
- };
1131
- }
1132
- }
1133
- function jt(t, r, e, n, i, o, u) {
1134
- var s = Object.create(F);
1135
- return s.size = r - t, s._origin = t, s._capacity = r, s._level = e, s._root = n, s._tail = i, s.__ownerID = o, s.__hash = u, s.__altered = !1, s;
1136
- }
1137
- var Ee;
1138
- function Nr() {
1139
- return Ee || (Ee = jt(0, 0, I));
1140
- }
1141
- function dn(t, r, e) {
1142
- if (r = pt(t, r), r !== r)
1143
- return t;
1144
- if (r >= t.size || r < 0)
1145
- return t.withMutations(function(u) {
1146
- r < 0 ? dt(u, r).set(0, e) : dt(u, 0, r + 1).set(r, e);
1147
- });
1148
- r += t._origin;
1149
- var n = t._tail, i = t._root, o = or(Vr);
1150
- return r >= Bt(t._capacity) ? n = Lr(n, t.__ownerID, 0, r, e, o) : i = Lr(i, t.__ownerID, t._level, r, e, o), o.value ? t.__ownerID ? (t._root = i, t._tail = n, t.__hash = void 0, t.__altered = !0, t) : jt(t._origin, t._capacity, t._level, i, n) : t;
1151
- }
1152
- function Lr(t, r, e, n, i, o) {
1153
- var u = n >>> e & C, s = t && u < t.array.length;
1154
- if (!s && i === void 0)
1155
- return t;
1156
- var a;
1157
- if (e > 0) {
1158
- var f = t && t.array[u], h = Lr(f, r, e - I, n, i, o);
1159
- return h === f ? t : (a = zt(t, r), a.array[u] = h, a);
1160
- }
1161
- return s && t.array[u] === i ? t : (Z(o), a = zt(t, r), i === void 0 && u === a.array.length - 1 ? a.array.pop() : a.array[u] = i, a);
1162
- }
1163
- function zt(t, r) {
1164
- return r && t && r === t.ownerID ? t : new lt(t ? t.array.slice() : [], r);
1165
- }
1166
- function ze(t, r) {
1167
- if (r >= Bt(t._capacity))
1168
- return t._tail;
1169
- if (r < 1 << t._level + I) {
1170
- for (var e = t._root, n = t._level; e && n > 0; )
1171
- e = e.array[r >>> n & C], n -= I;
1172
- return e;
1173
- }
1174
- }
1175
- function dt(t, r, e) {
1176
- r !== void 0 && (r = r | 0), e !== void 0 && (e = e | 0);
1177
- var n = t.__ownerID || new ur(), i = t._origin, o = t._capacity, u = i + r, s = e === void 0 ? o : e < 0 ? o + e : i + e;
1178
- if (u === i && s === o)
1179
- return t;
1180
- if (u >= s)
1181
- return t.clear();
1182
- for (var a = t._level, f = t._root, h = 0; u + h < 0; )
1183
- f = new lt(f && f.array.length ? [void 0, f] : [], n), a += I, h += 1 << a;
1184
- h && (u += h, i += h, s += h, o += h);
1185
- for (var c = Bt(o), _ = Bt(s); _ >= 1 << a + I; )
1186
- f = new lt(f && f.array.length ? [f] : [], n), a += I;
1187
- var p = t._tail, v = _ < c ? ze(t, s - 1) : _ > c ? new lt([], n) : p;
1188
- if (p && _ > c && u < o && p.array.length) {
1189
- f = zt(f, n);
1190
- for (var M = f, et = a; et > I; et -= I) {
1191
- var ht = c >>> et & C;
1192
- M = M.array[ht] = zt(M.array[ht], n);
1193
- }
1194
- M.array[c >>> I & C] = p;
1195
- }
1196
- if (s < o && (v = v && v.removeAfter(n, 0, s)), u >= _)
1197
- u -= _, s -= _, a = I, f = null, v = v && v.removeBefore(n, 0, u);
1198
- else if (u > i || _ < c) {
1199
- for (h = 0; f; ) {
1200
- var nr = u >>> a & C;
1201
- if (nr !== _ >>> a & C)
1202
- break;
1203
- nr && (h += (1 << a) * nr), a -= I, f = f.array[nr];
1204
- }
1205
- f && u > i && (f = f.removeBefore(n, a, u - h)), f && _ < c && (f = f.removeAfter(n, a, _ - h)), h && (u -= h, s -= h);
1206
- }
1207
- return t.__ownerID ? (t.size = s - u, t._origin = u, t._capacity = s, t._level = a, t._root = f, t._tail = v, t.__hash = void 0, t.__altered = !0, t) : jt(u, s, a, f, v);
1208
- }
1209
- function Zt(t, r, e) {
1210
- for (var n = [], i = 0, o = 0; o < e.length; o++) {
1211
- var u = e[o], s = tt(u);
1212
- s.size > i && (i = s.size), D(u) || (s = s.map(function(a) {
1213
- return _r(a);
1214
- })), n.push(s);
1215
- }
1216
- return i > t.size && (t = t.setSize(i)), le(t, r, n);
1217
- }
1218
- function Bt(t) {
1219
- return t < X ? 0 : t - 1 >>> I << I;
1220
- }
1221
- S(A, d);
1222
- function A(t) {
1223
- return t == null ? Qt() : Me(t) ? t : Qt().withMutations(function(r) {
1224
- var e = P(t);
1225
- J(e.size), e.forEach(function(n, i) {
1226
- return r.set(i, n);
1227
- });
1228
- });
1229
- }
1230
- A.of = function() {
1231
- return this(arguments);
1232
- }, A.prototype.toString = function() {
1233
- return this.__toString("OrderedMap {", "}");
1234
- }, A.prototype.get = function(t, r) {
1235
- var e = this._map.get(t);
1236
- return e !== void 0 ? this._list.get(e)[1] : r;
1237
- }, A.prototype.clear = function() {
1238
- return this.size === 0 ? this : this.__ownerID ? (this.size = 0, this._map.clear(), this._list.clear(), this) : Qt();
1239
- }, A.prototype.set = function(t, r) {
1240
- return Oe(this, t, r);
1241
- }, A.prototype.remove = function(t) {
1242
- return Oe(this, t, l);
1243
- }, A.prototype.wasAltered = function() {
1244
- return this._map.wasAltered() || this._list.wasAltered();
1245
- }, A.prototype.__iterate = function(t, r) {
1246
- var e = this;
1247
- return this._list.__iterate(
1248
- function(n) {
1249
- return n && t(n[1], n[0], e);
1250
- },
1251
- r
1252
- );
1253
- }, A.prototype.__iterator = function(t, r) {
1254
- return this._list.fromEntrySeq().__iterator(t, r);
1255
- }, A.prototype.__ensureOwner = function(t) {
1256
- if (t === this.__ownerID)
1257
- return this;
1258
- var r = this._map.__ensureOwner(t), e = this._list.__ensureOwner(t);
1259
- return t ? Dr(r, e, t, this.__hash) : (this.__ownerID = t, this._map = r, this._list = e, this);
1260
- };
1261
- function Me(t) {
1262
- return Mr(t) && nt(t);
1263
- }
1264
- A.isOrderedMap = Me, A.prototype[St] = !0, A.prototype[Rt] = A.prototype.remove;
1265
- function Dr(t, r, e, n) {
1266
- var i = Object.create(A.prototype);
1267
- return i.size = t ? t.size : 0, i._map = t, i._list = r, i.__ownerID = e, i.__hash = n, i;
1268
- }
1269
- var qe;
1270
- function Qt() {
1271
- return qe || (qe = Dr(rt(), Nr()));
1272
- }
1273
- function Oe(t, r, e) {
1274
- var n = t._map, i = t._list, o = n.get(r), u = o !== void 0, s, a;
1275
- if (e === l) {
1276
- if (!u)
1277
- return t;
1278
- i.size >= X && i.size >= n.size * 2 ? (a = i.filter(function(f, h) {
1279
- return f !== void 0 && o !== h;
1280
- }), s = a.toKeyedSeq().map(function(f) {
1281
- return f[0];
1282
- }).flip().toMap(), t.__ownerID && (s.__ownerID = a.__ownerID = t.__ownerID)) : (s = n.remove(r), a = o === i.size - 1 ? i.pop() : i.set(o, void 0));
1283
- } else if (u) {
1284
- if (e === i.get(o)[1])
1285
- return t;
1286
- s = n, a = i.set(o, [r, e]);
1287
- } else
1288
- s = n.set(r, i.size), a = i.set(i.size, [r, e]);
1289
- return t.__ownerID ? (t.size = s.size, t._map = s, t._list = a, t.__hash = void 0, t) : Dr(s, a);
1290
- }
1291
- S(x, b);
1292
- function x(t, r) {
1293
- this._iter = t, this._useKeys = r, this.size = t.size;
1294
- }
1295
- x.prototype.get = function(t, r) {
1296
- return this._iter.get(t, r);
1297
- }, x.prototype.has = function(t) {
1298
- return this._iter.has(t);
1299
- }, x.prototype.valueSeq = function() {
1300
- return this._iter.valueSeq();
1301
- }, x.prototype.reverse = function() {
1302
- var t = this, r = kr(this, !0);
1303
- return this._useKeys || (r.valueSeq = function() {
1304
- return t._iter.toSeq().reverse();
1305
- }), r;
1306
- }, x.prototype.map = function(t, r) {
1307
- var e = this, n = Te(this, t, r);
1308
- return this._useKeys || (n.valueSeq = function() {
1309
- return e._iter.toSeq().map(t, r);
1310
- }), n;
1311
- }, x.prototype.__iterate = function(t, r) {
1312
- var e = this, n;
1313
- return this._iter.__iterate(
1314
- this._useKeys ? function(i, o) {
1315
- return t(i, o, e);
1316
- } : (n = r ? Ke(this) : 0, function(i) {
1317
- return t(i, r ? --n : n++, e);
1318
- }),
1319
- r
1320
- );
1321
- }, x.prototype.__iterator = function(t, r) {
1322
- if (this._useKeys)
1323
- return this._iter.__iterator(t, r);
1324
- var e = this._iter.__iterator(Q, r), n = r ? Ke(this) : 0;
1325
- return new m(function() {
1326
- var i = e.next();
1327
- return i.done ? i : w(t, r ? --n : n++, i.value, i);
1328
- });
1329
- }, x.prototype[St] = !0, S(Mt, O);
1330
- function Mt(t) {
1331
- this._iter = t, this.size = t.size;
1332
- }
1333
- Mt.prototype.includes = function(t) {
1334
- return this._iter.includes(t);
1335
- }, Mt.prototype.__iterate = function(t, r) {
1336
- var e = this, n = 0;
1337
- return this._iter.__iterate(function(i) {
1338
- return t(i, n++, e);
1339
- }, r);
1340
- }, Mt.prototype.__iterator = function(t, r) {
1341
- var e = this._iter.__iterator(Q, r), n = 0;
1342
- return new m(function() {
1343
- var i = e.next();
1344
- return i.done ? i : w(t, n++, i.value, i);
1345
- });
1346
- }, S(qt, ot);
1347
- function qt(t) {
1348
- this._iter = t, this.size = t.size;
1349
- }
1350
- qt.prototype.has = function(t) {
1351
- return this._iter.includes(t);
1352
- }, qt.prototype.__iterate = function(t, r) {
1353
- var e = this;
1354
- return this._iter.__iterate(function(n) {
1355
- return t(n, n, e);
1356
- }, r);
1357
- }, qt.prototype.__iterator = function(t, r) {
1358
- var e = this._iter.__iterator(Q, r);
1359
- return new m(function() {
1360
- var n = e.next();
1361
- return n.done ? n : w(t, n.value, n.value, n);
1362
- });
1363
- }, S(Ot, b);
1364
- function Ot(t) {
1365
- this._iter = t, this.size = t.size;
1366
- }
1367
- Ot.prototype.entrySeq = function() {
1368
- return this._iter.toSeq();
1369
- }, Ot.prototype.__iterate = function(t, r) {
1370
- var e = this;
1371
- return this._iter.__iterate(function(n) {
1372
- if (n) {
1373
- ke(n);
1374
- var i = D(n);
1375
- return t(
1376
- i ? n.get(1) : n[1],
1377
- i ? n.get(0) : n[0],
1378
- e
1379
- );
1380
- }
1381
- }, r);
1382
- }, Ot.prototype.__iterator = function(t, r) {
1383
- var e = this._iter.__iterator(Q, r);
1384
- return new m(function() {
1385
- for (; ; ) {
1386
- var n = e.next();
1387
- if (n.done)
1388
- return n;
1389
- var i = n.value;
1390
- if (i) {
1391
- ke(i);
1392
- var o = D(i);
1393
- return w(
1394
- t,
1395
- o ? i.get(0) : i[0],
1396
- o ? i.get(1) : i[1],
1397
- n
1398
- );
1399
- }
1400
- }
1401
- });
1402
- }, Mt.prototype.cacheResult = x.prototype.cacheResult = qt.prototype.cacheResult = Ot.prototype.cacheResult = Pr;
1403
- function Ae(t) {
1404
- var r = st(t);
1405
- return r._iter = t, r.size = t.size, r.flip = function() {
1406
- return t;
1407
- }, r.reverse = function() {
1408
- var e = t.reverse.apply(this);
1409
- return e.flip = function() {
1410
- return t.reverse();
1411
- }, e;
1412
- }, r.has = function(e) {
1413
- return t.includes(e);
1414
- }, r.includes = function(e) {
1415
- return t.has(e);
1416
- }, r.cacheResult = Pr, r.__iterateUncached = function(e, n) {
1417
- var i = this;
1418
- return t.__iterate(function(o, u) {
1419
- return e(u, o, i) !== !1;
1420
- }, n);
1421
- }, r.__iteratorUncached = function(e, n) {
1422
- if (e === it) {
1423
- var i = t.__iterator(e, n);
1424
- return new m(function() {
1425
- var o = i.next();
1426
- if (!o.done) {
1427
- var u = o.value[0];
1428
- o.value[0] = o.value[1], o.value[1] = u;
1429
- }
1430
- return o;
1431
- });
1432
- }
1433
- return t.__iterator(
1434
- e === Q ? Dt : Q,
1435
- n
1436
- );
1437
- }, r;
1438
- }
1439
- function Te(t, r, e) {
1440
- var n = st(t);
1441
- return n.size = t.size, n.has = function(i) {
1442
- return t.has(i);
1443
- }, n.get = function(i, o) {
1444
- var u = t.get(i, l);
1445
- return u === l ? o : r.call(e, u, i, t);
1446
- }, n.__iterateUncached = function(i, o) {
1447
- var u = this;
1448
- return t.__iterate(
1449
- function(s, a, f) {
1450
- return i(r.call(e, s, a, f), a, u) !== !1;
1451
- },
1452
- o
1453
- );
1454
- }, n.__iteratorUncached = function(i, o) {
1455
- var u = t.__iterator(it, o);
1456
- return new m(function() {
1457
- var s = u.next();
1458
- if (s.done)
1459
- return s;
1460
- var a = s.value, f = a[0];
1461
- return w(
1462
- i,
1463
- f,
1464
- r.call(e, a[1], f, t),
1465
- s
1466
- );
1467
- });
1468
- }, n;
1469
- }
1470
- function kr(t, r) {
1471
- var e = st(t);
1472
- return e._iter = t, e.size = t.size, e.reverse = function() {
1473
- return t;
1474
- }, t.flip && (e.flip = function() {
1475
- var n = Ae(t);
1476
- return n.reverse = function() {
1477
- return t.flip();
1478
- }, n;
1479
- }), e.get = function(n, i) {
1480
- return t.get(r ? n : -1 - n, i);
1481
- }, e.has = function(n) {
1482
- return t.has(r ? n : -1 - n);
1483
- }, e.includes = function(n) {
1484
- return t.includes(n);
1485
- }, e.cacheResult = Pr, e.__iterate = function(n, i) {
1486
- var o = this;
1487
- return t.__iterate(function(u, s) {
1488
- return n(u, s, o);
1489
- }, !i);
1490
- }, e.__iterator = function(n, i) {
1491
- return t.__iterator(n, !i);
1492
- }, e;
1493
- }
1494
- function Re(t, r, e, n) {
1495
- var i = st(t);
1496
- return n && (i.has = function(o) {
1497
- var u = t.get(o, l);
1498
- return u !== l && !!r.call(e, u, o, t);
1499
- }, i.get = function(o, u) {
1500
- var s = t.get(o, l);
1501
- return s !== l && r.call(e, s, o, t) ? s : u;
1502
- }), i.__iterateUncached = function(o, u) {
1503
- var s = this, a = 0;
1504
- return t.__iterate(function(f, h, c) {
1505
- if (r.call(e, f, h, c))
1506
- return a++, o(f, n ? h : a - 1, s);
1507
- }, u), a;
1508
- }, i.__iteratorUncached = function(o, u) {
1509
- var s = t.__iterator(it, u), a = 0;
1510
- return new m(function() {
1511
- for (; ; ) {
1512
- var f = s.next();
1513
- if (f.done)
1514
- return f;
1515
- var h = f.value, c = h[0], _ = h[1];
1516
- if (r.call(e, _, c, t))
1517
- return w(o, n ? c : a++, _, f);
1518
- }
1519
- });
1520
- }, i;
1521
- }
1522
- function mn(t, r, e) {
1523
- var n = d().asMutable();
1524
- return t.__iterate(function(i, o) {
1525
- n.update(
1526
- r.call(e, i, o, t),
1527
- 0,
1528
- function(u) {
1529
- return u + 1;
1530
- }
1531
- );
1532
- }), n.asImmutable();
1533
- }
1534
- function Sn(t, r, e) {
1535
- var n = T(t), i = (nt(t) ? A() : d()).asMutable();
1536
- t.__iterate(function(u, s) {
1537
- i.update(
1538
- r.call(e, u, s, t),
1539
- function(a) {
1540
- return a = a || [], a.push(n ? [s, u] : u), a;
1541
- }
1542
- );
1543
- });
1544
- var o = Ue(t);
1545
- return i.map(function(u) {
1546
- return g(t, o(u));
1547
- });
1548
- }
1549
- function Kr(t, r, e, n) {
1550
- var i = t.size;
1551
- if (r !== void 0 && (r = r | 0), e !== void 0 && (e === 1 / 0 ? e = i : e = e | 0), Nt(r, e, i))
1552
- return t;
1553
- var o = gt(r, i), u = Lt(e, i);
1554
- if (o !== o || u !== u)
1555
- return Kr(t.toSeq().cacheResult(), r, e, n);
1556
- var s = u - o, a;
1557
- s === s && (a = s < 0 ? 0 : s);
1558
- var f = st(t);
1559
- return f.size = a === 0 ? a : t.size && a || void 0, !n && hr(t) && a >= 0 && (f.get = function(h, c) {
1560
- return h = pt(this, h), h >= 0 && h < a ? t.get(h + o, c) : c;
1561
- }), f.__iterateUncached = function(h, c) {
1562
- var _ = this;
1563
- if (a === 0)
1564
- return 0;
1565
- if (c)
1566
- return this.cacheResult().__iterate(h, c);
1567
- var p = 0, v = !0, M = 0;
1568
- return t.__iterate(function(et, ht) {
1569
- if (!(v && (v = p++ < o)))
1570
- return M++, h(et, n ? ht : M - 1, _) !== !1 && M !== a;
1571
- }), M;
1572
- }, f.__iteratorUncached = function(h, c) {
1573
- if (a !== 0 && c)
1574
- return this.cacheResult().__iterator(h, c);
1575
- var _ = a !== 0 && t.__iterator(h, c), p = 0, v = 0;
1576
- return new m(function() {
1577
- for (; p++ < o; )
1578
- _.next();
1579
- if (++v > a)
1580
- return j();
1581
- var M = _.next();
1582
- return n || h === Q ? M : h === Dt ? w(h, v - 1, void 0, M) : w(h, v - 1, M.value[1], M);
1583
- });
1584
- }, f;
1585
- }
1586
- function gn(t, r, e) {
1587
- var n = st(t);
1588
- return n.__iterateUncached = function(i, o) {
1589
- var u = this;
1590
- if (o)
1591
- return this.cacheResult().__iterate(i, o);
1592
- var s = 0;
1593
- return t.__iterate(
1594
- function(a, f, h) {
1595
- return r.call(e, a, f, h) && ++s && i(a, f, u);
1596
- }
1597
- ), s;
1598
- }, n.__iteratorUncached = function(i, o) {
1599
- var u = this;
1600
- if (o)
1601
- return this.cacheResult().__iterator(i, o);
1602
- var s = t.__iterator(it, o), a = !0;
1603
- return new m(function() {
1604
- if (!a)
1605
- return j();
1606
- var f = s.next();
1607
- if (f.done)
1608
- return f;
1609
- var h = f.value, c = h[0], _ = h[1];
1610
- return r.call(e, _, c, u) ? i === it ? f : w(i, c, _, f) : (a = !1, j());
1611
- });
1612
- }, n;
1613
- }
1614
- function Ne(t, r, e, n) {
1615
- var i = st(t);
1616
- return i.__iterateUncached = function(o, u) {
1617
- var s = this;
1618
- if (u)
1619
- return this.cacheResult().__iterate(o, u);
1620
- var a = !0, f = 0;
1621
- return t.__iterate(function(h, c, _) {
1622
- if (!(a && (a = r.call(e, h, c, _))))
1623
- return f++, o(h, n ? c : f - 1, s);
1624
- }), f;
1625
- }, i.__iteratorUncached = function(o, u) {
1626
- var s = this;
1627
- if (u)
1628
- return this.cacheResult().__iterator(o, u);
1629
- var a = t.__iterator(it, u), f = !0, h = 0;
1630
- return new m(function() {
1631
- var c, _, p;
1632
- do {
1633
- if (c = a.next(), c.done)
1634
- return n || o === Q ? c : o === Dt ? w(o, h++, void 0, c) : w(o, h++, c.value[1], c);
1635
- var v = c.value;
1636
- _ = v[0], p = v[1], f && (f = r.call(e, p, _, s));
1637
- } while (f);
1638
- return o === it ? c : w(o, _, p, c);
1639
- });
1640
- }, i;
1641
- }
1642
- function wn(t, r) {
1643
- var e = T(t), n = [t].concat(r).map(function(u) {
1644
- return D(u) ? e && (u = P(u)) : u = e ? ee(u) : cr(Array.isArray(u) ? u : [u]), u;
1645
- }).filter(function(u) {
1646
- return u.size !== 0;
1647
- });
1648
- if (n.length === 0)
1649
- return t;
1650
- if (n.length === 1) {
1651
- var i = n[0];
1652
- if (i === t || e && T(i) || G(t) && G(i))
1653
- return i;
1654
- }
1655
- var o = new ut(n);
1656
- return e ? o = o.toKeyedSeq() : G(t) || (o = o.toSetSeq()), o = o.flatten(!0), o.size = n.reduce(
1657
- function(u, s) {
1658
- if (u !== void 0) {
1659
- var a = s.size;
1660
- if (a !== void 0)
1661
- return u + a;
1662
- }
1663
- },
1664
- 0
1665
- ), o;
1666
- }
1667
- function Le(t, r, e) {
1668
- var n = st(t);
1669
- return n.__iterateUncached = function(i, o) {
1670
- var u = 0, s = !1;
1671
- function a(f, h) {
1672
- var c = this;
1673
- f.__iterate(function(_, p) {
1674
- return (!r || h < r) && D(_) ? a(_, h + 1) : i(_, e ? p : u++, c) === !1 && (s = !0), !s;
1675
- }, o);
1676
- }
1677
- return a(t, 0), u;
1678
- }, n.__iteratorUncached = function(i, o) {
1679
- var u = t.__iterator(i, o), s = [], a = 0;
1680
- return new m(function() {
1681
- for (; u; ) {
1682
- var f = u.next();
1683
- if (f.done !== !1) {
1684
- u = s.pop();
1685
- continue;
1686
- }
1687
- var h = f.value;
1688
- if (i === it && (h = h[1]), (!r || s.length < r) && D(h))
1689
- s.push(u), u = h.__iterator(i, o);
1690
- else
1691
- return e ? f : w(i, a++, h, f);
1692
- }
1693
- return j();
1694
- });
1695
- }, n;
1696
- }
1697
- function In(t, r, e) {
1698
- var n = Ue(t);
1699
- return t.toSeq().map(
1700
- function(i, o) {
1701
- return n(r.call(e, i, o, t));
1702
- }
1703
- ).flatten(!0);
1704
- }
1705
- function En(t, r) {
1706
- var e = st(t);
1707
- return e.size = t.size && t.size * 2 - 1, e.__iterateUncached = function(n, i) {
1708
- var o = this, u = 0;
1709
- return t.__iterate(
1710
- function(s, a) {
1711
- return (!u || n(r, u++, o) !== !1) && n(s, u++, o) !== !1;
1712
- },
1713
- i
1714
- ), u;
1715
- }, e.__iteratorUncached = function(n, i) {
1716
- var o = t.__iterator(Q, i), u = 0, s;
1717
- return new m(function() {
1718
- return (!s || u % 2) && (s = o.next(), s.done) ? s : u % 2 ? w(n, u++, r) : w(n, u++, s.value, s);
1719
- });
1720
- }, e;
1721
- }
1722
- function At(t, r, e) {
1723
- r || (r = Pe);
1724
- var n = T(t), i = 0, o = t.toSeq().map(
1725
- function(u, s) {
1726
- return [s, u, i++, e ? e(u, s, t) : u];
1727
- }
1728
- ).toArray();
1729
- return o.sort(function(u, s) {
1730
- return r(u[3], s[3]) || u[2] - s[2];
1731
- }).forEach(
1732
- n ? function(u, s) {
1733
- o[s].length = 2;
1734
- } : function(u, s) {
1735
- o[s] = u[1];
1736
- }
1737
- ), n ? b(o) : G(t) ? O(o) : ot(o);
1738
- }
1739
- function bt(t, r, e) {
1740
- if (r || (r = Pe), e) {
1741
- var n = t.toSeq().map(function(i, o) {
1742
- return [i, e(i, o, t)];
1743
- }).reduce(function(i, o) {
1744
- return De(r, i[1], o[1]) ? o : i;
1745
- });
1746
- return n && n[0];
1747
- } else
1748
- return t.reduce(function(i, o) {
1749
- return De(r, i, o) ? o : i;
1750
- });
1751
- }
1752
- function De(t, r, e) {
1753
- var n = t(e, r);
1754
- return n === 0 && e !== r && (e == null || e !== e) || n > 0;
1755
- }
1756
- function Ur(t, r, e) {
1757
- var n = st(t);
1758
- return n.size = new ut(e).map(function(i) {
1759
- return i.size;
1760
- }).min(), n.__iterate = function(i, o) {
1761
- for (var u = this.__iterator(Q, o), s, a = 0; !(s = u.next()).done && i(s.value, a++, this) !== !1; )
1762
- ;
1763
- return a;
1764
- }, n.__iteratorUncached = function(i, o) {
1765
- var u = e.map(
1766
- function(f) {
1767
- return f = q(f), kt(o ? f.reverse() : f);
1768
- }
1769
- ), s = 0, a = !1;
1770
- return new m(function() {
1771
- var f;
1772
- return a || (f = u.map(function(h) {
1773
- return h.next();
1774
- }), a = f.some(function(h) {
1775
- return h.done;
1776
- })), a ? j() : w(
1777
- i,
1778
- s++,
1779
- r.apply(null, f.map(function(h) {
1780
- return h.value;
1781
- }))
1782
- );
1783
- });
1784
- }, n;
1785
- }
1786
- function g(t, r) {
1787
- return hr(t) ? r : t.constructor(r);
1788
- }
1789
- function ke(t) {
1790
- if (t !== Object(t))
1791
- throw new TypeError("Expected [K, V] tuple: " + t);
1792
- }
1793
- function Ke(t) {
1794
- return J(t.size), sr(t);
1795
- }
1796
- function Ue(t) {
1797
- return T(t) ? P : G(t) ? tt : $;
1798
- }
1799
- function st(t) {
1800
- return Object.create(
1801
- (T(t) ? b : G(t) ? O : ot).prototype
1802
- );
1803
- }
1804
- function Pr() {
1805
- return this._iter.cacheResult ? (this._iter.cacheResult(), this.size = this._iter.size, this) : L.prototype.cacheResult.call(this);
1806
- }
1807
- function Pe(t, r) {
1808
- return t > r ? 1 : t < r ? -1 : 0;
1809
- }
1810
- function Ce(t) {
1811
- var r = kt(t);
1812
- if (!r) {
1813
- if (!xr(t))
1814
- throw new TypeError("Expected iterable or array-like: " + t);
1815
- r = kt(q(t));
1816
- }
1817
- return r;
1818
- }
1819
- S(H, Pt);
1820
- function H(t, r) {
1821
- var e, n = function(u) {
1822
- if (u instanceof n)
1823
- return u;
1824
- if (!(this instanceof n))
1825
- return new n(u);
1826
- if (!e) {
1827
- e = !0;
1828
- var s = Object.keys(t);
1829
- zn(i, s), i.size = s.length, i._name = r, i._keys = s, i._defaultValues = t;
1830
- }
1831
- this._map = d(u);
1832
- }, i = n.prototype = Object.create(K);
1833
- return i.constructor = n, n;
1834
- }
1835
- H.prototype.toString = function() {
1836
- return this.__toString(Fe(this) + " {", "}");
1837
- }, H.prototype.has = function(t) {
1838
- return this._defaultValues.hasOwnProperty(t);
1839
- }, H.prototype.get = function(t, r) {
1840
- if (!this.has(t))
1841
- return r;
1842
- var e = this._defaultValues[t];
1843
- return this._map ? this._map.get(t, e) : e;
1844
- }, H.prototype.clear = function() {
1845
- if (this.__ownerID)
1846
- return this._map && this._map.clear(), this;
1847
- var t = this.constructor;
1848
- return t._empty || (t._empty = xt(this, rt()));
1849
- }, H.prototype.set = function(t, r) {
1850
- if (!this.has(t))
1851
- throw new Error('Cannot set unknown key "' + t + '" on ' + Fe(this));
1852
- if (this._map && !this._map.has(t)) {
1853
- var e = this._defaultValues[t];
1854
- if (r === e)
1855
- return this;
1856
- }
1857
- var n = this._map && this._map.set(t, r);
1858
- return this.__ownerID || n === this._map ? this : xt(this, n);
1859
- }, H.prototype.remove = function(t) {
1860
- if (!this.has(t))
1861
- return this;
1862
- var r = this._map && this._map.remove(t);
1863
- return this.__ownerID || r === this._map ? this : xt(this, r);
1864
- }, H.prototype.wasAltered = function() {
1865
- return this._map.wasAltered();
1866
- }, H.prototype.__iterator = function(t, r) {
1867
- var e = this;
1868
- return P(this._defaultValues).map(function(n, i) {
1869
- return e.get(i);
1870
- }).__iterator(t, r);
1871
- }, H.prototype.__iterate = function(t, r) {
1872
- var e = this;
1873
- return P(this._defaultValues).map(function(n, i) {
1874
- return e.get(i);
1875
- }).__iterate(t, r);
1876
- }, H.prototype.__ensureOwner = function(t) {
1877
- if (t === this.__ownerID)
1878
- return this;
1879
- var r = this._map && this._map.__ensureOwner(t);
1880
- return t ? xt(this, r, t) : (this.__ownerID = t, this._map = r, this);
1881
- };
1882
- var K = H.prototype;
1883
- K[Rt] = K.remove, K.deleteIn = K.removeIn = y.removeIn, K.merge = y.merge, K.mergeWith = y.mergeWith, K.mergeIn = y.mergeIn, K.mergeDeep = y.mergeDeep, K.mergeDeepWith = y.mergeDeepWith, K.mergeDeepIn = y.mergeDeepIn, K.setIn = y.setIn, K.update = y.update, K.updateIn = y.updateIn, K.withMutations = y.withMutations, K.asMutable = y.asMutable, K.asImmutable = y.asImmutable;
1884
- function xt(t, r, e) {
1885
- var n = Object.create(Object.getPrototypeOf(t));
1886
- return n._map = r, n.__ownerID = e, n;
1887
- }
1888
- function Fe(t) {
1889
- return t._name || t.constructor.name || "Record";
1890
- }
1891
- function zn(t, r) {
1892
- try {
1893
- r.forEach(Mn.bind(void 0, t));
1894
- } catch {
1895
- }
1896
- }
1897
- function Mn(t, r) {
1898
- Object.defineProperty(t, r, {
1899
- get: function() {
1900
- return this.get(r);
1901
- },
1902
- set: function(e) {
1903
- Vt(this.__ownerID, "Cannot set on an immutable record."), this.set(r, e);
1904
- }
1905
- });
1906
- }
1907
- S(z, Gt);
1908
- function z(t) {
1909
- return t == null ? Wr() : Cr(t) && !nt(t) ? t : Wr().withMutations(function(r) {
1910
- var e = $(t);
1911
- J(e.size), e.forEach(function(n) {
1912
- return r.add(n);
1913
- });
1914
- });
1915
- }
1916
- z.of = function() {
1917
- return this(arguments);
1918
- }, z.fromKeys = function(t) {
1919
- return this(P(t).keySeq());
1920
- }, z.prototype.toString = function() {
1921
- return this.__toString("Set {", "}");
1922
- }, z.prototype.has = function(t) {
1923
- return this._map.has(t);
1924
- }, z.prototype.add = function(t) {
1925
- return Fr(this, this._map.set(t, !0));
1926
- }, z.prototype.remove = function(t) {
1927
- return Fr(this, this._map.remove(t));
1928
- }, z.prototype.clear = function() {
1929
- return Fr(this, this._map.clear());
1930
- }, z.prototype.union = function() {
1931
- var t = B.call(arguments, 0);
1932
- return t = t.filter(function(r) {
1933
- return r.size !== 0;
1934
- }), t.length === 0 ? this : this.size === 0 && !this.__ownerID && t.length === 1 ? this.constructor(t[0]) : this.withMutations(function(r) {
1935
- for (var e = 0; e < t.length; e++)
1936
- $(t[e]).forEach(function(n) {
1937
- return r.add(n);
1938
- });
1939
- });
1940
- }, z.prototype.intersect = function() {
1941
- var t = B.call(arguments, 0);
1942
- if (t.length === 0)
1943
- return this;
1944
- t = t.map(function(e) {
1945
- return $(e);
1946
- });
1947
- var r = this;
1948
- return this.withMutations(function(e) {
1949
- r.forEach(function(n) {
1950
- t.every(function(i) {
1951
- return i.includes(n);
1952
- }) || e.remove(n);
1953
- });
1954
- });
1955
- }, z.prototype.subtract = function() {
1956
- var t = B.call(arguments, 0);
1957
- if (t.length === 0)
1958
- return this;
1959
- t = t.map(function(e) {
1960
- return $(e);
1961
- });
1962
- var r = this;
1963
- return this.withMutations(function(e) {
1964
- r.forEach(function(n) {
1965
- t.some(function(i) {
1966
- return i.includes(n);
1967
- }) && e.remove(n);
1968
- });
1969
- });
1970
- }, z.prototype.merge = function() {
1971
- return this.union.apply(this, arguments);
1972
- }, z.prototype.mergeWith = function(t) {
1973
- var r = B.call(arguments, 1);
1974
- return this.union.apply(this, r);
1975
- }, z.prototype.sort = function(t) {
1976
- return at(At(this, t));
1977
- }, z.prototype.sortBy = function(t, r) {
1978
- return at(At(this, r, t));
1979
- }, z.prototype.wasAltered = function() {
1980
- return this._map.wasAltered();
1981
- }, z.prototype.__iterate = function(t, r) {
1982
- var e = this;
1983
- return this._map.__iterate(function(n, i) {
1984
- return t(i, i, e);
1985
- }, r);
1986
- }, z.prototype.__iterator = function(t, r) {
1987
- return this._map.map(function(e, n) {
1988
- return n;
1989
- }).__iterator(t, r);
1990
- }, z.prototype.__ensureOwner = function(t) {
1991
- if (t === this.__ownerID)
1992
- return this;
1993
- var r = this._map.__ensureOwner(t);
1994
- return t ? this.__make(r, t) : (this.__ownerID = t, this._map = r, this);
1995
- };
1996
- function Cr(t) {
1997
- return !!(t && t[We]);
1998
- }
1999
- z.isSet = Cr;
2000
- var We = "@@__IMMUTABLE_SET__@@", V = z.prototype;
2001
- V[We] = !0, V[Rt] = V.remove, V.mergeDeep = V.merge, V.mergeDeepWith = V.mergeWith, V.withMutations = y.withMutations, V.asMutable = y.asMutable, V.asImmutable = y.asImmutable, V.__empty = Wr, V.__make = $e;
2002
- function Fr(t, r) {
2003
- return t.__ownerID ? (t.size = r.size, t._map = r, t) : r === t._map ? t : r.size === 0 ? t.__empty() : t.__make(r);
2004
- }
2005
- function $e(t, r) {
2006
- var e = Object.create(V);
2007
- return e.size = t ? t.size : 0, e._map = t, e.__ownerID = r, e;
2008
- }
2009
- var je;
2010
- function Wr() {
2011
- return je || (je = $e(rt()));
2012
- }
2013
- S(at, z);
2014
- function at(t) {
2015
- return t == null ? $r() : Be(t) ? t : $r().withMutations(function(r) {
2016
- var e = $(t);
2017
- J(e.size), e.forEach(function(n) {
2018
- return r.add(n);
2019
- });
2020
- });
2021
- }
2022
- at.of = function() {
2023
- return this(arguments);
2024
- }, at.fromKeys = function(t) {
2025
- return this(P(t).keySeq());
2026
- }, at.prototype.toString = function() {
2027
- return this.__toString("OrderedSet {", "}");
2028
- };
2029
- function Be(t) {
2030
- return Cr(t) && nt(t);
2031
- }
2032
- at.isOrderedSet = Be;
2033
- var tr = at.prototype;
2034
- tr[St] = !0, tr.__empty = $r, tr.__make = Ye;
2035
- function Ye(t, r) {
2036
- var e = Object.create(tr);
2037
- return e.size = t ? t.size : 0, e._map = t, e.__ownerID = r, e;
2038
- }
2039
- var Je;
2040
- function $r() {
2041
- return Je || (Je = Ye(Qt()));
2042
- }
2043
- S(N, wt);
2044
- function N(t) {
2045
- return t == null ? jr() : He(t) ? t : jr().unshiftAll(t);
2046
- }
2047
- N.of = function() {
2048
- return this(arguments);
2049
- }, N.prototype.toString = function() {
2050
- return this.__toString("Stack [", "]");
2051
- }, N.prototype.get = function(t, r) {
2052
- var e = this._head;
2053
- for (t = pt(this, t); e && t--; )
2054
- e = e.next;
2055
- return e ? e.value : r;
2056
- }, N.prototype.peek = function() {
2057
- return this._head && this._head.value;
2058
- }, N.prototype.push = function() {
2059
- if (arguments.length === 0)
2060
- return this;
2061
- for (var t = this.size + arguments.length, r = this._head, e = arguments.length - 1; e >= 0; e--)
2062
- r = {
2063
- value: arguments[e],
2064
- next: r
2065
- };
2066
- return this.__ownerID ? (this.size = t, this._head = r, this.__hash = void 0, this.__altered = !0, this) : Yt(t, r);
2067
- }, N.prototype.pushAll = function(t) {
2068
- if (t = tt(t), t.size === 0)
2069
- return this;
2070
- J(t.size);
2071
- var r = this.size, e = this._head;
2072
- return t.reverse().forEach(function(n) {
2073
- r++, e = {
2074
- value: n,
2075
- next: e
2076
- };
2077
- }), this.__ownerID ? (this.size = r, this._head = e, this.__hash = void 0, this.__altered = !0, this) : Yt(r, e);
2078
- }, N.prototype.pop = function() {
2079
- return this.slice(1);
2080
- }, N.prototype.unshift = function() {
2081
- return this.push.apply(this, arguments);
2082
- }, N.prototype.unshiftAll = function(t) {
2083
- return this.pushAll(t);
2084
- }, N.prototype.shift = function() {
2085
- return this.pop.apply(this, arguments);
2086
- }, N.prototype.clear = function() {
2087
- return this.size === 0 ? this : this.__ownerID ? (this.size = 0, this._head = void 0, this.__hash = void 0, this.__altered = !0, this) : jr();
2088
- }, N.prototype.slice = function(t, r) {
2089
- if (Nt(t, r, this.size))
2090
- return this;
2091
- var e = gt(t, this.size), n = Lt(r, this.size);
2092
- if (n !== this.size)
2093
- return wt.prototype.slice.call(this, t, r);
2094
- for (var i = this.size - e, o = this._head; e--; )
2095
- o = o.next;
2096
- return this.__ownerID ? (this.size = i, this._head = o, this.__hash = void 0, this.__altered = !0, this) : Yt(i, o);
2097
- }, N.prototype.__ensureOwner = function(t) {
2098
- return t === this.__ownerID ? this : t ? Yt(this.size, this._head, t, this.__hash) : (this.__ownerID = t, this.__altered = !1, this);
2099
- }, N.prototype.__iterate = function(t, r) {
2100
- if (r)
2101
- return this.reverse().__iterate(t);
2102
- for (var e = 0, n = this._head; n && t(n.value, e++, this) !== !1; )
2103
- n = n.next;
2104
- return e;
2105
- }, N.prototype.__iterator = function(t, r) {
2106
- if (r)
2107
- return this.reverse().__iterator(t);
2108
- var e = 0, n = this._head;
2109
- return new m(function() {
2110
- if (n) {
2111
- var i = n.value;
2112
- return n = n.next, w(t, e++, i);
2113
- }
2114
- return j();
2115
- });
2116
- };
2117
- function He(t) {
2118
- return !!(t && t[Ve]);
2119
- }
2120
- N.isStack = He;
2121
- var Ve = "@@__IMMUTABLE_STACK__@@", Tt = N.prototype;
2122
- Tt[Ve] = !0, Tt.withMutations = y.withMutations, Tt.asMutable = y.asMutable, Tt.asImmutable = y.asImmutable, Tt.wasAltered = y.wasAltered;
2123
- function Yt(t, r, e, n) {
2124
- var i = Object.create(Tt);
2125
- return i.size = t, i._head = r, i.__ownerID = e, i.__hash = n, i.__altered = !1, i;
2126
- }
2127
- var Ge;
2128
- function jr() {
2129
- return Ge || (Ge = Yt(0));
2130
- }
2131
- function ft(t, r) {
2132
- var e = function(n) {
2133
- t.prototype[n] = r[n];
2134
- };
2135
- return Object.keys(r).forEach(e), Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(r).forEach(e), t;
2136
- }
2137
- q.Iterator = m, ft(q, {
2138
- // ### Conversion to other types
2139
- toArray: function() {
2140
- J(this.size);
2141
- var t = new Array(this.size || 0);
2142
- return this.valueSeq().__iterate(function(r, e) {
2143
- t[e] = r;
2144
- }), t;
2145
- },
2146
- toIndexedSeq: function() {
2147
- return new Mt(this);
2148
- },
2149
- toJS: function() {
2150
- return this.toSeq().map(
2151
- function(t) {
2152
- return t && typeof t.toJS == "function" ? t.toJS() : t;
2153
- }
2154
- ).__toJS();
2155
- },
2156
- toJSON: function() {
2157
- return this.toSeq().map(
2158
- function(t) {
2159
- return t && typeof t.toJSON == "function" ? t.toJSON() : t;
2160
- }
2161
- ).__toJS();
2162
- },
2163
- toKeyedSeq: function() {
2164
- return new x(this, !0);
2165
- },
2166
- toMap: function() {
2167
- return d(this.toKeyedSeq());
2168
- },
2169
- toObject: function() {
2170
- J(this.size);
2171
- var t = {};
2172
- return this.__iterate(function(r, e) {
2173
- t[e] = r;
2174
- }), t;
2175
- },
2176
- toOrderedMap: function() {
2177
- return A(this.toKeyedSeq());
2178
- },
2179
- toOrderedSet: function() {
2180
- return at(T(this) ? this.valueSeq() : this);
2181
- },
2182
- toSet: function() {
2183
- return z(T(this) ? this.valueSeq() : this);
2184
- },
2185
- toSetSeq: function() {
2186
- return new qt(this);
2187
- },
2188
- toSeq: function() {
2189
- return G(this) ? this.toIndexedSeq() : T(this) ? this.toKeyedSeq() : this.toSetSeq();
2190
- },
2191
- toStack: function() {
2192
- return N(T(this) ? this.valueSeq() : this);
2193
- },
2194
- toList: function() {
2195
- return E(T(this) ? this.valueSeq() : this);
2196
- },
2197
- // ### Common JavaScript methods and properties
2198
- toString: function() {
2199
- return "[Iterable]";
2200
- },
2201
- __toString: function(t, r) {
2202
- return this.size === 0 ? t + r : t + " " + this.toSeq().map(this.__toStringMapper).join(", ") + " " + r;
2203
- },
2204
- // ### ES6 Collection methods (ES6 Array and Map)
2205
- concat: function() {
2206
- var t = B.call(arguments, 0);
2207
- return g(this, wn(this, t));
2208
- },
2209
- includes: function(t) {
2210
- return this.some(function(r) {
2211
- return R(r, t);
2212
- });
2213
- },
2214
- entries: function() {
2215
- return this.__iterator(it);
2216
- },
2217
- every: function(t, r) {
2218
- J(this.size);
2219
- var e = !0;
2220
- return this.__iterate(function(n, i, o) {
2221
- if (!t.call(r, n, i, o))
2222
- return e = !1, !1;
2223
- }), e;
2224
- },
2225
- filter: function(t, r) {
2226
- return g(this, Re(this, t, r, !0));
2227
- },
2228
- find: function(t, r, e) {
2229
- var n = this.findEntry(t, r);
2230
- return n ? n[1] : e;
2231
- },
2232
- forEach: function(t, r) {
2233
- return J(this.size), this.__iterate(r ? t.bind(r) : t);
2234
- },
2235
- join: function(t) {
2236
- J(this.size), t = t !== void 0 ? "" + t : ",";
2237
- var r = "", e = !0;
2238
- return this.__iterate(function(n) {
2239
- e ? e = !1 : r += t, r += n != null ? n.toString() : "";
2240
- }), r;
2241
- },
2242
- keys: function() {
2243
- return this.__iterator(Dt);
2244
- },
2245
- map: function(t, r) {
2246
- return g(this, Te(this, t, r));
2247
- },
2248
- reduce: function(t, r, e) {
2249
- J(this.size);
2250
- var n, i;
2251
- return arguments.length < 2 ? i = !0 : n = r, this.__iterate(function(o, u, s) {
2252
- i ? (i = !1, n = o) : n = t.call(e, n, o, u, s);
2253
- }), n;
2254
- },
2255
- reduceRight: function(t, r, e) {
2256
- var n = this.toKeyedSeq().reverse();
2257
- return n.reduce.apply(n, arguments);
2258
- },
2259
- reverse: function() {
2260
- return g(this, kr(this, !0));
2261
- },
2262
- slice: function(t, r) {
2263
- return g(this, Kr(this, t, r, !0));
2264
- },
2265
- some: function(t, r) {
2266
- return !this.every(er(t), r);
2267
- },
2268
- sort: function(t) {
2269
- return g(this, At(this, t));
2270
- },
2271
- values: function() {
2272
- return this.__iterator(Q);
2273
- },
2274
- // ### More sequential methods
2275
- butLast: function() {
2276
- return this.slice(0, -1);
2277
- },
2278
- isEmpty: function() {
2279
- return this.size !== void 0 ? this.size === 0 : !this.some(function() {
2280
- return !0;
2281
- });
2282
- },
2283
- count: function(t, r) {
2284
- return sr(
2285
- t ? this.toSeq().filter(t, r) : this
2286
- );
2287
- },
2288
- countBy: function(t, r) {
2289
- return mn(this, t, r);
2290
- },
2291
- equals: function(t) {
2292
- return yr(this, t);
2293
- },
2294
- entrySeq: function() {
2295
- var t = this;
2296
- if (t._cache)
2297
- return new ut(t._cache);
2298
- var r = t.toSeq().map(On).toIndexedSeq();
2299
- return r.fromEntrySeq = function() {
2300
- return t.toSeq();
2301
- }, r;
2302
- },
2303
- filterNot: function(t, r) {
2304
- return this.filter(er(t), r);
2305
- },
2306
- findEntry: function(t, r, e) {
2307
- var n = e;
2308
- return this.__iterate(function(i, o, u) {
2309
- if (t.call(r, i, o, u))
2310
- return n = [o, i], !1;
2311
- }), n;
2312
- },
2313
- findKey: function(t, r) {
2314
- var e = this.findEntry(t, r);
2315
- return e && e[0];
2316
- },
2317
- findLast: function(t, r, e) {
2318
- return this.toKeyedSeq().reverse().find(t, r, e);
2319
- },
2320
- findLastEntry: function(t, r, e) {
2321
- return this.toKeyedSeq().reverse().findEntry(t, r, e);
2322
- },
2323
- findLastKey: function(t, r) {
2324
- return this.toKeyedSeq().reverse().findKey(t, r);
2325
- },
2326
- first: function() {
2327
- return this.find(Gr);
2328
- },
2329
- flatMap: function(t, r) {
2330
- return g(this, In(this, t, r));
2331
- },
2332
- flatten: function(t) {
2333
- return g(this, Le(this, t, !0));
2334
- },
2335
- fromEntrySeq: function() {
2336
- return new Ot(this);
2337
- },
2338
- get: function(t, r) {
2339
- return this.find(function(e, n) {
2340
- return R(n, t);
2341
- }, void 0, r);
2342
- },
2343
- getIn: function(t, r) {
2344
- for (var e = this, n = Ce(t), i; !(i = n.next()).done; ) {
2345
- var o = i.value;
2346
- if (e = e && e.get ? e.get(o, l) : l, e === l)
2347
- return r;
2348
- }
2349
- return e;
2350
- },
2351
- groupBy: function(t, r) {
2352
- return Sn(this, t, r);
2353
- },
2354
- has: function(t) {
2355
- return this.get(t, l) !== l;
2356
- },
2357
- hasIn: function(t) {
2358
- return this.getIn(t, l) !== l;
2359
- },
2360
- isSubset: function(t) {
2361
- return t = typeof t.includes == "function" ? t : q(t), this.every(function(r) {
2362
- return t.includes(r);
2363
- });
2364
- },
2365
- isSuperset: function(t) {
2366
- return t = typeof t.isSubset == "function" ? t : q(t), t.isSubset(this);
2367
- },
2368
- keyOf: function(t) {
2369
- return this.findKey(function(r) {
2370
- return R(r, t);
2371
- });
2372
- },
2373
- keySeq: function() {
2374
- return this.toSeq().map(qn).toIndexedSeq();
2375
- },
2376
- last: function() {
2377
- return this.toSeq().reverse().first();
2378
- },
2379
- lastKeyOf: function(t) {
2380
- return this.toKeyedSeq().reverse().keyOf(t);
2381
- },
2382
- max: function(t) {
2383
- return bt(this, t);
2384
- },
2385
- maxBy: function(t, r) {
2386
- return bt(this, r, t);
2387
- },
2388
- min: function(t) {
2389
- return bt(this, t ? Xe(t) : Qe);
2390
- },
2391
- minBy: function(t, r) {
2392
- return bt(this, r ? Xe(r) : Qe, t);
2393
- },
2394
- rest: function() {
2395
- return this.slice(1);
2396
- },
2397
- skip: function(t) {
2398
- return this.slice(Math.max(0, t));
2399
- },
2400
- skipLast: function(t) {
2401
- return g(this, this.toSeq().reverse().skip(t).reverse());
2402
- },
2403
- skipWhile: function(t, r) {
2404
- return g(this, Ne(this, t, r, !0));
2405
- },
2406
- skipUntil: function(t, r) {
2407
- return this.skipWhile(er(t), r);
2408
- },
2409
- sortBy: function(t, r) {
2410
- return g(this, At(this, r, t));
2411
- },
2412
- take: function(t) {
2413
- return this.slice(0, Math.max(0, t));
2414
- },
2415
- takeLast: function(t) {
2416
- return g(this, this.toSeq().reverse().take(t).reverse());
2417
- },
2418
- takeWhile: function(t, r) {
2419
- return g(this, gn(this, t, r));
2420
- },
2421
- takeUntil: function(t, r) {
2422
- return this.takeWhile(er(t), r);
2423
- },
2424
- valueSeq: function() {
2425
- return this.toIndexedSeq();
2426
- },
2427
- // ### Hashable Object
2428
- hashCode: function() {
2429
- return this.__hash || (this.__hash = Tn(this));
2430
- }
2431
- // ### Internal
2432
- // abstract __iterate(fn, reverse)
2433
- // abstract __iterator(type, reverse)
2434
- });
2435
- var W = q.prototype;
2436
- W[Yr] = !0, W[fr] = W.values, W.__toJS = W.toArray, W.__toStringMapper = Ze, W.inspect = W.toSource = function() {
2437
- return this.toString();
2438
- }, W.chain = W.flatMap, W.contains = W.includes, ft(P, {
2439
- // ### More sequential methods
2440
- flip: function() {
2441
- return g(this, Ae(this));
2442
- },
2443
- mapEntries: function(t, r) {
2444
- var e = this, n = 0;
2445
- return g(
2446
- this,
2447
- this.toSeq().map(
2448
- function(i, o) {
2449
- return t.call(r, [o, i], n++, e);
2450
- }
2451
- ).fromEntrySeq()
2452
- );
2453
- },
2454
- mapKeys: function(t, r) {
2455
- var e = this;
2456
- return g(
2457
- this,
2458
- this.toSeq().flip().map(
2459
- function(n, i) {
2460
- return t.call(r, n, i, e);
2461
- }
2462
- ).flip()
2463
- );
2464
- }
2465
- });
2466
- var rr = P.prototype;
2467
- rr[Jr] = !0, rr[fr] = W.entries, rr.__toJS = W.toObject, rr.__toStringMapper = function(t, r) {
2468
- return JSON.stringify(r) + ": " + Ze(t);
2469
- }, ft(tt, {
2470
- // ### Conversion to other types
2471
- toKeyedSeq: function() {
2472
- return new x(this, !1);
2473
- },
2474
- // ### ES6 Collection methods (ES6 Array and Map)
2475
- filter: function(t, r) {
2476
- return g(this, Re(this, t, r, !1));
2477
- },
2478
- findIndex: function(t, r) {
2479
- var e = this.findEntry(t, r);
2480
- return e ? e[0] : -1;
2481
- },
2482
- indexOf: function(t) {
2483
- var r = this.keyOf(t);
2484
- return r === void 0 ? -1 : r;
2485
- },
2486
- lastIndexOf: function(t) {
2487
- var r = this.lastKeyOf(t);
2488
- return r === void 0 ? -1 : r;
2489
- },
2490
- reverse: function() {
2491
- return g(this, kr(this, !1));
2492
- },
2493
- slice: function(t, r) {
2494
- return g(this, Kr(this, t, r, !1));
2495
- },
2496
- splice: function(t, r) {
2497
- var e = arguments.length;
2498
- if (r = Math.max(r | 0, 0), e === 0 || e === 2 && !r)
2499
- return this;
2500
- t = gt(t, t < 0 ? this.count() : this.size);
2501
- var n = this.slice(0, t);
2502
- return g(
2503
- this,
2504
- e === 1 ? n : n.concat(_t(arguments, 2), this.slice(t + r))
2505
- );
2506
- },
2507
- // ### More collection methods
2508
- findLastIndex: function(t, r) {
2509
- var e = this.findLastEntry(t, r);
2510
- return e ? e[0] : -1;
2511
- },
2512
- first: function() {
2513
- return this.get(0);
2514
- },
2515
- flatten: function(t) {
2516
- return g(this, Le(this, t, !1));
2517
- },
2518
- get: function(t, r) {
2519
- return t = pt(this, t), t < 0 || this.size === 1 / 0 || this.size !== void 0 && t > this.size ? r : this.find(function(e, n) {
2520
- return n === t;
2521
- }, void 0, r);
2522
- },
2523
- has: function(t) {
2524
- return t = pt(this, t), t >= 0 && (this.size !== void 0 ? this.size === 1 / 0 || t < this.size : this.indexOf(t) !== -1);
2525
- },
2526
- interpose: function(t) {
2527
- return g(this, En(this, t));
2528
- },
2529
- interleave: function() {
2530
- var t = [this].concat(_t(arguments)), r = Ur(this.toSeq(), O.of, t), e = r.flatten(!0);
2531
- return r.size && (e.size = r.size * t.length), g(this, e);
2532
- },
2533
- keySeq: function() {
2534
- return k(0, this.size);
2535
- },
2536
- last: function() {
2537
- return this.get(-1);
2538
- },
2539
- skipWhile: function(t, r) {
2540
- return g(this, Ne(this, t, r, !1));
2541
- },
2542
- zip: function() {
2543
- var t = [this].concat(_t(arguments));
2544
- return g(this, Ur(this, An, t));
2545
- },
2546
- zipWith: function(t) {
2547
- var r = _t(arguments);
2548
- return r[0] = this, g(this, Ur(this, t, r));
2549
- }
2550
- }), tt.prototype[Hr] = !0, tt.prototype[St] = !0, ft($, {
2551
- // ### ES6 Collection methods (ES6 Array and Map)
2552
- get: function(t, r) {
2553
- return this.has(t) ? t : r;
2554
- },
2555
- includes: function(t) {
2556
- return this.has(t);
2557
- },
2558
- // ### More sequential methods
2559
- keySeq: function() {
2560
- return this.valueSeq();
2561
- }
2562
- }), $.prototype.has = W.includes, $.prototype.contains = $.prototype.includes, ft(b, P.prototype), ft(O, tt.prototype), ft(ot, $.prototype), ft(Pt, P.prototype), ft(wt, tt.prototype), ft(Gt, $.prototype);
2563
- function qn(t, r) {
2564
- return r;
2565
- }
2566
- function On(t, r) {
2567
- return [r, t];
2568
- }
2569
- function er(t) {
2570
- return function() {
2571
- return !t.apply(this, arguments);
2572
- };
2573
- }
2574
- function Xe(t) {
2575
- return function() {
2576
- return -t.apply(this, arguments);
2577
- };
2578
- }
2579
- function Ze(t) {
2580
- return typeof t == "string" ? JSON.stringify(t) : String(t);
2581
- }
2582
- function An() {
2583
- return _t(arguments);
2584
- }
2585
- function Qe(t, r) {
2586
- return t < r ? 1 : t > r ? -1 : 0;
2587
- }
2588
- function Tn(t) {
2589
- if (t.size === 1 / 0)
2590
- return 0;
2591
- var r = nt(t), e = T(t), n = r ? 1 : 0, i = t.__iterate(
2592
- e ? r ? function(o, u) {
2593
- n = 31 * n + be(Y(o), Y(u)) | 0;
2594
- } : function(o, u) {
2595
- n = n + be(Y(o), Y(u)) | 0;
2596
- } : r ? function(o) {
2597
- n = 31 * n + Y(o) | 0;
2598
- } : function(o) {
2599
- n = n + Y(o) | 0;
2600
- }
2601
- );
2602
- return Rn(i, n);
2603
- }
2604
- function Rn(t, r) {
2605
- return r = Ct(r, 3432918353), r = Ct(r << 15 | r >>> -15, 461845907), r = Ct(r << 13 | r >>> -13, 5), r = (r + 3864292196 | 0) ^ t, r = Ct(r ^ r >>> 16, 2246822507), r = Ct(r ^ r >>> 13, 3266489909), r = mr(r ^ r >>> 16), r;
2606
- }
2607
- function be(t, r) {
2608
- return t ^ r + 2654435769 + (t << 6) + (t >> 2) | 0;
2609
- }
2610
- var Nn = {
2611
- Iterable: q,
2612
- Seq: L,
2613
- Collection: yt,
2614
- Map: d,
2615
- OrderedMap: A,
2616
- List: E,
2617
- Stack: N,
2618
- Set: z,
2619
- OrderedSet: at,
2620
- Record: H,
2621
- Range: k,
2622
- Repeat: U,
2623
- is: R,
2624
- fromJS: _r
2625
- };
2626
- return Nn;
2627
- });
2628
- }(Br)), Br.exports;
2629
- }
2630
- export {
2631
- Kn as r
2632
- };