@dxos/merkle-search-tree 0.8.4-staging.ac66bdf99f → 0.9.0
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/LICENSE +102 -5
- package/dist/lib/browser/index.mjs +17 -154
- package/dist/lib/browser/index.mjs.map +2 -2
- package/dist/lib/browser/meta.json +1 -1
- package/dist/lib/node-esm/index.mjs +17 -154
- package/dist/lib/node-esm/index.mjs.map +2 -2
- package/dist/lib/node-esm/meta.json +1 -1
- package/dist/types/src/common.d.ts.map +1 -1
- package/dist/types/src/forest.d.ts.map +1 -1
- package/dist/types/src/lww-tree.d.ts.map +1 -1
- package/dist/types/src/mirror-multi-map.d.ts.map +1 -1
- package/dist/types/src/testing.d.ts.map +1 -1
- package/dist/types/tsconfig.tsbuildinfo +1 -1
- package/package.json +4 -7
package/LICENSE
CHANGED
|
@@ -1,8 +1,105 @@
|
|
|
1
|
-
|
|
2
|
-
Copyright (c) 2022 DXOS
|
|
1
|
+
# Functional Source License, Version 1.1, ALv2 Future License
|
|
3
2
|
|
|
4
|
-
|
|
3
|
+
## Abbreviation
|
|
5
4
|
|
|
6
|
-
|
|
5
|
+
FSL-1.1-Apache-2.0
|
|
7
6
|
|
|
8
|
-
|
|
7
|
+
## Notice
|
|
8
|
+
|
|
9
|
+
Copyright 2026 DXOS
|
|
10
|
+
|
|
11
|
+
## Terms and Conditions
|
|
12
|
+
|
|
13
|
+
### Licensor ("We")
|
|
14
|
+
|
|
15
|
+
The party offering the Software under these Terms and Conditions.
|
|
16
|
+
|
|
17
|
+
### The Software
|
|
18
|
+
|
|
19
|
+
The "Software" is each version of the software that we make available under
|
|
20
|
+
these Terms and Conditions, as indicated by our inclusion of these Terms and
|
|
21
|
+
Conditions with the Software.
|
|
22
|
+
|
|
23
|
+
### License Grant
|
|
24
|
+
|
|
25
|
+
Subject to your compliance with this License Grant and the Patents,
|
|
26
|
+
Redistribution and Trademark clauses below, we hereby grant you the right to
|
|
27
|
+
use, copy, modify, create derivative works, publicly perform, publicly display
|
|
28
|
+
and redistribute the Software for any Permitted Purpose identified below.
|
|
29
|
+
|
|
30
|
+
### Permitted Purpose
|
|
31
|
+
|
|
32
|
+
A Permitted Purpose is any purpose other than a Competing Use. A Competing Use
|
|
33
|
+
means making the Software available to others in a commercial product or
|
|
34
|
+
service that:
|
|
35
|
+
|
|
36
|
+
1. substitutes for the Software;
|
|
37
|
+
|
|
38
|
+
2. substitutes for any other product or service we offer using the Software
|
|
39
|
+
that exists as of the date we make the Software available; or
|
|
40
|
+
|
|
41
|
+
3. offers the same or substantially similar functionality as the Software.
|
|
42
|
+
|
|
43
|
+
Permitted Purposes specifically include using the Software:
|
|
44
|
+
|
|
45
|
+
1. for your internal use and access;
|
|
46
|
+
|
|
47
|
+
2. for non-commercial education;
|
|
48
|
+
|
|
49
|
+
3. for non-commercial research; and
|
|
50
|
+
|
|
51
|
+
4. in connection with professional services that you provide to a licensee
|
|
52
|
+
using the Software in accordance with these Terms and Conditions.
|
|
53
|
+
|
|
54
|
+
### Patents
|
|
55
|
+
|
|
56
|
+
To the extent your use for a Permitted Purpose would necessarily infringe our
|
|
57
|
+
patents, the license grant above includes a license under our patents. If you
|
|
58
|
+
make a claim against any party that the Software infringes or contributes to
|
|
59
|
+
the infringement of any patent, then your patent license to the Software ends
|
|
60
|
+
immediately.
|
|
61
|
+
|
|
62
|
+
### Redistribution
|
|
63
|
+
|
|
64
|
+
The Terms and Conditions apply to all copies, modifications and derivatives of
|
|
65
|
+
the Software.
|
|
66
|
+
|
|
67
|
+
If you redistribute any copies, modifications or derivatives of the Software,
|
|
68
|
+
you must include a copy of or a link to these Terms and Conditions and not
|
|
69
|
+
remove any copyright notices provided in or with the Software.
|
|
70
|
+
|
|
71
|
+
### Disclaimer
|
|
72
|
+
|
|
73
|
+
THE SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTIES OF ANY KIND, EXPRESS OR
|
|
74
|
+
IMPLIED, INCLUDING WITHOUT LIMITATION WARRANTIES OF FITNESS FOR A PARTICULAR
|
|
75
|
+
PURPOSE, MERCHANTABILITY, TITLE OR NON-INFRINGEMENT.
|
|
76
|
+
|
|
77
|
+
IN NO EVENT WILL WE HAVE ANY LIABILITY TO YOU ARISING OUT OF OR RELATED TO THE
|
|
78
|
+
SOFTWARE, INCLUDING INDIRECT, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES,
|
|
79
|
+
EVEN IF WE HAVE BEEN INFORMED OF THEIR POSSIBILITY IN ADVANCE.
|
|
80
|
+
|
|
81
|
+
### Trademarks
|
|
82
|
+
|
|
83
|
+
Except for displaying the License Details and identifying us as the origin of
|
|
84
|
+
the Software, you have no right under these Terms and Conditions to use our
|
|
85
|
+
trademarks, trade names, service marks or product names.
|
|
86
|
+
|
|
87
|
+
## Grant of Future License
|
|
88
|
+
|
|
89
|
+
We hereby irrevocably grant you an additional license to use the Software under
|
|
90
|
+
the Apache License, Version 2.0 that is effective on the second anniversary of
|
|
91
|
+
the date we make the Software available. On or after that date, you may use the
|
|
92
|
+
Software under the Apache License, Version 2.0, in which case the following
|
|
93
|
+
will apply:
|
|
94
|
+
|
|
95
|
+
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
|
|
96
|
+
this file except in compliance with the License.
|
|
97
|
+
|
|
98
|
+
You may obtain a copy of the License at
|
|
99
|
+
|
|
100
|
+
http://www.apache.org/licenses/LICENSE-2.0
|
|
101
|
+
|
|
102
|
+
Unless required by applicable law or agreed to in writing, software distributed
|
|
103
|
+
under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
104
|
+
CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
105
|
+
specific language governing permissions and limitations under the License.
|
|
@@ -61,7 +61,6 @@ var textEncoder = new TextEncoder();
|
|
|
61
61
|
// src/forest.ts
|
|
62
62
|
import { invariant } from "@dxos/invariant";
|
|
63
63
|
import { arrayToHex as arrayToHex2, arraysEqual } from "@dxos/util";
|
|
64
|
-
var __dxlog_file = "/__w/dxos/dxos/packages/common/merkle-search-tree/src/forest.ts";
|
|
65
64
|
var Forest = class {
|
|
66
65
|
#nodes = /* @__PURE__ */ new Map();
|
|
67
66
|
itemHashOps = 0;
|
|
@@ -81,15 +80,7 @@ var Forest = class {
|
|
|
81
80
|
return this.#makeNode(0, [], []);
|
|
82
81
|
}
|
|
83
82
|
const buildLevel = async (level, from, to) => {
|
|
84
|
-
invariant(level >= 0
|
|
85
|
-
F: __dxlog_file,
|
|
86
|
-
L: 37,
|
|
87
|
-
S: this,
|
|
88
|
-
A: [
|
|
89
|
-
"level >= 0",
|
|
90
|
-
""
|
|
91
|
-
]
|
|
92
|
-
});
|
|
83
|
+
invariant(level >= 0);
|
|
93
84
|
if (level === 0) {
|
|
94
85
|
return this.#makeNode(0, items.slice(from, to), []);
|
|
95
86
|
}
|
|
@@ -145,15 +136,7 @@ var Forest = class {
|
|
|
145
136
|
}
|
|
146
137
|
}
|
|
147
138
|
if (!found) {
|
|
148
|
-
invariant(node.level > 0
|
|
149
|
-
F: __dxlog_file,
|
|
150
|
-
L: 96,
|
|
151
|
-
S: this,
|
|
152
|
-
A: [
|
|
153
|
-
"node!.level > 0",
|
|
154
|
-
""
|
|
155
|
-
]
|
|
156
|
-
});
|
|
139
|
+
invariant(node.level > 0);
|
|
157
140
|
node = this.#nodes.get(node.children[node.items.length]);
|
|
158
141
|
}
|
|
159
142
|
}
|
|
@@ -177,70 +160,22 @@ var Forest = class {
|
|
|
177
160
|
digest1
|
|
178
161
|
]), digest2, mergeFn);
|
|
179
162
|
}
|
|
180
|
-
invariant(node1.level === node2.level
|
|
181
|
-
F: __dxlog_file,
|
|
182
|
-
L: 119,
|
|
183
|
-
S: this,
|
|
184
|
-
A: [
|
|
185
|
-
"node1.level === node2.level",
|
|
186
|
-
""
|
|
187
|
-
]
|
|
188
|
-
});
|
|
163
|
+
invariant(node1.level === node2.level);
|
|
189
164
|
const resultItems = [];
|
|
190
165
|
const resultChildren = [];
|
|
191
166
|
let carry1 = null;
|
|
192
167
|
let carry2 = null;
|
|
193
168
|
for (let i1 = 0, i2 = 0; i1 < node1.items.length || i2 < node2.items.length; void 0) {
|
|
194
|
-
invariant(i1 <= node1.items.length
|
|
195
|
-
|
|
196
|
-
L: 132,
|
|
197
|
-
S: this,
|
|
198
|
-
A: [
|
|
199
|
-
"i1 <= node1.items.length",
|
|
200
|
-
""
|
|
201
|
-
]
|
|
202
|
-
});
|
|
203
|
-
invariant(i2 <= node2.items.length, void 0, {
|
|
204
|
-
F: __dxlog_file,
|
|
205
|
-
L: 133,
|
|
206
|
-
S: this,
|
|
207
|
-
A: [
|
|
208
|
-
"i2 <= node2.items.length",
|
|
209
|
-
""
|
|
210
|
-
]
|
|
211
|
-
});
|
|
169
|
+
invariant(i1 <= node1.items.length);
|
|
170
|
+
invariant(i2 <= node2.items.length);
|
|
212
171
|
const key1 = i1 < node1.items.length ? node1.items[i1].key : null;
|
|
213
172
|
const key2 = i2 < node2.items.length ? node2.items[i2].key : null;
|
|
214
|
-
invariant(key1 !== null || key2 !== null
|
|
215
|
-
F: __dxlog_file,
|
|
216
|
-
L: 137,
|
|
217
|
-
S: this,
|
|
218
|
-
A: [
|
|
219
|
-
"key1 !== null || key2 !== null",
|
|
220
|
-
""
|
|
221
|
-
]
|
|
222
|
-
});
|
|
173
|
+
invariant(key1 !== null || key2 !== null);
|
|
223
174
|
const child1 = carry1 !== null ? carry1 : node1.children[i1];
|
|
224
175
|
const child2 = carry2 !== null ? carry2 : node2.children[i2];
|
|
225
176
|
if (node1.level > 0) {
|
|
226
|
-
invariant(validDigest(child1)
|
|
227
|
-
|
|
228
|
-
L: 142,
|
|
229
|
-
S: this,
|
|
230
|
-
A: [
|
|
231
|
-
"validDigest(child1)",
|
|
232
|
-
""
|
|
233
|
-
]
|
|
234
|
-
});
|
|
235
|
-
invariant(validDigest(child2), void 0, {
|
|
236
|
-
F: __dxlog_file,
|
|
237
|
-
L: 143,
|
|
238
|
-
S: this,
|
|
239
|
-
A: [
|
|
240
|
-
"validDigest(child2)",
|
|
241
|
-
""
|
|
242
|
-
]
|
|
243
|
-
});
|
|
177
|
+
invariant(validDigest(child1));
|
|
178
|
+
invariant(validDigest(child2));
|
|
244
179
|
}
|
|
245
180
|
if (key1 === key2) {
|
|
246
181
|
if (node1.level > 0) {
|
|
@@ -252,15 +187,7 @@ var Forest = class {
|
|
|
252
187
|
i1++;
|
|
253
188
|
i2++;
|
|
254
189
|
} else if (key2 !== null && (key1 === null || key1 > key2)) {
|
|
255
|
-
invariant(key2 !== null
|
|
256
|
-
F: __dxlog_file,
|
|
257
|
-
L: 157,
|
|
258
|
-
S: this,
|
|
259
|
-
A: [
|
|
260
|
-
"key2 !== null",
|
|
261
|
-
""
|
|
262
|
-
]
|
|
263
|
-
});
|
|
190
|
+
invariant(key2 !== null);
|
|
264
191
|
resultItems.push(await this.#mergeItem(mergeFn, null, node2.items[i2]));
|
|
265
192
|
if (node1.level > 0) {
|
|
266
193
|
const [left, right] = await this.#splitAtKey(child1, key2);
|
|
@@ -270,15 +197,7 @@ var Forest = class {
|
|
|
270
197
|
}
|
|
271
198
|
i2++;
|
|
272
199
|
} else {
|
|
273
|
-
invariant(key1 !== null
|
|
274
|
-
F: __dxlog_file,
|
|
275
|
-
L: 170,
|
|
276
|
-
S: this,
|
|
277
|
-
A: [
|
|
278
|
-
"key1 !== null",
|
|
279
|
-
""
|
|
280
|
-
]
|
|
281
|
-
});
|
|
200
|
+
invariant(key1 !== null);
|
|
282
201
|
resultItems.push(await this.#mergeItem(mergeFn, node1.items[i1], null));
|
|
283
202
|
if (node1.level > 0) {
|
|
284
203
|
const [left, right] = await this.#splitAtKey(child2, key1);
|
|
@@ -323,15 +242,7 @@ var Forest = class {
|
|
|
323
242
|
for (const node of nodes) {
|
|
324
243
|
const items = await Promise.all(node.items.map((item) => makeItem2(item.key, item.value)));
|
|
325
244
|
const { digest } = await makeNode(node.level, items, node.children);
|
|
326
|
-
invariant(digest === node.digest
|
|
327
|
-
F: __dxlog_file,
|
|
328
|
-
L: 218,
|
|
329
|
-
S: this,
|
|
330
|
-
A: [
|
|
331
|
-
"digest === node.digest",
|
|
332
|
-
""
|
|
333
|
-
]
|
|
334
|
-
});
|
|
245
|
+
invariant(digest === node.digest);
|
|
335
246
|
this.#nodes.set(node.digest, {
|
|
336
247
|
level: node.level,
|
|
337
248
|
digest: node.digest,
|
|
@@ -404,15 +315,7 @@ var Forest = class {
|
|
|
404
315
|
}
|
|
405
316
|
}
|
|
406
317
|
#requireNode(digest) {
|
|
407
|
-
invariant(validDigest(digest)
|
|
408
|
-
F: __dxlog_file,
|
|
409
|
-
L: 295,
|
|
410
|
-
S: this,
|
|
411
|
-
A: [
|
|
412
|
-
"validDigest(digest)",
|
|
413
|
-
""
|
|
414
|
-
]
|
|
415
|
-
});
|
|
318
|
+
invariant(validDigest(digest));
|
|
416
319
|
const node = this.#nodes.get(digest);
|
|
417
320
|
if (!node) {
|
|
418
321
|
throw new Error(`Node not available: ${digest}`);
|
|
@@ -420,15 +323,7 @@ var Forest = class {
|
|
|
420
323
|
return node;
|
|
421
324
|
}
|
|
422
325
|
async #mergeItem(mergeFn, item1, item2) {
|
|
423
|
-
invariant(item1 !== null || item2 !== null
|
|
424
|
-
F: __dxlog_file,
|
|
425
|
-
L: 304,
|
|
426
|
-
S: this,
|
|
427
|
-
A: [
|
|
428
|
-
"item1 !== null || item2 !== null",
|
|
429
|
-
""
|
|
430
|
-
]
|
|
431
|
-
});
|
|
326
|
+
invariant(item1 !== null || item2 !== null);
|
|
432
327
|
const key = item1?.key ?? item2?.key;
|
|
433
328
|
if (item1 !== null && item2 !== null && arraysEqual(item1.value, item2.value)) {
|
|
434
329
|
return item1;
|
|
@@ -446,15 +341,7 @@ var Forest = class {
|
|
|
446
341
|
}
|
|
447
342
|
#emptyNodeCache = void 0;
|
|
448
343
|
async #makeNode(level, items, children) {
|
|
449
|
-
invariant(level > 0 ? items.length + 1 === children.length : children.length === 0
|
|
450
|
-
F: __dxlog_file,
|
|
451
|
-
L: 328,
|
|
452
|
-
S: this,
|
|
453
|
-
A: [
|
|
454
|
-
"level > 0 ? items.length + 1 === children.length : children.length === 0",
|
|
455
|
-
""
|
|
456
|
-
]
|
|
457
|
-
});
|
|
344
|
+
invariant(level > 0 ? items.length + 1 === children.length : children.length === 0);
|
|
458
345
|
let node;
|
|
459
346
|
if (level === 0 && items.length === 0) {
|
|
460
347
|
node = await (this.#emptyNodeCache ??= makeNode(0, [], []));
|
|
@@ -537,15 +424,7 @@ var TreeMut = class {
|
|
|
537
424
|
}
|
|
538
425
|
};
|
|
539
426
|
var makeNode = async (level, items, children) => {
|
|
540
|
-
invariant(level > 0 ? items.length + 1 === children.length : children.length === 0
|
|
541
|
-
F: __dxlog_file,
|
|
542
|
-
L: 479,
|
|
543
|
-
S: void 0,
|
|
544
|
-
A: [
|
|
545
|
-
"level > 0 ? items.length + 1 === children.length : children.length === 0",
|
|
546
|
-
""
|
|
547
|
-
]
|
|
548
|
-
});
|
|
427
|
+
invariant(level > 0 ? items.length + 1 === children.length : children.length === 0);
|
|
549
428
|
const nodeInputData = textEncoder2.encode(items.map((item) => item.itemDigest).join("") + children.join(""));
|
|
550
429
|
const digest = await crypto.subtle.digest({
|
|
551
430
|
name: "SHA-256"
|
|
@@ -558,24 +437,8 @@ var makeNode = async (level, items, children) => {
|
|
|
558
437
|
};
|
|
559
438
|
};
|
|
560
439
|
var makeItem2 = async (key, value) => {
|
|
561
|
-
invariant(typeof key === "string"
|
|
562
|
-
|
|
563
|
-
L: 501,
|
|
564
|
-
S: void 0,
|
|
565
|
-
A: [
|
|
566
|
-
"typeof key === 'string'",
|
|
567
|
-
""
|
|
568
|
-
]
|
|
569
|
-
});
|
|
570
|
-
invariant(value !== null, void 0, {
|
|
571
|
-
F: __dxlog_file,
|
|
572
|
-
L: 502,
|
|
573
|
-
S: void 0,
|
|
574
|
-
A: [
|
|
575
|
-
"value !== null",
|
|
576
|
-
""
|
|
577
|
-
]
|
|
578
|
-
});
|
|
440
|
+
invariant(typeof key === "string");
|
|
441
|
+
invariant(value !== null);
|
|
579
442
|
const keyBytes = textEncoder2.encode(key);
|
|
580
443
|
const keyDigest = await crypto.subtle.digest({
|
|
581
444
|
name: "SHA-256"
|
|
@@ -2,6 +2,6 @@
|
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../../src/common.ts", "../../../src/forest.ts", "../../../src/lww-tree.ts", "../../../src/mirror-multi-map.ts", "../../../src/testing.ts"],
|
|
4
4
|
"sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { arrayToHex } from '@dxos/util';\n\nexport type ActorID = string & { __ActorID: never };\n\nexport type Item = {\n key: string;\n value: Uint8Array;\n digest: Uint8Array;\n};\n\nexport const makeItem = async (key: string, value: Uint8Array): Promise<Item> => {\n const keyBytes = textEncoder.encode(key);\n const data = new Uint8Array(keyBytes.length + value.length);\n data.set(keyBytes, 0);\n data.set(value, keyBytes.length);\n const digest = await crypto.subtle.digest({ name: 'SHA-256' }, data);\n return {\n key,\n value,\n digest: new Uint8Array(digest),\n };\n};\n\n/**\n * The level the item is placed at is determined as the number of leading zeroes in the item's digest in a given base.\n *\n * This function is hardcoded to use base 16.\n *\n * Example:\n * XXXXXXXX - level 0\n * 0XXXXXXX - level 1\n * 00XXXXXX - level 2\n */\nexport const getLevel = (digest: Uint8Array): number => {\n let level = 0;\n for (let i = 0; i < digest.length; i++) {\n const byte = digest[i];\n // left nibble\n if (byte >> 4 === 0) {\n level++;\n } else {\n break;\n }\n // right nibble\n if ((byte & 0x0f) === 0) {\n level++;\n } else {\n break;\n }\n }\n return level;\n};\n\nexport const formatDigest = (digest: Uint8Array) => {\n return arrayToHex(digest.buffer);\n};\n\nexport const getLevelHex = (digest: string): number => {\n let level = 0;\n for (let i = 0; i < digest.length; i++) {\n if (digest[i] === '0') {\n level++;\n } else {\n break;\n }\n }\n return level;\n};\n\nexport const digestEquals = (a: Uint8Array, b: Uint8Array) => {\n if (a.length !== b.length) {\n return false;\n }\n for (let i = 0; i < a.length; i++) {\n if (a[i] !== b[i]) {\n return false;\n }\n }\n return true;\n};\n\nconst textEncoder = new TextEncoder();\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { invariant } from '@dxos/invariant';\nimport { arrayToHex, arraysEqual } from '@dxos/util';\n\nimport { formatDigest, getLevelHex } from './common';\n\nexport class Forest {\n #nodes = new Map<DigestHex, Node>();\n\n itemHashOps = 0;\n nodeHashOps = 0;\n\n async createTree(pairs: Iterable<Pair>): Promise<DigestHex> {\n const items = await Promise.all([...pairs].map(([key, value]) => makeItem(key, value)));\n this.itemHashOps += items.length;\n items.sort((a, b) => (a.key < b.key ? -1 : 1));\n // Check for repetition.\n for (let i = 0; i < items.length; i++) {\n if (i + 1 < items.length && items[i].key === items[i + 1].key) {\n throw new Error('Duplicate key');\n }\n }\n\n if (items.length === 0) {\n return this.#makeNode(0, [], []);\n }\n\n // # 0 0 1 0 0 2 1 0 1 0\n // 0 [0 0] 1 [0 0] 2 1 [0] 1 [0]\n // 1 [[0 0] 1 [0 0]] 2 [1 [0] 1 [0]]\n // 2 [[[0 0] 1 [0 0]] 2 [1 [0] 1 [0]]]\n\n const buildLevel = async (level: number, from: number, to: number): Promise<DigestHex> => {\n invariant(level >= 0);\n if (level === 0) {\n return this.#makeNode(0, items.slice(from, to), []);\n }\n\n let rangeBegin = from;\n const childItems: Item[] = [];\n const childNodes: DigestHex[] = [];\n for (let i = from; i < to; i++) {\n if (items[i].level > level) {\n throw new Error('BUG - Node level is higher then expected');\n }\n if (items[i].level === level) {\n const node = await buildLevel(level - 1, rangeBegin, i);\n childNodes.push(node);\n childItems.push(items[i]);\n rangeBegin = i + 1;\n }\n }\n childNodes.push(await buildLevel(level - 1, rangeBegin, to));\n\n return this.#makeNode(level, childItems, childNodes);\n };\n\n const maxLevel = Math.max(...items.map((item) => item.level));\n const root = await buildLevel(maxLevel, 0, items.length);\n return root;\n }\n\n async get(root: DigestHex, key: string): Promise<GetResult<Uint8Array>> {\n const keyLevel = await getKeyLevel(key);\n\n let node = this.#nodes.get(root);\n\n if (node !== undefined && node.level < keyLevel) {\n return { kind: 'missing' };\n }\n\n while (node !== undefined) {\n if (node.level === keyLevel) {\n // TODO(dmaretskyi): Binary search.\n for (let i = 0; i < node.items.length; i++) {\n if (node.items[i].key === key) {\n return { kind: 'present', value: node.items[i].value };\n }\n }\n return { kind: 'missing' };\n } else {\n // TODO(dmaretskyi): Binary search.\n let found = false;\n for (let i = 0; i < node.items.length; i++) {\n if (node.items[i].key > key) {\n // Descend down one level.\n node = this.#nodes.get(node.children[i]);\n found = true;\n break;\n }\n }\n if (!found) {\n invariant(node!.level > 0);\n node = this.#nodes.get(node!.children[node!.items.length]);\n }\n }\n }\n return { kind: 'not-available' };\n }\n\n async merge(digest1: DigestHex, digest2: DigestHex, mergeFn: MergeFn): Promise<DigestHex> {\n // console.log(`merge ${digest1.slice(0, 8)} ${digest2.slice(0, 8)}`)\n if (digest1 === digest2) {\n return digest1;\n }\n\n const node1 = this.#requireNode(digest1);\n const node2 = this.#requireNode(digest2);\n\n if (node2.level < node1.level) {\n return await this.merge(digest1, await this.#makeNode(node2.level + 1, [], [digest2]), mergeFn);\n } else if (node1.level < node2.level) {\n return await this.merge(await this.#makeNode(node1.level + 1, [], [digest1]), digest2, mergeFn);\n }\n\n invariant(node1.level === node2.level);\n\n // # B # | D | # E # F # H # | K | #\n // # A # | D | # G # | K | # L #\n //\n\n const resultItems: Item[] = [];\n const resultChildren: DigestHex[] = [];\n\n let carry1: DigestHex | null = null;\n let carry2: DigestHex | null = null;\n\n for (let i1 = 0, i2 = 0; i1 < node1.items.length || i2 < node2.items.length; undefined) {\n invariant(i1 <= node1.items.length);\n invariant(i2 <= node2.items.length);\n\n const key1 = i1 < node1.items.length ? node1.items[i1].key : null;\n const key2 = i2 < node2.items.length ? node2.items[i2].key : null;\n invariant(key1 !== null || key2 !== null);\n\n const child1 = carry1 !== null ? carry1 : node1.children[i1];\n const child2 = carry2 !== null ? carry2 : node2.children[i2];\n if (node1.level > 0) {\n invariant(validDigest(child1));\n invariant(validDigest(child2));\n }\n\n if (key1 === key2) {\n if (node1.level > 0) {\n resultChildren.push(await this.merge(child1, child2, mergeFn));\n }\n resultItems.push(await this.#mergeItem(mergeFn, node1.items[i1], node2.items[i2]));\n carry1 = null;\n carry2 = null;\n i1++;\n i2++;\n } else if (key2 !== null && (key1 === null || key1 > key2)) {\n // Split first.\n invariant(key2 !== null);\n\n resultItems.push(await this.#mergeItem(mergeFn, null, node2.items[i2]));\n\n if (node1.level > 0) {\n const [left, right] = await this.#splitAtKey(child1, key2);\n resultChildren.push(await this.merge(left, child2, mergeFn));\n carry1 = right;\n carry2 = null;\n }\n i2++;\n } else {\n // Split second.\n invariant(key1 !== null);\n\n resultItems.push(await this.#mergeItem(mergeFn, node1.items[i1], null));\n\n if (node1.level > 0) {\n const [left, right] = await this.#splitAtKey(child2, key1);\n resultChildren.push(await this.merge(child1, left, mergeFn));\n carry1 = null;\n carry2 = right;\n }\n i1++;\n }\n }\n if (node1.level > 0) {\n const child1 = carry1 !== null ? carry1 : node1.children[node1.items.length];\n const child2 = carry2 !== null ? carry2 : node2.children[node2.items.length];\n resultChildren.push(await this.merge(child1, child2, mergeFn));\n }\n\n return await this.#makeNode(node1.level, resultItems, resultChildren);\n }\n\n async setBatch(root: DigestHex, pairs: Iterable<Pair>): Promise<DigestHex> {\n const newTree = await this.createTree(pairs);\n return await this.merge(root, newTree, async (key, value1, value2) => (value2 !== null ? value2 : value1!));\n }\n\n async set(root: DigestHex, key: Key, value: Uint8Array): Promise<DigestHex> {\n return this.setBatch(root, [[key, value]]);\n }\n\n *missingNodes(digest: DigestHex): Iterable<DigestHex> {\n const node = this.#nodes.get(digest);\n if (!node) {\n yield digest;\n } else {\n for (const child of node.children) {\n yield* this.missingNodes(child);\n }\n }\n }\n\n async insertNodes(nodes: Iterable<NodeData>): Promise<DigestHex[]> {\n const result: DigestHex[] = [];\n for (const node of nodes) {\n const items = await Promise.all(node.items.map((item) => makeItem(item.key, item.value)));\n // Validation.\n const { digest } = await makeNode(node.level, items, node.children);\n invariant(digest === node.digest);\n\n this.#nodes.set(node.digest, {\n level: node.level,\n digest: node.digest,\n items,\n children: node.children,\n });\n result.push(node.digest);\n }\n return result;\n }\n\n async getNodes(digests: Iterable<DigestHex>): Promise<NodeData[]> {\n const result: NodeData[] = [];\n\n for (const digest of digests) {\n const node = this.#nodes.get(digest);\n if (!node) {\n continue;\n }\n result.push({\n level: node.level,\n digest: node.digest,\n items: node.items.map((item) => ({\n key: item.key,\n value: item.value,\n })),\n children: node.children,\n });\n }\n\n return result;\n }\n\n treeMut(root: DigestHex): TreeMut {\n return new TreeMut(this, root);\n }\n\n formatToString(digest: DigestHex, { pad = 0 }: { pad?: number } = {}): string {\n const padStr = ' '.repeat(pad);\n\n const node = this.#nodes.get(digest);\n if (!node) {\n return `${padStr} o (${digest.slice(0, 8)}) NOT AVAILABLE`;\n }\n\n let string = `${padStr} o (${digest.slice(0, 8)}) level=${node.level} size=${node.items.length}\\n`;\n for (let i = 0; i < node.items.length; i++) {\n if (node.level > 0) {\n string += this.formatToString(node.children[i], { pad: pad + 1 });\n }\n string += `${padStr} - [${node.items[i].itemDigest.slice(0, 8)}] level=${node.items[i].level} ${node.items[i].key.slice(0, 10)} -> ${arrayToHex(node.items[i].value.slice(0, 10).buffer)} \\n`;\n }\n if (node.level > 0) {\n string += this.formatToString(node.children[node.items.length], { pad: pad + 1 });\n }\n return string;\n }\n\n /**\n * Items iterator ordered by key.\n */\n *items(digest: DigestHex): Iterable<Item> {\n const node = this.#requireNode(digest);\n for (let i = 0; i < node.items.length; i++) {\n if (node.level > 0) {\n yield* this.items(node.children[i]);\n }\n yield node.items[i];\n }\n if (node.level > 0) {\n yield* this.items(node.children[node.items.length]);\n }\n }\n\n #requireNode(digest: DigestHex): Node {\n invariant(validDigest(digest));\n const node = this.#nodes.get(digest);\n if (!node) {\n throw new Error(`Node not available: ${digest}`);\n }\n return node;\n }\n\n async #mergeItem(mergeFn: MergeFn, item1: Item | null, item2: Item | null): Promise<Item> {\n invariant(item1 !== null || item2 !== null);\n const key = (item1?.key ?? item2?.key)!;\n\n if (item1 !== null && item2 !== null && arraysEqual(item1.value, item2.value)) {\n return item1;\n } else {\n const mergeResult = await mergeFn(key, item1?.value ?? null, item2?.value ?? null);\n // console.log(\n // `mergeFn ${key.slice(0, 10)} ${String(item1 ? arrayToHex(item1.value).slice(0, 10) : null).padStart(10)} ${String(item2 ? arrayToHex(item2.value).slice(0, 10) : null).padStart(10)} -> ${arrayToHex(mergeResult).slice(0, 10)}`,\n // );\n\n if (item1 !== null && arraysEqual(item1.value, mergeResult)) {\n return item1;\n } else if (item2 !== null && arraysEqual(item2.value, mergeResult)) {\n return item2;\n } else {\n this.itemHashOps++;\n return await makeItem(key, mergeResult);\n }\n }\n }\n\n #emptyNodeCache?: Promise<Node> = undefined;\n async #makeNode(level: number, items: Item[], children: DigestHex[]): Promise<DigestHex> {\n invariant(level > 0 ? items.length + 1 === children.length : children.length === 0);\n\n let node: Node;\n if (level === 0 && items.length === 0) {\n node = await (this.#emptyNodeCache ??= makeNode(0, [], []));\n } else {\n node = await makeNode(level, items, children);\n this.nodeHashOps++;\n }\n if (!this.#nodes.has(node.digest)) {\n this.#nodes.set(node.digest, node);\n }\n return node.digest;\n }\n\n async #splitAtKey(digest: DigestHex, key: Key): Promise<[left: DigestHex, right: DigestHex]> {\n const node = this.#requireNode(digest);\n\n let splitIndex = node.items.length;\n for (let i = 0; i < node.items.length; i++) {\n if (node.items[i].key === key) {\n return [\n await this.#makeNode(node.level, node.items.slice(0, i), node.children.slice(0, i + 1)),\n await this.#makeNode(node.level, node.items.slice(i + 1), node.children.slice(i + 2)),\n ];\n }\n\n if (node.items[i].key > key) {\n splitIndex = i;\n break;\n }\n }\n\n if (node.level === 0) {\n if (splitIndex === 0) {\n return [await this.#makeNode(0, [], []), digest];\n } else if (splitIndex === node.items.length) {\n return [digest, await this.#makeNode(0, [], [])];\n }\n return [\n await this.#makeNode(node.level, node.items.slice(0, splitIndex), []),\n await this.#makeNode(node.level, node.items.slice(splitIndex), []),\n ];\n } else {\n const [left, right] = await this.#splitAtKey(node.children[splitIndex], key);\n\n return [\n await this.#makeNode(node.level, node.items.slice(0, splitIndex), [\n ...node.children.slice(0, splitIndex),\n left,\n ]),\n await this.#makeNode(node.level, node.items.slice(splitIndex), [right, ...node.children.slice(splitIndex + 1)]),\n ];\n }\n }\n}\n\nexport class TreeMut {\n readonly #forest: Forest;\n #root: DigestHex;\n\n constructor(forest: Forest, root: DigestHex) {\n this.#forest = forest;\n this.#root = root;\n }\n\n get root() {\n return this.#root;\n }\n\n async get(key: string): Promise<GetResult<Uint8Array>> {\n return this.#forest.get(this.#root, key);\n }\n\n async setBatch(pairs: Iterable<Pair>): Promise<void> {\n this.#root = await this.#forest.setBatch(this.#root, pairs);\n }\n\n async set(key: Key, value: Uint8Array): Promise<void> {\n this.#root = await this.#forest.set(this.#root, key, value);\n }\n\n items(): Iterable<Item> {\n return this.#forest.items(this.root);\n }\n}\n\nexport type Key = string;\n\nexport type DigestHex = string & { __digestHex: true };\n\nexport type Pair = readonly [key: Key, value: Uint8Array];\n\nexport type GetResult<T> =\n | {\n kind: 'present';\n value: T;\n }\n | {\n kind: 'missing';\n }\n | {\n kind: 'not-available';\n };\n\nexport type MergeFn = (key: string, value1: Uint8Array | null, value2: Uint8Array | null) => Promise<Uint8Array>;\n\nexport type NodeData = {\n readonly level: number;\n\n readonly digest: DigestHex;\n /**\n * Sorted by key\n */\n readonly items: readonly ItemData[];\n /**\n * {items.length + 1} child digests.\n */\n readonly children: readonly DigestHex[];\n};\n\nexport type ItemData = {\n readonly key: string;\n readonly value: Uint8Array;\n};\n\n/**\n * A Merkle-Search Tree node.\n * Contains variable number of items (key-value pairs).\n * Contains {items.length + 1} child nodes.\n * All items, including the ones in interleaving child nodes, are ordered base on the key.\n *\n * Items : (0) (1) (3)\n * Children: [0] [1] [2] [3]\n */\ntype Node = {\n readonly level: number;\n\n readonly digest: DigestHex;\n\n /**\n * Sorted by key\n */\n readonly items: readonly Item[];\n /**\n * {items.length + 1} child digests.\n */\n readonly children: readonly DigestHex[];\n};\n\nconst makeNode = async (level: number, items: readonly Item[], children: readonly DigestHex[]): Promise<Node> => {\n invariant(level > 0 ? items.length + 1 === children.length : children.length === 0);\n\n // TODO(dmaretskyi): Hashing spec.\n const nodeInputData = textEncoder.encode(items.map((item) => item.itemDigest).join('') + children.join(''));\n const digest = await crypto.subtle.digest({ name: 'SHA-256' }, nodeInputData);\n return {\n level,\n digest: formatDigest(new Uint8Array(digest)) as DigestHex,\n items,\n children,\n };\n};\n\ntype Item = {\n readonly level: number;\n readonly key: string;\n readonly value: Uint8Array;\n readonly keyDigest: DigestHex;\n readonly itemDigest: DigestHex;\n};\n\nconst makeItem = async (key: string, value: Uint8Array): Promise<Item> => {\n invariant(typeof key === 'string');\n invariant(value !== null);\n // TODO(dmaretskyi): Hashing spec.\n const keyBytes = textEncoder.encode(key);\n const keyDigest = await crypto.subtle.digest({ name: 'SHA-256' }, keyBytes);\n const keyDigestHex = formatDigest(new Uint8Array(keyDigest)) as DigestHex;\n\n const data = new Uint8Array(keyBytes.length + value.length);\n data.set(keyBytes, 0);\n data.set(value, keyBytes.length);\n const itemDigest = await crypto.subtle.digest({ name: 'SHA-256' }, data);\n return {\n level: getLevelHex(keyDigestHex),\n key,\n value,\n keyDigest: keyDigestHex,\n itemDigest: formatDigest(new Uint8Array(itemDigest)) as DigestHex,\n };\n};\n\nconst getKeyLevel = async (key: string): Promise<number> => {\n const keyBytes = textEncoder.encode(key);\n const keyDigest = await crypto.subtle.digest({ name: 'SHA-256' }, keyBytes);\n\n const keyDigestHex = formatDigest(new Uint8Array(keyDigest)) as DigestHex;\n\n return getLevelHex(keyDigestHex);\n};\n\nconst textEncoder = new TextEncoder();\n\nconst validDigest = (digest: DigestHex) => typeof digest === 'string' && digest.length > 0;\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport type { ActorID } from './common';\nimport { type DigestHex, Forest, type Key, type NodeData } from './forest';\n\nexport type LLWTreeProps = {\n actor: ActorID;\n};\n\n/**\n * Replicated Key-Value Store with Last-Write-Wins semantics.\n */\nexport class LWWTree<T> {\n static async new<T>(params: LLWTreeProps): Promise<LWWTree<T>> {\n const tree = new LWWTree<T>(params);\n tree.#currentRoot = await tree.#forest.createTree([]);\n\n return tree;\n }\n\n #actor: ActorID;\n\n #forest = new Forest();\n\n #currentRoot!: DigestHex;\n\n get currentRoot() {\n return this.#currentRoot;\n }\n\n private constructor(params: LLWTreeProps) {\n this.#actor = params.actor;\n }\n\n async get(key: Key): Promise<T | undefined> {\n const data = await this.#getData(key);\n return data?.value;\n }\n\n async setBatch(pairs: [Key, T][]): Promise<void> {\n const prevDataBatch = await Promise.all(pairs.map(([key]) => this.#getData(key)));\n const updates = pairs.map(([key, value], i) => {\n const prevData = prevDataBatch[i];\n const newClock: VersionClock = !prevData\n ? ([this.#actor, 0] as const)\n : ([this.#actor, prevData.clock[1] + 1] as const);\n const data = this.#encode({ clock: newClock, value });\n\n return [key, data] as const;\n });\n this.#currentRoot = await this.#forest.setBatch(this.#currentRoot, updates);\n }\n\n async set(key: Key, value: T): Promise<void> {\n await this.setBatch([[key, value]]);\n }\n\n async receiveSyncMessage(state: LWWTreeSyncState, message: LWWTreeSyncMessage): Promise<LWWTreeSyncState> {\n await this.#forest.insertNodes(message.nodes);\n\n const remoteRoot = message.root ?? state.remoteRoot;\n\n if (remoteRoot !== null) {\n const missing = [...(await this.#forest.missingNodes(remoteRoot))];\n if (missing.length === 0) {\n this.#currentRoot = await this.#forest.merge(remoteRoot, this.#currentRoot, this.#merge.bind(this));\n } else if (state.remoteRoot !== null && state.remoteRoot !== remoteRoot) {\n // If we're missing nodes from the new remote root, but we have the previous remote root, we can try to merge.\n const missingFromPrevRoot = [...(await this.#forest.missingNodes(state.remoteRoot))];\n if (missingFromPrevRoot.length === 0) {\n await this.#forest.merge(state.remoteRoot, this.#currentRoot, this.#merge.bind(this));\n\n const missing = [...(await this.#forest.missingNodes(remoteRoot))];\n if (missing.length === 0) {\n this.#currentRoot = await this.#forest.merge(remoteRoot, this.#currentRoot, this.#merge.bind(this));\n }\n }\n }\n }\n\n return {\n remoteRoot,\n remoteWant: message.want,\n needsAck: message.nodes.length > 0,\n };\n }\n\n async generateSyncMessage(state: LWWTreeSyncState): Promise<[LWWTreeSyncState, LWWTreeSyncMessage | null]> {\n if (state.remoteRoot === this.#currentRoot && state.remoteWant.length === 0 && !state.needsAck) {\n return [state, null];\n }\n\n const nodes = await this.#forest.getNodes(state.remoteWant);\n const want = state.remoteRoot === null ? [] : [...(await this.#forest.missingNodes(state.remoteRoot))];\n\n return [\n {\n remoteRoot: state.remoteRoot,\n remoteWant: state.remoteWant,\n needsAck: false,\n },\n {\n root: this.#currentRoot,\n want,\n nodes,\n },\n ];\n }\n\n async #getData(key: Key): Promise<ValueData<T> | undefined> {\n const res = await this.#forest.get(this.#currentRoot, key);\n switch (res.kind) {\n case 'present': {\n return this.#decode(res.value);\n }\n\n case 'missing':\n return undefined;\n case 'not-available':\n throw new Error('Key not available');\n }\n }\n\n async #merge(key: Key, left: Uint8Array | null, right: Uint8Array | null): Promise<Uint8Array> {\n if (!left) {\n return right!;\n }\n if (!right) {\n return left!;\n }\n\n const leftData = this.#decode(left);\n const rightData = this.#decode(right);\n\n const cmp =\n leftData.clock[1] === rightData.clock[1]\n ? leftData.clock[0].localeCompare(rightData.clock[0])\n : leftData.clock[1] - rightData.clock[1];\n if (cmp >= 0) {\n return left;\n } else {\n return right;\n }\n }\n\n #decode(value: Uint8Array): ValueData<T> {\n return JSON.parse(textDecoder.decode(value));\n }\n\n #encode(data: ValueData<T>): Uint8Array {\n const { clock, value } = data;\n return textEncoder.encode(JSON.stringify({ clock, value })); // Field order ensures consistent hashing.\n }\n}\n\nexport type LWWTreeSyncMessage = {\n root: DigestHex | null;\n want: DigestHex[];\n nodes: NodeData[];\n};\n\nexport type LWWTreeSyncState = {\n remoteRoot: DigestHex | null;\n remoteWant: DigestHex[];\n needsAck: boolean;\n};\n\nexport const initLWWTreeSyncState = (): LWWTreeSyncState => ({ remoteRoot: null, remoteWant: [], needsAck: false });\n\ntype VersionClock = readonly [actor: ActorID, version: number];\n\ntype ValueData<T> = {\n clock: VersionClock;\n value: T;\n};\n\nconst textDecoder = new TextDecoder();\nconst textEncoder = new TextEncoder();\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { arraysEqual } from '@dxos/util';\n\nimport type { ActorID } from './common';\nimport { type DigestHex, Forest, type Key, type NodeData } from './forest';\n\nexport type MirrorMultiMapProps = {\n actor: ActorID;\n};\n\n/**\n * Replicated tree where each actor's state is tracked separately.\n * Sync is optimized for the case where each actor has a similar state.\n * Actors are expected to eventually converge to the same state.\n */\nexport class MirrorMultiMap<T> {\n static async new<T>(params: MirrorMultiMapProps): Promise<MirrorMultiMap<T>> {\n const tree = new MirrorMultiMap<T>(params);\n tree.#currentRoot = await tree.#forest.createTree([]);\n\n return tree;\n }\n\n #forest = new Forest();\n\n #actor: ActorID;\n #currentRoot!: DigestHex;\n\n #remoteStates = new Map<ActorID, SyncState>();\n\n private constructor(params: MirrorMultiMapProps) {\n this.#actor = params.actor;\n }\n\n get localActorId(): ActorID {\n return this.#actor;\n }\n\n get currentRoot(): DigestHex {\n return this.#currentRoot;\n }\n\n get forest(): Forest {\n return this.#forest;\n }\n\n async getLocal(key: Key): Promise<T | undefined> {\n const entry = await this.#forest.get(this.#currentRoot, key);\n switch (entry?.kind) {\n case 'present':\n return this.#decode(entry.value);\n case 'missing':\n return undefined;\n case 'not-available':\n throw new Error('Unexpected local entry not available');\n }\n }\n\n async setLocalBatch(pairs: (readonly [Key, T])[]): Promise<void> {\n const updates = pairs.map(([key, value]) => [key, this.#encode(value)] as const);\n this.#currentRoot = await this.#forest.setBatch(this.#currentRoot, updates);\n }\n\n async getFor(actorId: ActorID, key: Key): Promise<T | undefined> {\n const state = this.#remoteStates.get(actorId);\n if (!state) {\n throw new Error(`Unknown actorId: ${actorId}`);\n }\n if (!state.remoteRoot) {\n return undefined;\n }\n\n const entry = await this.#forest.get(state.remoteRoot, key);\n switch (entry?.kind) {\n case 'present':\n return this.#decode(entry.value);\n case 'missing':\n return undefined;\n case 'not-available':\n throw new Error('Unexpected remote entry not available');\n }\n }\n\n async setForBatch(actorId: ActorID, pairs: [Key, T][]): Promise<void> {\n const remoteState = this.#remoteStates.get(actorId) ?? initSyncState();\n const updates = pairs.map(([key, value]) => [key, this.#encode(value)] as const);\n const prevRoot = remoteState.remoteRoot ?? (await this.#forest.createTree([]));\n const nextRoot = await this.#forest.setBatch(prevRoot, updates);\n\n this.#remoteStates.set(actorId, {\n remoteRoot: nextRoot,\n myRoot: null,\n remoteWant: remoteState.remoteWant,\n needsAck: remoteState.needsAck,\n });\n }\n\n async getAll(key: Key): Promise<Map<ActorID, T | undefined>> {\n const result = new Map<ActorID, T | undefined>();\n result.set(this.#actor, await this.getLocal(key));\n for (const [actorId, _state] of this.#remoteStates) {\n result.set(actorId, await this.getFor(actorId, key));\n }\n return result;\n }\n\n async getDifferent(): Promise<Map<Key, Map<ActorID, T | undefined>>> {\n // TODO(dmaretskyi): This could be optimized to not traverse nodes that have equal hashes.\n\n const resultByKey = new Map<Key, Map<ActorID, Uint8Array>>();\n\n const actors = new Set<ActorID>([this.#actor, ...this.#remoteStates.keys()]);\n for (const actor of actors) {\n let root;\n if (actor === this.#actor) {\n root = this.#currentRoot;\n } else {\n root = this.#remoteStates.get(actor)?.remoteRoot;\n }\n\n if (!root) {\n continue;\n }\n for (const item of this.#forest.items(root)) {\n let subMap = resultByKey.get(item.key);\n if (!subMap) {\n subMap = new Map();\n resultByKey.set(item.key, subMap);\n }\n subMap.set(actor, item.value);\n }\n }\n\n const result = new Map<Key, Map<ActorID, T | undefined>>();\n\n for (const [key, subMap] of resultByKey) {\n const first = subMap.values().next().value!;\n let allEqual = subMap.size === actors.size;\n if (allEqual) {\n for (const value of subMap.values()) {\n if (!arraysEqual(first, value)) {\n allEqual = false;\n break;\n }\n }\n }\n\n if (!allEqual) {\n const resultSubMap = new Map<ActorID, T | undefined>();\n for (const [actorId, value] of subMap) {\n resultSubMap.set(actorId, this.#decode(value));\n }\n result.set(key, resultSubMap);\n }\n }\n\n return result;\n }\n\n clearActorState(actorId: ActorID): void {\n this.#remoteStates.delete(actorId);\n }\n\n async receiveSyncMessage(actorId: ActorID, message: MirrorMultiMapSyncMessage): Promise<void> {\n await this.#forest.insertNodes(message.nodes);\n\n const state = this.#remoteStates.get(actorId) ?? initSyncState();\n const remoteRoot = message.root ?? state.remoteRoot;\n\n const newState: SyncState = {\n remoteRoot,\n myRoot: message.remoteRoot ?? state.myRoot,\n remoteWant: message.want,\n needsAck: message.nodes.length > 0,\n };\n this.#remoteStates.set(actorId, newState);\n }\n\n async generateSyncMessage(actorId: ActorID): Promise<MirrorMultiMapSyncMessage | null> {\n const state = this.#remoteStates.get(actorId) ?? initSyncState();\n\n if (state.myRoot === this.#currentRoot && state.remoteWant.length === 0 && !state.needsAck) {\n return null;\n }\n\n const nodes = await this.#forest.getNodes(state.remoteWant);\n const want = state.remoteRoot === null ? [] : [...(await this.#forest.missingNodes(state.remoteRoot))];\n\n this.#remoteStates.set(actorId, {\n remoteRoot: state.remoteRoot,\n myRoot: state.myRoot,\n remoteWant: state.remoteWant,\n needsAck: false,\n });\n\n return {\n root: this.#currentRoot,\n remoteRoot: state.remoteRoot,\n want,\n nodes,\n };\n }\n\n #decode(value: Uint8Array): T {\n return JSON.parse(textDecoder.decode(value));\n }\n\n #encode(data: T): Uint8Array {\n return textEncoder.encode(JSON.stringify(data)); // Field order ensures consistent hashing.\n }\n}\n\nexport type MirrorMultiMapSyncMessage = {\n root: DigestHex | null;\n remoteRoot: DigestHex | null;\n want: DigestHex[];\n nodes: NodeData[];\n};\n\ntype SyncState = {\n remoteRoot: DigestHex | null;\n myRoot: DigestHex | null;\n remoteWant: DigestHex[];\n needsAck: boolean;\n};\n\nconst initSyncState = (): SyncState => ({ remoteRoot: null, myRoot: null, remoteWant: [], needsAck: false });\n\nconst textDecoder = new TextDecoder();\nconst textEncoder = new TextEncoder();\n", "//\n// Copyright 2024 DXOS.org\n//\n\nexport const createValue = (source: string) => new Uint8Array(textEncoder.encode(source));\n\nconst textEncoder = new TextEncoder();\n\nexport const randomKey = () => crypto.randomUUID();\n\nexport const randomSample = <T>(data: T[], count: number) => data.toSorted(() => Math.random() - 0.5).slice(0, count);\n"],
|
|
5
|
-
"mappings": ";AAIA,SAASA,kBAAkB;AAUpB,IAAMC,WAAW,OAAOC,KAAaC,UAAAA;AAC1C,QAAMC,WAAWC,YAAYC,OAAOJ,GAAAA;AACpC,QAAMK,OAAO,IAAIC,WAAWJ,SAASK,SAASN,MAAMM,MAAM;AAC1DF,OAAKG,IAAIN,UAAU,CAAA;AACnBG,OAAKG,IAAIP,OAAOC,SAASK,MAAM;AAC/B,QAAME,SAAS,MAAMC,OAAOC,OAAOF,OAAO;IAAEG,MAAM;EAAU,GAAGP,IAAAA;AAC/D,SAAO;IACLL;IACAC;IACAQ,QAAQ,IAAIH,WAAWG,MAAAA;EACzB;AACF;AAYO,IAAMI,WAAW,CAACJ,WAAAA;AACvB,MAAIK,QAAQ;AACZ,WAASC,IAAI,GAAGA,IAAIN,OAAOF,QAAQQ,KAAK;AACtC,UAAMC,OAAOP,OAAOM,CAAAA;AAEpB,QAAIC,QAAQ,MAAM,GAAG;AACnBF;IACF,OAAO;AACL;IACF;AAEA,SAAKE,OAAO,QAAU,GAAG;AACvBF;IACF,OAAO;AACL;IACF;EACF;AACA,SAAOA;AACT;AAEO,IAAMG,eAAe,CAACR,WAAAA;AAC3B,SAAOS,WAAWT,OAAOU,MAAM;AACjC;AAEO,IAAMC,cAAc,CAACX,WAAAA;AAC1B,MAAIK,QAAQ;AACZ,WAASC,IAAI,GAAGA,IAAIN,OAAOF,QAAQQ,KAAK;AACtC,QAAIN,OAAOM,CAAAA,MAAO,KAAK;AACrBD;IACF,OAAO;AACL;IACF;EACF;AACA,SAAOA;AACT;AAEO,IAAMO,eAAe,CAACC,GAAeC,MAAAA;AAC1C,MAAID,EAAEf,WAAWgB,EAAEhB,QAAQ;AACzB,WAAO;EACT;AACA,WAASQ,IAAI,GAAGA,IAAIO,EAAEf,QAAQQ,KAAK;AACjC,QAAIO,EAAEP,CAAAA,MAAOQ,EAAER,CAAAA,GAAI;AACjB,aAAO;IACT;EACF;AACA,SAAO;AACT;AAEA,IAAMZ,cAAc,IAAIqB,YAAAA;;;ACjFxB,SAASC,iBAAiB;AAC1B,SAASC,cAAAA,aAAYC,mBAAmB;;AAIjC,IAAMC,SAAN,MAAMA;EACX,SAAS,oBAAIC,IAAAA;EAEbC,cAAc;EACdC,cAAc;EAEd,MAAMC,WAAWC,OAA2C;AAC1D,UAAMC,QAAQ,MAAMC,QAAQC,IAAI;SAAIH;MAAOI,IAAI,CAAC,CAACC,KAAKC,KAAAA,MAAWC,UAASF,KAAKC,KAAAA,CAAAA,CAAAA;AAC/E,SAAKT,eAAeI,MAAMO;AAC1BP,UAAMQ,KAAK,CAACC,GAAGC,MAAOD,EAAEL,MAAMM,EAAEN,MAAM,KAAK,CAAA;AAE3C,aAASO,IAAI,GAAGA,IAAIX,MAAMO,QAAQI,KAAK;AACrC,UAAIA,IAAI,IAAIX,MAAMO,UAAUP,MAAMW,CAAAA,EAAGP,QAAQJ,MAAMW,IAAI,CAAA,EAAGP,KAAK;AAC7D,cAAM,IAAIQ,MAAM,eAAA;MAClB;IACF;AAEA,QAAIZ,MAAMO,WAAW,GAAG;AACtB,aAAO,KAAK,UAAU,GAAG,CAAA,GAAI,CAAA,CAAE;IACjC;AAOA,UAAMM,aAAa,OAAOC,OAAeC,MAAcC,OAAAA;AACrDC,gBAAUH,SAAS,GAAA,QAAA;;;;;;;;;AACnB,UAAIA,UAAU,GAAG;AACf,eAAO,KAAK,UAAU,GAAGd,MAAMkB,MAAMH,MAAMC,EAAAA,GAAK,CAAA,CAAE;MACpD;AAEA,UAAIG,aAAaJ;AACjB,YAAMK,aAAqB,CAAA;AAC3B,YAAMC,aAA0B,CAAA;AAChC,eAASV,IAAII,MAAMJ,IAAIK,IAAIL,KAAK;AAC9B,YAAIX,MAAMW,CAAAA,EAAGG,QAAQA,OAAO;AAC1B,gBAAM,IAAIF,MAAM,0CAAA;QAClB;AACA,YAAIZ,MAAMW,CAAAA,EAAGG,UAAUA,OAAO;AAC5B,gBAAMQ,OAAO,MAAMT,WAAWC,QAAQ,GAAGK,YAAYR,CAAAA;AACrDU,qBAAWE,KAAKD,IAAAA;AAChBF,qBAAWG,KAAKvB,MAAMW,CAAAA,CAAE;AACxBQ,uBAAaR,IAAI;QACnB;MACF;AACAU,iBAAWE,KAAK,MAAMV,WAAWC,QAAQ,GAAGK,YAAYH,EAAAA,CAAAA;AAExD,aAAO,KAAK,UAAUF,OAAOM,YAAYC,UAAAA;IAC3C;AAEA,UAAMG,WAAWC,KAAKC,IAAG,GAAI1B,MAAMG,IAAI,CAACwB,SAASA,KAAKb,KAAK,CAAA;AAC3D,UAAMc,OAAO,MAAMf,WAAWW,UAAU,GAAGxB,MAAMO,MAAM;AACvD,WAAOqB;EACT;EAEA,MAAMC,IAAID,MAAiBxB,KAA6C;AACtE,UAAM0B,WAAW,MAAMC,YAAY3B,GAAAA;AAEnC,QAAIkB,OAAO,KAAK,OAAOO,IAAID,IAAAA;AAE3B,QAAIN,SAASU,UAAaV,KAAKR,QAAQgB,UAAU;AAC/C,aAAO;QAAEG,MAAM;MAAU;IAC3B;AAEA,WAAOX,SAASU,QAAW;AACzB,UAAIV,KAAKR,UAAUgB,UAAU;AAE3B,iBAASnB,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,cAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,QAAQA,KAAK;AAC7B,mBAAO;cAAE6B,MAAM;cAAW5B,OAAOiB,KAAKtB,MAAMW,CAAAA,EAAGN;YAAM;UACvD;QACF;AACA,eAAO;UAAE4B,MAAM;QAAU;MAC3B,OAAO;AAEL,YAAIC,QAAQ;AACZ,iBAASvB,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,cAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,MAAMA,KAAK;AAE3BkB,mBAAO,KAAK,OAAOO,IAAIP,KAAKa,SAASxB,CAAAA,CAAE;AACvCuB,oBAAQ;AACR;UACF;QACF;AACA,YAAI,CAACA,OAAO;AACVjB,oBAAUK,KAAMR,QAAQ,GAAA,QAAA;;;;;;;;;AACxBQ,iBAAO,KAAK,OAAOO,IAAIP,KAAMa,SAASb,KAAMtB,MAAMO,MAAM,CAAC;QAC3D;MACF;IACF;AACA,WAAO;MAAE0B,MAAM;IAAgB;EACjC;EAEA,MAAMG,MAAMC,SAAoBC,SAAoBC,SAAsC;AAExF,QAAIF,YAAYC,SAAS;AACvB,aAAOD;IACT;AAEA,UAAMG,QAAQ,KAAK,aAAaH,OAAAA;AAChC,UAAMI,QAAQ,KAAK,aAAaH,OAAAA;AAEhC,QAAIG,MAAM3B,QAAQ0B,MAAM1B,OAAO;AAC7B,aAAO,MAAM,KAAKsB,MAAMC,SAAS,MAAM,KAAK,UAAUI,MAAM3B,QAAQ,GAAG,CAAA,GAAI;QAACwB;OAAQ,GAAGC,OAAAA;IACzF,WAAWC,MAAM1B,QAAQ2B,MAAM3B,OAAO;AACpC,aAAO,MAAM,KAAKsB,MAAM,MAAM,KAAK,UAAUI,MAAM1B,QAAQ,GAAG,CAAA,GAAI;QAACuB;OAAQ,GAAGC,SAASC,OAAAA;IACzF;AAEAtB,cAAUuB,MAAM1B,UAAU2B,MAAM3B,OAAK,QAAA;;;;;;;;;AAMrC,UAAM4B,cAAsB,CAAA;AAC5B,UAAMC,iBAA8B,CAAA;AAEpC,QAAIC,SAA2B;AAC/B,QAAIC,SAA2B;AAE/B,aAASC,KAAK,GAAGC,KAAK,GAAGD,KAAKN,MAAMxC,MAAMO,UAAUwC,KAAKN,MAAMzC,MAAMO,QAAQyB,QAAW;AACtFf,gBAAU6B,MAAMN,MAAMxC,MAAMO,QAAM,QAAA;;;;;;;;;AAClCU,gBAAU8B,MAAMN,MAAMzC,MAAMO,QAAM,QAAA;;;;;;;;;AAElC,YAAMyC,OAAOF,KAAKN,MAAMxC,MAAMO,SAASiC,MAAMxC,MAAM8C,EAAAA,EAAI1C,MAAM;AAC7D,YAAM6C,OAAOF,KAAKN,MAAMzC,MAAMO,SAASkC,MAAMzC,MAAM+C,EAAAA,EAAI3C,MAAM;AAC7Da,gBAAU+B,SAAS,QAAQC,SAAS,MAAA,QAAA;;;;;;;;;AAEpC,YAAMC,SAASN,WAAW,OAAOA,SAASJ,MAAML,SAASW,EAAAA;AACzD,YAAMK,SAASN,WAAW,OAAOA,SAASJ,MAAMN,SAASY,EAAAA;AACzD,UAAIP,MAAM1B,QAAQ,GAAG;AACnBG,kBAAUmC,YAAYF,MAAAA,GAAAA,QAAAA;;;;;;;;;AACtBjC,kBAAUmC,YAAYD,MAAAA,GAAAA,QAAAA;;;;;;;;;MACxB;AAEA,UAAIH,SAASC,MAAM;AACjB,YAAIT,MAAM1B,QAAQ,GAAG;AACnB6B,yBAAepB,KAAK,MAAM,KAAKa,MAAMc,QAAQC,QAAQZ,OAAAA,CAAAA;QACvD;AACAG,oBAAYnB,KAAK,MAAM,KAAK,WAAWgB,SAASC,MAAMxC,MAAM8C,EAAAA,GAAKL,MAAMzC,MAAM+C,EAAAA,CAAG,CAAA;AAChFH,iBAAS;AACTC,iBAAS;AACTC;AACAC;MACF,WAAWE,SAAS,SAASD,SAAS,QAAQA,OAAOC,OAAO;AAE1DhC,kBAAUgC,SAAS,MAAA,QAAA;;;;;;;;;AAEnBP,oBAAYnB,KAAK,MAAM,KAAK,WAAWgB,SAAS,MAAME,MAAMzC,MAAM+C,EAAAA,CAAG,CAAA;AAErE,YAAIP,MAAM1B,QAAQ,GAAG;AACnB,gBAAM,CAACuC,MAAMC,KAAAA,IAAS,MAAM,KAAK,YAAYJ,QAAQD,IAAAA;AACrDN,yBAAepB,KAAK,MAAM,KAAKa,MAAMiB,MAAMF,QAAQZ,OAAAA,CAAAA;AACnDK,mBAASU;AACTT,mBAAS;QACX;AACAE;MACF,OAAO;AAEL9B,kBAAU+B,SAAS,MAAA,QAAA;;;;;;;;;AAEnBN,oBAAYnB,KAAK,MAAM,KAAK,WAAWgB,SAASC,MAAMxC,MAAM8C,EAAAA,GAAK,IAAA,CAAA;AAEjE,YAAIN,MAAM1B,QAAQ,GAAG;AACnB,gBAAM,CAACuC,MAAMC,KAAAA,IAAS,MAAM,KAAK,YAAYH,QAAQH,IAAAA;AACrDL,yBAAepB,KAAK,MAAM,KAAKa,MAAMc,QAAQG,MAAMd,OAAAA,CAAAA;AACnDK,mBAAS;AACTC,mBAASS;QACX;AACAR;MACF;IACF;AACA,QAAIN,MAAM1B,QAAQ,GAAG;AACnB,YAAMoC,SAASN,WAAW,OAAOA,SAASJ,MAAML,SAASK,MAAMxC,MAAMO,MAAM;AAC3E,YAAM4C,SAASN,WAAW,OAAOA,SAASJ,MAAMN,SAASM,MAAMzC,MAAMO,MAAM;AAC3EoC,qBAAepB,KAAK,MAAM,KAAKa,MAAMc,QAAQC,QAAQZ,OAAAA,CAAAA;IACvD;AAEA,WAAO,MAAM,KAAK,UAAUC,MAAM1B,OAAO4B,aAAaC,cAAAA;EACxD;EAEA,MAAMY,SAAS3B,MAAiB7B,OAA2C;AACzE,UAAMyD,UAAU,MAAM,KAAK1D,WAAWC,KAAAA;AACtC,WAAO,MAAM,KAAKqC,MAAMR,MAAM4B,SAAS,OAAOpD,KAAKqD,QAAQC,WAAYA,WAAW,OAAOA,SAASD,MAAAA;EACpG;EAEA,MAAME,IAAI/B,MAAiBxB,KAAUC,OAAuC;AAC1E,WAAO,KAAKkD,SAAS3B,MAAM;MAAC;QAACxB;QAAKC;;KAAO;EAC3C;EAEA,CAACuD,aAAaC,QAAwC;AACpD,UAAMvC,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,QAAI,CAACvC,MAAM;AACT,YAAMuC;IACR,OAAO;AACL,iBAAWC,SAASxC,KAAKa,UAAU;AACjC,eAAO,KAAKyB,aAAaE,KAAAA;MAC3B;IACF;EACF;EAEA,MAAMC,YAAYC,OAAiD;AACjE,UAAMC,SAAsB,CAAA;AAC5B,eAAW3C,QAAQ0C,OAAO;AACxB,YAAMhE,QAAQ,MAAMC,QAAQC,IAAIoB,KAAKtB,MAAMG,IAAI,CAACwB,SAASrB,UAASqB,KAAKvB,KAAKuB,KAAKtB,KAAK,CAAA,CAAA;AAEtF,YAAM,EAAEwD,OAAM,IAAK,MAAMK,SAAS5C,KAAKR,OAAOd,OAAOsB,KAAKa,QAAQ;AAClElB,gBAAU4C,WAAWvC,KAAKuC,QAAM,QAAA;;;;;;;;;AAEhC,WAAK,OAAOF,IAAIrC,KAAKuC,QAAQ;QAC3B/C,OAAOQ,KAAKR;QACZ+C,QAAQvC,KAAKuC;QACb7D;QACAmC,UAAUb,KAAKa;MACjB,CAAA;AACA8B,aAAO1C,KAAKD,KAAKuC,MAAM;IACzB;AACA,WAAOI;EACT;EAEA,MAAME,SAASC,SAAmD;AAChE,UAAMH,SAAqB,CAAA;AAE3B,eAAWJ,UAAUO,SAAS;AAC5B,YAAM9C,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,UAAI,CAACvC,MAAM;AACT;MACF;AACA2C,aAAO1C,KAAK;QACVT,OAAOQ,KAAKR;QACZ+C,QAAQvC,KAAKuC;QACb7D,OAAOsB,KAAKtB,MAAMG,IAAI,CAACwB,UAAU;UAC/BvB,KAAKuB,KAAKvB;UACVC,OAAOsB,KAAKtB;QACd,EAAA;QACA8B,UAAUb,KAAKa;MACjB,CAAA;IACF;AAEA,WAAO8B;EACT;EAEAI,QAAQzC,MAA0B;AAChC,WAAO,IAAI0C,QAAQ,MAAM1C,IAAAA;EAC3B;EAEA2C,eAAeV,QAAmB,EAAEW,MAAM,EAAC,IAAuB,CAAC,GAAW;AAC5E,UAAMC,SAAS,KAAKC,OAAOF,GAAAA;AAE3B,UAAMlD,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,QAAI,CAACvC,MAAM;AACT,aAAO,GAAGmD,MAAAA,OAAaZ,OAAO3C,MAAM,GAAG,CAAA,CAAA;IACzC;AAEA,QAAIyD,SAAS,GAAGF,MAAAA,OAAaZ,OAAO3C,MAAM,GAAG,CAAA,CAAA,WAAaI,KAAKR,KAAK,SAASQ,KAAKtB,MAAMO,MAAM;;AAC9F,aAASI,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,UAAIW,KAAKR,QAAQ,GAAG;AAClB6D,kBAAU,KAAKJ,eAAejD,KAAKa,SAASxB,CAAAA,GAAI;UAAE6D,KAAKA,MAAM;QAAE,CAAA;MACjE;AACAG,gBAAU,GAAGF,MAAAA,SAAenD,KAAKtB,MAAMW,CAAAA,EAAGiE,WAAW1D,MAAM,GAAG,CAAA,CAAA,WAAaI,KAAKtB,MAAMW,CAAAA,EAAGG,KAAK,IAAIQ,KAAKtB,MAAMW,CAAAA,EAAGP,IAAIc,MAAM,GAAG,EAAA,CAAA,OAAU2D,YAAWvD,KAAKtB,MAAMW,CAAAA,EAAGN,MAAMa,MAAM,GAAG,EAAA,EAAI4D,MAAM,CAAA;;IAC3L;AACA,QAAIxD,KAAKR,QAAQ,GAAG;AAClB6D,gBAAU,KAAKJ,eAAejD,KAAKa,SAASb,KAAKtB,MAAMO,MAAM,GAAG;QAAEiE,KAAKA,MAAM;MAAE,CAAA;IACjF;AACA,WAAOG;EACT;;;;EAKA,CAAC3E,MAAM6D,QAAmC;AACxC,UAAMvC,OAAO,KAAK,aAAauC,MAAAA;AAC/B,aAASlD,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,UAAIW,KAAKR,QAAQ,GAAG;AAClB,eAAO,KAAKd,MAAMsB,KAAKa,SAASxB,CAAAA,CAAE;MACpC;AACA,YAAMW,KAAKtB,MAAMW,CAAAA;IACnB;AACA,QAAIW,KAAKR,QAAQ,GAAG;AAClB,aAAO,KAAKd,MAAMsB,KAAKa,SAASb,KAAKtB,MAAMO,MAAM,CAAC;IACpD;EACF;EAEA,aAAasD,QAAiB;AAC5B5C,cAAUmC,YAAYS,MAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,UAAMvC,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,QAAI,CAACvC,MAAM;AACT,YAAM,IAAIV,MAAM,uBAAuBiD,MAAAA,EAAQ;IACjD;AACA,WAAOvC;EACT;EAEA,MAAM,WAAWiB,SAAkBwC,OAAoBC,OAAkB;AACvE/D,cAAU8D,UAAU,QAAQC,UAAU,MAAA,QAAA;;;;;;;;;AACtC,UAAM5E,MAAO2E,OAAO3E,OAAO4E,OAAO5E;AAElC,QAAI2E,UAAU,QAAQC,UAAU,QAAQC,YAAYF,MAAM1E,OAAO2E,MAAM3E,KAAK,GAAG;AAC7E,aAAO0E;IACT,OAAO;AACL,YAAMG,cAAc,MAAM3C,QAAQnC,KAAK2E,OAAO1E,SAAS,MAAM2E,OAAO3E,SAAS,IAAA;AAK7E,UAAI0E,UAAU,QAAQE,YAAYF,MAAM1E,OAAO6E,WAAAA,GAAc;AAC3D,eAAOH;MACT,WAAWC,UAAU,QAAQC,YAAYD,MAAM3E,OAAO6E,WAAAA,GAAc;AAClE,eAAOF;MACT,OAAO;AACL,aAAKpF;AACL,eAAO,MAAMU,UAASF,KAAK8E,WAAAA;MAC7B;IACF;EACF;EAEA,kBAAkClD;EAClC,MAAM,UAAUlB,OAAed,OAAemC,UAAqB;AACjElB,cAAUH,QAAQ,IAAId,MAAMO,SAAS,MAAM4B,SAAS5B,SAAS4B,SAAS5B,WAAW,GAAA,QAAA;;;;;;;;;AAEjF,QAAIe;AACJ,QAAIR,UAAU,KAAKd,MAAMO,WAAW,GAAG;AACrCe,aAAO,OAAO,KAAK,oBAAoB4C,SAAS,GAAG,CAAA,GAAI,CAAA,CAAE;IAC3D,OAAO;AACL5C,aAAO,MAAM4C,SAASpD,OAAOd,OAAOmC,QAAAA;AACpC,WAAKtC;IACP;AACA,QAAI,CAAC,KAAK,OAAOsF,IAAI7D,KAAKuC,MAAM,GAAG;AACjC,WAAK,OAAOF,IAAIrC,KAAKuC,QAAQvC,IAAAA;IAC/B;AACA,WAAOA,KAAKuC;EACd;EAEA,MAAM,YAAYA,QAAmBzD,KAAQ;AAC3C,UAAMkB,OAAO,KAAK,aAAauC,MAAAA;AAE/B,QAAIuB,aAAa9D,KAAKtB,MAAMO;AAC5B,aAASI,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,UAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,QAAQA,KAAK;AAC7B,eAAO;UACL,MAAM,KAAK,UAAUkB,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAM,GAAGP,CAAAA,GAAIW,KAAKa,SAASjB,MAAM,GAAGP,IAAI,CAAA,CAAA;UACpF,MAAM,KAAK,UAAUW,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAMP,IAAI,CAAA,GAAIW,KAAKa,SAASjB,MAAMP,IAAI,CAAA,CAAA;;MAEtF;AAEA,UAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,MAAMA,KAAK;AAC3BgF,qBAAazE;AACb;MACF;IACF;AAEA,QAAIW,KAAKR,UAAU,GAAG;AACpB,UAAIsE,eAAe,GAAG;AACpB,eAAO;UAAC,MAAM,KAAK,UAAU,GAAG,CAAA,GAAI,CAAA,CAAE;UAAGvB;;MAC3C,WAAWuB,eAAe9D,KAAKtB,MAAMO,QAAQ;AAC3C,eAAO;UAACsD;UAAQ,MAAM,KAAK,UAAU,GAAG,CAAA,GAAI,CAAA,CAAE;;MAChD;AACA,aAAO;QACL,MAAM,KAAK,UAAUvC,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAM,GAAGkE,UAAAA,GAAa,CAAA,CAAE;QACpE,MAAM,KAAK,UAAU9D,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAMkE,UAAAA,GAAa,CAAA,CAAE;;IAErE,OAAO;AACL,YAAM,CAAC/B,MAAMC,KAAAA,IAAS,MAAM,KAAK,YAAYhC,KAAKa,SAASiD,UAAAA,GAAahF,GAAAA;AAExE,aAAO;QACL,MAAM,KAAK,UAAUkB,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAM,GAAGkE,UAAAA,GAAa;aAC7D9D,KAAKa,SAASjB,MAAM,GAAGkE,UAAAA;UAC1B/B;SACD;QACD,MAAM,KAAK,UAAU/B,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAMkE,UAAAA,GAAa;UAAC9B;aAAUhC,KAAKa,SAASjB,MAAMkE,aAAa,CAAA;SAAG;;IAElH;EACF;AACF;AAEO,IAAMd,UAAN,MAAMA;EACF;EACT;EAEA,YAAYe,QAAgBzD,MAAiB;AAC3C,SAAK,UAAUyD;AACf,SAAK,QAAQzD;EACf;EAEA,IAAIA,OAAO;AACT,WAAO,KAAK;EACd;EAEA,MAAMC,IAAIzB,KAA6C;AACrD,WAAO,KAAK,QAAQyB,IAAI,KAAK,OAAOzB,GAAAA;EACtC;EAEA,MAAMmD,SAASxD,OAAsC;AACnD,SAAK,QAAQ,MAAM,KAAK,QAAQwD,SAAS,KAAK,OAAOxD,KAAAA;EACvD;EAEA,MAAM4D,IAAIvD,KAAUC,OAAkC;AACpD,SAAK,QAAQ,MAAM,KAAK,QAAQsD,IAAI,KAAK,OAAOvD,KAAKC,KAAAA;EACvD;EAEAL,QAAwB;AACtB,WAAO,KAAK,QAAQA,MAAM,KAAK4B,IAAI;EACrC;AACF;AAiEA,IAAMsC,WAAW,OAAOpD,OAAed,OAAwBmC,aAAAA;AAC7DlB,YAAUH,QAAQ,IAAId,MAAMO,SAAS,MAAM4B,SAAS5B,SAAS4B,SAAS5B,WAAW,GAAA,QAAA;;;;;;;;;AAGjF,QAAM+E,gBAAgBC,aAAYC,OAAOxF,MAAMG,IAAI,CAACwB,SAASA,KAAKiD,UAAU,EAAEa,KAAK,EAAA,IAAMtD,SAASsD,KAAK,EAAA,CAAA;AACvG,QAAM5B,SAAS,MAAM6B,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGN,aAAAA;AAC/D,SAAO;IACLxE;IACA+C,QAAQgC,aAAa,IAAIC,WAAWjC,MAAAA,CAAAA;IACpC7D;IACAmC;EACF;AACF;AAUA,IAAM7B,YAAW,OAAOF,KAAaC,UAAAA;AACnCY,YAAU,OAAOb,QAAQ,UAAA,QAAA;;;;;;;;;AACzBa,YAAUZ,UAAU,MAAA,QAAA;;;;;;;;;AAEpB,QAAM0F,WAAWR,aAAYC,OAAOpF,GAAAA;AACpC,QAAM4F,YAAY,MAAMN,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGG,QAAAA;AAClE,QAAME,eAAeJ,aAAa,IAAIC,WAAWE,SAAAA,CAAAA;AAEjD,QAAME,OAAO,IAAIJ,WAAWC,SAASxF,SAASF,MAAME,MAAM;AAC1D2F,OAAKvC,IAAIoC,UAAU,CAAA;AACnBG,OAAKvC,IAAItD,OAAO0F,SAASxF,MAAM;AAC/B,QAAMqE,aAAa,MAAMc,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGM,IAAAA;AACnE,SAAO;IACLpF,OAAOqF,YAAYF,YAAAA;IACnB7F;IACAC;IACA2F,WAAWC;IACXrB,YAAYiB,aAAa,IAAIC,WAAWlB,UAAAA,CAAAA;EAC1C;AACF;AAEA,IAAM7C,cAAc,OAAO3B,QAAAA;AACzB,QAAM2F,WAAWR,aAAYC,OAAOpF,GAAAA;AACpC,QAAM4F,YAAY,MAAMN,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGG,QAAAA;AAElE,QAAME,eAAeJ,aAAa,IAAIC,WAAWE,SAAAA,CAAAA;AAEjD,SAAOG,YAAYF,YAAAA;AACrB;AAEA,IAAMV,eAAc,IAAIa,YAAAA;AAExB,IAAMhD,cAAc,CAACS,WAAsB,OAAOA,WAAW,YAAYA,OAAOtD,SAAS;;;ACrgBlF,IAAM8F,UAAN,MAAMA,SAAAA;EACX,aAAaC,IAAOC,QAA2C;AAC7D,UAAMC,OAAO,IAAIH,SAAWE,MAAAA;AAC5BC,SAAK,eAAe,MAAMA,KAAK,QAAQC,WAAW,CAAA,CAAE;AAEpD,WAAOD;EACT;EAEA;EAEA,UAAU,IAAIE,OAAAA;EAEd;EAEA,IAAIC,cAAc;AAChB,WAAO,KAAK;EACd;EAEA,YAAoBJ,QAAsB;AACxC,SAAK,SAASA,OAAOK;EACvB;EAEA,MAAMC,IAAIC,KAAkC;AAC1C,UAAMC,OAAO,MAAM,KAAK,SAASD,GAAAA;AACjC,WAAOC,MAAMC;EACf;EAEA,MAAMC,SAASC,OAAkC;AAC/C,UAAMC,gBAAgB,MAAMC,QAAQC,IAAIH,MAAMI,IAAI,CAAC,CAACR,GAAAA,MAAS,KAAK,SAASA,GAAAA,CAAAA,CAAAA;AAC3E,UAAMS,UAAUL,MAAMI,IAAI,CAAC,CAACR,KAAKE,KAAAA,GAAQQ,MAAAA;AACvC,YAAMC,WAAWN,cAAcK,CAAAA;AAC/B,YAAME,WAAyB,CAACD,WAC3B;QAAC,KAAK;QAAQ;UACd;QAAC,KAAK;QAAQA,SAASE,MAAM,CAAA,IAAK;;AACvC,YAAMZ,OAAO,KAAK,QAAQ;QAAEY,OAAOD;QAAUV;MAAM,CAAA;AAEnD,aAAO;QAACF;QAAKC;;IACf,CAAA;AACA,SAAK,eAAe,MAAM,KAAK,QAAQE,SAAS,KAAK,cAAcM,OAAAA;EACrE;EAEA,MAAMK,IAAId,KAAUE,OAAyB;AAC3C,UAAM,KAAKC,SAAS;MAAC;QAACH;QAAKE;;KAAO;EACpC;EAEA,MAAMa,mBAAmBC,OAAyBC,SAAwD;AACxG,UAAM,KAAK,QAAQC,YAAYD,QAAQE,KAAK;AAE5C,UAAMC,aAAaH,QAAQI,QAAQL,MAAMI;AAEzC,QAAIA,eAAe,MAAM;AACvB,YAAME,UAAU;WAAK,MAAM,KAAK,QAAQC,aAAaH,UAAAA;;AACrD,UAAIE,QAAQE,WAAW,GAAG;AACxB,aAAK,eAAe,MAAM,KAAK,QAAQC,MAAML,YAAY,KAAK,cAAc,KAAK,OAAOM,KAAK,IAAI,CAAA;MACnG,WAAWV,MAAMI,eAAe,QAAQJ,MAAMI,eAAeA,YAAY;AAEvE,cAAMO,sBAAsB;aAAK,MAAM,KAAK,QAAQJ,aAAaP,MAAMI,UAAU;;AACjF,YAAIO,oBAAoBH,WAAW,GAAG;AACpC,gBAAM,KAAK,QAAQC,MAAMT,MAAMI,YAAY,KAAK,cAAc,KAAK,OAAOM,KAAK,IAAI,CAAA;AAEnF,gBAAMJ,WAAU;eAAK,MAAM,KAAK,QAAQC,aAAaH,UAAAA;;AACrD,cAAIE,SAAQE,WAAW,GAAG;AACxB,iBAAK,eAAe,MAAM,KAAK,QAAQC,MAAML,YAAY,KAAK,cAAc,KAAK,OAAOM,KAAK,IAAI,CAAA;UACnG;QACF;MACF;IACF;AAEA,WAAO;MACLN;MACAQ,YAAYX,QAAQY;MACpBC,UAAUb,QAAQE,MAAMK,SAAS;IACnC;EACF;EAEA,MAAMO,oBAAoBf,OAAiF;AACzG,QAAIA,MAAMI,eAAe,KAAK,gBAAgBJ,MAAMY,WAAWJ,WAAW,KAAK,CAACR,MAAMc,UAAU;AAC9F,aAAO;QAACd;QAAO;;IACjB;AAEA,UAAMG,QAAQ,MAAM,KAAK,QAAQa,SAAShB,MAAMY,UAAU;AAC1D,UAAMC,OAAOb,MAAMI,eAAe,OAAO,CAAA,IAAK;SAAK,MAAM,KAAK,QAAQG,aAAaP,MAAMI,UAAU;;AAEnG,WAAO;MACL;QACEA,YAAYJ,MAAMI;QAClBQ,YAAYZ,MAAMY;QAClBE,UAAU;MACZ;MACA;QACET,MAAM,KAAK;QACXQ;QACAV;MACF;;EAEJ;EAEA,MAAM,SAASnB,KAAQ;AACrB,UAAMiC,MAAM,MAAM,KAAK,QAAQlC,IAAI,KAAK,cAAcC,GAAAA;AACtD,YAAQiC,IAAIC,MAAI;MACd,KAAK,WAAW;AACd,eAAO,KAAK,QAAQD,IAAI/B,KAAK;MAC/B;MAEA,KAAK;AACH,eAAOiC;MACT,KAAK;AACH,cAAM,IAAIC,MAAM,mBAAA;IACpB;EACF;EAEA,MAAM,OAAOpC,KAAUqC,MAAyBC,OAAwB;AACtE,QAAI,CAACD,MAAM;AACT,aAAOC;IACT;AACA,QAAI,CAACA,OAAO;AACV,aAAOD;IACT;AAEA,UAAME,WAAW,KAAK,QAAQF,IAAAA;AAC9B,UAAMG,YAAY,KAAK,QAAQF,KAAAA;AAE/B,UAAMG,MACJF,SAAS1B,MAAM,CAAA,MAAO2B,UAAU3B,MAAM,CAAA,IAClC0B,SAAS1B,MAAM,CAAA,EAAG6B,cAAcF,UAAU3B,MAAM,CAAA,CAAE,IAClD0B,SAAS1B,MAAM,CAAA,IAAK2B,UAAU3B,MAAM,CAAA;AAC1C,QAAI4B,OAAO,GAAG;AACZ,aAAOJ;IACT,OAAO;AACL,aAAOC;IACT;EACF;EAEA,QAAQpC,OAAiB;AACvB,WAAOyC,KAAKC,MAAMC,YAAYC,OAAO5C,KAAAA,CAAAA;EACvC;EAEA,QAAQD,MAAkB;AACxB,UAAM,EAAEY,OAAOX,MAAK,IAAKD;AACzB,WAAO8C,aAAYC,OAAOL,KAAKM,UAAU;MAAEpC;MAAOX;IAAM,CAAA,CAAA;EAC1D;AACF;AAcO,IAAMgD,uBAAuB,OAAyB;EAAE9B,YAAY;EAAMQ,YAAY,CAAA;EAAIE,UAAU;AAAM;AASjH,IAAMe,cAAc,IAAIM,YAAAA;AACxB,IAAMJ,eAAc,IAAIK,YAAAA;;;AC/KxB,SAASC,eAAAA,oBAAmB;AAcrB,IAAMC,iBAAN,MAAMA,gBAAAA;EACX,aAAaC,IAAOC,QAAyD;AAC3E,UAAMC,OAAO,IAAIH,gBAAkBE,MAAAA;AACnCC,SAAK,eAAe,MAAMA,KAAK,QAAQC,WAAW,CAAA,CAAE;AAEpD,WAAOD;EACT;EAEA,UAAU,IAAIE,OAAAA;EAEd;EACA;EAEA,gBAAgB,oBAAIC,IAAAA;EAEpB,YAAoBJ,QAA6B;AAC/C,SAAK,SAASA,OAAOK;EACvB;EAEA,IAAIC,eAAwB;AAC1B,WAAO,KAAK;EACd;EAEA,IAAIC,cAAyB;AAC3B,WAAO,KAAK;EACd;EAEA,IAAIC,SAAiB;AACnB,WAAO,KAAK;EACd;EAEA,MAAMC,SAASC,KAAkC;AAC/C,UAAMC,QAAQ,MAAM,KAAK,QAAQC,IAAI,KAAK,cAAcF,GAAAA;AACxD,YAAQC,OAAOE,MAAAA;MACb,KAAK;AACH,eAAO,KAAK,QAAQF,MAAMG,KAAK;MACjC,KAAK;AACH,eAAOC;MACT,KAAK;AACH,cAAM,IAAIC,MAAM,sCAAA;IACpB;EACF;EAEA,MAAMC,cAAcC,OAA6C;AAC/D,UAAMC,UAAUD,MAAME,IAAI,CAAC,CAACV,KAAKI,KAAAA,MAAW;MAACJ;MAAK,KAAK,QAAQI,KAAAA;KAAO;AACtE,SAAK,eAAe,MAAM,KAAK,QAAQO,SAAS,KAAK,cAAcF,OAAAA;EACrE;EAEA,MAAMG,OAAOC,SAAkBb,KAAkC;AAC/D,UAAMc,QAAQ,KAAK,cAAcZ,IAAIW,OAAAA;AACrC,QAAI,CAACC,OAAO;AACV,YAAM,IAAIR,MAAM,oBAAoBO,OAAAA,EAAS;IAC/C;AACA,QAAI,CAACC,MAAMC,YAAY;AACrB,aAAOV;IACT;AAEA,UAAMJ,QAAQ,MAAM,KAAK,QAAQC,IAAIY,MAAMC,YAAYf,GAAAA;AACvD,YAAQC,OAAOE,MAAAA;MACb,KAAK;AACH,eAAO,KAAK,QAAQF,MAAMG,KAAK;MACjC,KAAK;AACH,eAAOC;MACT,KAAK;AACH,cAAM,IAAIC,MAAM,uCAAA;IACpB;EACF;EAEA,MAAMU,YAAYH,SAAkBL,OAAkC;AACpE,UAAMS,cAAc,KAAK,cAAcf,IAAIW,OAAAA,KAAYK,cAAAA;AACvD,UAAMT,UAAUD,MAAME,IAAI,CAAC,CAACV,KAAKI,KAAAA,MAAW;MAACJ;MAAK,KAAK,QAAQI,KAAAA;KAAO;AACtE,UAAMe,WAAWF,YAAYF,cAAe,MAAM,KAAK,QAAQvB,WAAW,CAAA,CAAE;AAC5E,UAAM4B,WAAW,MAAM,KAAK,QAAQT,SAASQ,UAAUV,OAAAA;AAEvD,SAAK,cAAcY,IAAIR,SAAS;MAC9BE,YAAYK;MACZE,QAAQ;MACRC,YAAYN,YAAYM;MACxBC,UAAUP,YAAYO;IACxB,CAAA;EACF;EAEA,MAAMC,OAAOzB,KAAgD;AAC3D,UAAM0B,SAAS,oBAAIhC,IAAAA;AACnBgC,WAAOL,IAAI,KAAK,QAAQ,MAAM,KAAKtB,SAASC,GAAAA,CAAAA;AAC5C,eAAW,CAACa,SAASc,MAAAA,KAAW,KAAK,eAAe;AAClDD,aAAOL,IAAIR,SAAS,MAAM,KAAKD,OAAOC,SAASb,GAAAA,CAAAA;IACjD;AACA,WAAO0B;EACT;EAEA,MAAME,eAA+D;AAGnE,UAAMC,cAAc,oBAAInC,IAAAA;AAExB,UAAMoC,SAAS,oBAAIC,IAAa;MAAC,KAAK;SAAW,KAAK,cAAcC,KAAI;KAAG;AAC3E,eAAWrC,SAASmC,QAAQ;AAC1B,UAAIG;AACJ,UAAItC,UAAU,KAAK,QAAQ;AACzBsC,eAAO,KAAK;MACd,OAAO;AACLA,eAAO,KAAK,cAAc/B,IAAIP,KAAAA,GAAQoB;MACxC;AAEA,UAAI,CAACkB,MAAM;AACT;MACF;AACA,iBAAWC,QAAQ,KAAK,QAAQC,MAAMF,IAAAA,GAAO;AAC3C,YAAIG,SAASP,YAAY3B,IAAIgC,KAAKlC,GAAG;AACrC,YAAI,CAACoC,QAAQ;AACXA,mBAAS,oBAAI1C,IAAAA;AACbmC,sBAAYR,IAAIa,KAAKlC,KAAKoC,MAAAA;QAC5B;AACAA,eAAOf,IAAI1B,OAAOuC,KAAK9B,KAAK;MAC9B;IACF;AAEA,UAAMsB,SAAS,oBAAIhC,IAAAA;AAEnB,eAAW,CAACM,KAAKoC,MAAAA,KAAWP,aAAa;AACvC,YAAMQ,QAAQD,OAAOE,OAAM,EAAGC,KAAI,EAAGnC;AACrC,UAAIoC,WAAWJ,OAAOK,SAASX,OAAOW;AACtC,UAAID,UAAU;AACZ,mBAAWpC,SAASgC,OAAOE,OAAM,GAAI;AACnC,cAAI,CAACI,aAAYL,OAAOjC,KAAAA,GAAQ;AAC9BoC,uBAAW;AACX;UACF;QACF;MACF;AAEA,UAAI,CAACA,UAAU;AACb,cAAMG,eAAe,oBAAIjD,IAAAA;AACzB,mBAAW,CAACmB,SAAST,KAAAA,KAAUgC,QAAQ;AACrCO,uBAAatB,IAAIR,SAAS,KAAK,QAAQT,KAAAA,CAAAA;QACzC;AACAsB,eAAOL,IAAIrB,KAAK2C,YAAAA;MAClB;IACF;AAEA,WAAOjB;EACT;EAEAkB,gBAAgB/B,SAAwB;AACtC,SAAK,cAAcgC,OAAOhC,OAAAA;EAC5B;EAEA,MAAMiC,mBAAmBjC,SAAkBkC,SAAmD;AAC5F,UAAM,KAAK,QAAQC,YAAYD,QAAQE,KAAK;AAE5C,UAAMnC,QAAQ,KAAK,cAAcZ,IAAIW,OAAAA,KAAYK,cAAAA;AACjD,UAAMH,aAAagC,QAAQd,QAAQnB,MAAMC;AAEzC,UAAMmC,WAAsB;MAC1BnC;MACAO,QAAQyB,QAAQhC,cAAcD,MAAMQ;MACpCC,YAAYwB,QAAQI;MACpB3B,UAAUuB,QAAQE,MAAMG,SAAS;IACnC;AACA,SAAK,cAAc/B,IAAIR,SAASqC,QAAAA;EAClC;EAEA,MAAMG,oBAAoBxC,SAA6D;AACrF,UAAMC,QAAQ,KAAK,cAAcZ,IAAIW,OAAAA,KAAYK,cAAAA;AAEjD,QAAIJ,MAAMQ,WAAW,KAAK,gBAAgBR,MAAMS,WAAW6B,WAAW,KAAK,CAACtC,MAAMU,UAAU;AAC1F,aAAO;IACT;AAEA,UAAMyB,QAAQ,MAAM,KAAK,QAAQK,SAASxC,MAAMS,UAAU;AAC1D,UAAM4B,OAAOrC,MAAMC,eAAe,OAAO,CAAA,IAAK;SAAK,MAAM,KAAK,QAAQwC,aAAazC,MAAMC,UAAU;;AAEnG,SAAK,cAAcM,IAAIR,SAAS;MAC9BE,YAAYD,MAAMC;MAClBO,QAAQR,MAAMQ;MACdC,YAAYT,MAAMS;MAClBC,UAAU;IACZ,CAAA;AAEA,WAAO;MACLS,MAAM,KAAK;MACXlB,YAAYD,MAAMC;MAClBoC;MACAF;IACF;EACF;EAEA,QAAQ7C,OAAiB;AACvB,WAAOoD,KAAKC,MAAMC,aAAYC,OAAOvD,KAAAA,CAAAA;EACvC;EAEA,QAAQwD,MAAO;AACb,WAAOC,aAAYC,OAAON,KAAKO,UAAUH,IAAAA,CAAAA;EAC3C;AACF;AAgBA,IAAM1C,gBAAgB,OAAkB;EAAEH,YAAY;EAAMO,QAAQ;EAAMC,YAAY,CAAA;EAAIC,UAAU;AAAM;AAE1G,IAAMkC,eAAc,IAAIM,YAAAA;AACxB,IAAMH,eAAc,IAAII,YAAAA;;;ACpOjB,IAAMC,cAAc,CAACC,WAAmB,IAAIC,WAAWC,aAAYC,OAAOH,MAAAA,CAAAA;AAEjF,IAAME,eAAc,IAAIE,YAAAA;AAEjB,IAAMC,YAAY,MAAMC,OAAOC,WAAU;AAEzC,IAAMC,eAAe,CAAIC,MAAWC,UAAkBD,KAAKE,SAAS,MAAMC,KAAKC,OAAM,IAAK,GAAA,EAAKC,MAAM,GAAGJ,KAAAA;",
|
|
6
|
-
"names": ["arrayToHex", "makeItem", "key", "value", "keyBytes", "textEncoder", "encode", "data", "Uint8Array", "length", "set", "digest", "crypto", "subtle", "name", "getLevel", "level", "i", "byte", "formatDigest", "
|
|
5
|
+
"mappings": ";AAIA,SAASA,kBAAkB;AAUpB,IAAMC,WAAW,OAAOC,KAAaC,UAAAA;AAC1C,QAAMC,WAAWC,YAAYC,OAAOJ,GAAAA;AACpC,QAAMK,OAAO,IAAIC,WAAWJ,SAASK,SAASN,MAAMM,MAAM;AAC1DF,OAAKG,IAAIN,UAAU,CAAA;AACnBG,OAAKG,IAAIP,OAAOC,SAASK,MAAM;AAC/B,QAAME,SAAS,MAAMC,OAAOC,OAAOF,OAAO;IAAEG,MAAM;EAAU,GAAGP,IAAAA;AAC/D,SAAO;IACLL;IACAC;IACAQ,QAAQ,IAAIH,WAAWG,MAAAA;EACzB;AACF;AAYO,IAAMI,WAAW,CAACJ,WAAAA;AACvB,MAAIK,QAAQ;AACZ,WAASC,IAAI,GAAGA,IAAIN,OAAOF,QAAQQ,KAAK;AACtC,UAAMC,OAAOP,OAAOM,CAAAA;AAEpB,QAAIC,QAAQ,MAAM,GAAG;AACnBF;IACF,OAAO;AACL;IACF;AAEA,SAAKE,OAAO,QAAU,GAAG;AACvBF;IACF,OAAO;AACL;IACF;EACF;AACA,SAAOA;AACT;AAEO,IAAMG,eAAe,CAACR,WAAAA;AAC3B,SAAOX,WAAWW,OAAOS,MAAM;AACjC;AAEO,IAAMC,cAAc,CAACV,WAAAA;AAC1B,MAAIK,QAAQ;AACZ,WAASC,IAAI,GAAGA,IAAIN,OAAOF,QAAQQ,KAAK;AACtC,QAAIN,OAAOM,CAAAA,MAAO,KAAK;AACrBD;IACF,OAAO;AACL;IACF;EACF;AACA,SAAOA;AACT;AAEO,IAAMM,eAAe,CAACC,GAAeC,MAAAA;AAC1C,MAAID,EAAEd,WAAWe,EAAEf,QAAQ;AACzB,WAAO;EACT;AACA,WAASQ,IAAI,GAAGA,IAAIM,EAAEd,QAAQQ,KAAK;AACjC,QAAIM,EAAEN,CAAAA,MAAOO,EAAEP,CAAAA,GAAI;AACjB,aAAO;IACT;EACF;AACA,SAAO;AACT;AAEA,IAAMZ,cAAc,IAAIoB,YAAAA;;;ACjFxB,SAASC,iBAAiB;AAC1B,SAASC,cAAAA,aAAYC,mBAAmB;AAIjC,IAAMC,SAAN,MAAMA;EACX,SAAS,oBAAIC,IAAAA;EAEbC,cAAc;EACdC,cAAc;EAEd,MAAMC,WAAWC,OAA2C;AAC1D,UAAMC,QAAQ,MAAMC,QAAQC,IAAI;SAAIH;MAAOI,IAAI,CAAC,CAACC,KAAKC,KAAAA,MAAWC,UAASF,KAAKC,KAAAA,CAAAA,CAAAA;AAC/E,SAAKT,eAAeI,MAAMO;AAC1BP,UAAMQ,KAAK,CAACC,GAAGC,MAAOD,EAAEL,MAAMM,EAAEN,MAAM,KAAK,CAAA;AAE3C,aAASO,IAAI,GAAGA,IAAIX,MAAMO,QAAQI,KAAK;AACrC,UAAIA,IAAI,IAAIX,MAAMO,UAAUP,MAAMW,CAAAA,EAAGP,QAAQJ,MAAMW,IAAI,CAAA,EAAGP,KAAK;AAC7D,cAAM,IAAIQ,MAAM,eAAA;MAClB;IACF;AAEA,QAAIZ,MAAMO,WAAW,GAAG;AACtB,aAAO,KAAK,UAAU,GAAG,CAAA,GAAI,CAAA,CAAE;IACjC;AAOA,UAAMM,aAAa,OAAOC,OAAeC,MAAcC,OAAAA;AACrDC,gBAAUH,SAAS,CAAA;AACnB,UAAIA,UAAU,GAAG;AACf,eAAO,KAAK,UAAU,GAAGd,MAAMkB,MAAMH,MAAMC,EAAAA,GAAK,CAAA,CAAE;MACpD;AAEA,UAAIG,aAAaJ;AACjB,YAAMK,aAAqB,CAAA;AAC3B,YAAMC,aAA0B,CAAA;AAChC,eAASV,IAAII,MAAMJ,IAAIK,IAAIL,KAAK;AAC9B,YAAIX,MAAMW,CAAAA,EAAGG,QAAQA,OAAO;AAC1B,gBAAM,IAAIF,MAAM,0CAAA;QAClB;AACA,YAAIZ,MAAMW,CAAAA,EAAGG,UAAUA,OAAO;AAC5B,gBAAMQ,OAAO,MAAMT,WAAWC,QAAQ,GAAGK,YAAYR,CAAAA;AACrDU,qBAAWE,KAAKD,IAAAA;AAChBF,qBAAWG,KAAKvB,MAAMW,CAAAA,CAAE;AACxBQ,uBAAaR,IAAI;QACnB;MACF;AACAU,iBAAWE,KAAK,MAAMV,WAAWC,QAAQ,GAAGK,YAAYH,EAAAA,CAAAA;AAExD,aAAO,KAAK,UAAUF,OAAOM,YAAYC,UAAAA;IAC3C;AAEA,UAAMG,WAAWC,KAAKC,IAAG,GAAI1B,MAAMG,IAAI,CAACwB,SAASA,KAAKb,KAAK,CAAA;AAC3D,UAAMc,OAAO,MAAMf,WAAWW,UAAU,GAAGxB,MAAMO,MAAM;AACvD,WAAOqB;EACT;EAEA,MAAMC,IAAID,MAAiBxB,KAA6C;AACtE,UAAM0B,WAAW,MAAMC,YAAY3B,GAAAA;AAEnC,QAAIkB,OAAO,KAAK,OAAOO,IAAID,IAAAA;AAE3B,QAAIN,SAASU,UAAaV,KAAKR,QAAQgB,UAAU;AAC/C,aAAO;QAAEG,MAAM;MAAU;IAC3B;AAEA,WAAOX,SAASU,QAAW;AACzB,UAAIV,KAAKR,UAAUgB,UAAU;AAE3B,iBAASnB,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,cAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,QAAQA,KAAK;AAC7B,mBAAO;cAAE6B,MAAM;cAAW5B,OAAOiB,KAAKtB,MAAMW,CAAAA,EAAGN;YAAM;UACvD;QACF;AACA,eAAO;UAAE4B,MAAM;QAAU;MAC3B,OAAO;AAEL,YAAIC,QAAQ;AACZ,iBAASvB,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,cAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,MAAMA,KAAK;AAE3BkB,mBAAO,KAAK,OAAOO,IAAIP,KAAKa,SAASxB,CAAAA,CAAE;AACvCuB,oBAAQ;AACR;UACF;QACF;AACA,YAAI,CAACA,OAAO;AACVjB,oBAAUK,KAAMR,QAAQ,CAAA;AACxBQ,iBAAO,KAAK,OAAOO,IAAIP,KAAMa,SAASb,KAAMtB,MAAMO,MAAM,CAAC;QAC3D;MACF;IACF;AACA,WAAO;MAAE0B,MAAM;IAAgB;EACjC;EAEA,MAAMG,MAAMC,SAAoBC,SAAoBC,SAAsC;AAExF,QAAIF,YAAYC,SAAS;AACvB,aAAOD;IACT;AAEA,UAAMG,QAAQ,KAAK,aAAaH,OAAAA;AAChC,UAAMI,QAAQ,KAAK,aAAaH,OAAAA;AAEhC,QAAIG,MAAM3B,QAAQ0B,MAAM1B,OAAO;AAC7B,aAAO,MAAM,KAAKsB,MAAMC,SAAS,MAAM,KAAK,UAAUI,MAAM3B,QAAQ,GAAG,CAAA,GAAI;QAACwB;OAAQ,GAAGC,OAAAA;IACzF,WAAWC,MAAM1B,QAAQ2B,MAAM3B,OAAO;AACpC,aAAO,MAAM,KAAKsB,MAAM,MAAM,KAAK,UAAUI,MAAM1B,QAAQ,GAAG,CAAA,GAAI;QAACuB;OAAQ,GAAGC,SAASC,OAAAA;IACzF;AAEAtB,cAAUuB,MAAM1B,UAAU2B,MAAM3B,KAAK;AAMrC,UAAM4B,cAAsB,CAAA;AAC5B,UAAMC,iBAA8B,CAAA;AAEpC,QAAIC,SAA2B;AAC/B,QAAIC,SAA2B;AAE/B,aAASC,KAAK,GAAGC,KAAK,GAAGD,KAAKN,MAAMxC,MAAMO,UAAUwC,KAAKN,MAAMzC,MAAMO,QAAQyB,QAAW;AACtFf,gBAAU6B,MAAMN,MAAMxC,MAAMO,MAAM;AAClCU,gBAAU8B,MAAMN,MAAMzC,MAAMO,MAAM;AAElC,YAAMyC,OAAOF,KAAKN,MAAMxC,MAAMO,SAASiC,MAAMxC,MAAM8C,EAAAA,EAAI1C,MAAM;AAC7D,YAAM6C,OAAOF,KAAKN,MAAMzC,MAAMO,SAASkC,MAAMzC,MAAM+C,EAAAA,EAAI3C,MAAM;AAC7Da,gBAAU+B,SAAS,QAAQC,SAAS,IAAA;AAEpC,YAAMC,SAASN,WAAW,OAAOA,SAASJ,MAAML,SAASW,EAAAA;AACzD,YAAMK,SAASN,WAAW,OAAOA,SAASJ,MAAMN,SAASY,EAAAA;AACzD,UAAIP,MAAM1B,QAAQ,GAAG;AACnBG,kBAAUmC,YAAYF,MAAAA,CAAAA;AACtBjC,kBAAUmC,YAAYD,MAAAA,CAAAA;MACxB;AAEA,UAAIH,SAASC,MAAM;AACjB,YAAIT,MAAM1B,QAAQ,GAAG;AACnB6B,yBAAepB,KAAK,MAAM,KAAKa,MAAMc,QAAQC,QAAQZ,OAAAA,CAAAA;QACvD;AACAG,oBAAYnB,KAAK,MAAM,KAAK,WAAWgB,SAASC,MAAMxC,MAAM8C,EAAAA,GAAKL,MAAMzC,MAAM+C,EAAAA,CAAG,CAAA;AAChFH,iBAAS;AACTC,iBAAS;AACTC;AACAC;MACF,WAAWE,SAAS,SAASD,SAAS,QAAQA,OAAOC,OAAO;AAE1DhC,kBAAUgC,SAAS,IAAA;AAEnBP,oBAAYnB,KAAK,MAAM,KAAK,WAAWgB,SAAS,MAAME,MAAMzC,MAAM+C,EAAAA,CAAG,CAAA;AAErE,YAAIP,MAAM1B,QAAQ,GAAG;AACnB,gBAAM,CAACuC,MAAMC,KAAAA,IAAS,MAAM,KAAK,YAAYJ,QAAQD,IAAAA;AACrDN,yBAAepB,KAAK,MAAM,KAAKa,MAAMiB,MAAMF,QAAQZ,OAAAA,CAAAA;AACnDK,mBAASU;AACTT,mBAAS;QACX;AACAE;MACF,OAAO;AAEL9B,kBAAU+B,SAAS,IAAA;AAEnBN,oBAAYnB,KAAK,MAAM,KAAK,WAAWgB,SAASC,MAAMxC,MAAM8C,EAAAA,GAAK,IAAA,CAAA;AAEjE,YAAIN,MAAM1B,QAAQ,GAAG;AACnB,gBAAM,CAACuC,MAAMC,KAAAA,IAAS,MAAM,KAAK,YAAYH,QAAQH,IAAAA;AACrDL,yBAAepB,KAAK,MAAM,KAAKa,MAAMc,QAAQG,MAAMd,OAAAA,CAAAA;AACnDK,mBAAS;AACTC,mBAASS;QACX;AACAR;MACF;IACF;AACA,QAAIN,MAAM1B,QAAQ,GAAG;AACnB,YAAMoC,SAASN,WAAW,OAAOA,SAASJ,MAAML,SAASK,MAAMxC,MAAMO,MAAM;AAC3E,YAAM4C,SAASN,WAAW,OAAOA,SAASJ,MAAMN,SAASM,MAAMzC,MAAMO,MAAM;AAC3EoC,qBAAepB,KAAK,MAAM,KAAKa,MAAMc,QAAQC,QAAQZ,OAAAA,CAAAA;IACvD;AAEA,WAAO,MAAM,KAAK,UAAUC,MAAM1B,OAAO4B,aAAaC,cAAAA;EACxD;EAEA,MAAMY,SAAS3B,MAAiB7B,OAA2C;AACzE,UAAMyD,UAAU,MAAM,KAAK1D,WAAWC,KAAAA;AACtC,WAAO,MAAM,KAAKqC,MAAMR,MAAM4B,SAAS,OAAOpD,KAAKqD,QAAQC,WAAYA,WAAW,OAAOA,SAASD,MAAAA;EACpG;EAEA,MAAME,IAAI/B,MAAiBxB,KAAUC,OAAuC;AAC1E,WAAO,KAAKkD,SAAS3B,MAAM;MAAC;QAACxB;QAAKC;;KAAO;EAC3C;EAEA,CAACuD,aAAaC,QAAwC;AACpD,UAAMvC,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,QAAI,CAACvC,MAAM;AACT,YAAMuC;IACR,OAAO;AACL,iBAAWC,SAASxC,KAAKa,UAAU;AACjC,eAAO,KAAKyB,aAAaE,KAAAA;MAC3B;IACF;EACF;EAEA,MAAMC,YAAYC,OAAiD;AACjE,UAAMC,SAAsB,CAAA;AAC5B,eAAW3C,QAAQ0C,OAAO;AACxB,YAAMhE,QAAQ,MAAMC,QAAQC,IAAIoB,KAAKtB,MAAMG,IAAI,CAACwB,SAASrB,UAASqB,KAAKvB,KAAKuB,KAAKtB,KAAK,CAAA,CAAA;AAEtF,YAAM,EAAEwD,OAAM,IAAK,MAAMK,SAAS5C,KAAKR,OAAOd,OAAOsB,KAAKa,QAAQ;AAClElB,gBAAU4C,WAAWvC,KAAKuC,MAAM;AAEhC,WAAK,OAAOF,IAAIrC,KAAKuC,QAAQ;QAC3B/C,OAAOQ,KAAKR;QACZ+C,QAAQvC,KAAKuC;QACb7D;QACAmC,UAAUb,KAAKa;MACjB,CAAA;AACA8B,aAAO1C,KAAKD,KAAKuC,MAAM;IACzB;AACA,WAAOI;EACT;EAEA,MAAME,SAASC,SAAmD;AAChE,UAAMH,SAAqB,CAAA;AAE3B,eAAWJ,UAAUO,SAAS;AAC5B,YAAM9C,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,UAAI,CAACvC,MAAM;AACT;MACF;AACA2C,aAAO1C,KAAK;QACVT,OAAOQ,KAAKR;QACZ+C,QAAQvC,KAAKuC;QACb7D,OAAOsB,KAAKtB,MAAMG,IAAI,CAACwB,UAAU;UAC/BvB,KAAKuB,KAAKvB;UACVC,OAAOsB,KAAKtB;QACd,EAAA;QACA8B,UAAUb,KAAKa;MACjB,CAAA;IACF;AAEA,WAAO8B;EACT;EAEAI,QAAQzC,MAA0B;AAChC,WAAO,IAAI0C,QAAQ,MAAM1C,IAAAA;EAC3B;EAEA2C,eAAeV,QAAmB,EAAEW,MAAM,EAAC,IAAuB,CAAC,GAAW;AAC5E,UAAMC,SAAS,KAAKC,OAAOF,GAAAA;AAE3B,UAAMlD,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,QAAI,CAACvC,MAAM;AACT,aAAO,GAAGmD,MAAAA,OAAaZ,OAAO3C,MAAM,GAAG,CAAA,CAAA;IACzC;AAEA,QAAIyD,SAAS,GAAGF,MAAAA,OAAaZ,OAAO3C,MAAM,GAAG,CAAA,CAAA,WAAaI,KAAKR,KAAK,SAASQ,KAAKtB,MAAMO,MAAM;;AAC9F,aAASI,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,UAAIW,KAAKR,QAAQ,GAAG;AAClB6D,kBAAU,KAAKJ,eAAejD,KAAKa,SAASxB,CAAAA,GAAI;UAAE6D,KAAKA,MAAM;QAAE,CAAA;MACjE;AACAG,gBAAU,GAAGF,MAAAA,SAAenD,KAAKtB,MAAMW,CAAAA,EAAGiE,WAAW1D,MAAM,GAAG,CAAA,CAAA,WAAaI,KAAKtB,MAAMW,CAAAA,EAAGG,KAAK,IAAIQ,KAAKtB,MAAMW,CAAAA,EAAGP,IAAIc,MAAM,GAAG,EAAA,CAAA,OAAU2D,YAAWvD,KAAKtB,MAAMW,CAAAA,EAAGN,MAAMa,MAAM,GAAG,EAAA,EAAI4D,MAAM,CAAA;;IAC3L;AACA,QAAIxD,KAAKR,QAAQ,GAAG;AAClB6D,gBAAU,KAAKJ,eAAejD,KAAKa,SAASb,KAAKtB,MAAMO,MAAM,GAAG;QAAEiE,KAAKA,MAAM;MAAE,CAAA;IACjF;AACA,WAAOG;EACT;;;;EAKA,CAAC3E,MAAM6D,QAAmC;AACxC,UAAMvC,OAAO,KAAK,aAAauC,MAAAA;AAC/B,aAASlD,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,UAAIW,KAAKR,QAAQ,GAAG;AAClB,eAAO,KAAKd,MAAMsB,KAAKa,SAASxB,CAAAA,CAAE;MACpC;AACA,YAAMW,KAAKtB,MAAMW,CAAAA;IACnB;AACA,QAAIW,KAAKR,QAAQ,GAAG;AAClB,aAAO,KAAKd,MAAMsB,KAAKa,SAASb,KAAKtB,MAAMO,MAAM,CAAC;IACpD;EACF;EAEA,aAAasD,QAAiB;AAC5B5C,cAAUmC,YAAYS,MAAAA,CAAAA;AACtB,UAAMvC,OAAO,KAAK,OAAOO,IAAIgC,MAAAA;AAC7B,QAAI,CAACvC,MAAM;AACT,YAAM,IAAIV,MAAM,uBAAuBiD,MAAAA,EAAQ;IACjD;AACA,WAAOvC;EACT;EAEA,MAAM,WAAWiB,SAAkBwC,OAAoBC,OAAkB;AACvE/D,cAAU8D,UAAU,QAAQC,UAAU,IAAA;AACtC,UAAM5E,MAAO2E,OAAO3E,OAAO4E,OAAO5E;AAElC,QAAI2E,UAAU,QAAQC,UAAU,QAAQC,YAAYF,MAAM1E,OAAO2E,MAAM3E,KAAK,GAAG;AAC7E,aAAO0E;IACT,OAAO;AACL,YAAMG,cAAc,MAAM3C,QAAQnC,KAAK2E,OAAO1E,SAAS,MAAM2E,OAAO3E,SAAS,IAAA;AAK7E,UAAI0E,UAAU,QAAQE,YAAYF,MAAM1E,OAAO6E,WAAAA,GAAc;AAC3D,eAAOH;MACT,WAAWC,UAAU,QAAQC,YAAYD,MAAM3E,OAAO6E,WAAAA,GAAc;AAClE,eAAOF;MACT,OAAO;AACL,aAAKpF;AACL,eAAO,MAAMU,UAASF,KAAK8E,WAAAA;MAC7B;IACF;EACF;EAEA,kBAAkClD;EAClC,MAAM,UAAUlB,OAAed,OAAemC,UAAqB;AACjElB,cAAUH,QAAQ,IAAId,MAAMO,SAAS,MAAM4B,SAAS5B,SAAS4B,SAAS5B,WAAW,CAAA;AAEjF,QAAIe;AACJ,QAAIR,UAAU,KAAKd,MAAMO,WAAW,GAAG;AACrCe,aAAO,OAAO,KAAK,oBAAoB4C,SAAS,GAAG,CAAA,GAAI,CAAA,CAAE;IAC3D,OAAO;AACL5C,aAAO,MAAM4C,SAASpD,OAAOd,OAAOmC,QAAAA;AACpC,WAAKtC;IACP;AACA,QAAI,CAAC,KAAK,OAAOsF,IAAI7D,KAAKuC,MAAM,GAAG;AACjC,WAAK,OAAOF,IAAIrC,KAAKuC,QAAQvC,IAAAA;IAC/B;AACA,WAAOA,KAAKuC;EACd;EAEA,MAAM,YAAYA,QAAmBzD,KAAQ;AAC3C,UAAMkB,OAAO,KAAK,aAAauC,MAAAA;AAE/B,QAAIuB,aAAa9D,KAAKtB,MAAMO;AAC5B,aAASI,IAAI,GAAGA,IAAIW,KAAKtB,MAAMO,QAAQI,KAAK;AAC1C,UAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,QAAQA,KAAK;AAC7B,eAAO;UACL,MAAM,KAAK,UAAUkB,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAM,GAAGP,CAAAA,GAAIW,KAAKa,SAASjB,MAAM,GAAGP,IAAI,CAAA,CAAA;UACpF,MAAM,KAAK,UAAUW,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAMP,IAAI,CAAA,GAAIW,KAAKa,SAASjB,MAAMP,IAAI,CAAA,CAAA;;MAEtF;AAEA,UAAIW,KAAKtB,MAAMW,CAAAA,EAAGP,MAAMA,KAAK;AAC3BgF,qBAAazE;AACb;MACF;IACF;AAEA,QAAIW,KAAKR,UAAU,GAAG;AACpB,UAAIsE,eAAe,GAAG;AACpB,eAAO;UAAC,MAAM,KAAK,UAAU,GAAG,CAAA,GAAI,CAAA,CAAE;UAAGvB;;MAC3C,WAAWuB,eAAe9D,KAAKtB,MAAMO,QAAQ;AAC3C,eAAO;UAACsD;UAAQ,MAAM,KAAK,UAAU,GAAG,CAAA,GAAI,CAAA,CAAE;;MAChD;AACA,aAAO;QACL,MAAM,KAAK,UAAUvC,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAM,GAAGkE,UAAAA,GAAa,CAAA,CAAE;QACpE,MAAM,KAAK,UAAU9D,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAMkE,UAAAA,GAAa,CAAA,CAAE;;IAErE,OAAO;AACL,YAAM,CAAC/B,MAAMC,KAAAA,IAAS,MAAM,KAAK,YAAYhC,KAAKa,SAASiD,UAAAA,GAAahF,GAAAA;AAExE,aAAO;QACL,MAAM,KAAK,UAAUkB,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAM,GAAGkE,UAAAA,GAAa;aAC7D9D,KAAKa,SAASjB,MAAM,GAAGkE,UAAAA;UAC1B/B;SACD;QACD,MAAM,KAAK,UAAU/B,KAAKR,OAAOQ,KAAKtB,MAAMkB,MAAMkE,UAAAA,GAAa;UAAC9B;aAAUhC,KAAKa,SAASjB,MAAMkE,aAAa,CAAA;SAAG;;IAElH;EACF;AACF;AAEO,IAAMd,UAAN,MAAMA;EACF;EACT;EAEA,YAAYe,QAAgBzD,MAAiB;AAC3C,SAAK,UAAUyD;AACf,SAAK,QAAQzD;EACf;EAEA,IAAIA,OAAO;AACT,WAAO,KAAK;EACd;EAEA,MAAMC,IAAIzB,KAA6C;AACrD,WAAO,KAAK,QAAQyB,IAAI,KAAK,OAAOzB,GAAAA;EACtC;EAEA,MAAMmD,SAASxD,OAAsC;AACnD,SAAK,QAAQ,MAAM,KAAK,QAAQwD,SAAS,KAAK,OAAOxD,KAAAA;EACvD;EAEA,MAAM4D,IAAIvD,KAAUC,OAAkC;AACpD,SAAK,QAAQ,MAAM,KAAK,QAAQsD,IAAI,KAAK,OAAOvD,KAAKC,KAAAA;EACvD;EAEAL,QAAwB;AACtB,WAAO,KAAK,QAAQA,MAAM,KAAK4B,IAAI;EACrC;AACF;AAiEA,IAAMsC,WAAW,OAAOpD,OAAed,OAAwBmC,aAAAA;AAC7DlB,YAAUH,QAAQ,IAAId,MAAMO,SAAS,MAAM4B,SAAS5B,SAAS4B,SAAS5B,WAAW,CAAA;AAGjF,QAAM+E,gBAAgBC,aAAYC,OAAOxF,MAAMG,IAAI,CAACwB,SAASA,KAAKiD,UAAU,EAAEa,KAAK,EAAA,IAAMtD,SAASsD,KAAK,EAAA,CAAA;AACvG,QAAM5B,SAAS,MAAM6B,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGN,aAAAA;AAC/D,SAAO;IACLxE;IACA+C,QAAQgC,aAAa,IAAIC,WAAWjC,MAAAA,CAAAA;IACpC7D;IACAmC;EACF;AACF;AAUA,IAAM7B,YAAW,OAAOF,KAAaC,UAAAA;AACnCY,YAAU,OAAOb,QAAQ,QAAA;AACzBa,YAAUZ,UAAU,IAAA;AAEpB,QAAM0F,WAAWR,aAAYC,OAAOpF,GAAAA;AACpC,QAAM4F,YAAY,MAAMN,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGG,QAAAA;AAClE,QAAME,eAAeJ,aAAa,IAAIC,WAAWE,SAAAA,CAAAA;AAEjD,QAAME,OAAO,IAAIJ,WAAWC,SAASxF,SAASF,MAAME,MAAM;AAC1D2F,OAAKvC,IAAIoC,UAAU,CAAA;AACnBG,OAAKvC,IAAItD,OAAO0F,SAASxF,MAAM;AAC/B,QAAMqE,aAAa,MAAMc,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGM,IAAAA;AACnE,SAAO;IACLpF,OAAOqF,YAAYF,YAAAA;IACnB7F;IACAC;IACA2F,WAAWC;IACXrB,YAAYiB,aAAa,IAAIC,WAAWlB,UAAAA,CAAAA;EAC1C;AACF;AAEA,IAAM7C,cAAc,OAAO3B,QAAAA;AACzB,QAAM2F,WAAWR,aAAYC,OAAOpF,GAAAA;AACpC,QAAM4F,YAAY,MAAMN,OAAOC,OAAO9B,OAAO;IAAE+B,MAAM;EAAU,GAAGG,QAAAA;AAElE,QAAME,eAAeJ,aAAa,IAAIC,WAAWE,SAAAA,CAAAA;AAEjD,SAAOG,YAAYF,YAAAA;AACrB;AAEA,IAAMV,eAAc,IAAIa,YAAAA;AAExB,IAAMhD,cAAc,CAACS,WAAsB,OAAOA,WAAW,YAAYA,OAAOtD,SAAS;;;ACrgBlF,IAAM8F,UAAN,MAAMA,SAAAA;EACX,aAAaC,IAAOC,QAA2C;AAC7D,UAAMC,OAAO,IAAIH,SAAWE,MAAAA;AAC5BC,SAAK,eAAe,MAAMA,KAAK,QAAQC,WAAW,CAAA,CAAE;AAEpD,WAAOD;EACT;EAEA;EAEA,UAAU,IAAIE,OAAAA;EAEd;EAEA,IAAIC,cAAc;AAChB,WAAO,KAAK;EACd;EAEA,YAAoBJ,QAAsB;AACxC,SAAK,SAASA,OAAOK;EACvB;EAEA,MAAMC,IAAIC,KAAkC;AAC1C,UAAMC,OAAO,MAAM,KAAK,SAASD,GAAAA;AACjC,WAAOC,MAAMC;EACf;EAEA,MAAMC,SAASC,OAAkC;AAC/C,UAAMC,gBAAgB,MAAMC,QAAQC,IAAIH,MAAMI,IAAI,CAAC,CAACR,GAAAA,MAAS,KAAK,SAASA,GAAAA,CAAAA,CAAAA;AAC3E,UAAMS,UAAUL,MAAMI,IAAI,CAAC,CAACR,KAAKE,KAAAA,GAAQQ,MAAAA;AACvC,YAAMC,WAAWN,cAAcK,CAAAA;AAC/B,YAAME,WAAyB,CAACD,WAC3B;QAAC,KAAK;QAAQ;UACd;QAAC,KAAK;QAAQA,SAASE,MAAM,CAAA,IAAK;;AACvC,YAAMZ,OAAO,KAAK,QAAQ;QAAEY,OAAOD;QAAUV;MAAM,CAAA;AAEnD,aAAO;QAACF;QAAKC;;IACf,CAAA;AACA,SAAK,eAAe,MAAM,KAAK,QAAQE,SAAS,KAAK,cAAcM,OAAAA;EACrE;EAEA,MAAMK,IAAId,KAAUE,OAAyB;AAC3C,UAAM,KAAKC,SAAS;MAAC;QAACH;QAAKE;;KAAO;EACpC;EAEA,MAAMa,mBAAmBC,OAAyBC,SAAwD;AACxG,UAAM,KAAK,QAAQC,YAAYD,QAAQE,KAAK;AAE5C,UAAMC,aAAaH,QAAQI,QAAQL,MAAMI;AAEzC,QAAIA,eAAe,MAAM;AACvB,YAAME,UAAU;WAAK,MAAM,KAAK,QAAQC,aAAaH,UAAAA;;AACrD,UAAIE,QAAQE,WAAW,GAAG;AACxB,aAAK,eAAe,MAAM,KAAK,QAAQC,MAAML,YAAY,KAAK,cAAc,KAAK,OAAOM,KAAK,IAAI,CAAA;MACnG,WAAWV,MAAMI,eAAe,QAAQJ,MAAMI,eAAeA,YAAY;AAEvE,cAAMO,sBAAsB;aAAK,MAAM,KAAK,QAAQJ,aAAaP,MAAMI,UAAU;;AACjF,YAAIO,oBAAoBH,WAAW,GAAG;AACpC,gBAAM,KAAK,QAAQC,MAAMT,MAAMI,YAAY,KAAK,cAAc,KAAK,OAAOM,KAAK,IAAI,CAAA;AAEnF,gBAAMJ,WAAU;eAAK,MAAM,KAAK,QAAQC,aAAaH,UAAAA;;AACrD,cAAIE,SAAQE,WAAW,GAAG;AACxB,iBAAK,eAAe,MAAM,KAAK,QAAQC,MAAML,YAAY,KAAK,cAAc,KAAK,OAAOM,KAAK,IAAI,CAAA;UACnG;QACF;MACF;IACF;AAEA,WAAO;MACLN;MACAQ,YAAYX,QAAQY;MACpBC,UAAUb,QAAQE,MAAMK,SAAS;IACnC;EACF;EAEA,MAAMO,oBAAoBf,OAAiF;AACzG,QAAIA,MAAMI,eAAe,KAAK,gBAAgBJ,MAAMY,WAAWJ,WAAW,KAAK,CAACR,MAAMc,UAAU;AAC9F,aAAO;QAACd;QAAO;;IACjB;AAEA,UAAMG,QAAQ,MAAM,KAAK,QAAQa,SAAShB,MAAMY,UAAU;AAC1D,UAAMC,OAAOb,MAAMI,eAAe,OAAO,CAAA,IAAK;SAAK,MAAM,KAAK,QAAQG,aAAaP,MAAMI,UAAU;;AAEnG,WAAO;MACL;QACEA,YAAYJ,MAAMI;QAClBQ,YAAYZ,MAAMY;QAClBE,UAAU;MACZ;MACA;QACET,MAAM,KAAK;QACXQ;QACAV;MACF;;EAEJ;EAEA,MAAM,SAASnB,KAAQ;AACrB,UAAMiC,MAAM,MAAM,KAAK,QAAQlC,IAAI,KAAK,cAAcC,GAAAA;AACtD,YAAQiC,IAAIC,MAAI;MACd,KAAK,WAAW;AACd,eAAO,KAAK,QAAQD,IAAI/B,KAAK;MAC/B;MAEA,KAAK;AACH,eAAOiC;MACT,KAAK;AACH,cAAM,IAAIC,MAAM,mBAAA;IACpB;EACF;EAEA,MAAM,OAAOpC,KAAUqC,MAAyBC,OAAwB;AACtE,QAAI,CAACD,MAAM;AACT,aAAOC;IACT;AACA,QAAI,CAACA,OAAO;AACV,aAAOD;IACT;AAEA,UAAME,WAAW,KAAK,QAAQF,IAAAA;AAC9B,UAAMG,YAAY,KAAK,QAAQF,KAAAA;AAE/B,UAAMG,MACJF,SAAS1B,MAAM,CAAA,MAAO2B,UAAU3B,MAAM,CAAA,IAClC0B,SAAS1B,MAAM,CAAA,EAAG6B,cAAcF,UAAU3B,MAAM,CAAA,CAAE,IAClD0B,SAAS1B,MAAM,CAAA,IAAK2B,UAAU3B,MAAM,CAAA;AAC1C,QAAI4B,OAAO,GAAG;AACZ,aAAOJ;IACT,OAAO;AACL,aAAOC;IACT;EACF;EAEA,QAAQpC,OAAiB;AACvB,WAAOyC,KAAKC,MAAMC,YAAYC,OAAO5C,KAAAA,CAAAA;EACvC;EAEA,QAAQD,MAAkB;AACxB,UAAM,EAAEY,OAAOX,MAAK,IAAKD;AACzB,WAAO8C,aAAYC,OAAOL,KAAKM,UAAU;MAAEpC;MAAOX;IAAM,CAAA,CAAA;EAC1D;AACF;AAcO,IAAMgD,uBAAuB,OAAyB;EAAE9B,YAAY;EAAMQ,YAAY,CAAA;EAAIE,UAAU;AAAM;AASjH,IAAMe,cAAc,IAAIM,YAAAA;AACxB,IAAMJ,eAAc,IAAIK,YAAAA;;;AC/KxB,SAASC,eAAAA,oBAAmB;AAcrB,IAAMC,iBAAN,MAAMA,gBAAAA;EACX,aAAaC,IAAOC,QAAyD;AAC3E,UAAMC,OAAO,IAAIH,gBAAkBE,MAAAA;AACnCC,SAAK,eAAe,MAAMA,KAAK,QAAQC,WAAW,CAAA,CAAE;AAEpD,WAAOD;EACT;EAEA,UAAU,IAAIE,OAAAA;EAEd;EACA;EAEA,gBAAgB,oBAAIC,IAAAA;EAEpB,YAAoBJ,QAA6B;AAC/C,SAAK,SAASA,OAAOK;EACvB;EAEA,IAAIC,eAAwB;AAC1B,WAAO,KAAK;EACd;EAEA,IAAIC,cAAyB;AAC3B,WAAO,KAAK;EACd;EAEA,IAAIC,SAAiB;AACnB,WAAO,KAAK;EACd;EAEA,MAAMC,SAASC,KAAkC;AAC/C,UAAMC,QAAQ,MAAM,KAAK,QAAQC,IAAI,KAAK,cAAcF,GAAAA;AACxD,YAAQC,OAAOE,MAAAA;MACb,KAAK;AACH,eAAO,KAAK,QAAQF,MAAMG,KAAK;MACjC,KAAK;AACH,eAAOC;MACT,KAAK;AACH,cAAM,IAAIC,MAAM,sCAAA;IACpB;EACF;EAEA,MAAMC,cAAcC,OAA6C;AAC/D,UAAMC,UAAUD,MAAME,IAAI,CAAC,CAACV,KAAKI,KAAAA,MAAW;MAACJ;MAAK,KAAK,QAAQI,KAAAA;KAAO;AACtE,SAAK,eAAe,MAAM,KAAK,QAAQO,SAAS,KAAK,cAAcF,OAAAA;EACrE;EAEA,MAAMG,OAAOC,SAAkBb,KAAkC;AAC/D,UAAMc,QAAQ,KAAK,cAAcZ,IAAIW,OAAAA;AACrC,QAAI,CAACC,OAAO;AACV,YAAM,IAAIR,MAAM,oBAAoBO,OAAAA,EAAS;IAC/C;AACA,QAAI,CAACC,MAAMC,YAAY;AACrB,aAAOV;IACT;AAEA,UAAMJ,QAAQ,MAAM,KAAK,QAAQC,IAAIY,MAAMC,YAAYf,GAAAA;AACvD,YAAQC,OAAOE,MAAAA;MACb,KAAK;AACH,eAAO,KAAK,QAAQF,MAAMG,KAAK;MACjC,KAAK;AACH,eAAOC;MACT,KAAK;AACH,cAAM,IAAIC,MAAM,uCAAA;IACpB;EACF;EAEA,MAAMU,YAAYH,SAAkBL,OAAkC;AACpE,UAAMS,cAAc,KAAK,cAAcf,IAAIW,OAAAA,KAAYK,cAAAA;AACvD,UAAMT,UAAUD,MAAME,IAAI,CAAC,CAACV,KAAKI,KAAAA,MAAW;MAACJ;MAAK,KAAK,QAAQI,KAAAA;KAAO;AACtE,UAAMe,WAAWF,YAAYF,cAAe,MAAM,KAAK,QAAQvB,WAAW,CAAA,CAAE;AAC5E,UAAM4B,WAAW,MAAM,KAAK,QAAQT,SAASQ,UAAUV,OAAAA;AAEvD,SAAK,cAAcY,IAAIR,SAAS;MAC9BE,YAAYK;MACZE,QAAQ;MACRC,YAAYN,YAAYM;MACxBC,UAAUP,YAAYO;IACxB,CAAA;EACF;EAEA,MAAMC,OAAOzB,KAAgD;AAC3D,UAAM0B,SAAS,oBAAIhC,IAAAA;AACnBgC,WAAOL,IAAI,KAAK,QAAQ,MAAM,KAAKtB,SAASC,GAAAA,CAAAA;AAC5C,eAAW,CAACa,SAASc,MAAAA,KAAW,KAAK,eAAe;AAClDD,aAAOL,IAAIR,SAAS,MAAM,KAAKD,OAAOC,SAASb,GAAAA,CAAAA;IACjD;AACA,WAAO0B;EACT;EAEA,MAAME,eAA+D;AAGnE,UAAMC,cAAc,oBAAInC,IAAAA;AAExB,UAAMoC,SAAS,oBAAIC,IAAa;MAAC,KAAK;SAAW,KAAK,cAAcC,KAAI;KAAG;AAC3E,eAAWrC,SAASmC,QAAQ;AAC1B,UAAIG;AACJ,UAAItC,UAAU,KAAK,QAAQ;AACzBsC,eAAO,KAAK;MACd,OAAO;AACLA,eAAO,KAAK,cAAc/B,IAAIP,KAAAA,GAAQoB;MACxC;AAEA,UAAI,CAACkB,MAAM;AACT;MACF;AACA,iBAAWC,QAAQ,KAAK,QAAQC,MAAMF,IAAAA,GAAO;AAC3C,YAAIG,SAASP,YAAY3B,IAAIgC,KAAKlC,GAAG;AACrC,YAAI,CAACoC,QAAQ;AACXA,mBAAS,oBAAI1C,IAAAA;AACbmC,sBAAYR,IAAIa,KAAKlC,KAAKoC,MAAAA;QAC5B;AACAA,eAAOf,IAAI1B,OAAOuC,KAAK9B,KAAK;MAC9B;IACF;AAEA,UAAMsB,SAAS,oBAAIhC,IAAAA;AAEnB,eAAW,CAACM,KAAKoC,MAAAA,KAAWP,aAAa;AACvC,YAAMQ,QAAQD,OAAOE,OAAM,EAAGC,KAAI,EAAGnC;AACrC,UAAIoC,WAAWJ,OAAOK,SAASX,OAAOW;AACtC,UAAID,UAAU;AACZ,mBAAWpC,SAASgC,OAAOE,OAAM,GAAI;AACnC,cAAI,CAACI,aAAYL,OAAOjC,KAAAA,GAAQ;AAC9BoC,uBAAW;AACX;UACF;QACF;MACF;AAEA,UAAI,CAACA,UAAU;AACb,cAAMG,eAAe,oBAAIjD,IAAAA;AACzB,mBAAW,CAACmB,SAAST,KAAAA,KAAUgC,QAAQ;AACrCO,uBAAatB,IAAIR,SAAS,KAAK,QAAQT,KAAAA,CAAAA;QACzC;AACAsB,eAAOL,IAAIrB,KAAK2C,YAAAA;MAClB;IACF;AAEA,WAAOjB;EACT;EAEAkB,gBAAgB/B,SAAwB;AACtC,SAAK,cAAcgC,OAAOhC,OAAAA;EAC5B;EAEA,MAAMiC,mBAAmBjC,SAAkBkC,SAAmD;AAC5F,UAAM,KAAK,QAAQC,YAAYD,QAAQE,KAAK;AAE5C,UAAMnC,QAAQ,KAAK,cAAcZ,IAAIW,OAAAA,KAAYK,cAAAA;AACjD,UAAMH,aAAagC,QAAQd,QAAQnB,MAAMC;AAEzC,UAAMmC,WAAsB;MAC1BnC;MACAO,QAAQyB,QAAQhC,cAAcD,MAAMQ;MACpCC,YAAYwB,QAAQI;MACpB3B,UAAUuB,QAAQE,MAAMG,SAAS;IACnC;AACA,SAAK,cAAc/B,IAAIR,SAASqC,QAAAA;EAClC;EAEA,MAAMG,oBAAoBxC,SAA6D;AACrF,UAAMC,QAAQ,KAAK,cAAcZ,IAAIW,OAAAA,KAAYK,cAAAA;AAEjD,QAAIJ,MAAMQ,WAAW,KAAK,gBAAgBR,MAAMS,WAAW6B,WAAW,KAAK,CAACtC,MAAMU,UAAU;AAC1F,aAAO;IACT;AAEA,UAAMyB,QAAQ,MAAM,KAAK,QAAQK,SAASxC,MAAMS,UAAU;AAC1D,UAAM4B,OAAOrC,MAAMC,eAAe,OAAO,CAAA,IAAK;SAAK,MAAM,KAAK,QAAQwC,aAAazC,MAAMC,UAAU;;AAEnG,SAAK,cAAcM,IAAIR,SAAS;MAC9BE,YAAYD,MAAMC;MAClBO,QAAQR,MAAMQ;MACdC,YAAYT,MAAMS;MAClBC,UAAU;IACZ,CAAA;AAEA,WAAO;MACLS,MAAM,KAAK;MACXlB,YAAYD,MAAMC;MAClBoC;MACAF;IACF;EACF;EAEA,QAAQ7C,OAAiB;AACvB,WAAOoD,KAAKC,MAAMC,aAAYC,OAAOvD,KAAAA,CAAAA;EACvC;EAEA,QAAQwD,MAAO;AACb,WAAOC,aAAYC,OAAON,KAAKO,UAAUH,IAAAA,CAAAA;EAC3C;AACF;AAgBA,IAAM1C,gBAAgB,OAAkB;EAAEH,YAAY;EAAMO,QAAQ;EAAMC,YAAY,CAAA;EAAIC,UAAU;AAAM;AAE1G,IAAMkC,eAAc,IAAIM,YAAAA;AACxB,IAAMH,eAAc,IAAII,YAAAA;;;ACpOjB,IAAMC,cAAc,CAACC,WAAmB,IAAIC,WAAWC,aAAYC,OAAOH,MAAAA,CAAAA;AAEjF,IAAME,eAAc,IAAIE,YAAAA;AAEjB,IAAMC,YAAY,MAAMC,OAAOC,WAAU;AAEzC,IAAMC,eAAe,CAAIC,MAAWC,UAAkBD,KAAKE,SAAS,MAAMC,KAAKC,OAAM,IAAK,GAAA,EAAKC,MAAM,GAAGJ,KAAAA;",
|
|
6
|
+
"names": ["arrayToHex", "makeItem", "key", "value", "keyBytes", "textEncoder", "encode", "data", "Uint8Array", "length", "set", "digest", "crypto", "subtle", "name", "getLevel", "level", "i", "byte", "formatDigest", "buffer", "getLevelHex", "digestEquals", "a", "b", "TextEncoder", "invariant", "arrayToHex", "arraysEqual", "Forest", "Map", "itemHashOps", "nodeHashOps", "createTree", "pairs", "items", "Promise", "all", "map", "key", "value", "makeItem", "length", "sort", "a", "b", "i", "Error", "buildLevel", "level", "from", "to", "invariant", "slice", "rangeBegin", "childItems", "childNodes", "node", "push", "maxLevel", "Math", "max", "item", "root", "get", "keyLevel", "getKeyLevel", "undefined", "kind", "found", "children", "merge", "digest1", "digest2", "mergeFn", "node1", "node2", "resultItems", "resultChildren", "carry1", "carry2", "i1", "i2", "key1", "key2", "child1", "child2", "validDigest", "left", "right", "setBatch", "newTree", "value1", "value2", "set", "missingNodes", "digest", "child", "insertNodes", "nodes", "result", "makeNode", "getNodes", "digests", "treeMut", "TreeMut", "formatToString", "pad", "padStr", "repeat", "string", "itemDigest", "arrayToHex", "buffer", "item1", "item2", "arraysEqual", "mergeResult", "has", "splitIndex", "forest", "nodeInputData", "textEncoder", "encode", "join", "crypto", "subtle", "name", "formatDigest", "Uint8Array", "keyBytes", "keyDigest", "keyDigestHex", "data", "getLevelHex", "TextEncoder", "LWWTree", "new", "params", "tree", "createTree", "Forest", "currentRoot", "actor", "get", "key", "data", "value", "setBatch", "pairs", "prevDataBatch", "Promise", "all", "map", "updates", "i", "prevData", "newClock", "clock", "set", "receiveSyncMessage", "state", "message", "insertNodes", "nodes", "remoteRoot", "root", "missing", "missingNodes", "length", "merge", "bind", "missingFromPrevRoot", "remoteWant", "want", "needsAck", "generateSyncMessage", "getNodes", "res", "kind", "undefined", "Error", "left", "right", "leftData", "rightData", "cmp", "localeCompare", "JSON", "parse", "textDecoder", "decode", "textEncoder", "encode", "stringify", "initLWWTreeSyncState", "TextDecoder", "TextEncoder", "arraysEqual", "MirrorMultiMap", "new", "params", "tree", "createTree", "Forest", "Map", "actor", "localActorId", "currentRoot", "forest", "getLocal", "key", "entry", "get", "kind", "value", "undefined", "Error", "setLocalBatch", "pairs", "updates", "map", "setBatch", "getFor", "actorId", "state", "remoteRoot", "setForBatch", "remoteState", "initSyncState", "prevRoot", "nextRoot", "set", "myRoot", "remoteWant", "needsAck", "getAll", "result", "_state", "getDifferent", "resultByKey", "actors", "Set", "keys", "root", "item", "items", "subMap", "first", "values", "next", "allEqual", "size", "arraysEqual", "resultSubMap", "clearActorState", "delete", "receiveSyncMessage", "message", "insertNodes", "nodes", "newState", "want", "length", "generateSyncMessage", "getNodes", "missingNodes", "JSON", "parse", "textDecoder", "decode", "data", "textEncoder", "encode", "stringify", "TextDecoder", "TextEncoder", "createValue", "source", "Uint8Array", "textEncoder", "encode", "TextEncoder", "randomKey", "crypto", "randomUUID", "randomSample", "data", "count", "toSorted", "Math", "random", "slice"]
|
|
7
7
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"inputs":{"src/common.ts":{"bytes":
|
|
1
|
+
{"inputs":{"src/common.ts":{"bytes":6393,"imports":[{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"src/forest.ts":{"bytes":57800,"imports":[{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/common.ts","kind":"import-statement","original":"./common"}],"format":"esm"},"src/lww-tree.ts":{"bytes":18505,"imports":[{"path":"src/forest.ts","kind":"import-statement","original":"./forest"}],"format":"esm"},"src/mirror-multi-map.ts":{"bytes":23545,"imports":[{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/forest.ts","kind":"import-statement","original":"./forest"}],"format":"esm"},"src/testing.ts":{"bytes":1525,"imports":[],"format":"esm"},"src/index.ts":{"bytes":739,"imports":[{"path":"src/common.ts","kind":"import-statement","original":"./common"},{"path":"src/forest.ts","kind":"import-statement","original":"./forest"},{"path":"src/lww-tree.ts","kind":"import-statement","original":"./lww-tree"},{"path":"src/mirror-multi-map.ts","kind":"import-statement","original":"./mirror-multi-map"},{"path":"src/testing.ts","kind":"import-statement","original":"./testing"}],"format":"esm"}},"outputs":{"dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":54262},"dist/lib/browser/index.mjs":{"imports":[{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["Forest","LWWTree","MirrorMultiMap","TreeMut","createValue","digestEquals","formatDigest","getLevel","getLevelHex","initLWWTreeSyncState","makeItem","randomKey","randomSample"],"entryPoint":"src/index.ts","inputs":{"src/common.ts":{"bytesInOutput":1188},"src/index.ts":{"bytesInOutput":0},"src/forest.ts":{"bytesInOutput":12940},"src/lww-tree.ts":{"bytesInOutput":4011},"src/mirror-multi-map.ts":{"bytesInOutput":5352},"src/testing.ts":{"bytesInOutput":250}},"bytes":24078}}}
|