@dxos/merkle-search-tree 0.10.0 → 0.11.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/dist/lib/index.mjs +717 -0
- package/dist/lib/index.mjs.map +1 -0
- package/dist/types/tsconfig.tsbuildinfo +1 -1
- package/package.json +4 -5
- package/dist/lib/browser/index.mjs +0 -826
- package/dist/lib/browser/index.mjs.map +0 -7
- package/dist/lib/browser/meta.json +0 -1
- package/dist/lib/node-esm/index.mjs +0 -828
- package/dist/lib/node-esm/index.mjs.map +0 -7
- package/dist/lib/node-esm/meta.json +0 -1
|
@@ -0,0 +1,717 @@
|
|
|
1
|
+
import { arrayToHex, arraysEqual } from "@dxos/util";
|
|
2
|
+
import { invariant } from "@dxos/invariant";
|
|
3
|
+
//#region src/common.ts
|
|
4
|
+
var makeItem = async (key, value) => {
|
|
5
|
+
const keyBytes = textEncoder$4.encode(key);
|
|
6
|
+
const data = new Uint8Array(keyBytes.length + value.length);
|
|
7
|
+
data.set(keyBytes, 0);
|
|
8
|
+
data.set(value, keyBytes.length);
|
|
9
|
+
const digest = await crypto.subtle.digest({ name: "SHA-256" }, data);
|
|
10
|
+
return {
|
|
11
|
+
key,
|
|
12
|
+
value,
|
|
13
|
+
digest: new Uint8Array(digest)
|
|
14
|
+
};
|
|
15
|
+
};
|
|
16
|
+
/**
|
|
17
|
+
* The level the item is placed at is determined as the number of leading zeroes in the item's digest in a given base.
|
|
18
|
+
*
|
|
19
|
+
* This function is hardcoded to use base 16.
|
|
20
|
+
*
|
|
21
|
+
* Example:
|
|
22
|
+
* XXXXXXXX - level 0
|
|
23
|
+
* 0XXXXXXX - level 1
|
|
24
|
+
* 00XXXXXX - level 2
|
|
25
|
+
*/
|
|
26
|
+
var getLevel = (digest) => {
|
|
27
|
+
let level = 0;
|
|
28
|
+
for (let i = 0; i < digest.length; i++) {
|
|
29
|
+
const byte = digest[i];
|
|
30
|
+
if (byte >> 4 === 0) level++;
|
|
31
|
+
else break;
|
|
32
|
+
if ((byte & 15) === 0) level++;
|
|
33
|
+
else break;
|
|
34
|
+
}
|
|
35
|
+
return level;
|
|
36
|
+
};
|
|
37
|
+
var formatDigest = (digest) => {
|
|
38
|
+
return arrayToHex(digest.buffer);
|
|
39
|
+
};
|
|
40
|
+
var getLevelHex = (digest) => {
|
|
41
|
+
let level = 0;
|
|
42
|
+
for (let i = 0; i < digest.length; i++) if (digest[i] === "0") level++;
|
|
43
|
+
else break;
|
|
44
|
+
return level;
|
|
45
|
+
};
|
|
46
|
+
var digestEquals = (a, b) => {
|
|
47
|
+
if (a.length !== b.length) return false;
|
|
48
|
+
for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return false;
|
|
49
|
+
return true;
|
|
50
|
+
};
|
|
51
|
+
var textEncoder$4 = new TextEncoder();
|
|
52
|
+
//#endregion
|
|
53
|
+
//#region src/forest.ts
|
|
54
|
+
var __dxlog_file = "/__w/dxos/dxos/packages/common/merkle-search-tree/src/forest.ts";
|
|
55
|
+
var Forest = class {
|
|
56
|
+
#nodes = /* @__PURE__ */ new Map();
|
|
57
|
+
itemHashOps = 0;
|
|
58
|
+
nodeHashOps = 0;
|
|
59
|
+
async createTree(pairs) {
|
|
60
|
+
const items = await Promise.all([...pairs].map(([key, value]) => makeItem$1(key, value)));
|
|
61
|
+
this.itemHashOps += items.length;
|
|
62
|
+
items.sort((a, b) => a.key < b.key ? -1 : 1);
|
|
63
|
+
for (let i = 0; i < items.length; i++) if (i + 1 < items.length && items[i].key === items[i + 1].key) throw new Error("Duplicate key");
|
|
64
|
+
if (items.length === 0) return this.#makeNode(0, [], []);
|
|
65
|
+
const buildLevel = async (level, from, to) => {
|
|
66
|
+
invariant(level >= 0, void 0, {
|
|
67
|
+
"~LogMeta": "~LogMeta",
|
|
68
|
+
F: __dxlog_file,
|
|
69
|
+
L: 37,
|
|
70
|
+
S: this,
|
|
71
|
+
A: ["level >= 0", ""]
|
|
72
|
+
});
|
|
73
|
+
if (level === 0) return this.#makeNode(0, items.slice(from, to), []);
|
|
74
|
+
let rangeBegin = from;
|
|
75
|
+
const childItems = [];
|
|
76
|
+
const childNodes = [];
|
|
77
|
+
for (let i = from; i < to; i++) {
|
|
78
|
+
if (items[i].level > level) throw new Error("BUG - Node level is higher then expected");
|
|
79
|
+
if (items[i].level === level) {
|
|
80
|
+
const node = await buildLevel(level - 1, rangeBegin, i);
|
|
81
|
+
childNodes.push(node);
|
|
82
|
+
childItems.push(items[i]);
|
|
83
|
+
rangeBegin = i + 1;
|
|
84
|
+
}
|
|
85
|
+
}
|
|
86
|
+
childNodes.push(await buildLevel(level - 1, rangeBegin, to));
|
|
87
|
+
return this.#makeNode(level, childItems, childNodes);
|
|
88
|
+
};
|
|
89
|
+
return await buildLevel(Math.max(...items.map((item) => item.level)), 0, items.length);
|
|
90
|
+
}
|
|
91
|
+
async get(root, key) {
|
|
92
|
+
const keyLevel = await getKeyLevel(key);
|
|
93
|
+
let node = this.#nodes.get(root);
|
|
94
|
+
if (node !== void 0 && node.level < keyLevel) return { kind: "missing" };
|
|
95
|
+
while (node !== void 0) if (node.level === keyLevel) {
|
|
96
|
+
for (let i = 0; i < node.items.length; i++) if (node.items[i].key === key) return {
|
|
97
|
+
kind: "present",
|
|
98
|
+
value: node.items[i].value
|
|
99
|
+
};
|
|
100
|
+
return { kind: "missing" };
|
|
101
|
+
} else {
|
|
102
|
+
let found = false;
|
|
103
|
+
for (let i = 0; i < node.items.length; i++) if (node.items[i].key > key) {
|
|
104
|
+
node = this.#nodes.get(node.children[i]);
|
|
105
|
+
found = true;
|
|
106
|
+
break;
|
|
107
|
+
}
|
|
108
|
+
if (!found) {
|
|
109
|
+
invariant(node.level > 0, void 0, {
|
|
110
|
+
"~LogMeta": "~LogMeta",
|
|
111
|
+
F: __dxlog_file,
|
|
112
|
+
L: 96,
|
|
113
|
+
S: this,
|
|
114
|
+
A: ["node!.level > 0", ""]
|
|
115
|
+
});
|
|
116
|
+
node = this.#nodes.get(node.children[node.items.length]);
|
|
117
|
+
}
|
|
118
|
+
}
|
|
119
|
+
return { kind: "not-available" };
|
|
120
|
+
}
|
|
121
|
+
async merge(digest1, digest2, mergeFn) {
|
|
122
|
+
if (digest1 === digest2) return digest1;
|
|
123
|
+
const node1 = this.#requireNode(digest1);
|
|
124
|
+
const node2 = this.#requireNode(digest2);
|
|
125
|
+
if (node2.level < node1.level) return await this.merge(digest1, await this.#makeNode(node2.level + 1, [], [digest2]), mergeFn);
|
|
126
|
+
else if (node1.level < node2.level) return await this.merge(await this.#makeNode(node1.level + 1, [], [digest1]), digest2, mergeFn);
|
|
127
|
+
invariant(node1.level === node2.level, void 0, {
|
|
128
|
+
"~LogMeta": "~LogMeta",
|
|
129
|
+
F: __dxlog_file,
|
|
130
|
+
L: 119,
|
|
131
|
+
S: this,
|
|
132
|
+
A: ["node1.level === node2.level", ""]
|
|
133
|
+
});
|
|
134
|
+
const resultItems = [];
|
|
135
|
+
const resultChildren = [];
|
|
136
|
+
let carry1 = null;
|
|
137
|
+
let carry2 = null;
|
|
138
|
+
for (let i1 = 0, i2 = 0; i1 < node1.items.length || i2 < node2.items.length;) {
|
|
139
|
+
invariant(i1 <= node1.items.length, void 0, {
|
|
140
|
+
"~LogMeta": "~LogMeta",
|
|
141
|
+
F: __dxlog_file,
|
|
142
|
+
L: 132,
|
|
143
|
+
S: this,
|
|
144
|
+
A: ["i1 <= node1.items.length", ""]
|
|
145
|
+
});
|
|
146
|
+
invariant(i2 <= node2.items.length, void 0, {
|
|
147
|
+
"~LogMeta": "~LogMeta",
|
|
148
|
+
F: __dxlog_file,
|
|
149
|
+
L: 133,
|
|
150
|
+
S: this,
|
|
151
|
+
A: ["i2 <= node2.items.length", ""]
|
|
152
|
+
});
|
|
153
|
+
const key1 = i1 < node1.items.length ? node1.items[i1].key : null;
|
|
154
|
+
const key2 = i2 < node2.items.length ? node2.items[i2].key : null;
|
|
155
|
+
invariant(key1 !== null || key2 !== null, void 0, {
|
|
156
|
+
"~LogMeta": "~LogMeta",
|
|
157
|
+
F: __dxlog_file,
|
|
158
|
+
L: 137,
|
|
159
|
+
S: this,
|
|
160
|
+
A: ["key1 !== null || key2 !== null", ""]
|
|
161
|
+
});
|
|
162
|
+
const child1 = carry1 !== null ? carry1 : node1.children[i1];
|
|
163
|
+
const child2 = carry2 !== null ? carry2 : node2.children[i2];
|
|
164
|
+
if (node1.level > 0) {
|
|
165
|
+
invariant(validDigest(child1), void 0, {
|
|
166
|
+
"~LogMeta": "~LogMeta",
|
|
167
|
+
F: __dxlog_file,
|
|
168
|
+
L: 142,
|
|
169
|
+
S: this,
|
|
170
|
+
A: ["validDigest(child1)", ""]
|
|
171
|
+
});
|
|
172
|
+
invariant(validDigest(child2), void 0, {
|
|
173
|
+
"~LogMeta": "~LogMeta",
|
|
174
|
+
F: __dxlog_file,
|
|
175
|
+
L: 143,
|
|
176
|
+
S: this,
|
|
177
|
+
A: ["validDigest(child2)", ""]
|
|
178
|
+
});
|
|
179
|
+
}
|
|
180
|
+
if (key1 === key2) {
|
|
181
|
+
if (node1.level > 0) resultChildren.push(await this.merge(child1, child2, mergeFn));
|
|
182
|
+
resultItems.push(await this.#mergeItem(mergeFn, node1.items[i1], node2.items[i2]));
|
|
183
|
+
carry1 = null;
|
|
184
|
+
carry2 = null;
|
|
185
|
+
i1++;
|
|
186
|
+
i2++;
|
|
187
|
+
} else if (key2 !== null && (key1 === null || key1 > key2)) {
|
|
188
|
+
invariant(key2 !== null, void 0, {
|
|
189
|
+
"~LogMeta": "~LogMeta",
|
|
190
|
+
F: __dxlog_file,
|
|
191
|
+
L: 157,
|
|
192
|
+
S: this,
|
|
193
|
+
A: ["key2 !== null", ""]
|
|
194
|
+
});
|
|
195
|
+
resultItems.push(await this.#mergeItem(mergeFn, null, node2.items[i2]));
|
|
196
|
+
if (node1.level > 0) {
|
|
197
|
+
const [left, right] = await this.#splitAtKey(child1, key2);
|
|
198
|
+
resultChildren.push(await this.merge(left, child2, mergeFn));
|
|
199
|
+
carry1 = right;
|
|
200
|
+
carry2 = null;
|
|
201
|
+
}
|
|
202
|
+
i2++;
|
|
203
|
+
} else {
|
|
204
|
+
invariant(key1 !== null, void 0, {
|
|
205
|
+
"~LogMeta": "~LogMeta",
|
|
206
|
+
F: __dxlog_file,
|
|
207
|
+
L: 170,
|
|
208
|
+
S: this,
|
|
209
|
+
A: ["key1 !== null", ""]
|
|
210
|
+
});
|
|
211
|
+
resultItems.push(await this.#mergeItem(mergeFn, node1.items[i1], null));
|
|
212
|
+
if (node1.level > 0) {
|
|
213
|
+
const [left, right] = await this.#splitAtKey(child2, key1);
|
|
214
|
+
resultChildren.push(await this.merge(child1, left, mergeFn));
|
|
215
|
+
carry1 = null;
|
|
216
|
+
carry2 = right;
|
|
217
|
+
}
|
|
218
|
+
i1++;
|
|
219
|
+
}
|
|
220
|
+
}
|
|
221
|
+
if (node1.level > 0) {
|
|
222
|
+
const child1 = carry1 !== null ? carry1 : node1.children[node1.items.length];
|
|
223
|
+
const child2 = carry2 !== null ? carry2 : node2.children[node2.items.length];
|
|
224
|
+
resultChildren.push(await this.merge(child1, child2, mergeFn));
|
|
225
|
+
}
|
|
226
|
+
return await this.#makeNode(node1.level, resultItems, resultChildren);
|
|
227
|
+
}
|
|
228
|
+
async setBatch(root, pairs) {
|
|
229
|
+
const newTree = await this.createTree(pairs);
|
|
230
|
+
return await this.merge(root, newTree, async (key, value1, value2) => value2 !== null ? value2 : value1);
|
|
231
|
+
}
|
|
232
|
+
async set(root, key, value) {
|
|
233
|
+
return this.setBatch(root, [[key, value]]);
|
|
234
|
+
}
|
|
235
|
+
*missingNodes(digest) {
|
|
236
|
+
const node = this.#nodes.get(digest);
|
|
237
|
+
if (!node) yield digest;
|
|
238
|
+
else for (const child of node.children) yield* this.missingNodes(child);
|
|
239
|
+
}
|
|
240
|
+
async insertNodes(nodes) {
|
|
241
|
+
const result = [];
|
|
242
|
+
for (const node of nodes) {
|
|
243
|
+
const items = await Promise.all(node.items.map((item) => makeItem$1(item.key, item.value)));
|
|
244
|
+
const { digest } = await makeNode(node.level, items, node.children);
|
|
245
|
+
invariant(digest === node.digest, void 0, {
|
|
246
|
+
"~LogMeta": "~LogMeta",
|
|
247
|
+
F: __dxlog_file,
|
|
248
|
+
L: 218,
|
|
249
|
+
S: this,
|
|
250
|
+
A: ["digest === node.digest", ""]
|
|
251
|
+
});
|
|
252
|
+
this.#nodes.set(node.digest, {
|
|
253
|
+
level: node.level,
|
|
254
|
+
digest: node.digest,
|
|
255
|
+
items,
|
|
256
|
+
children: node.children
|
|
257
|
+
});
|
|
258
|
+
result.push(node.digest);
|
|
259
|
+
}
|
|
260
|
+
return result;
|
|
261
|
+
}
|
|
262
|
+
async getNodes(digests) {
|
|
263
|
+
const result = [];
|
|
264
|
+
for (const digest of digests) {
|
|
265
|
+
const node = this.#nodes.get(digest);
|
|
266
|
+
if (!node) continue;
|
|
267
|
+
result.push({
|
|
268
|
+
level: node.level,
|
|
269
|
+
digest: node.digest,
|
|
270
|
+
items: node.items.map((item) => ({
|
|
271
|
+
key: item.key,
|
|
272
|
+
value: item.value
|
|
273
|
+
})),
|
|
274
|
+
children: node.children
|
|
275
|
+
});
|
|
276
|
+
}
|
|
277
|
+
return result;
|
|
278
|
+
}
|
|
279
|
+
treeMut(root) {
|
|
280
|
+
return new TreeMut(this, root);
|
|
281
|
+
}
|
|
282
|
+
formatToString(digest, { pad = 0 } = {}) {
|
|
283
|
+
const padStr = " ".repeat(pad);
|
|
284
|
+
const node = this.#nodes.get(digest);
|
|
285
|
+
if (!node) return `${padStr} o (${digest.slice(0, 8)}) NOT AVAILABLE`;
|
|
286
|
+
let string = `${padStr} o (${digest.slice(0, 8)}) level=${node.level} size=${node.items.length}\n`;
|
|
287
|
+
for (let i = 0; i < node.items.length; i++) {
|
|
288
|
+
if (node.level > 0) string += this.formatToString(node.children[i], { pad: pad + 1 });
|
|
289
|
+
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`;
|
|
290
|
+
}
|
|
291
|
+
if (node.level > 0) string += this.formatToString(node.children[node.items.length], { pad: pad + 1 });
|
|
292
|
+
return string;
|
|
293
|
+
}
|
|
294
|
+
/**
|
|
295
|
+
* Items iterator ordered by key.
|
|
296
|
+
*/
|
|
297
|
+
*items(digest) {
|
|
298
|
+
const node = this.#requireNode(digest);
|
|
299
|
+
for (let i = 0; i < node.items.length; i++) {
|
|
300
|
+
if (node.level > 0) yield* this.items(node.children[i]);
|
|
301
|
+
yield node.items[i];
|
|
302
|
+
}
|
|
303
|
+
if (node.level > 0) yield* this.items(node.children[node.items.length]);
|
|
304
|
+
}
|
|
305
|
+
#requireNode(digest) {
|
|
306
|
+
invariant(validDigest(digest), void 0, {
|
|
307
|
+
"~LogMeta": "~LogMeta",
|
|
308
|
+
F: __dxlog_file,
|
|
309
|
+
L: 295,
|
|
310
|
+
S: this,
|
|
311
|
+
A: ["validDigest(digest)", ""]
|
|
312
|
+
});
|
|
313
|
+
const node = this.#nodes.get(digest);
|
|
314
|
+
if (!node) throw new Error(`Node not available: ${digest}`);
|
|
315
|
+
return node;
|
|
316
|
+
}
|
|
317
|
+
async #mergeItem(mergeFn, item1, item2) {
|
|
318
|
+
invariant(item1 !== null || item2 !== null, void 0, {
|
|
319
|
+
"~LogMeta": "~LogMeta",
|
|
320
|
+
F: __dxlog_file,
|
|
321
|
+
L: 304,
|
|
322
|
+
S: this,
|
|
323
|
+
A: ["item1 !== null || item2 !== null", ""]
|
|
324
|
+
});
|
|
325
|
+
const key = item1?.key ?? item2?.key;
|
|
326
|
+
if (item1 !== null && item2 !== null && arraysEqual(item1.value, item2.value)) return item1;
|
|
327
|
+
else {
|
|
328
|
+
const mergeResult = await mergeFn(key, item1?.value ?? null, item2?.value ?? null);
|
|
329
|
+
if (item1 !== null && arraysEqual(item1.value, mergeResult)) return item1;
|
|
330
|
+
else if (item2 !== null && arraysEqual(item2.value, mergeResult)) return item2;
|
|
331
|
+
else {
|
|
332
|
+
this.itemHashOps++;
|
|
333
|
+
return await makeItem$1(key, mergeResult);
|
|
334
|
+
}
|
|
335
|
+
}
|
|
336
|
+
}
|
|
337
|
+
#emptyNodeCache = void 0;
|
|
338
|
+
async #makeNode(level, items, children) {
|
|
339
|
+
invariant(level > 0 ? items.length + 1 === children.length : children.length === 0, void 0, {
|
|
340
|
+
"~LogMeta": "~LogMeta",
|
|
341
|
+
F: __dxlog_file,
|
|
342
|
+
L: 328,
|
|
343
|
+
S: this,
|
|
344
|
+
A: ["level > 0 ? items.length + 1 === children.length : children.length === 0", ""]
|
|
345
|
+
});
|
|
346
|
+
let node;
|
|
347
|
+
if (level === 0 && items.length === 0) node = await (this.#emptyNodeCache ??= makeNode(0, [], []));
|
|
348
|
+
else {
|
|
349
|
+
node = await makeNode(level, items, children);
|
|
350
|
+
this.nodeHashOps++;
|
|
351
|
+
}
|
|
352
|
+
if (!this.#nodes.has(node.digest)) this.#nodes.set(node.digest, node);
|
|
353
|
+
return node.digest;
|
|
354
|
+
}
|
|
355
|
+
async #splitAtKey(digest, key) {
|
|
356
|
+
const node = this.#requireNode(digest);
|
|
357
|
+
let splitIndex = node.items.length;
|
|
358
|
+
for (let i = 0; i < node.items.length; i++) {
|
|
359
|
+
if (node.items[i].key === key) return [await this.#makeNode(node.level, node.items.slice(0, i), node.children.slice(0, i + 1)), await this.#makeNode(node.level, node.items.slice(i + 1), node.children.slice(i + 2))];
|
|
360
|
+
if (node.items[i].key > key) {
|
|
361
|
+
splitIndex = i;
|
|
362
|
+
break;
|
|
363
|
+
}
|
|
364
|
+
}
|
|
365
|
+
if (node.level === 0) {
|
|
366
|
+
if (splitIndex === 0) return [await this.#makeNode(0, [], []), digest];
|
|
367
|
+
else if (splitIndex === node.items.length) return [digest, await this.#makeNode(0, [], [])];
|
|
368
|
+
return [await this.#makeNode(node.level, node.items.slice(0, splitIndex), []), await this.#makeNode(node.level, node.items.slice(splitIndex), [])];
|
|
369
|
+
} else {
|
|
370
|
+
const [left, right] = await this.#splitAtKey(node.children[splitIndex], key);
|
|
371
|
+
return [await this.#makeNode(node.level, node.items.slice(0, splitIndex), [...node.children.slice(0, splitIndex), left]), await this.#makeNode(node.level, node.items.slice(splitIndex), [right, ...node.children.slice(splitIndex + 1)])];
|
|
372
|
+
}
|
|
373
|
+
}
|
|
374
|
+
};
|
|
375
|
+
var TreeMut = class {
|
|
376
|
+
#forest;
|
|
377
|
+
#root;
|
|
378
|
+
constructor(forest, root) {
|
|
379
|
+
this.#forest = forest;
|
|
380
|
+
this.#root = root;
|
|
381
|
+
}
|
|
382
|
+
get root() {
|
|
383
|
+
return this.#root;
|
|
384
|
+
}
|
|
385
|
+
async get(key) {
|
|
386
|
+
return this.#forest.get(this.#root, key);
|
|
387
|
+
}
|
|
388
|
+
async setBatch(pairs) {
|
|
389
|
+
this.#root = await this.#forest.setBatch(this.#root, pairs);
|
|
390
|
+
}
|
|
391
|
+
async set(key, value) {
|
|
392
|
+
this.#root = await this.#forest.set(this.#root, key, value);
|
|
393
|
+
}
|
|
394
|
+
items() {
|
|
395
|
+
return this.#forest.items(this.root);
|
|
396
|
+
}
|
|
397
|
+
};
|
|
398
|
+
var makeNode = async (level, items, children) => {
|
|
399
|
+
invariant(level > 0 ? items.length + 1 === children.length : children.length === 0, void 0, {
|
|
400
|
+
"~LogMeta": "~LogMeta",
|
|
401
|
+
F: __dxlog_file,
|
|
402
|
+
L: 479,
|
|
403
|
+
S: void 0,
|
|
404
|
+
A: ["level > 0 ? items.length + 1 === children.length : children.length === 0", ""]
|
|
405
|
+
});
|
|
406
|
+
const nodeInputData = textEncoder$3.encode(items.map((item) => item.itemDigest).join("") + children.join(""));
|
|
407
|
+
const digest = await crypto.subtle.digest({ name: "SHA-256" }, nodeInputData);
|
|
408
|
+
return {
|
|
409
|
+
level,
|
|
410
|
+
digest: formatDigest(new Uint8Array(digest)),
|
|
411
|
+
items,
|
|
412
|
+
children
|
|
413
|
+
};
|
|
414
|
+
};
|
|
415
|
+
var makeItem$1 = async (key, value) => {
|
|
416
|
+
invariant(typeof key === "string", void 0, {
|
|
417
|
+
"~LogMeta": "~LogMeta",
|
|
418
|
+
F: __dxlog_file,
|
|
419
|
+
L: 501,
|
|
420
|
+
S: void 0,
|
|
421
|
+
A: ["typeof key === 'string'", ""]
|
|
422
|
+
});
|
|
423
|
+
invariant(value !== null, void 0, {
|
|
424
|
+
"~LogMeta": "~LogMeta",
|
|
425
|
+
F: __dxlog_file,
|
|
426
|
+
L: 502,
|
|
427
|
+
S: void 0,
|
|
428
|
+
A: ["value !== null", ""]
|
|
429
|
+
});
|
|
430
|
+
const keyBytes = textEncoder$3.encode(key);
|
|
431
|
+
const keyDigest = await crypto.subtle.digest({ name: "SHA-256" }, keyBytes);
|
|
432
|
+
const keyDigestHex = formatDigest(new Uint8Array(keyDigest));
|
|
433
|
+
const data = new Uint8Array(keyBytes.length + value.length);
|
|
434
|
+
data.set(keyBytes, 0);
|
|
435
|
+
data.set(value, keyBytes.length);
|
|
436
|
+
const itemDigest = await crypto.subtle.digest({ name: "SHA-256" }, data);
|
|
437
|
+
return {
|
|
438
|
+
level: getLevelHex(keyDigestHex),
|
|
439
|
+
key,
|
|
440
|
+
value,
|
|
441
|
+
keyDigest: keyDigestHex,
|
|
442
|
+
itemDigest: formatDigest(new Uint8Array(itemDigest))
|
|
443
|
+
};
|
|
444
|
+
};
|
|
445
|
+
var getKeyLevel = async (key) => {
|
|
446
|
+
const keyBytes = textEncoder$3.encode(key);
|
|
447
|
+
const keyDigest = await crypto.subtle.digest({ name: "SHA-256" }, keyBytes);
|
|
448
|
+
return getLevelHex(formatDigest(new Uint8Array(keyDigest)));
|
|
449
|
+
};
|
|
450
|
+
var textEncoder$3 = new TextEncoder();
|
|
451
|
+
var validDigest = (digest) => typeof digest === "string" && digest.length > 0;
|
|
452
|
+
//#endregion
|
|
453
|
+
//#region src/lww-tree.ts
|
|
454
|
+
/**
|
|
455
|
+
* Replicated Key-Value Store with Last-Write-Wins semantics.
|
|
456
|
+
*/
|
|
457
|
+
var LWWTree = class LWWTree {
|
|
458
|
+
static async new(params) {
|
|
459
|
+
const tree = new LWWTree(params);
|
|
460
|
+
tree.#currentRoot = await tree.#forest.createTree([]);
|
|
461
|
+
return tree;
|
|
462
|
+
}
|
|
463
|
+
#actor;
|
|
464
|
+
#forest = new Forest();
|
|
465
|
+
#currentRoot;
|
|
466
|
+
get currentRoot() {
|
|
467
|
+
return this.#currentRoot;
|
|
468
|
+
}
|
|
469
|
+
constructor(params) {
|
|
470
|
+
this.#actor = params.actor;
|
|
471
|
+
}
|
|
472
|
+
async get(key) {
|
|
473
|
+
return (await this.#getData(key))?.value;
|
|
474
|
+
}
|
|
475
|
+
async setBatch(pairs) {
|
|
476
|
+
const prevDataBatch = await Promise.all(pairs.map(([key]) => this.#getData(key)));
|
|
477
|
+
const updates = pairs.map(([key, value], i) => {
|
|
478
|
+
const prevData = prevDataBatch[i];
|
|
479
|
+
const newClock = !prevData ? [this.#actor, 0] : [this.#actor, prevData.clock[1] + 1];
|
|
480
|
+
return [key, this.#encode({
|
|
481
|
+
clock: newClock,
|
|
482
|
+
value
|
|
483
|
+
})];
|
|
484
|
+
});
|
|
485
|
+
this.#currentRoot = await this.#forest.setBatch(this.#currentRoot, updates);
|
|
486
|
+
}
|
|
487
|
+
async set(key, value) {
|
|
488
|
+
await this.setBatch([[key, value]]);
|
|
489
|
+
}
|
|
490
|
+
async receiveSyncMessage(state, message) {
|
|
491
|
+
await this.#forest.insertNodes(message.nodes);
|
|
492
|
+
const remoteRoot = message.root ?? state.remoteRoot;
|
|
493
|
+
if (remoteRoot !== null) {
|
|
494
|
+
if ([...await this.#forest.missingNodes(remoteRoot)].length === 0) this.#currentRoot = await this.#forest.merge(remoteRoot, this.#currentRoot, this.#merge.bind(this));
|
|
495
|
+
else if (state.remoteRoot !== null && state.remoteRoot !== remoteRoot) {
|
|
496
|
+
if ([...await this.#forest.missingNodes(state.remoteRoot)].length === 0) {
|
|
497
|
+
await this.#forest.merge(state.remoteRoot, this.#currentRoot, this.#merge.bind(this));
|
|
498
|
+
if ([...await this.#forest.missingNodes(remoteRoot)].length === 0) this.#currentRoot = await this.#forest.merge(remoteRoot, this.#currentRoot, this.#merge.bind(this));
|
|
499
|
+
}
|
|
500
|
+
}
|
|
501
|
+
}
|
|
502
|
+
return {
|
|
503
|
+
remoteRoot,
|
|
504
|
+
remoteWant: message.want,
|
|
505
|
+
needsAck: message.nodes.length > 0
|
|
506
|
+
};
|
|
507
|
+
}
|
|
508
|
+
async generateSyncMessage(state) {
|
|
509
|
+
if (state.remoteRoot === this.#currentRoot && state.remoteWant.length === 0 && !state.needsAck) return [state, null];
|
|
510
|
+
const nodes = await this.#forest.getNodes(state.remoteWant);
|
|
511
|
+
const want = state.remoteRoot === null ? [] : [...await this.#forest.missingNodes(state.remoteRoot)];
|
|
512
|
+
return [{
|
|
513
|
+
remoteRoot: state.remoteRoot,
|
|
514
|
+
remoteWant: state.remoteWant,
|
|
515
|
+
needsAck: false
|
|
516
|
+
}, {
|
|
517
|
+
root: this.#currentRoot,
|
|
518
|
+
want,
|
|
519
|
+
nodes
|
|
520
|
+
}];
|
|
521
|
+
}
|
|
522
|
+
async #getData(key) {
|
|
523
|
+
const res = await this.#forest.get(this.#currentRoot, key);
|
|
524
|
+
switch (res.kind) {
|
|
525
|
+
case "present": return this.#decode(res.value);
|
|
526
|
+
case "missing": return;
|
|
527
|
+
case "not-available": throw new Error("Key not available");
|
|
528
|
+
}
|
|
529
|
+
}
|
|
530
|
+
async #merge(key, left, right) {
|
|
531
|
+
if (!left) return right;
|
|
532
|
+
if (!right) return left;
|
|
533
|
+
const leftData = this.#decode(left);
|
|
534
|
+
const rightData = this.#decode(right);
|
|
535
|
+
if ((leftData.clock[1] === rightData.clock[1] ? leftData.clock[0].localeCompare(rightData.clock[0]) : leftData.clock[1] - rightData.clock[1]) >= 0) return left;
|
|
536
|
+
else return right;
|
|
537
|
+
}
|
|
538
|
+
#decode(value) {
|
|
539
|
+
return JSON.parse(textDecoder$1.decode(value));
|
|
540
|
+
}
|
|
541
|
+
#encode(data) {
|
|
542
|
+
const { clock, value } = data;
|
|
543
|
+
return textEncoder$2.encode(JSON.stringify({
|
|
544
|
+
clock,
|
|
545
|
+
value
|
|
546
|
+
}));
|
|
547
|
+
}
|
|
548
|
+
};
|
|
549
|
+
var initLWWTreeSyncState = () => ({
|
|
550
|
+
remoteRoot: null,
|
|
551
|
+
remoteWant: [],
|
|
552
|
+
needsAck: false
|
|
553
|
+
});
|
|
554
|
+
var textDecoder$1 = new TextDecoder();
|
|
555
|
+
var textEncoder$2 = new TextEncoder();
|
|
556
|
+
//#endregion
|
|
557
|
+
//#region src/mirror-multi-map.ts
|
|
558
|
+
/**
|
|
559
|
+
* Replicated tree where each actor's state is tracked separately.
|
|
560
|
+
* Sync is optimized for the case where each actor has a similar state.
|
|
561
|
+
* Actors are expected to eventually converge to the same state.
|
|
562
|
+
*/
|
|
563
|
+
var MirrorMultiMap = class MirrorMultiMap {
|
|
564
|
+
static async new(params) {
|
|
565
|
+
const tree = new MirrorMultiMap(params);
|
|
566
|
+
tree.#currentRoot = await tree.#forest.createTree([]);
|
|
567
|
+
return tree;
|
|
568
|
+
}
|
|
569
|
+
#forest = new Forest();
|
|
570
|
+
#actor;
|
|
571
|
+
#currentRoot;
|
|
572
|
+
#remoteStates = /* @__PURE__ */ new Map();
|
|
573
|
+
constructor(params) {
|
|
574
|
+
this.#actor = params.actor;
|
|
575
|
+
}
|
|
576
|
+
get localActorId() {
|
|
577
|
+
return this.#actor;
|
|
578
|
+
}
|
|
579
|
+
get currentRoot() {
|
|
580
|
+
return this.#currentRoot;
|
|
581
|
+
}
|
|
582
|
+
get forest() {
|
|
583
|
+
return this.#forest;
|
|
584
|
+
}
|
|
585
|
+
async getLocal(key) {
|
|
586
|
+
const entry = await this.#forest.get(this.#currentRoot, key);
|
|
587
|
+
switch (entry?.kind) {
|
|
588
|
+
case "present": return this.#decode(entry.value);
|
|
589
|
+
case "missing": return;
|
|
590
|
+
case "not-available": throw new Error("Unexpected local entry not available");
|
|
591
|
+
}
|
|
592
|
+
}
|
|
593
|
+
async setLocalBatch(pairs) {
|
|
594
|
+
const updates = pairs.map(([key, value]) => [key, this.#encode(value)]);
|
|
595
|
+
this.#currentRoot = await this.#forest.setBatch(this.#currentRoot, updates);
|
|
596
|
+
}
|
|
597
|
+
async getFor(actorId, key) {
|
|
598
|
+
const state = this.#remoteStates.get(actorId);
|
|
599
|
+
if (!state) throw new Error(`Unknown actorId: ${actorId}`);
|
|
600
|
+
if (!state.remoteRoot) return;
|
|
601
|
+
const entry = await this.#forest.get(state.remoteRoot, key);
|
|
602
|
+
switch (entry?.kind) {
|
|
603
|
+
case "present": return this.#decode(entry.value);
|
|
604
|
+
case "missing": return;
|
|
605
|
+
case "not-available": throw new Error("Unexpected remote entry not available");
|
|
606
|
+
}
|
|
607
|
+
}
|
|
608
|
+
async setForBatch(actorId, pairs) {
|
|
609
|
+
const remoteState = this.#remoteStates.get(actorId) ?? initSyncState();
|
|
610
|
+
const updates = pairs.map(([key, value]) => [key, this.#encode(value)]);
|
|
611
|
+
const prevRoot = remoteState.remoteRoot ?? await this.#forest.createTree([]);
|
|
612
|
+
const nextRoot = await this.#forest.setBatch(prevRoot, updates);
|
|
613
|
+
this.#remoteStates.set(actorId, {
|
|
614
|
+
remoteRoot: nextRoot,
|
|
615
|
+
myRoot: null,
|
|
616
|
+
remoteWant: remoteState.remoteWant,
|
|
617
|
+
needsAck: remoteState.needsAck
|
|
618
|
+
});
|
|
619
|
+
}
|
|
620
|
+
async getAll(key) {
|
|
621
|
+
const result = /* @__PURE__ */ new Map();
|
|
622
|
+
result.set(this.#actor, await this.getLocal(key));
|
|
623
|
+
for (const [actorId, _state] of this.#remoteStates) result.set(actorId, await this.getFor(actorId, key));
|
|
624
|
+
return result;
|
|
625
|
+
}
|
|
626
|
+
async getDifferent() {
|
|
627
|
+
const resultByKey = /* @__PURE__ */ new Map();
|
|
628
|
+
const actors = /* @__PURE__ */ new Set([this.#actor, ...this.#remoteStates.keys()]);
|
|
629
|
+
for (const actor of actors) {
|
|
630
|
+
let root;
|
|
631
|
+
if (actor === this.#actor) root = this.#currentRoot;
|
|
632
|
+
else root = this.#remoteStates.get(actor)?.remoteRoot;
|
|
633
|
+
if (!root) continue;
|
|
634
|
+
for (const item of this.#forest.items(root)) {
|
|
635
|
+
let subMap = resultByKey.get(item.key);
|
|
636
|
+
if (!subMap) {
|
|
637
|
+
subMap = /* @__PURE__ */ new Map();
|
|
638
|
+
resultByKey.set(item.key, subMap);
|
|
639
|
+
}
|
|
640
|
+
subMap.set(actor, item.value);
|
|
641
|
+
}
|
|
642
|
+
}
|
|
643
|
+
const result = /* @__PURE__ */ new Map();
|
|
644
|
+
for (const [key, subMap] of resultByKey) {
|
|
645
|
+
const first = subMap.values().next().value;
|
|
646
|
+
let allEqual = subMap.size === actors.size;
|
|
647
|
+
if (allEqual) {
|
|
648
|
+
for (const value of subMap.values()) if (!arraysEqual(first, value)) {
|
|
649
|
+
allEqual = false;
|
|
650
|
+
break;
|
|
651
|
+
}
|
|
652
|
+
}
|
|
653
|
+
if (!allEqual) {
|
|
654
|
+
const resultSubMap = /* @__PURE__ */ new Map();
|
|
655
|
+
for (const [actorId, value] of subMap) resultSubMap.set(actorId, this.#decode(value));
|
|
656
|
+
result.set(key, resultSubMap);
|
|
657
|
+
}
|
|
658
|
+
}
|
|
659
|
+
return result;
|
|
660
|
+
}
|
|
661
|
+
clearActorState(actorId) {
|
|
662
|
+
this.#remoteStates.delete(actorId);
|
|
663
|
+
}
|
|
664
|
+
async receiveSyncMessage(actorId, message) {
|
|
665
|
+
await this.#forest.insertNodes(message.nodes);
|
|
666
|
+
const state = this.#remoteStates.get(actorId) ?? initSyncState();
|
|
667
|
+
const newState = {
|
|
668
|
+
remoteRoot: message.root ?? state.remoteRoot,
|
|
669
|
+
myRoot: message.remoteRoot ?? state.myRoot,
|
|
670
|
+
remoteWant: message.want,
|
|
671
|
+
needsAck: message.nodes.length > 0
|
|
672
|
+
};
|
|
673
|
+
this.#remoteStates.set(actorId, newState);
|
|
674
|
+
}
|
|
675
|
+
async generateSyncMessage(actorId) {
|
|
676
|
+
const state = this.#remoteStates.get(actorId) ?? initSyncState();
|
|
677
|
+
if (state.myRoot === this.#currentRoot && state.remoteWant.length === 0 && !state.needsAck) return null;
|
|
678
|
+
const nodes = await this.#forest.getNodes(state.remoteWant);
|
|
679
|
+
const want = state.remoteRoot === null ? [] : [...await this.#forest.missingNodes(state.remoteRoot)];
|
|
680
|
+
this.#remoteStates.set(actorId, {
|
|
681
|
+
remoteRoot: state.remoteRoot,
|
|
682
|
+
myRoot: state.myRoot,
|
|
683
|
+
remoteWant: state.remoteWant,
|
|
684
|
+
needsAck: false
|
|
685
|
+
});
|
|
686
|
+
return {
|
|
687
|
+
root: this.#currentRoot,
|
|
688
|
+
remoteRoot: state.remoteRoot,
|
|
689
|
+
want,
|
|
690
|
+
nodes
|
|
691
|
+
};
|
|
692
|
+
}
|
|
693
|
+
#decode(value) {
|
|
694
|
+
return JSON.parse(textDecoder.decode(value));
|
|
695
|
+
}
|
|
696
|
+
#encode(data) {
|
|
697
|
+
return textEncoder$1.encode(JSON.stringify(data));
|
|
698
|
+
}
|
|
699
|
+
};
|
|
700
|
+
var initSyncState = () => ({
|
|
701
|
+
remoteRoot: null,
|
|
702
|
+
myRoot: null,
|
|
703
|
+
remoteWant: [],
|
|
704
|
+
needsAck: false
|
|
705
|
+
});
|
|
706
|
+
var textDecoder = new TextDecoder();
|
|
707
|
+
var textEncoder$1 = new TextEncoder();
|
|
708
|
+
//#endregion
|
|
709
|
+
//#region src/testing.ts
|
|
710
|
+
var createValue = (source) => new Uint8Array(textEncoder.encode(source));
|
|
711
|
+
var textEncoder = new TextEncoder();
|
|
712
|
+
var randomKey = () => crypto.randomUUID();
|
|
713
|
+
var randomSample = (data, count) => data.toSorted(() => Math.random() - .5).slice(0, count);
|
|
714
|
+
//#endregion
|
|
715
|
+
export { Forest, LWWTree, MirrorMultiMap, TreeMut, createValue, digestEquals, formatDigest, getLevel, getLevelHex, initLWWTreeSyncState, makeItem, randomKey, randomSample };
|
|
716
|
+
|
|
717
|
+
//# sourceMappingURL=index.mjs.map
|