jbrowse-plugin-protein3d 0.0.8 → 0.0.9
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/ProteinView/util.js +1 -1
- package/dist/ProteinView/util.js.map +1 -1
- package/dist/jbrowse-plugin-protein3d.umd.production.min.js +3 -3
- package/dist/jbrowse-plugin-protein3d.umd.production.min.js.map +3 -3
- package/dist/out.js +517 -505
- package/package.json +1 -1
- package/src/ProteinView/util.ts +1 -1
package/dist/out.js
CHANGED
|
@@ -52918,17 +52918,17 @@ ${subTree.join("\n")}`;
|
|
|
52918
52918
|
exports.default = StyleToObject;
|
|
52919
52919
|
var inline_style_parser_1 = __importDefault(require_inline_style_parser());
|
|
52920
52920
|
function StyleToObject(style2, iterator2) {
|
|
52921
|
-
|
|
52921
|
+
let styleObject = null;
|
|
52922
52922
|
if (!style2 || typeof style2 !== "string") {
|
|
52923
52923
|
return styleObject;
|
|
52924
52924
|
}
|
|
52925
|
-
|
|
52926
|
-
|
|
52927
|
-
declarations.forEach(
|
|
52925
|
+
const declarations = (0, inline_style_parser_1.default)(style2);
|
|
52926
|
+
const hasIterator2 = typeof iterator2 === "function";
|
|
52927
|
+
declarations.forEach((declaration) => {
|
|
52928
52928
|
if (declaration.type !== "declaration") {
|
|
52929
52929
|
return;
|
|
52930
52930
|
}
|
|
52931
|
-
|
|
52931
|
+
const { property: property2, value } = declaration;
|
|
52932
52932
|
if (hasIterator2) {
|
|
52933
52933
|
iterator2(property2, value, declaration);
|
|
52934
52934
|
} else if (value) {
|
|
@@ -62360,6 +62360,63 @@ ${subTree.join("\n")}`;
|
|
|
62360
62360
|
});
|
|
62361
62361
|
|
|
62362
62362
|
// node_modules/immutable/dist/immutable.es.js
|
|
62363
|
+
function isIndexed(maybeIndexed) {
|
|
62364
|
+
return Boolean(maybeIndexed && // @ts-expect-error: maybeIndexed is typed as `{}`, need to change in 6.0 to `maybeIndexed && typeof maybeIndexed === 'object' && IS_INDEXED_SYMBOL in maybeIndexed`
|
|
62365
|
+
maybeIndexed[IS_INDEXED_SYMBOL]);
|
|
62366
|
+
}
|
|
62367
|
+
function isKeyed(maybeKeyed) {
|
|
62368
|
+
return Boolean(maybeKeyed && // @ts-expect-error: maybeKeyed is typed as `{}`, need to change in 6.0 to `maybeKeyed && typeof maybeKeyed === 'object' && IS_KEYED_SYMBOL in maybeKeyed`
|
|
62369
|
+
maybeKeyed[IS_KEYED_SYMBOL]);
|
|
62370
|
+
}
|
|
62371
|
+
function isAssociative(maybeAssociative) {
|
|
62372
|
+
return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);
|
|
62373
|
+
}
|
|
62374
|
+
function isCollection(maybeCollection) {
|
|
62375
|
+
return Boolean(maybeCollection && // @ts-expect-error: maybeCollection is typed as `{}`, need to change in 6.0 to `maybeCollection && typeof maybeCollection === 'object' && IS_COLLECTION_SYMBOL in maybeCollection`
|
|
62376
|
+
maybeCollection[IS_COLLECTION_SYMBOL]);
|
|
62377
|
+
}
|
|
62378
|
+
function iteratorValue(type3, k, v4, iteratorResult) {
|
|
62379
|
+
var value = type3 === ITERATE_KEYS ? k : type3 === ITERATE_VALUES ? v4 : [k, v4];
|
|
62380
|
+
iteratorResult ? iteratorResult.value = value : iteratorResult = {
|
|
62381
|
+
// @ts-expect-error ensure value is not undefined
|
|
62382
|
+
value,
|
|
62383
|
+
done: false
|
|
62384
|
+
};
|
|
62385
|
+
return iteratorResult;
|
|
62386
|
+
}
|
|
62387
|
+
function iteratorDone() {
|
|
62388
|
+
return { value: void 0, done: true };
|
|
62389
|
+
}
|
|
62390
|
+
function hasIterator(maybeIterable) {
|
|
62391
|
+
if (Array.isArray(maybeIterable)) {
|
|
62392
|
+
return true;
|
|
62393
|
+
}
|
|
62394
|
+
return !!getIteratorFn(maybeIterable);
|
|
62395
|
+
}
|
|
62396
|
+
function isIterator(maybeIterator) {
|
|
62397
|
+
return !!(maybeIterator && // @ts-expect-error: maybeIterator is typed as `{}`
|
|
62398
|
+
typeof maybeIterator.next === "function");
|
|
62399
|
+
}
|
|
62400
|
+
function getIterator(iterable) {
|
|
62401
|
+
var iteratorFn = getIteratorFn(iterable);
|
|
62402
|
+
return iteratorFn && iteratorFn.call(iterable);
|
|
62403
|
+
}
|
|
62404
|
+
function getIteratorFn(iterable) {
|
|
62405
|
+
var iteratorFn = iterable && // @ts-expect-error: maybeIterator is typed as `{}`
|
|
62406
|
+
(REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL] || // @ts-expect-error: maybeIterator is typed as `{}`
|
|
62407
|
+
iterable[FAUX_ITERATOR_SYMBOL]);
|
|
62408
|
+
if (typeof iteratorFn === "function") {
|
|
62409
|
+
return iteratorFn;
|
|
62410
|
+
}
|
|
62411
|
+
}
|
|
62412
|
+
function isEntriesIterable(maybeIterable) {
|
|
62413
|
+
var iteratorFn = getIteratorFn(maybeIterable);
|
|
62414
|
+
return iteratorFn && iteratorFn === maybeIterable.entries;
|
|
62415
|
+
}
|
|
62416
|
+
function isKeysIterable(maybeIterable) {
|
|
62417
|
+
var iteratorFn = getIteratorFn(maybeIterable);
|
|
62418
|
+
return iteratorFn && iteratorFn === maybeIterable.keys;
|
|
62419
|
+
}
|
|
62363
62420
|
function MakeRef() {
|
|
62364
62421
|
return { value: false };
|
|
62365
62422
|
}
|
|
@@ -62404,25 +62461,6 @@ ${subTree.join("\n")}`;
|
|
|
62404
62461
|
function isNeg(value) {
|
|
62405
62462
|
return value < 0 || value === 0 && 1 / value === -Infinity;
|
|
62406
62463
|
}
|
|
62407
|
-
function isCollection(maybeCollection) {
|
|
62408
|
-
return Boolean(maybeCollection && // @ts-expect-error: maybeCollection is typed as `{}`, need to change in 6.0 to `maybeCollection && typeof maybeCollection === 'object' && IS_COLLECTION_SYMBOL in maybeCollection`
|
|
62409
|
-
maybeCollection[IS_COLLECTION_SYMBOL]);
|
|
62410
|
-
}
|
|
62411
|
-
function isKeyed(maybeKeyed) {
|
|
62412
|
-
return Boolean(maybeKeyed && // @ts-expect-error: maybeKeyed is typed as `{}`, need to change in 6.0 to `maybeKeyed && typeof maybeKeyed === 'object' && IS_KEYED_SYMBOL in maybeKeyed`
|
|
62413
|
-
maybeKeyed[IS_KEYED_SYMBOL]);
|
|
62414
|
-
}
|
|
62415
|
-
function isIndexed(maybeIndexed) {
|
|
62416
|
-
return Boolean(maybeIndexed && // @ts-expect-error: maybeIndexed is typed as `{}`, need to change in 6.0 to `maybeIndexed && typeof maybeIndexed === 'object' && IS_INDEXED_SYMBOL in maybeIndexed`
|
|
62417
|
-
maybeIndexed[IS_INDEXED_SYMBOL]);
|
|
62418
|
-
}
|
|
62419
|
-
function isAssociative(maybeAssociative) {
|
|
62420
|
-
return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);
|
|
62421
|
-
}
|
|
62422
|
-
function isSeq(maybeSeq) {
|
|
62423
|
-
return Boolean(maybeSeq && // @ts-expect-error: maybeSeq is typed as `{}`, need to change in 6.0 to `maybeSeq && typeof maybeSeq === 'object' && MAYBE_SEQ_SYMBOL in maybeSeq`
|
|
62424
|
-
maybeSeq[IS_SEQ_SYMBOL]);
|
|
62425
|
-
}
|
|
62426
62464
|
function isRecord(maybeRecord) {
|
|
62427
62465
|
return Boolean(maybeRecord && // @ts-expect-error: maybeRecord is typed as `{}`, need to change in 6.0 to `maybeRecord && typeof maybeRecord === 'object' && IS_RECORD_SYMBOL in maybeRecord`
|
|
62428
62466
|
maybeRecord[IS_RECORD_SYMBOL]);
|
|
@@ -62434,43 +62472,9 @@ ${subTree.join("\n")}`;
|
|
|
62434
62472
|
return Boolean(maybeOrdered && // @ts-expect-error: maybeOrdered is typed as `{}`, need to change in 6.0 to `maybeOrdered && typeof maybeOrdered === 'object' && IS_ORDERED_SYMBOL in maybeOrdered`
|
|
62435
62473
|
maybeOrdered[IS_ORDERED_SYMBOL]);
|
|
62436
62474
|
}
|
|
62437
|
-
function
|
|
62438
|
-
|
|
62439
|
-
|
|
62440
|
-
value,
|
|
62441
|
-
done: false
|
|
62442
|
-
};
|
|
62443
|
-
return iteratorResult;
|
|
62444
|
-
}
|
|
62445
|
-
function iteratorDone() {
|
|
62446
|
-
return { value: void 0, done: true };
|
|
62447
|
-
}
|
|
62448
|
-
function hasIterator(maybeIterable) {
|
|
62449
|
-
if (Array.isArray(maybeIterable)) {
|
|
62450
|
-
return true;
|
|
62451
|
-
}
|
|
62452
|
-
return !!getIteratorFn(maybeIterable);
|
|
62453
|
-
}
|
|
62454
|
-
function isIterator(maybeIterator) {
|
|
62455
|
-
return maybeIterator && typeof maybeIterator.next === "function";
|
|
62456
|
-
}
|
|
62457
|
-
function getIterator(iterable) {
|
|
62458
|
-
var iteratorFn = getIteratorFn(iterable);
|
|
62459
|
-
return iteratorFn && iteratorFn.call(iterable);
|
|
62460
|
-
}
|
|
62461
|
-
function getIteratorFn(iterable) {
|
|
62462
|
-
var iteratorFn = iterable && (REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL] || iterable[FAUX_ITERATOR_SYMBOL]);
|
|
62463
|
-
if (typeof iteratorFn === "function") {
|
|
62464
|
-
return iteratorFn;
|
|
62465
|
-
}
|
|
62466
|
-
}
|
|
62467
|
-
function isEntriesIterable(maybeIterable) {
|
|
62468
|
-
var iteratorFn = getIteratorFn(maybeIterable);
|
|
62469
|
-
return iteratorFn && iteratorFn === maybeIterable.entries;
|
|
62470
|
-
}
|
|
62471
|
-
function isKeysIterable(maybeIterable) {
|
|
62472
|
-
var iteratorFn = getIteratorFn(maybeIterable);
|
|
62473
|
-
return iteratorFn && iteratorFn === maybeIterable.keys;
|
|
62475
|
+
function isSeq(maybeSeq) {
|
|
62476
|
+
return Boolean(maybeSeq && // @ts-expect-error: maybeSeq is typed as `{}`, need to change in 6.0 to `maybeSeq && typeof maybeSeq === 'object' && MAYBE_SEQ_SYMBOL in maybeSeq`
|
|
62477
|
+
maybeSeq[IS_SEQ_SYMBOL]);
|
|
62474
62478
|
}
|
|
62475
62479
|
function isArrayLike(value) {
|
|
62476
62480
|
if (Array.isArray(value) || typeof value === "string") {
|
|
@@ -62528,36 +62532,11 @@ ${subTree.join("\n")}`;
|
|
|
62528
62532
|
function maybeIndexedSeqFromValue(value) {
|
|
62529
62533
|
return isArrayLike(value) ? new ArraySeq(value) : hasIterator(value) ? new CollectionSeq(value) : void 0;
|
|
62530
62534
|
}
|
|
62531
|
-
function
|
|
62532
|
-
return
|
|
62533
|
-
maybeMap[IS_MAP_SYMBOL]);
|
|
62534
|
-
}
|
|
62535
|
-
function isOrderedMap(maybeOrderedMap) {
|
|
62536
|
-
return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);
|
|
62537
|
-
}
|
|
62538
|
-
function isValueObject(maybeValue) {
|
|
62539
|
-
return Boolean(maybeValue && // @ts-expect-error: maybeValue is typed as `{}`
|
|
62540
|
-
typeof maybeValue.equals === "function" && // @ts-expect-error: maybeValue is typed as `{}`
|
|
62541
|
-
typeof maybeValue.hashCode === "function");
|
|
62535
|
+
function asImmutable() {
|
|
62536
|
+
return this.__ensureOwner();
|
|
62542
62537
|
}
|
|
62543
|
-
function
|
|
62544
|
-
|
|
62545
|
-
return true;
|
|
62546
|
-
}
|
|
62547
|
-
if (!valueA || !valueB) {
|
|
62548
|
-
return false;
|
|
62549
|
-
}
|
|
62550
|
-
if (typeof valueA.valueOf === "function" && typeof valueB.valueOf === "function") {
|
|
62551
|
-
valueA = valueA.valueOf();
|
|
62552
|
-
valueB = valueB.valueOf();
|
|
62553
|
-
if (valueA === valueB || valueA !== valueA && valueB !== valueB) {
|
|
62554
|
-
return true;
|
|
62555
|
-
}
|
|
62556
|
-
if (!valueA || !valueB) {
|
|
62557
|
-
return false;
|
|
62558
|
-
}
|
|
62559
|
-
}
|
|
62560
|
-
return !!(isValueObject(valueA) && isValueObject(valueB) && valueA.equals(valueB));
|
|
62538
|
+
function asMutable() {
|
|
62539
|
+
return this.__ownerID ? this : this.__ensureOwner(new OwnerID());
|
|
62561
62540
|
}
|
|
62562
62541
|
function smi(i32) {
|
|
62563
62542
|
return i32 >>> 1 & 1073741824 | i32 & 3221225471;
|
|
@@ -62679,6 +62658,7 @@ ${subTree.join("\n")}`;
|
|
|
62679
62658
|
obj.propertyIsEnumerable = function() {
|
|
62680
62659
|
return this.constructor.prototype.propertyIsEnumerable.apply(
|
|
62681
62660
|
this,
|
|
62661
|
+
// eslint-disable-next-line prefer-rest-params
|
|
62682
62662
|
arguments
|
|
62683
62663
|
);
|
|
62684
62664
|
};
|
|
@@ -62701,7 +62681,10 @@ ${subTree.join("\n")}`;
|
|
|
62701
62681
|
}
|
|
62702
62682
|
}
|
|
62703
62683
|
function valueOf(obj) {
|
|
62704
|
-
return obj.valueOf !== defaultValueOf && typeof obj.valueOf === "function" ?
|
|
62684
|
+
return obj.valueOf !== defaultValueOf && typeof obj.valueOf === "function" ? (
|
|
62685
|
+
// @ts-expect-error weird the "obj" parameter as `valueOf` should not have a parameter
|
|
62686
|
+
obj.valueOf(obj)
|
|
62687
|
+
) : obj;
|
|
62705
62688
|
}
|
|
62706
62689
|
function nextHash() {
|
|
62707
62690
|
var nextHash2 = ++_objHashUID;
|
|
@@ -63340,186 +63323,32 @@ ${subTree.join("\n")}`;
|
|
|
63340
63323
|
}
|
|
63341
63324
|
return a8 > b8 ? 1 : a8 < b8 ? -1 : 0;
|
|
63342
63325
|
}
|
|
63343
|
-
function
|
|
63344
|
-
|
|
63345
|
-
|
|
63346
|
-
|
|
63347
|
-
for (var ii = 0; ii < len; ii++) {
|
|
63348
|
-
newArr[ii] = arr[ii + offset3];
|
|
63349
|
-
}
|
|
63350
|
-
return newArr;
|
|
63351
|
-
}
|
|
63352
|
-
function invariant(condition, error2) {
|
|
63353
|
-
if (!condition) {
|
|
63354
|
-
throw new Error(error2);
|
|
63355
|
-
}
|
|
63356
|
-
}
|
|
63357
|
-
function assertNotInfinite(size4) {
|
|
63358
|
-
invariant(size4 !== Infinity, "Cannot perform this action with an infinite size.");
|
|
63359
|
-
}
|
|
63360
|
-
function coerceKeyPath(keyPath) {
|
|
63361
|
-
if (isArrayLike(keyPath) && typeof keyPath !== "string") {
|
|
63362
|
-
return keyPath;
|
|
63363
|
-
}
|
|
63364
|
-
if (isOrdered(keyPath)) {
|
|
63365
|
-
return keyPath.toArray();
|
|
63366
|
-
}
|
|
63367
|
-
throw new TypeError("Invalid keyPath: expected Ordered Collection or Array: " + keyPath);
|
|
63326
|
+
function isValueObject(maybeValue) {
|
|
63327
|
+
return Boolean(maybeValue && // @ts-expect-error: maybeValue is typed as `{}`
|
|
63328
|
+
typeof maybeValue.equals === "function" && // @ts-expect-error: maybeValue is typed as `{}`
|
|
63329
|
+
typeof maybeValue.hashCode === "function");
|
|
63368
63330
|
}
|
|
63369
|
-
function
|
|
63370
|
-
if (
|
|
63371
|
-
return false;
|
|
63372
|
-
}
|
|
63373
|
-
var proto = Object.getPrototypeOf(value);
|
|
63374
|
-
if (proto === null) {
|
|
63331
|
+
function is4(valueA, valueB) {
|
|
63332
|
+
if (valueA === valueB || valueA !== valueA && valueB !== valueB) {
|
|
63375
63333
|
return true;
|
|
63376
63334
|
}
|
|
63377
|
-
|
|
63378
|
-
|
|
63379
|
-
while (nextProto !== null) {
|
|
63380
|
-
parentProto = nextProto;
|
|
63381
|
-
nextProto = Object.getPrototypeOf(parentProto);
|
|
63382
|
-
}
|
|
63383
|
-
return parentProto === proto;
|
|
63384
|
-
}
|
|
63385
|
-
function isDataStructure(value) {
|
|
63386
|
-
return typeof value === "object" && (isImmutable(value) || Array.isArray(value) || isPlainObject3(value));
|
|
63387
|
-
}
|
|
63388
|
-
function quoteString(value) {
|
|
63389
|
-
try {
|
|
63390
|
-
return typeof value === "string" ? JSON.stringify(value) : String(value);
|
|
63391
|
-
} catch (_ignoreError) {
|
|
63392
|
-
return JSON.stringify(value);
|
|
63393
|
-
}
|
|
63394
|
-
}
|
|
63395
|
-
function has5(collection, key2) {
|
|
63396
|
-
return isImmutable(collection) ? (
|
|
63397
|
-
// @ts-expect-error key might be a number or symbol, which is not handled be Record key type
|
|
63398
|
-
collection.has(key2)
|
|
63399
|
-
) : (
|
|
63400
|
-
// @ts-expect-error key might be anything else than PropertyKey, and will return false in that case but runtime is OK
|
|
63401
|
-
isDataStructure(collection) && hasOwnProperty4.call(collection, key2)
|
|
63402
|
-
);
|
|
63403
|
-
}
|
|
63404
|
-
function get(collection, key2, notSetValue) {
|
|
63405
|
-
return isImmutable(collection) ? collection.get(key2, notSetValue) : !has5(collection, key2) ? notSetValue : (
|
|
63406
|
-
// @ts-expect-error weird "get" here,
|
|
63407
|
-
typeof collection.get === "function" ? (
|
|
63408
|
-
// @ts-expect-error weird "get" here,
|
|
63409
|
-
collection.get(key2)
|
|
63410
|
-
) : (
|
|
63411
|
-
// @ts-expect-error key is unknown here,
|
|
63412
|
-
collection[key2]
|
|
63413
|
-
)
|
|
63414
|
-
);
|
|
63415
|
-
}
|
|
63416
|
-
function shallowCopy(from2) {
|
|
63417
|
-
if (Array.isArray(from2)) {
|
|
63418
|
-
return arrCopy(from2);
|
|
63419
|
-
}
|
|
63420
|
-
var to = {};
|
|
63421
|
-
for (var key2 in from2) {
|
|
63422
|
-
if (hasOwnProperty4.call(from2, key2)) {
|
|
63423
|
-
to[key2] = from2[key2];
|
|
63424
|
-
}
|
|
63425
|
-
}
|
|
63426
|
-
return to;
|
|
63427
|
-
}
|
|
63428
|
-
function remove(collection, key2) {
|
|
63429
|
-
if (!isDataStructure(collection)) {
|
|
63430
|
-
throw new TypeError("Cannot update non-data-structure value: " + collection);
|
|
63335
|
+
if (!valueA || !valueB) {
|
|
63336
|
+
return false;
|
|
63431
63337
|
}
|
|
63432
|
-
if (
|
|
63433
|
-
|
|
63434
|
-
|
|
63338
|
+
if (typeof valueA.valueOf === "function" && typeof valueB.valueOf === "function") {
|
|
63339
|
+
valueA = valueA.valueOf();
|
|
63340
|
+
valueB = valueB.valueOf();
|
|
63341
|
+
if (valueA === valueB || valueA !== valueA && valueB !== valueB) {
|
|
63342
|
+
return true;
|
|
63435
63343
|
}
|
|
63436
|
-
|
|
63437
|
-
|
|
63438
|
-
if (!hasOwnProperty4.call(collection, key2)) {
|
|
63439
|
-
return collection;
|
|
63440
|
-
}
|
|
63441
|
-
var collectionCopy = shallowCopy(collection);
|
|
63442
|
-
if (Array.isArray(collectionCopy)) {
|
|
63443
|
-
collectionCopy.splice(key2, 1);
|
|
63444
|
-
} else {
|
|
63445
|
-
delete collectionCopy[key2];
|
|
63446
|
-
}
|
|
63447
|
-
return collectionCopy;
|
|
63448
|
-
}
|
|
63449
|
-
function set2(collection, key2, value) {
|
|
63450
|
-
if (!isDataStructure(collection)) {
|
|
63451
|
-
throw new TypeError("Cannot update non-data-structure value: " + collection);
|
|
63452
|
-
}
|
|
63453
|
-
if (isImmutable(collection)) {
|
|
63454
|
-
if (!collection.set) {
|
|
63455
|
-
throw new TypeError("Cannot update immutable value without .set() method: " + collection);
|
|
63344
|
+
if (!valueA || !valueB) {
|
|
63345
|
+
return false;
|
|
63456
63346
|
}
|
|
63457
|
-
return collection.set(key2, value);
|
|
63458
63347
|
}
|
|
63459
|
-
|
|
63460
|
-
return collection;
|
|
63461
|
-
}
|
|
63462
|
-
var collectionCopy = shallowCopy(collection);
|
|
63463
|
-
collectionCopy[key2] = value;
|
|
63464
|
-
return collectionCopy;
|
|
63465
|
-
}
|
|
63466
|
-
function updateIn$1(collection, keyPath, notSetValue, updater) {
|
|
63467
|
-
if (!updater) {
|
|
63468
|
-
updater = notSetValue;
|
|
63469
|
-
notSetValue = void 0;
|
|
63470
|
-
}
|
|
63471
|
-
var updatedValue = updateInDeeply(
|
|
63472
|
-
isImmutable(collection),
|
|
63473
|
-
// @ts-expect-error type issues with Record and mixed types
|
|
63474
|
-
collection,
|
|
63475
|
-
coerceKeyPath(keyPath),
|
|
63476
|
-
0,
|
|
63477
|
-
notSetValue,
|
|
63478
|
-
updater
|
|
63479
|
-
);
|
|
63480
|
-
return updatedValue === NOT_SET ? notSetValue : updatedValue;
|
|
63481
|
-
}
|
|
63482
|
-
function updateInDeeply(inImmutable, existing, keyPath, i, notSetValue, updater) {
|
|
63483
|
-
var wasNotSet = existing === NOT_SET;
|
|
63484
|
-
if (i === keyPath.length) {
|
|
63485
|
-
var existingValue = wasNotSet ? notSetValue : existing;
|
|
63486
|
-
var newValue = updater(existingValue);
|
|
63487
|
-
return newValue === existingValue ? existing : newValue;
|
|
63488
|
-
}
|
|
63489
|
-
if (!wasNotSet && !isDataStructure(existing)) {
|
|
63490
|
-
throw new TypeError("Cannot update within non-data-structure value in path [" + Array.from(keyPath).slice(0, i).map(quoteString) + "]: " + existing);
|
|
63491
|
-
}
|
|
63492
|
-
var key2 = keyPath[i];
|
|
63493
|
-
var nextExisting = wasNotSet ? NOT_SET : get(existing, key2, NOT_SET);
|
|
63494
|
-
var nextUpdated = updateInDeeply(
|
|
63495
|
-
nextExisting === NOT_SET ? inImmutable : isImmutable(nextExisting),
|
|
63496
|
-
// @ts-expect-error mixed type
|
|
63497
|
-
nextExisting,
|
|
63498
|
-
keyPath,
|
|
63499
|
-
i + 1,
|
|
63500
|
-
notSetValue,
|
|
63501
|
-
updater
|
|
63502
|
-
);
|
|
63503
|
-
return nextUpdated === nextExisting ? existing : nextUpdated === NOT_SET ? remove(existing, key2) : set2(wasNotSet ? inImmutable ? emptyMap2() : {} : existing, key2, nextUpdated);
|
|
63504
|
-
}
|
|
63505
|
-
function setIn$1(collection, keyPath, value) {
|
|
63506
|
-
return updateIn$1(collection, keyPath, NOT_SET, function() {
|
|
63507
|
-
return value;
|
|
63508
|
-
});
|
|
63509
|
-
}
|
|
63510
|
-
function setIn(keyPath, v4) {
|
|
63511
|
-
return setIn$1(this, keyPath, v4);
|
|
63512
|
-
}
|
|
63513
|
-
function removeIn(collection, keyPath) {
|
|
63514
|
-
return updateIn$1(collection, keyPath, function() {
|
|
63515
|
-
return NOT_SET;
|
|
63516
|
-
});
|
|
63517
|
-
}
|
|
63518
|
-
function deleteIn(keyPath) {
|
|
63519
|
-
return removeIn(this, keyPath);
|
|
63348
|
+
return !!(isValueObject(valueA) && isValueObject(valueB) && valueA.equals(valueB));
|
|
63520
63349
|
}
|
|
63521
63350
|
function update$1(collection, key2, notSetValue, updater) {
|
|
63522
|
-
return updateIn
|
|
63351
|
+
return updateIn(
|
|
63523
63352
|
// @ts-expect-error Index signature for type string is missing in type V[]
|
|
63524
63353
|
collection,
|
|
63525
63354
|
[key2],
|
|
@@ -63527,12 +63356,6 @@ ${subTree.join("\n")}`;
|
|
|
63527
63356
|
updater
|
|
63528
63357
|
);
|
|
63529
63358
|
}
|
|
63530
|
-
function update(key2, notSetValue, updater) {
|
|
63531
|
-
return arguments.length === 1 ? key2(this) : update$1(this, key2, notSetValue, updater);
|
|
63532
|
-
}
|
|
63533
|
-
function updateIn(keyPath, notSetValue, updater) {
|
|
63534
|
-
return updateIn$1(this, keyPath, notSetValue, updater);
|
|
63535
|
-
}
|
|
63536
63359
|
function merge$1() {
|
|
63537
63360
|
var iters = [], len = arguments.length;
|
|
63538
63361
|
while (len--) iters[len] = arguments[len];
|
|
@@ -63578,6 +63401,46 @@ ${subTree.join("\n")}`;
|
|
|
63578
63401
|
}
|
|
63579
63402
|
});
|
|
63580
63403
|
}
|
|
63404
|
+
function isPlainObject3(value) {
|
|
63405
|
+
if (!value || typeof value !== "object" || toString7.call(value) !== "[object Object]") {
|
|
63406
|
+
return false;
|
|
63407
|
+
}
|
|
63408
|
+
var proto = Object.getPrototypeOf(value);
|
|
63409
|
+
if (proto === null) {
|
|
63410
|
+
return true;
|
|
63411
|
+
}
|
|
63412
|
+
var parentProto = proto;
|
|
63413
|
+
var nextProto = Object.getPrototypeOf(proto);
|
|
63414
|
+
while (nextProto !== null) {
|
|
63415
|
+
parentProto = nextProto;
|
|
63416
|
+
nextProto = Object.getPrototypeOf(parentProto);
|
|
63417
|
+
}
|
|
63418
|
+
return parentProto === proto;
|
|
63419
|
+
}
|
|
63420
|
+
function isDataStructure(value) {
|
|
63421
|
+
return typeof value === "object" && (isImmutable(value) || Array.isArray(value) || isPlainObject3(value));
|
|
63422
|
+
}
|
|
63423
|
+
function arrCopy(arr, offset3) {
|
|
63424
|
+
offset3 = offset3 || 0;
|
|
63425
|
+
var len = Math.max(0, arr.length - offset3);
|
|
63426
|
+
var newArr = new Array(len);
|
|
63427
|
+
for (var ii = 0; ii < len; ii++) {
|
|
63428
|
+
newArr[ii] = arr[ii + offset3];
|
|
63429
|
+
}
|
|
63430
|
+
return newArr;
|
|
63431
|
+
}
|
|
63432
|
+
function shallowCopy(from2) {
|
|
63433
|
+
if (Array.isArray(from2)) {
|
|
63434
|
+
return arrCopy(from2);
|
|
63435
|
+
}
|
|
63436
|
+
var to = {};
|
|
63437
|
+
for (var key2 in from2) {
|
|
63438
|
+
if (hasOwnProperty4.call(from2, key2)) {
|
|
63439
|
+
to[key2] = from2[key2];
|
|
63440
|
+
}
|
|
63441
|
+
}
|
|
63442
|
+
return to;
|
|
63443
|
+
}
|
|
63581
63444
|
function mergeDeepWithSources(collection, sources, merger) {
|
|
63582
63445
|
return mergeWithSources(collection, sources, deepMergerWith(merger));
|
|
63583
63446
|
}
|
|
@@ -63634,17 +63497,10 @@ ${subTree.join("\n")}`;
|
|
|
63634
63497
|
while (len-- > 0) iters[len] = arguments[len + 1];
|
|
63635
63498
|
return mergeDeepWithSources(this, iters, merger);
|
|
63636
63499
|
}
|
|
63637
|
-
function mergeIn(keyPath) {
|
|
63638
|
-
var iters = [], len = arguments.length - 1;
|
|
63639
|
-
while (len-- > 0) iters[len] = arguments[len + 1];
|
|
63640
|
-
return updateIn$1(this, keyPath, emptyMap2(), function(m) {
|
|
63641
|
-
return mergeWithSources(m, iters);
|
|
63642
|
-
});
|
|
63643
|
-
}
|
|
63644
63500
|
function mergeDeepIn(keyPath) {
|
|
63645
63501
|
var iters = [], len = arguments.length - 1;
|
|
63646
63502
|
while (len-- > 0) iters[len] = arguments[len + 1];
|
|
63647
|
-
return updateIn
|
|
63503
|
+
return updateIn(
|
|
63648
63504
|
this,
|
|
63649
63505
|
keyPath,
|
|
63650
63506
|
emptyMap2(),
|
|
@@ -63653,19 +63509,46 @@ ${subTree.join("\n")}`;
|
|
|
63653
63509
|
}
|
|
63654
63510
|
);
|
|
63655
63511
|
}
|
|
63512
|
+
function mergeIn(keyPath) {
|
|
63513
|
+
var iters = [], len = arguments.length - 1;
|
|
63514
|
+
while (len-- > 0) iters[len] = arguments[len + 1];
|
|
63515
|
+
return updateIn(this, keyPath, emptyMap2(), function(m) {
|
|
63516
|
+
return mergeWithSources(m, iters);
|
|
63517
|
+
});
|
|
63518
|
+
}
|
|
63519
|
+
function setIn$1(collection, keyPath, value) {
|
|
63520
|
+
return updateIn(collection, keyPath, NOT_SET, function() {
|
|
63521
|
+
return value;
|
|
63522
|
+
});
|
|
63523
|
+
}
|
|
63524
|
+
function setIn(keyPath, v4) {
|
|
63525
|
+
return setIn$1(this, keyPath, v4);
|
|
63526
|
+
}
|
|
63527
|
+
function update(key2, notSetValue, updater) {
|
|
63528
|
+
return arguments.length === 1 ? key2(this) : update$1(this, key2, notSetValue, updater);
|
|
63529
|
+
}
|
|
63530
|
+
function updateIn$1(keyPath, notSetValue, updater) {
|
|
63531
|
+
return updateIn(this, keyPath, notSetValue, updater);
|
|
63532
|
+
}
|
|
63533
|
+
function wasAltered() {
|
|
63534
|
+
return this.__altered;
|
|
63535
|
+
}
|
|
63656
63536
|
function withMutations(fn) {
|
|
63657
63537
|
var mutable = this.asMutable();
|
|
63658
63538
|
fn(mutable);
|
|
63659
63539
|
return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;
|
|
63660
63540
|
}
|
|
63661
|
-
function
|
|
63662
|
-
return
|
|
63541
|
+
function isMap(maybeMap) {
|
|
63542
|
+
return Boolean(maybeMap && // @ts-expect-error: maybeMap is typed as `{}`, need to change in 6.0 to `maybeMap && typeof maybeMap === 'object' && IS_MAP_SYMBOL in maybeMap`
|
|
63543
|
+
maybeMap[IS_MAP_SYMBOL]);
|
|
63663
63544
|
}
|
|
63664
|
-
function
|
|
63665
|
-
|
|
63545
|
+
function invariant(condition, error2) {
|
|
63546
|
+
if (!condition) {
|
|
63547
|
+
throw new Error(error2);
|
|
63548
|
+
}
|
|
63666
63549
|
}
|
|
63667
|
-
function
|
|
63668
|
-
|
|
63550
|
+
function assertNotInfinite(size4) {
|
|
63551
|
+
invariant(size4 !== Infinity, "Cannot perform this action with an infinite size.");
|
|
63669
63552
|
}
|
|
63670
63553
|
function mapIteratorValue(type3, entry) {
|
|
63671
63554
|
return iteratorValue(type3, entry[0], entry[1]);
|
|
@@ -63837,6 +63720,128 @@ ${subTree.join("\n")}`;
|
|
|
63837
63720
|
}
|
|
63838
63721
|
return newArray;
|
|
63839
63722
|
}
|
|
63723
|
+
function coerceKeyPath(keyPath) {
|
|
63724
|
+
if (isArrayLike(keyPath) && typeof keyPath !== "string") {
|
|
63725
|
+
return keyPath;
|
|
63726
|
+
}
|
|
63727
|
+
if (isOrdered(keyPath)) {
|
|
63728
|
+
return keyPath.toArray();
|
|
63729
|
+
}
|
|
63730
|
+
throw new TypeError("Invalid keyPath: expected Ordered Collection or Array: " + keyPath);
|
|
63731
|
+
}
|
|
63732
|
+
function quoteString(value) {
|
|
63733
|
+
try {
|
|
63734
|
+
return typeof value === "string" ? JSON.stringify(value) : String(value);
|
|
63735
|
+
} catch (_ignoreError) {
|
|
63736
|
+
return JSON.stringify(value);
|
|
63737
|
+
}
|
|
63738
|
+
}
|
|
63739
|
+
function has5(collection, key2) {
|
|
63740
|
+
return isImmutable(collection) ? (
|
|
63741
|
+
// @ts-expect-error key might be a number or symbol, which is not handled be Record key type
|
|
63742
|
+
collection.has(key2)
|
|
63743
|
+
) : (
|
|
63744
|
+
// @ts-expect-error key might be anything else than PropertyKey, and will return false in that case but runtime is OK
|
|
63745
|
+
isDataStructure(collection) && hasOwnProperty4.call(collection, key2)
|
|
63746
|
+
);
|
|
63747
|
+
}
|
|
63748
|
+
function get6(collection, key2, notSetValue) {
|
|
63749
|
+
return isImmutable(collection) ? collection.get(key2, notSetValue) : !has5(collection, key2) ? notSetValue : (
|
|
63750
|
+
// @ts-expect-error weird "get" here,
|
|
63751
|
+
typeof collection.get === "function" ? (
|
|
63752
|
+
// @ts-expect-error weird "get" here,
|
|
63753
|
+
collection.get(key2)
|
|
63754
|
+
) : (
|
|
63755
|
+
// @ts-expect-error key is unknown here,
|
|
63756
|
+
collection[key2]
|
|
63757
|
+
)
|
|
63758
|
+
);
|
|
63759
|
+
}
|
|
63760
|
+
function remove(collection, key2) {
|
|
63761
|
+
if (!isDataStructure(collection)) {
|
|
63762
|
+
throw new TypeError("Cannot update non-data-structure value: " + collection);
|
|
63763
|
+
}
|
|
63764
|
+
if (isImmutable(collection)) {
|
|
63765
|
+
if (!collection.remove) {
|
|
63766
|
+
throw new TypeError("Cannot update immutable value without .remove() method: " + collection);
|
|
63767
|
+
}
|
|
63768
|
+
return collection.remove(key2);
|
|
63769
|
+
}
|
|
63770
|
+
if (!hasOwnProperty4.call(collection, key2)) {
|
|
63771
|
+
return collection;
|
|
63772
|
+
}
|
|
63773
|
+
var collectionCopy = shallowCopy(collection);
|
|
63774
|
+
if (Array.isArray(collectionCopy)) {
|
|
63775
|
+
collectionCopy.splice(key2, 1);
|
|
63776
|
+
} else {
|
|
63777
|
+
delete collectionCopy[key2];
|
|
63778
|
+
}
|
|
63779
|
+
return collectionCopy;
|
|
63780
|
+
}
|
|
63781
|
+
function set2(collection, key2, value) {
|
|
63782
|
+
if (!isDataStructure(collection)) {
|
|
63783
|
+
throw new TypeError("Cannot update non-data-structure value: " + collection);
|
|
63784
|
+
}
|
|
63785
|
+
if (isImmutable(collection)) {
|
|
63786
|
+
if (!collection.set) {
|
|
63787
|
+
throw new TypeError("Cannot update immutable value without .set() method: " + collection);
|
|
63788
|
+
}
|
|
63789
|
+
return collection.set(key2, value);
|
|
63790
|
+
}
|
|
63791
|
+
if (hasOwnProperty4.call(collection, key2) && value === collection[key2]) {
|
|
63792
|
+
return collection;
|
|
63793
|
+
}
|
|
63794
|
+
var collectionCopy = shallowCopy(collection);
|
|
63795
|
+
collectionCopy[key2] = value;
|
|
63796
|
+
return collectionCopy;
|
|
63797
|
+
}
|
|
63798
|
+
function updateIn(collection, keyPath, notSetValue, updater) {
|
|
63799
|
+
if (!updater) {
|
|
63800
|
+
updater = notSetValue;
|
|
63801
|
+
notSetValue = void 0;
|
|
63802
|
+
}
|
|
63803
|
+
var updatedValue = updateInDeeply(
|
|
63804
|
+
isImmutable(collection),
|
|
63805
|
+
// @ts-expect-error type issues with Record and mixed types
|
|
63806
|
+
collection,
|
|
63807
|
+
coerceKeyPath(keyPath),
|
|
63808
|
+
0,
|
|
63809
|
+
notSetValue,
|
|
63810
|
+
updater
|
|
63811
|
+
);
|
|
63812
|
+
return updatedValue === NOT_SET ? notSetValue : updatedValue;
|
|
63813
|
+
}
|
|
63814
|
+
function updateInDeeply(inImmutable, existing, keyPath, i, notSetValue, updater) {
|
|
63815
|
+
var wasNotSet = existing === NOT_SET;
|
|
63816
|
+
if (i === keyPath.length) {
|
|
63817
|
+
var existingValue = wasNotSet ? notSetValue : existing;
|
|
63818
|
+
var newValue = updater(existingValue);
|
|
63819
|
+
return newValue === existingValue ? existing : newValue;
|
|
63820
|
+
}
|
|
63821
|
+
if (!wasNotSet && !isDataStructure(existing)) {
|
|
63822
|
+
throw new TypeError("Cannot update within non-data-structure value in path [" + Array.from(keyPath).slice(0, i).map(quoteString) + "]: " + existing);
|
|
63823
|
+
}
|
|
63824
|
+
var key2 = keyPath[i];
|
|
63825
|
+
var nextExisting = wasNotSet ? NOT_SET : get6(existing, key2, NOT_SET);
|
|
63826
|
+
var nextUpdated = updateInDeeply(
|
|
63827
|
+
nextExisting === NOT_SET ? inImmutable : isImmutable(nextExisting),
|
|
63828
|
+
// @ts-expect-error mixed type
|
|
63829
|
+
nextExisting,
|
|
63830
|
+
keyPath,
|
|
63831
|
+
i + 1,
|
|
63832
|
+
notSetValue,
|
|
63833
|
+
updater
|
|
63834
|
+
);
|
|
63835
|
+
return nextUpdated === nextExisting ? existing : nextUpdated === NOT_SET ? remove(existing, key2) : set2(wasNotSet ? inImmutable ? emptyMap2() : {} : existing, key2, nextUpdated);
|
|
63836
|
+
}
|
|
63837
|
+
function removeIn(collection, keyPath) {
|
|
63838
|
+
return updateIn(collection, keyPath, function() {
|
|
63839
|
+
return NOT_SET;
|
|
63840
|
+
});
|
|
63841
|
+
}
|
|
63842
|
+
function deleteIn(keyPath) {
|
|
63843
|
+
return removeIn(this, keyPath);
|
|
63844
|
+
}
|
|
63840
63845
|
function isList(maybeList) {
|
|
63841
63846
|
return Boolean(maybeList && // @ts-expect-error: maybeList is typed as `{}`, need to change in 6.0 to `maybeList && typeof maybeList === 'object' && IS_LIST_SYMBOL in maybeList`
|
|
63842
63847
|
maybeList[IS_LIST_SYMBOL]);
|
|
@@ -64115,6 +64120,9 @@ ${subTree.join("\n")}`;
|
|
|
64115
64120
|
function getTailOffset(size4) {
|
|
64116
64121
|
return size4 < SIZE ? 0 : size4 - 1 >>> SHIFT << SHIFT;
|
|
64117
64122
|
}
|
|
64123
|
+
function isOrderedMap(maybeOrderedMap) {
|
|
64124
|
+
return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);
|
|
64125
|
+
}
|
|
64118
64126
|
function makeOrderedMap(map6, list6, ownerID, hash5) {
|
|
64119
64127
|
var omap = Object.create(OrderedMap.prototype);
|
|
64120
64128
|
omap.size = map6 ? map6.size : 0;
|
|
@@ -64189,12 +64197,40 @@ ${subTree.join("\n")}`;
|
|
|
64189
64197
|
function emptyStack() {
|
|
64190
64198
|
return EMPTY_STACK || (EMPTY_STACK = makeStack(0));
|
|
64191
64199
|
}
|
|
64192
|
-
function
|
|
64193
|
-
|
|
64194
|
-
|
|
64200
|
+
function reduce(collection, reducer, reduction, context2, useFirst, reverse3) {
|
|
64201
|
+
assertNotInfinite(collection.size);
|
|
64202
|
+
collection.__iterate(function(v4, k, c8) {
|
|
64203
|
+
if (useFirst) {
|
|
64204
|
+
useFirst = false;
|
|
64205
|
+
reduction = v4;
|
|
64206
|
+
} else {
|
|
64207
|
+
reduction = reducer.call(context2, reduction, v4, k, c8);
|
|
64208
|
+
}
|
|
64209
|
+
}, reverse3);
|
|
64210
|
+
return reduction;
|
|
64195
64211
|
}
|
|
64196
|
-
function
|
|
64197
|
-
return
|
|
64212
|
+
function keyMapper(v4, k) {
|
|
64213
|
+
return k;
|
|
64214
|
+
}
|
|
64215
|
+
function entryMapper(v4, k) {
|
|
64216
|
+
return [k, v4];
|
|
64217
|
+
}
|
|
64218
|
+
function not(predicate) {
|
|
64219
|
+
return function() {
|
|
64220
|
+
var args = [], len = arguments.length;
|
|
64221
|
+
while (len--) args[len] = arguments[len];
|
|
64222
|
+
return !predicate.apply(this, args);
|
|
64223
|
+
};
|
|
64224
|
+
}
|
|
64225
|
+
function neg(predicate) {
|
|
64226
|
+
return function() {
|
|
64227
|
+
var args = [], len = arguments.length;
|
|
64228
|
+
while (len--) args[len] = arguments[len];
|
|
64229
|
+
return -predicate.apply(this, args);
|
|
64230
|
+
};
|
|
64231
|
+
}
|
|
64232
|
+
function defaultNegComparator(a8, b8) {
|
|
64233
|
+
return a8 < b8 ? 1 : a8 > b8 ? -1 : 0;
|
|
64198
64234
|
}
|
|
64199
64235
|
function deepEqual2(a8, b8) {
|
|
64200
64236
|
if (a8 === b8) {
|
|
@@ -64254,36 +64290,9 @@ ${subTree.join("\n")}`;
|
|
|
64254
64290
|
return allEqual && // @ts-expect-error size should exists on Collection
|
|
64255
64291
|
a8.size === bSize;
|
|
64256
64292
|
}
|
|
64257
|
-
function
|
|
64258
|
-
|
|
64259
|
-
|
|
64260
|
-
};
|
|
64261
|
-
Object.keys(methods).forEach(keyCopier);
|
|
64262
|
-
Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);
|
|
64263
|
-
return ctor;
|
|
64264
|
-
}
|
|
64265
|
-
function toJS(value) {
|
|
64266
|
-
if (!value || typeof value !== "object") {
|
|
64267
|
-
return value;
|
|
64268
|
-
}
|
|
64269
|
-
if (!isCollection(value)) {
|
|
64270
|
-
if (!isDataStructure(value)) {
|
|
64271
|
-
return value;
|
|
64272
|
-
}
|
|
64273
|
-
value = Seq(value);
|
|
64274
|
-
}
|
|
64275
|
-
if (isKeyed(value)) {
|
|
64276
|
-
var result$1 = {};
|
|
64277
|
-
value.__iterate(function(v4, k) {
|
|
64278
|
-
result$1[k] = toJS(v4);
|
|
64279
|
-
});
|
|
64280
|
-
return result$1;
|
|
64281
|
-
}
|
|
64282
|
-
var result2 = [];
|
|
64283
|
-
value.__iterate(function(v4) {
|
|
64284
|
-
result2.push(toJS(v4));
|
|
64285
|
-
});
|
|
64286
|
-
return result2;
|
|
64293
|
+
function isSet(maybeSet) {
|
|
64294
|
+
return Boolean(maybeSet && // @ts-expect-error: maybeSet is typed as `{}`, need to change in 6.0 to `maybeSeq && typeof maybeSet === 'object' && MAYBE_SET_SYMBOL in maybeSet`
|
|
64295
|
+
maybeSet[IS_SET_SYMBOL]);
|
|
64287
64296
|
}
|
|
64288
64297
|
function updateSet(set4, newMap) {
|
|
64289
64298
|
if (set4.__ownerID) {
|
|
@@ -64307,7 +64316,7 @@ ${subTree.join("\n")}`;
|
|
|
64307
64316
|
var keyPath = coerceKeyPath(searchKeyPath);
|
|
64308
64317
|
var i = 0;
|
|
64309
64318
|
while (i !== keyPath.length) {
|
|
64310
|
-
collection =
|
|
64319
|
+
collection = get6(collection, keyPath[i++], NOT_SET);
|
|
64311
64320
|
if (collection === NOT_SET) {
|
|
64312
64321
|
return notSetValue;
|
|
64313
64322
|
}
|
|
@@ -64331,39 +64340,28 @@ ${subTree.join("\n")}`;
|
|
|
64331
64340
|
});
|
|
64332
64341
|
return object;
|
|
64333
64342
|
}
|
|
64334
|
-
function
|
|
64335
|
-
|
|
64336
|
-
|
|
64337
|
-
|
|
64338
|
-
|
|
64339
|
-
|
|
64340
|
-
|
|
64341
|
-
reduction = reducer.call(context2, reduction, v4, k, c8);
|
|
64343
|
+
function toJS(value) {
|
|
64344
|
+
if (!value || typeof value !== "object") {
|
|
64345
|
+
return value;
|
|
64346
|
+
}
|
|
64347
|
+
if (!isCollection(value)) {
|
|
64348
|
+
if (!isDataStructure(value)) {
|
|
64349
|
+
return value;
|
|
64342
64350
|
}
|
|
64343
|
-
|
|
64344
|
-
|
|
64345
|
-
|
|
64346
|
-
|
|
64347
|
-
|
|
64348
|
-
|
|
64349
|
-
|
|
64350
|
-
|
|
64351
|
-
|
|
64352
|
-
|
|
64353
|
-
|
|
64354
|
-
|
|
64355
|
-
};
|
|
64356
|
-
|
|
64357
|
-
function neg(predicate) {
|
|
64358
|
-
return function() {
|
|
64359
|
-
return -predicate.apply(this, arguments);
|
|
64360
|
-
};
|
|
64361
|
-
}
|
|
64362
|
-
function defaultZipper() {
|
|
64363
|
-
return arrCopy(arguments);
|
|
64364
|
-
}
|
|
64365
|
-
function defaultNegComparator(a8, b8) {
|
|
64366
|
-
return a8 < b8 ? 1 : a8 > b8 ? -1 : 0;
|
|
64351
|
+
value = Seq(value);
|
|
64352
|
+
}
|
|
64353
|
+
if (isKeyed(value)) {
|
|
64354
|
+
var result$1 = {};
|
|
64355
|
+
value.__iterate(function(v4, k) {
|
|
64356
|
+
result$1[k] = toJS(v4);
|
|
64357
|
+
});
|
|
64358
|
+
return result$1;
|
|
64359
|
+
}
|
|
64360
|
+
var result2 = [];
|
|
64361
|
+
value.__iterate(function(v4) {
|
|
64362
|
+
result2.push(toJS(v4));
|
|
64363
|
+
});
|
|
64364
|
+
return result2;
|
|
64367
64365
|
}
|
|
64368
64366
|
function hashCollection(collection) {
|
|
64369
64367
|
if (collection.size === Infinity) {
|
|
@@ -64372,17 +64370,15 @@ ${subTree.join("\n")}`;
|
|
|
64372
64370
|
var ordered = isOrdered(collection);
|
|
64373
64371
|
var keyed = isKeyed(collection);
|
|
64374
64372
|
var h = ordered ? 1 : 0;
|
|
64375
|
-
collection.__iterate(
|
|
64376
|
-
|
|
64377
|
-
|
|
64378
|
-
|
|
64379
|
-
|
|
64380
|
-
|
|
64381
|
-
|
|
64382
|
-
|
|
64383
|
-
|
|
64384
|
-
}
|
|
64385
|
-
);
|
|
64373
|
+
collection.__iterate(keyed ? ordered ? function(v4, k) {
|
|
64374
|
+
h = 31 * h + hashMerge(hash(v4), hash(k)) | 0;
|
|
64375
|
+
} : function(v4, k) {
|
|
64376
|
+
h = h + hashMerge(hash(v4), hash(k)) | 0;
|
|
64377
|
+
} : ordered ? function(v4) {
|
|
64378
|
+
h = 31 * h + hash(v4) | 0;
|
|
64379
|
+
} : function(v4) {
|
|
64380
|
+
h = h + hash(v4) | 0;
|
|
64381
|
+
});
|
|
64386
64382
|
return murmurHashOfSize(collection.size, h);
|
|
64387
64383
|
}
|
|
64388
64384
|
function murmurHashOfSize(size4, h) {
|
|
@@ -64398,6 +64394,20 @@ ${subTree.join("\n")}`;
|
|
|
64398
64394
|
function hashMerge(a8, b8) {
|
|
64399
64395
|
return a8 ^ b8 + 2654435769 + (a8 << 6) + (a8 >> 2) | 0;
|
|
64400
64396
|
}
|
|
64397
|
+
function mixin(ctor, methods) {
|
|
64398
|
+
var keyCopier = function(key2) {
|
|
64399
|
+
ctor.prototype[key2] = methods[key2];
|
|
64400
|
+
};
|
|
64401
|
+
Object.keys(methods).forEach(keyCopier);
|
|
64402
|
+
Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);
|
|
64403
|
+
return ctor;
|
|
64404
|
+
}
|
|
64405
|
+
function defaultZipper() {
|
|
64406
|
+
return arrCopy(arguments);
|
|
64407
|
+
}
|
|
64408
|
+
function isOrderedSet(maybeOrderedSet) {
|
|
64409
|
+
return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);
|
|
64410
|
+
}
|
|
64401
64411
|
function makeOrderedSet(map6, ownerID) {
|
|
64402
64412
|
var set4 = Object.create(OrderedSetPrototype);
|
|
64403
64413
|
set4.size = map6 ? map6.size : 0;
|
|
@@ -64453,17 +64463,12 @@ ${subTree.join("\n")}`;
|
|
|
64453
64463
|
} catch (error2) {
|
|
64454
64464
|
}
|
|
64455
64465
|
}
|
|
64456
|
-
var
|
|
64466
|
+
var IS_INDEXED_SYMBOL, IS_KEYED_SYMBOL, IS_COLLECTION_SYMBOL, Collection, KeyedCollection, IndexedCollection, SetCollection, ITERATE_KEYS, ITERATE_VALUES, ITERATE_ENTRIES, REAL_ITERATOR_SYMBOL, FAUX_ITERATOR_SYMBOL, ITERATOR_SYMBOL, Iterator3, DELETE, SHIFT, SIZE, MASK, NOT_SET, IS_RECORD_SYMBOL, IS_ORDERED_SYMBOL, IS_SEQ_SYMBOL, hasOwnProperty4, Seq, KeyedSeq, IndexedSeq, SetSeq, ArraySeq, ObjectSeq, CollectionSeq, EMPTY_SEQ, imul, defaultValueOf, isExtensible, canDefineProperty, usingWeakMap, weakMap, symbolMap, _objHashUID, UID_HASH_KEY, STRING_HASH_CACHE_MIN_STRLEN, STRING_HASH_CACHE_MAX_SIZE, STRING_HASH_CACHE_SIZE, stringHashCache, ToKeyedSequence, ToIndexedSequence, ToSetSequence, FromEntriesSequence, ConcatSeq, toString7, IS_MAP_SYMBOL, Map2, MapPrototype, ArrayMapNode, BitmapIndexedNode, HashArrayMapNode, HashCollisionNode, ValueNode, MapIterator, EMPTY_MAP, MAX_ARRAY_MAP_SIZE, MAX_BITMAP_INDEXED_SIZE, MIN_HASH_ARRAY_MAP_SIZE, IS_LIST_SYMBOL, List3, ListPrototype, VNode, DONE, OrderedMap, EMPTY_ORDERED_MAP, IS_STACK_SYMBOL, Stack, StackPrototype, EMPTY_STACK, Range, EMPTY_RANGE, IS_SET_SYMBOL, Set2, SetPrototype, EMPTY_SET, CollectionPrototype, KeyedCollectionPrototype, IndexedCollectionPrototype, SetCollectionPrototype, OrderedSet2, OrderedSetPrototype, EMPTY_ORDERED_SET, Record, RecordPrototype;
|
|
64457
64467
|
var init_immutable_es = __esm({
|
|
64458
64468
|
"node_modules/immutable/dist/immutable.es.js"() {
|
|
64459
|
-
DELETE = "delete";
|
|
64460
|
-
SHIFT = 5;
|
|
64461
|
-
SIZE = 1 << SHIFT;
|
|
64462
|
-
MASK = SIZE - 1;
|
|
64463
|
-
NOT_SET = {};
|
|
64464
|
-
IS_COLLECTION_SYMBOL = "@@__IMMUTABLE_ITERABLE__@@";
|
|
64465
|
-
IS_KEYED_SYMBOL = "@@__IMMUTABLE_KEYED__@@";
|
|
64466
64469
|
IS_INDEXED_SYMBOL = "@@__IMMUTABLE_INDEXED__@@";
|
|
64470
|
+
IS_KEYED_SYMBOL = "@@__IMMUTABLE_KEYED__@@";
|
|
64471
|
+
IS_COLLECTION_SYMBOL = "@@__IMMUTABLE_ITERABLE__@@";
|
|
64467
64472
|
Collection = function Collection2(value) {
|
|
64468
64473
|
return isCollection(value) ? value : Seq(value);
|
|
64469
64474
|
};
|
|
@@ -64497,9 +64502,6 @@ ${subTree.join("\n")}`;
|
|
|
64497
64502
|
Collection.Keyed = KeyedCollection;
|
|
64498
64503
|
Collection.Indexed = IndexedCollection;
|
|
64499
64504
|
Collection.Set = SetCollection;
|
|
64500
|
-
IS_SEQ_SYMBOL = "@@__IMMUTABLE_SEQ__@@";
|
|
64501
|
-
IS_RECORD_SYMBOL = "@@__IMMUTABLE_RECORD__@@";
|
|
64502
|
-
IS_ORDERED_SYMBOL = "@@__IMMUTABLE_ORDERED__@@";
|
|
64503
64505
|
ITERATE_KEYS = 0;
|
|
64504
64506
|
ITERATE_VALUES = 1;
|
|
64505
64507
|
ITERATE_ENTRIES = 2;
|
|
@@ -64521,6 +64523,14 @@ ${subTree.join("\n")}`;
|
|
|
64521
64523
|
Iterator3.prototype[ITERATOR_SYMBOL] = function() {
|
|
64522
64524
|
return this;
|
|
64523
64525
|
};
|
|
64526
|
+
DELETE = "delete";
|
|
64527
|
+
SHIFT = 5;
|
|
64528
|
+
SIZE = 1 << SHIFT;
|
|
64529
|
+
MASK = SIZE - 1;
|
|
64530
|
+
NOT_SET = {};
|
|
64531
|
+
IS_RECORD_SYMBOL = "@@__IMMUTABLE_RECORD__@@";
|
|
64532
|
+
IS_ORDERED_SYMBOL = "@@__IMMUTABLE_ORDERED__@@";
|
|
64533
|
+
IS_SEQ_SYMBOL = "@@__IMMUTABLE_SEQ__@@";
|
|
64524
64534
|
hasOwnProperty4 = Object.prototype.hasOwnProperty;
|
|
64525
64535
|
Seq = /* @__PURE__ */ (function(Collection3) {
|
|
64526
64536
|
function Seq2(value) {
|
|
@@ -64753,7 +64763,6 @@ ${subTree.join("\n")}`;
|
|
|
64753
64763
|
};
|
|
64754
64764
|
return CollectionSeq2;
|
|
64755
64765
|
})(IndexedSeq);
|
|
64756
|
-
IS_MAP_SYMBOL = "@@__IMMUTABLE_MAP__@@";
|
|
64757
64766
|
imul = typeof Math.imul === "function" && Math.imul(4294967295, 2) === -2 ? Math.imul : function imul2(a8, b8) {
|
|
64758
64767
|
a8 |= 0;
|
|
64759
64768
|
b8 |= 0;
|
|
@@ -65040,6 +65049,7 @@ ${subTree.join("\n")}`;
|
|
|
65040
65049
|
return ConcatSeq2;
|
|
65041
65050
|
})(Seq);
|
|
65042
65051
|
toString7 = Object.prototype.toString;
|
|
65052
|
+
IS_MAP_SYMBOL = "@@__IMMUTABLE_MAP__@@";
|
|
65043
65053
|
Map2 = /* @__PURE__ */ (function(KeyedCollection2) {
|
|
65044
65054
|
function Map3(value) {
|
|
65045
65055
|
return value === void 0 || value === null ? emptyMap2() : isMap(value) && !isOrdered(value) ? value : emptyMap2().withMutations(function(map6) {
|
|
@@ -65139,7 +65149,7 @@ ${subTree.join("\n")}`;
|
|
|
65139
65149
|
MapPrototype.setIn = setIn;
|
|
65140
65150
|
MapPrototype.removeIn = MapPrototype.deleteIn = deleteIn;
|
|
65141
65151
|
MapPrototype.update = update;
|
|
65142
|
-
MapPrototype.updateIn = updateIn;
|
|
65152
|
+
MapPrototype.updateIn = updateIn$1;
|
|
65143
65153
|
MapPrototype.merge = MapPrototype.concat = merge$1;
|
|
65144
65154
|
MapPrototype.mergeWith = mergeWith$1;
|
|
65145
65155
|
MapPrototype.mergeDeep = mergeDeep;
|
|
@@ -65160,7 +65170,7 @@ ${subTree.join("\n")}`;
|
|
|
65160
65170
|
this.ownerID = ownerID;
|
|
65161
65171
|
this.entries = entries3;
|
|
65162
65172
|
};
|
|
65163
|
-
ArrayMapNode.prototype.get = function
|
|
65173
|
+
ArrayMapNode.prototype.get = function get(shift2, keyHash, key2, notSetValue) {
|
|
65164
65174
|
var entries3 = this.entries;
|
|
65165
65175
|
for (var ii = 0, len = entries3.length; ii < len; ii++) {
|
|
65166
65176
|
if (is4(key2, entries3[ii][0])) {
|
|
@@ -65213,7 +65223,7 @@ ${subTree.join("\n")}`;
|
|
|
65213
65223
|
this.bitmap = bitmap;
|
|
65214
65224
|
this.nodes = nodes;
|
|
65215
65225
|
};
|
|
65216
|
-
BitmapIndexedNode.prototype.get = function
|
|
65226
|
+
BitmapIndexedNode.prototype.get = function get2(shift2, keyHash, key2, notSetValue) {
|
|
65217
65227
|
if (keyHash === void 0) {
|
|
65218
65228
|
keyHash = hash(key2);
|
|
65219
65229
|
}
|
|
@@ -65277,7 +65287,7 @@ ${subTree.join("\n")}`;
|
|
|
65277
65287
|
this.count = count3;
|
|
65278
65288
|
this.nodes = nodes;
|
|
65279
65289
|
};
|
|
65280
|
-
HashArrayMapNode.prototype.get = function
|
|
65290
|
+
HashArrayMapNode.prototype.get = function get3(shift2, keyHash, key2, notSetValue) {
|
|
65281
65291
|
if (keyHash === void 0) {
|
|
65282
65292
|
keyHash = hash(key2);
|
|
65283
65293
|
}
|
|
@@ -65332,7 +65342,7 @@ ${subTree.join("\n")}`;
|
|
|
65332
65342
|
this.keyHash = keyHash;
|
|
65333
65343
|
this.entries = entries3;
|
|
65334
65344
|
};
|
|
65335
|
-
HashCollisionNode.prototype.get = function
|
|
65345
|
+
HashCollisionNode.prototype.get = function get4(shift2, keyHash, key2, notSetValue) {
|
|
65336
65346
|
var entries3 = this.entries;
|
|
65337
65347
|
for (var ii = 0, len = entries3.length; ii < len; ii++) {
|
|
65338
65348
|
if (is4(key2, entries3[ii][0])) {
|
|
@@ -65393,7 +65403,7 @@ ${subTree.join("\n")}`;
|
|
|
65393
65403
|
this.keyHash = keyHash;
|
|
65394
65404
|
this.entry = entry;
|
|
65395
65405
|
};
|
|
65396
|
-
ValueNode.prototype.get = function
|
|
65406
|
+
ValueNode.prototype.get = function get5(shift2, keyHash, key2, notSetValue) {
|
|
65397
65407
|
return is4(key2, this.entry[0]) ? this.entry[1] : notSetValue;
|
|
65398
65408
|
};
|
|
65399
65409
|
ValueNode.prototype.update = function update6(ownerID, shift2, keyHash, key2, value, didChangeSize, didAlter) {
|
|
@@ -65691,7 +65701,7 @@ ${subTree.join("\n")}`;
|
|
|
65691
65701
|
ListPrototype.setIn = setIn;
|
|
65692
65702
|
ListPrototype.deleteIn = ListPrototype.removeIn = deleteIn;
|
|
65693
65703
|
ListPrototype.update = update;
|
|
65694
|
-
ListPrototype.updateIn = updateIn;
|
|
65704
|
+
ListPrototype.updateIn = updateIn$1;
|
|
65695
65705
|
ListPrototype.mergeIn = mergeIn;
|
|
65696
65706
|
ListPrototype.mergeDeepIn = mergeDeepIn;
|
|
65697
65707
|
ListPrototype.withMutations = withMutations;
|
|
@@ -66024,6 +66034,109 @@ ${subTree.join("\n")}`;
|
|
|
66024
66034
|
StackPrototype["@@transducer/result"] = function(obj) {
|
|
66025
66035
|
return obj.asImmutable();
|
|
66026
66036
|
};
|
|
66037
|
+
Range = /* @__PURE__ */ (function(IndexedSeq2) {
|
|
66038
|
+
function Range2(start5, end4, step) {
|
|
66039
|
+
if (step === void 0) step = 1;
|
|
66040
|
+
if (!(this instanceof Range2)) {
|
|
66041
|
+
return new Range2(start5, end4, step);
|
|
66042
|
+
}
|
|
66043
|
+
invariant(step !== 0, "Cannot step a Range by 0");
|
|
66044
|
+
invariant(
|
|
66045
|
+
start5 !== void 0,
|
|
66046
|
+
"You must define a start value when using Range"
|
|
66047
|
+
);
|
|
66048
|
+
invariant(
|
|
66049
|
+
end4 !== void 0,
|
|
66050
|
+
"You must define an end value when using Range"
|
|
66051
|
+
);
|
|
66052
|
+
step = Math.abs(step);
|
|
66053
|
+
if (end4 < start5) {
|
|
66054
|
+
step = -step;
|
|
66055
|
+
}
|
|
66056
|
+
this._start = start5;
|
|
66057
|
+
this._end = end4;
|
|
66058
|
+
this._step = step;
|
|
66059
|
+
this.size = Math.max(0, Math.ceil((end4 - start5) / step - 1) + 1);
|
|
66060
|
+
if (this.size === 0) {
|
|
66061
|
+
if (EMPTY_RANGE) {
|
|
66062
|
+
return EMPTY_RANGE;
|
|
66063
|
+
}
|
|
66064
|
+
EMPTY_RANGE = this;
|
|
66065
|
+
}
|
|
66066
|
+
}
|
|
66067
|
+
if (IndexedSeq2) Range2.__proto__ = IndexedSeq2;
|
|
66068
|
+
Range2.prototype = Object.create(IndexedSeq2 && IndexedSeq2.prototype);
|
|
66069
|
+
Range2.prototype.constructor = Range2;
|
|
66070
|
+
Range2.prototype.toString = function toString10() {
|
|
66071
|
+
return this.size === 0 ? "Range []" : "Range [ " + this._start + "..." + this._end + (this._step !== 1 ? " by " + this._step : "") + " ]";
|
|
66072
|
+
};
|
|
66073
|
+
Range2.prototype.get = function get11(index2, notSetValue) {
|
|
66074
|
+
return this.has(index2) ? this._start + wrapIndex(this, index2) * this._step : notSetValue;
|
|
66075
|
+
};
|
|
66076
|
+
Range2.prototype.includes = function includes3(searchValue) {
|
|
66077
|
+
var possibleIndex = (searchValue - this._start) / this._step;
|
|
66078
|
+
return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);
|
|
66079
|
+
};
|
|
66080
|
+
Range2.prototype.slice = function slice3(begin, end4) {
|
|
66081
|
+
if (wholeSlice(begin, end4, this.size)) {
|
|
66082
|
+
return this;
|
|
66083
|
+
}
|
|
66084
|
+
begin = resolveBegin(begin, this.size);
|
|
66085
|
+
end4 = resolveEnd(end4, this.size);
|
|
66086
|
+
if (end4 <= begin) {
|
|
66087
|
+
return new Range2(0, 0);
|
|
66088
|
+
}
|
|
66089
|
+
return new Range2(
|
|
66090
|
+
this.get(begin, this._end),
|
|
66091
|
+
this.get(end4, this._end),
|
|
66092
|
+
this._step
|
|
66093
|
+
);
|
|
66094
|
+
};
|
|
66095
|
+
Range2.prototype.indexOf = function indexOf5(searchValue) {
|
|
66096
|
+
var offsetValue = searchValue - this._start;
|
|
66097
|
+
if (offsetValue % this._step === 0) {
|
|
66098
|
+
var index2 = offsetValue / this._step;
|
|
66099
|
+
if (index2 >= 0 && index2 < this.size) {
|
|
66100
|
+
return index2;
|
|
66101
|
+
}
|
|
66102
|
+
}
|
|
66103
|
+
return -1;
|
|
66104
|
+
};
|
|
66105
|
+
Range2.prototype.lastIndexOf = function lastIndexOf2(searchValue) {
|
|
66106
|
+
return this.indexOf(searchValue);
|
|
66107
|
+
};
|
|
66108
|
+
Range2.prototype.__iterate = function __iterate2(fn, reverse3) {
|
|
66109
|
+
var size4 = this.size;
|
|
66110
|
+
var step = this._step;
|
|
66111
|
+
var value = reverse3 ? this._start + (size4 - 1) * step : this._start;
|
|
66112
|
+
var i = 0;
|
|
66113
|
+
while (i !== size4) {
|
|
66114
|
+
if (fn(value, reverse3 ? size4 - ++i : i++, this) === false) {
|
|
66115
|
+
break;
|
|
66116
|
+
}
|
|
66117
|
+
value += reverse3 ? -step : step;
|
|
66118
|
+
}
|
|
66119
|
+
return i;
|
|
66120
|
+
};
|
|
66121
|
+
Range2.prototype.__iterator = function __iterator2(type3, reverse3) {
|
|
66122
|
+
var size4 = this.size;
|
|
66123
|
+
var step = this._step;
|
|
66124
|
+
var value = reverse3 ? this._start + (size4 - 1) * step : this._start;
|
|
66125
|
+
var i = 0;
|
|
66126
|
+
return new Iterator3(function() {
|
|
66127
|
+
if (i === size4) {
|
|
66128
|
+
return iteratorDone();
|
|
66129
|
+
}
|
|
66130
|
+
var v4 = value;
|
|
66131
|
+
value += reverse3 ? -step : step;
|
|
66132
|
+
return iteratorValue(type3, reverse3 ? size4 - ++i : i++, v4);
|
|
66133
|
+
});
|
|
66134
|
+
};
|
|
66135
|
+
Range2.prototype.equals = function equals3(other) {
|
|
66136
|
+
return other instanceof Range2 ? this._start === other._start && this._end === other._end && this._step === other._step : deepEqual2(this, other);
|
|
66137
|
+
};
|
|
66138
|
+
return Range2;
|
|
66139
|
+
})(IndexedSeq);
|
|
66027
66140
|
IS_SET_SYMBOL = "@@__IMMUTABLE_SET__@@";
|
|
66028
66141
|
Set2 = /* @__PURE__ */ (function(SetCollection2) {
|
|
66029
66142
|
function Set3(value) {
|
|
@@ -66204,109 +66317,6 @@ ${subTree.join("\n")}`;
|
|
|
66204
66317
|
};
|
|
66205
66318
|
SetPrototype.__empty = emptySet;
|
|
66206
66319
|
SetPrototype.__make = makeSet;
|
|
66207
|
-
Range = /* @__PURE__ */ (function(IndexedSeq2) {
|
|
66208
|
-
function Range2(start5, end4, step) {
|
|
66209
|
-
if (step === void 0) step = 1;
|
|
66210
|
-
if (!(this instanceof Range2)) {
|
|
66211
|
-
return new Range2(start5, end4, step);
|
|
66212
|
-
}
|
|
66213
|
-
invariant(step !== 0, "Cannot step a Range by 0");
|
|
66214
|
-
invariant(
|
|
66215
|
-
start5 !== void 0,
|
|
66216
|
-
"You must define a start value when using Range"
|
|
66217
|
-
);
|
|
66218
|
-
invariant(
|
|
66219
|
-
end4 !== void 0,
|
|
66220
|
-
"You must define an end value when using Range"
|
|
66221
|
-
);
|
|
66222
|
-
step = Math.abs(step);
|
|
66223
|
-
if (end4 < start5) {
|
|
66224
|
-
step = -step;
|
|
66225
|
-
}
|
|
66226
|
-
this._start = start5;
|
|
66227
|
-
this._end = end4;
|
|
66228
|
-
this._step = step;
|
|
66229
|
-
this.size = Math.max(0, Math.ceil((end4 - start5) / step - 1) + 1);
|
|
66230
|
-
if (this.size === 0) {
|
|
66231
|
-
if (EMPTY_RANGE) {
|
|
66232
|
-
return EMPTY_RANGE;
|
|
66233
|
-
}
|
|
66234
|
-
EMPTY_RANGE = this;
|
|
66235
|
-
}
|
|
66236
|
-
}
|
|
66237
|
-
if (IndexedSeq2) Range2.__proto__ = IndexedSeq2;
|
|
66238
|
-
Range2.prototype = Object.create(IndexedSeq2 && IndexedSeq2.prototype);
|
|
66239
|
-
Range2.prototype.constructor = Range2;
|
|
66240
|
-
Range2.prototype.toString = function toString10() {
|
|
66241
|
-
return this.size === 0 ? "Range []" : "Range [ " + this._start + "..." + this._end + (this._step !== 1 ? " by " + this._step : "") + " ]";
|
|
66242
|
-
};
|
|
66243
|
-
Range2.prototype.get = function get11(index2, notSetValue) {
|
|
66244
|
-
return this.has(index2) ? this._start + wrapIndex(this, index2) * this._step : notSetValue;
|
|
66245
|
-
};
|
|
66246
|
-
Range2.prototype.includes = function includes3(searchValue) {
|
|
66247
|
-
var possibleIndex = (searchValue - this._start) / this._step;
|
|
66248
|
-
return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);
|
|
66249
|
-
};
|
|
66250
|
-
Range2.prototype.slice = function slice3(begin, end4) {
|
|
66251
|
-
if (wholeSlice(begin, end4, this.size)) {
|
|
66252
|
-
return this;
|
|
66253
|
-
}
|
|
66254
|
-
begin = resolveBegin(begin, this.size);
|
|
66255
|
-
end4 = resolveEnd(end4, this.size);
|
|
66256
|
-
if (end4 <= begin) {
|
|
66257
|
-
return new Range2(0, 0);
|
|
66258
|
-
}
|
|
66259
|
-
return new Range2(
|
|
66260
|
-
this.get(begin, this._end),
|
|
66261
|
-
this.get(end4, this._end),
|
|
66262
|
-
this._step
|
|
66263
|
-
);
|
|
66264
|
-
};
|
|
66265
|
-
Range2.prototype.indexOf = function indexOf5(searchValue) {
|
|
66266
|
-
var offsetValue = searchValue - this._start;
|
|
66267
|
-
if (offsetValue % this._step === 0) {
|
|
66268
|
-
var index2 = offsetValue / this._step;
|
|
66269
|
-
if (index2 >= 0 && index2 < this.size) {
|
|
66270
|
-
return index2;
|
|
66271
|
-
}
|
|
66272
|
-
}
|
|
66273
|
-
return -1;
|
|
66274
|
-
};
|
|
66275
|
-
Range2.prototype.lastIndexOf = function lastIndexOf2(searchValue) {
|
|
66276
|
-
return this.indexOf(searchValue);
|
|
66277
|
-
};
|
|
66278
|
-
Range2.prototype.__iterate = function __iterate2(fn, reverse3) {
|
|
66279
|
-
var size4 = this.size;
|
|
66280
|
-
var step = this._step;
|
|
66281
|
-
var value = reverse3 ? this._start + (size4 - 1) * step : this._start;
|
|
66282
|
-
var i = 0;
|
|
66283
|
-
while (i !== size4) {
|
|
66284
|
-
if (fn(value, reverse3 ? size4 - ++i : i++, this) === false) {
|
|
66285
|
-
break;
|
|
66286
|
-
}
|
|
66287
|
-
value += reverse3 ? -step : step;
|
|
66288
|
-
}
|
|
66289
|
-
return i;
|
|
66290
|
-
};
|
|
66291
|
-
Range2.prototype.__iterator = function __iterator2(type3, reverse3) {
|
|
66292
|
-
var size4 = this.size;
|
|
66293
|
-
var step = this._step;
|
|
66294
|
-
var value = reverse3 ? this._start + (size4 - 1) * step : this._start;
|
|
66295
|
-
var i = 0;
|
|
66296
|
-
return new Iterator3(function() {
|
|
66297
|
-
if (i === size4) {
|
|
66298
|
-
return iteratorDone();
|
|
66299
|
-
}
|
|
66300
|
-
var v4 = value;
|
|
66301
|
-
value += reverse3 ? -step : step;
|
|
66302
|
-
return iteratorValue(type3, reverse3 ? size4 - ++i : i++, v4);
|
|
66303
|
-
});
|
|
66304
|
-
};
|
|
66305
|
-
Range2.prototype.equals = function equals3(other) {
|
|
66306
|
-
return other instanceof Range2 ? this._start === other._start && this._end === other._end && this._step === other._step : deepEqual2(this, other);
|
|
66307
|
-
};
|
|
66308
|
-
return Range2;
|
|
66309
|
-
})(IndexedSeq);
|
|
66310
66320
|
Collection.Iterator = Iterator3;
|
|
66311
66321
|
mixin(Collection, {
|
|
66312
66322
|
// ### Conversion to other types
|
|
@@ -66963,7 +66973,7 @@ ${subTree.join("\n")}`;
|
|
|
66963
66973
|
RecordPrototype.mergeDeepIn = mergeDeepIn;
|
|
66964
66974
|
RecordPrototype.setIn = setIn;
|
|
66965
66975
|
RecordPrototype.update = update;
|
|
66966
|
-
RecordPrototype.updateIn = updateIn;
|
|
66976
|
+
RecordPrototype.updateIn = updateIn$1;
|
|
66967
66977
|
RecordPrototype.withMutations = withMutations;
|
|
66968
66978
|
RecordPrototype.asMutable = asMutable;
|
|
66969
66979
|
RecordPrototype.asImmutable = asImmutable;
|
|
@@ -175056,14 +175066,6 @@ void main() {
|
|
|
175056
175066
|
const end4 = start5 + 3 * strand;
|
|
175057
175067
|
return [Math.min(start5, end4), Math.max(start5, end4)];
|
|
175058
175068
|
}
|
|
175059
|
-
function createGenomeRegion({
|
|
175060
|
-
assemblyName,
|
|
175061
|
-
refName,
|
|
175062
|
-
start: start5,
|
|
175063
|
-
end: end4
|
|
175064
|
-
}) {
|
|
175065
|
-
return { assemblyName, refName, start: start5, end: end4 };
|
|
175066
|
-
}
|
|
175067
175069
|
async function clickProteinToGenome({
|
|
175068
175070
|
model,
|
|
175069
175071
|
structureSeqPos
|
|
@@ -175081,7 +175083,7 @@ void main() {
|
|
|
175081
175083
|
if (!assemblyName) {
|
|
175082
175084
|
return void 0;
|
|
175083
175085
|
}
|
|
175084
|
-
const region =
|
|
175086
|
+
const region = { assemblyName, refName, start: start5, end: end4 };
|
|
175085
175087
|
model.setClickGenomeHighlights([region]);
|
|
175086
175088
|
if (zoomToBaseLevel) {
|
|
175087
175089
|
await connectedView.navToLocString(
|
|
@@ -175108,13 +175110,14 @@ void main() {
|
|
|
175108
175110
|
const assemblyName = connectedView?.assemblyNames[0];
|
|
175109
175111
|
if (genomeToTranscriptSeqMapping2 && mappedCoords && assemblyName) {
|
|
175110
175112
|
const [start5, end4] = mappedCoords;
|
|
175111
|
-
|
|
175112
|
-
|
|
175113
|
-
|
|
175114
|
-
|
|
175115
|
-
|
|
175116
|
-
|
|
175117
|
-
|
|
175113
|
+
model.setHoverGenomeHighlights([
|
|
175114
|
+
{
|
|
175115
|
+
assemblyName,
|
|
175116
|
+
refName: genomeToTranscriptSeqMapping2.refName,
|
|
175117
|
+
start: start5,
|
|
175118
|
+
end: end4
|
|
175119
|
+
}
|
|
175120
|
+
]);
|
|
175118
175121
|
}
|
|
175119
175122
|
}
|
|
175120
175123
|
var import_util212;
|
|
@@ -201548,9 +201551,15 @@ def Mesh "mesh${this.meshes.length}"
|
|
|
201548
201551
|
const { assemblyManager } = (0, import_util.getSession)(model);
|
|
201549
201552
|
const { offsetPx } = model;
|
|
201550
201553
|
const assembly = assemblyManager.get(assemblyName);
|
|
201551
|
-
const
|
|
201552
|
-
const s = model.bpToPx({
|
|
201553
|
-
|
|
201554
|
+
const canonicalRefName = assembly?.getCanonicalRefName(refName) ?? refName;
|
|
201555
|
+
const s = model.bpToPx({
|
|
201556
|
+
refName: canonicalRefName,
|
|
201557
|
+
coord: start5
|
|
201558
|
+
});
|
|
201559
|
+
const e = model.bpToPx({
|
|
201560
|
+
refName: canonicalRefName,
|
|
201561
|
+
coord: end4
|
|
201562
|
+
});
|
|
201554
201563
|
if (s && e) {
|
|
201555
201564
|
const width = Math.max(Math.abs(e.offsetPx - s.offsetPx), 3);
|
|
201556
201565
|
const left = Math.min(s.offsetPx, e.offsetPx) - offsetPx;
|
|
@@ -201561,7 +201570,10 @@ def Mesh "mesh${this.meshes.length}"
|
|
|
201561
201570
|
classes.highlight,
|
|
201562
201571
|
width <= 3 ? classes.thinborder : void 0
|
|
201563
201572
|
),
|
|
201564
|
-
style: {
|
|
201573
|
+
style: {
|
|
201574
|
+
left,
|
|
201575
|
+
width
|
|
201576
|
+
}
|
|
201565
201577
|
}
|
|
201566
201578
|
);
|
|
201567
201579
|
} else {
|
|
@@ -201624,7 +201636,7 @@ def Mesh "mesh${this.meshes.length}"
|
|
|
201624
201636
|
structureSeqPos
|
|
201625
201637
|
}) {
|
|
201626
201638
|
return [
|
|
201627
|
-
structureSeqPos === void 0 ? "" : `Position: ${structureSeqPos}`,
|
|
201639
|
+
structureSeqPos === void 0 ? "" : `Position: ${structureSeqPos + 1}`,
|
|
201628
201640
|
code4 ? `Letter: ${code4} (${proteinAbbreviationMapping[code4]?.singleLetterCode})` : "",
|
|
201629
201641
|
chain2 ? `Chain: ${chain2}` : ""
|
|
201630
201642
|
].filter((f) => !!f).join(", ");
|