@rocicorp/zero 0.17.2025031900 → 0.17.2025032000
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/out/advanced.js +1 -1
- package/out/{chunk-7ARRNDLF.js → chunk-MJCITZ5S.js} +103 -104
- package/out/chunk-MJCITZ5S.js.map +7 -0
- package/out/{chunk-VEVC5RHF.js → chunk-OI2PV2HL.js} +33 -22
- package/out/{chunk-VEVC5RHF.js.map → chunk-OI2PV2HL.js.map} +2 -2
- package/out/solid.js +4 -25
- package/out/solid.js.map +2 -2
- package/out/zero-cache/src/workers/syncer.d.ts +1 -1
- package/out/zero-cache/src/workers/syncer.d.ts.map +1 -1
- package/out/zero-cache/src/workers/syncer.js +1 -0
- package/out/zero-cache/src/workers/syncer.js.map +1 -1
- package/out/zero-solid/src/solid-view.d.ts.map +1 -1
- package/out/zero.js +2 -2
- package/out/zql/src/ivm/array-view.d.ts.map +1 -1
- package/out/zql/src/ivm/array-view.js +2 -3
- package/out/zql/src/ivm/array-view.js.map +1 -1
- package/out/zql/src/ivm/schema.d.ts +2 -2
- package/out/zql/src/ivm/schema.d.ts.map +1 -1
- package/out/zql/src/ivm/take.d.ts +3 -0
- package/out/zql/src/ivm/take.d.ts.map +1 -1
- package/out/zql/src/ivm/take.js +33 -7
- package/out/zql/src/ivm/take.js.map +1 -1
- package/out/zql/src/ivm/view-apply-change.d.ts +5 -1
- package/out/zql/src/ivm/view-apply-change.d.ts.map +1 -1
- package/out/zql/src/ivm/view-apply-change.js +83 -106
- package/out/zql/src/ivm/view-apply-change.js.map +1 -1
- package/package.json +1 -1
- package/out/chunk-7ARRNDLF.js.map +0 -7
|
@@ -1,7 +1,8 @@
|
|
|
1
|
-
import { assert, assertArray,
|
|
1
|
+
import { assert, assertArray, assertNumber, unreachable, } from "../../../shared/src/asserts.js";
|
|
2
2
|
import { must } from "../../../shared/src/must.js";
|
|
3
3
|
import { drainStreams } from "./data.js";
|
|
4
|
-
export
|
|
4
|
+
export const refCountSymbol = Symbol('rc');
|
|
5
|
+
export function applyChange(parentEntry, change, schema, relationship, format) {
|
|
5
6
|
if (schema.isHidden) {
|
|
6
7
|
switch (change.type) {
|
|
7
8
|
case 'add':
|
|
@@ -9,7 +10,7 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
9
10
|
for (const [relationship, children] of Object.entries(change.node.relationships)) {
|
|
10
11
|
const childSchema = must(schema.relationships[relationship]);
|
|
11
12
|
for (const node of children()) {
|
|
12
|
-
applyChange(parentEntry, { type: change.type, node }, childSchema, relationship, format
|
|
13
|
+
applyChange(parentEntry, { type: change.type, node }, childSchema, relationship, format);
|
|
13
14
|
}
|
|
14
15
|
}
|
|
15
16
|
return;
|
|
@@ -21,7 +22,7 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
21
22
|
return;
|
|
22
23
|
case 'child': {
|
|
23
24
|
const childSchema = must(schema.relationships[change.child.relationshipName]);
|
|
24
|
-
applyChange(parentEntry, change.child.change, childSchema, relationship, format
|
|
25
|
+
applyChange(parentEntry, change.child.change, childSchema, relationship, format);
|
|
25
26
|
return;
|
|
26
27
|
}
|
|
27
28
|
default:
|
|
@@ -31,40 +32,20 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
31
32
|
const { singular, relationships: childFormats } = format;
|
|
32
33
|
switch (change.type) {
|
|
33
34
|
case 'add': {
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
...change.node.row,
|
|
37
|
-
};
|
|
35
|
+
let newEntry;
|
|
36
|
+
let rc = 1;
|
|
38
37
|
if (singular) {
|
|
39
38
|
const oldEntry = parentEntry[relationship];
|
|
40
39
|
if (oldEntry !== undefined) {
|
|
41
|
-
assert(schema.compareRows(oldEntry,
|
|
40
|
+
assert(schema.compareRows(oldEntry, change.node.row) === 0, 'single output already exists');
|
|
42
41
|
// adding same again.
|
|
43
|
-
|
|
44
|
-
refCountMap.delete(oldEntry);
|
|
45
|
-
// @ts-expect-error parentEntry is readonly
|
|
46
|
-
parentEntry[relationship] = newEntry;
|
|
47
|
-
refCountMap.set(newEntry, rc + 1);
|
|
48
|
-
}
|
|
49
|
-
else {
|
|
50
|
-
// @ts-expect-error parentEntry is readonly
|
|
51
|
-
parentEntry[relationship] = newEntry;
|
|
52
|
-
refCountMap.set(newEntry, 1);
|
|
42
|
+
rc = oldEntry[refCountSymbol] + 1;
|
|
53
43
|
}
|
|
44
|
+
newEntry = makeNewEntryWithRefCount(change.node.row, rc);
|
|
45
|
+
parentEntry[relationship] = newEntry;
|
|
54
46
|
}
|
|
55
47
|
else {
|
|
56
|
-
|
|
57
|
-
const { pos, found } = binarySearch(view, newEntry, schema.compareRows);
|
|
58
|
-
let deleteCount = 0;
|
|
59
|
-
let rc = 1;
|
|
60
|
-
if (found) {
|
|
61
|
-
deleteCount = 1;
|
|
62
|
-
rc = must(refCountMap.get(view[pos])) + 1;
|
|
63
|
-
refCountMap.delete(view[pos]);
|
|
64
|
-
}
|
|
65
|
-
// @ts-expect-error view is readonly
|
|
66
|
-
view.splice(pos, deleteCount, newEntry);
|
|
67
|
-
refCountMap.set(newEntry, rc);
|
|
48
|
+
newEntry = makeNewEntryAndInsert(change.node.row, getChildEntryList(parentEntry, relationship), schema.compareRows);
|
|
68
49
|
}
|
|
69
50
|
for (const [relationship, children] of Object.entries(change.node.relationships)) {
|
|
70
51
|
// TODO: Is there a flag to make TypeScript complain that dictionary access might be undefined?
|
|
@@ -74,10 +55,9 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
74
55
|
continue;
|
|
75
56
|
}
|
|
76
57
|
const newView = childFormat.singular ? undefined : [];
|
|
77
|
-
// @ts-expect-error newEntry is readonly
|
|
78
58
|
newEntry[relationship] = newView;
|
|
79
59
|
for (const node of children()) {
|
|
80
|
-
applyChange(newEntry, { type: 'add', node }, childSchema, relationship, childFormat
|
|
60
|
+
applyChange(newEntry, { type: 'add', node }, childSchema, relationship, childFormat);
|
|
81
61
|
}
|
|
82
62
|
}
|
|
83
63
|
break;
|
|
@@ -86,29 +66,14 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
86
66
|
if (singular) {
|
|
87
67
|
const oldEntry = parentEntry[relationship];
|
|
88
68
|
assert(oldEntry !== undefined, 'node does not exist');
|
|
89
|
-
const rc =
|
|
69
|
+
const rc = oldEntry[refCountSymbol];
|
|
90
70
|
if (rc === 1) {
|
|
91
|
-
refCountMap.delete(oldEntry);
|
|
92
|
-
// @ts-expect-error parentEntry is readonly
|
|
93
71
|
parentEntry[relationship] = undefined;
|
|
94
72
|
}
|
|
95
|
-
|
|
96
|
-
refCountMap.set(oldEntry, rc - 1);
|
|
97
|
-
}
|
|
73
|
+
oldEntry[refCountSymbol]--;
|
|
98
74
|
}
|
|
99
75
|
else {
|
|
100
|
-
|
|
101
|
-
const { pos, found } = binarySearch(view, change.node.row, schema.compareRows);
|
|
102
|
-
assert(found, 'node does not exist');
|
|
103
|
-
const rc = must(refCountMap.get(view[pos]));
|
|
104
|
-
if (rc === 1) {
|
|
105
|
-
refCountMap.delete(view[pos]);
|
|
106
|
-
// @ts-expect-error view is readonly
|
|
107
|
-
view.splice(pos, 1);
|
|
108
|
-
}
|
|
109
|
-
else {
|
|
110
|
-
refCountMap.set(view[pos], rc - 1);
|
|
111
|
-
}
|
|
76
|
+
removeAndUpdateRefCount(getChildEntryList(parentEntry, relationship), change.node.row, schema.compareRows);
|
|
112
77
|
}
|
|
113
78
|
// Needed to ensure cleanup of operator state is fully done.
|
|
114
79
|
drainStreams(change.node);
|
|
@@ -117,8 +82,7 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
117
82
|
case 'child': {
|
|
118
83
|
let existing;
|
|
119
84
|
if (singular) {
|
|
120
|
-
|
|
121
|
-
existing = parentEntry[relationship];
|
|
85
|
+
existing = getSingularEntry(parentEntry, relationship);
|
|
122
86
|
}
|
|
123
87
|
else {
|
|
124
88
|
const view = getChildEntryList(parentEntry, relationship);
|
|
@@ -129,69 +93,40 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
129
93
|
const childSchema = must(schema.relationships[change.child.relationshipName]);
|
|
130
94
|
const childFormat = format.relationships[change.child.relationshipName];
|
|
131
95
|
if (childFormat !== undefined) {
|
|
132
|
-
applyChange(existing, change.child.change, childSchema, change.child.relationshipName, childFormat
|
|
96
|
+
applyChange(existing, change.child.change, childSchema, change.child.relationshipName, childFormat);
|
|
133
97
|
}
|
|
134
98
|
break;
|
|
135
99
|
}
|
|
136
100
|
case 'edit': {
|
|
137
101
|
if (singular) {
|
|
138
102
|
const existing = parentEntry[relationship];
|
|
139
|
-
|
|
140
|
-
const rc =
|
|
103
|
+
assertRCEntry(existing);
|
|
104
|
+
const rc = existing[refCountSymbol];
|
|
141
105
|
const newEntry = {
|
|
142
106
|
...existing,
|
|
143
107
|
...change.node.row,
|
|
108
|
+
[refCountSymbol]: rc,
|
|
144
109
|
};
|
|
145
|
-
|
|
146
|
-
refCountMap.delete(existing);
|
|
147
|
-
// @ts-expect-error parentEntry is readonly
|
|
110
|
+
existing[refCountSymbol] = 0;
|
|
148
111
|
parentEntry[relationship] = newEntry;
|
|
149
112
|
}
|
|
150
113
|
else {
|
|
151
|
-
const view = parentEntry
|
|
152
|
-
assertEntryList(view);
|
|
114
|
+
const view = getChildEntryList(parentEntry, relationship);
|
|
153
115
|
// If the order changed due to the edit, we need to remove and reinsert.
|
|
154
116
|
if (schema.compareRows(change.oldNode.row, change.node.row) === 0) {
|
|
155
117
|
const { pos, found } = binarySearch(view, change.oldNode.row, schema.compareRows);
|
|
156
|
-
assert(found, 'node does not
|
|
157
|
-
const
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
118
|
+
assert(found, 'node does not exist');
|
|
119
|
+
const oldEntry = view[pos];
|
|
120
|
+
const rc = oldEntry[refCountSymbol];
|
|
121
|
+
oldEntry[refCountSymbol] = 0;
|
|
122
|
+
const newEntry = makeEntryPreserveRelationships(change.node.row, oldEntry, format.relationships, rc);
|
|
123
|
+
view[pos] = newEntry;
|
|
162
124
|
}
|
|
163
125
|
else {
|
|
164
126
|
// Remove
|
|
165
|
-
const
|
|
166
|
-
assert(found, 'node does not exists');
|
|
167
|
-
const oldEntry = view[pos];
|
|
168
|
-
const rc = must(refCountMap.get(oldEntry));
|
|
169
|
-
if (rc === 1) {
|
|
170
|
-
refCountMap.delete(oldEntry);
|
|
171
|
-
// @ts-expect-error view is readonly
|
|
172
|
-
view.splice(pos, 1);
|
|
173
|
-
}
|
|
174
|
-
else {
|
|
175
|
-
refCountMap.set(oldEntry, rc - 1);
|
|
176
|
-
}
|
|
127
|
+
const oldEntry = removeAndUpdateRefCount(view, change.oldNode.row, schema.compareRows);
|
|
177
128
|
// Insert
|
|
178
|
-
|
|
179
|
-
const { pos, found } = binarySearch(view, change.node.row, schema.compareRows);
|
|
180
|
-
let rc = 1;
|
|
181
|
-
const newEntry = makeEntryPreserveRelationships(change.node.row, oldEntry, format.relationships);
|
|
182
|
-
let deleteCount = 0;
|
|
183
|
-
if (found) {
|
|
184
|
-
// We changed a row to a row that already exists. The existing row
|
|
185
|
-
// should increase its ref count.
|
|
186
|
-
deleteCount = 1;
|
|
187
|
-
const existing = view[pos];
|
|
188
|
-
rc = must(refCountMap.get(existing)) + 1;
|
|
189
|
-
refCountMap.delete(existing);
|
|
190
|
-
}
|
|
191
|
-
// @ts-expect-error view is readonly
|
|
192
|
-
view.splice(pos, deleteCount, newEntry);
|
|
193
|
-
refCountMap.set(newEntry, rc);
|
|
194
|
-
}
|
|
129
|
+
insertAndSetRefCount(view, change.node.row, oldEntry, format.relationships, schema.compareRows);
|
|
195
130
|
}
|
|
196
131
|
}
|
|
197
132
|
break;
|
|
@@ -200,6 +135,44 @@ export function applyChange(parentEntry, change, schema, relationship, format, r
|
|
|
200
135
|
unreachable(change);
|
|
201
136
|
}
|
|
202
137
|
}
|
|
138
|
+
function makeNewEntryAndInsert(newRow, view, compareRows) {
|
|
139
|
+
const { pos, found } = binarySearch(view, newRow, compareRows);
|
|
140
|
+
let deleteCount = 0;
|
|
141
|
+
let rc = 1;
|
|
142
|
+
if (found) {
|
|
143
|
+
deleteCount = 1;
|
|
144
|
+
rc = view[pos][refCountSymbol];
|
|
145
|
+
view[pos][refCountSymbol] = rc - 1;
|
|
146
|
+
rc++;
|
|
147
|
+
}
|
|
148
|
+
const newEntry = makeNewEntryWithRefCount(newRow, rc);
|
|
149
|
+
view.splice(pos, deleteCount, newEntry);
|
|
150
|
+
return newEntry;
|
|
151
|
+
}
|
|
152
|
+
function insertAndSetRefCount(view, newRow, oldEntry, relationships, compareRows) {
|
|
153
|
+
const { pos, found } = binarySearch(view, newRow, compareRows);
|
|
154
|
+
let deleteCount = 0;
|
|
155
|
+
let rc = 1;
|
|
156
|
+
if (found) {
|
|
157
|
+
deleteCount = 1;
|
|
158
|
+
const oldEntry = view[pos];
|
|
159
|
+
rc = oldEntry[refCountSymbol] + 1;
|
|
160
|
+
oldEntry[refCountSymbol] = 0;
|
|
161
|
+
}
|
|
162
|
+
const newEntry = makeEntryPreserveRelationships(newRow, oldEntry, relationships, rc);
|
|
163
|
+
view.splice(pos, deleteCount, newEntry);
|
|
164
|
+
}
|
|
165
|
+
function removeAndUpdateRefCount(view, row, compareRows) {
|
|
166
|
+
const { pos, found } = binarySearch(view, row, compareRows);
|
|
167
|
+
assert(found, 'node does not exist');
|
|
168
|
+
const oldEntry = view[pos];
|
|
169
|
+
const rc = oldEntry[refCountSymbol];
|
|
170
|
+
if (rc === 1) {
|
|
171
|
+
view.splice(pos, 1);
|
|
172
|
+
}
|
|
173
|
+
oldEntry[refCountSymbol]--;
|
|
174
|
+
return oldEntry;
|
|
175
|
+
}
|
|
203
176
|
// TODO: Do not return an object. It puts unnecessary pressure on the GC.
|
|
204
177
|
function binarySearch(view, target, comparator) {
|
|
205
178
|
let low = 0;
|
|
@@ -219,24 +192,28 @@ function binarySearch(view, target, comparator) {
|
|
|
219
192
|
}
|
|
220
193
|
return { pos: low, found: false };
|
|
221
194
|
}
|
|
222
|
-
function makeEntryPreserveRelationships(
|
|
223
|
-
const
|
|
195
|
+
function makeEntryPreserveRelationships(newRow, oldEntry, relationships, rc) {
|
|
196
|
+
const entry = makeNewEntryWithRefCount(newRow, rc);
|
|
224
197
|
for (const relationship in relationships) {
|
|
225
|
-
assert(!(relationship in
|
|
226
|
-
|
|
227
|
-
result[relationship] = entry[relationship];
|
|
198
|
+
assert(!(relationship in newRow), 'Relationship already exists');
|
|
199
|
+
entry[relationship] = oldEntry[relationship];
|
|
228
200
|
}
|
|
229
|
-
return
|
|
201
|
+
return entry;
|
|
230
202
|
}
|
|
231
203
|
function getChildEntryList(parentEntry, relationship) {
|
|
232
204
|
const view = parentEntry[relationship];
|
|
233
205
|
assertArray(view);
|
|
234
206
|
return view;
|
|
235
207
|
}
|
|
236
|
-
function
|
|
237
|
-
|
|
208
|
+
function assertRCEntry(v) {
|
|
209
|
+
assertNumber(v[refCountSymbol]);
|
|
210
|
+
}
|
|
211
|
+
function getSingularEntry(parentEntry, relationship) {
|
|
212
|
+
const e = parentEntry[relationship];
|
|
213
|
+
assertNumber(e[refCountSymbol]);
|
|
214
|
+
return e;
|
|
238
215
|
}
|
|
239
|
-
function
|
|
240
|
-
|
|
216
|
+
function makeNewEntryWithRefCount(row, rc) {
|
|
217
|
+
return { ...row, [refCountSymbol]: rc };
|
|
241
218
|
}
|
|
242
219
|
//# sourceMappingURL=view-apply-change.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"view-apply-change.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/view-apply-change.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,MAAM,EACN,WAAW,EACX,YAAY,EACZ,WAAW,GACZ,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,IAAI,EAAC,MAAM,6BAA6B,CAAC;
|
|
1
|
+
{"version":3,"file":"view-apply-change.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/view-apply-change.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,MAAM,EACN,WAAW,EACX,YAAY,EACZ,WAAW,GACZ,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,IAAI,EAAC,MAAM,6BAA6B,CAAC;AAGjD,OAAO,EAAC,YAAY,EAA6B,MAAM,WAAW,CAAC;AAInE,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;AAqE3C,MAAM,UAAU,WAAW,CACzB,WAAkB,EAClB,MAAkB,EAClB,MAAoB,EACpB,YAAoB,EACpB,MAAc;IAEd,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpB,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,KAAK,CAAC;YACX,KAAK,QAAQ;gBACX,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CACnD,MAAM,CAAC,IAAI,CAAC,aAAa,CAC1B,EAAE,CAAC;oBACF,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;oBAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,EAAE,CAAC;wBAC9B,WAAW,CACT,WAAW,EACX,EAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAC,EACzB,WAAW,EACX,YAAY,EACZ,MAAM,CACP,CAAC;oBACJ,CAAC;gBACH,CAAC;gBACD,OAAO;YACT,KAAK,MAAM;gBACT,uEAAuE;gBACvE,6DAA6D;gBAC7D,oEAAoE;gBACpE,OAAO;gBACP,OAAO;YACT,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,WAAW,GAAG,IAAI,CACtB,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACpD,CAAC;gBACF,WAAW,CACT,WAAW,EACX,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,WAAW,EACX,YAAY,EACZ,MAAM,CACP,CAAC;gBACF,OAAO;YACT,CAAC;YACD;gBACE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,MAAM,EAAC,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAC,GAAG,MAAM,CAAC;IACvD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,QAAiB,CAAC;YAEtB,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAAwB,CAAC;gBAClE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,MAAM,CACJ,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EACnD,8BAA8B,CAC/B,CAAC;oBACF,qBAAqB;oBACrB,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;gBACpC,CAAC;gBAED,QAAQ,GAAG,wBAAwB,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBAExD,WAA+B,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;YAC5D,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,qBAAqB,CAC9B,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,EAC5C,MAAM,CAAC,WAAW,CACnB,CAAC;YACJ,CAAC;YAED,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CACnD,MAAM,CAAC,IAAI,CAAC,aAAa,CAC1B,EAAE,CAAC;gBACF,+FAA+F;gBAC/F,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;gBAC7D,MAAM,WAAW,GAAG,YAAY,CAAC,YAAY,CAAC,CAAC;gBAC/C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;oBAC9B,SAAS;gBACX,CAAC;gBAED,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,EAAkB,CAAC;gBACvE,QAAQ,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC;gBAEjC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,EAAE,CAAC;oBAC9B,WAAW,CACT,QAAQ,EACR,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC,EACnB,WAAW,EACX,YAAY,EACZ,WAAW,CACZ,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAAwB,CAAC;gBAClE,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,qBAAqB,CAAC,CAAC;gBACtD,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;gBACpC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;oBACZ,WAA+B,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;gBAC7D,CAAC;gBACD,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,uBAAuB,CACrB,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,WAAW,CACnB,CAAC;YACJ,CAAC;YACD,4DAA4D;YAC5D,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,MAAM;QACR,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,QAAiB,CAAC;YACtB,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,GAAG,gBAAgB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;gBAC1D,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,WAAW,CACnB,CAAC;gBACF,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBACrC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YAED,MAAM,WAAW,GAAG,IAAI,CACtB,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACpD,CAAC;YACF,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACxE,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC9B,WAAW,CACT,QAAQ,EACR,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,WAAW,EACX,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAC7B,WAAW,CACZ,CAAC;YACJ,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;gBAC3C,aAAa,CAAC,QAAQ,CAAC,CAAC;gBACxB,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;gBACpC,MAAM,QAAQ,GAAG;oBACf,GAAG,QAAQ;oBACX,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG;oBAClB,CAAC,cAAc,CAAC,EAAE,EAAE;iBACrB,CAAC;gBACF,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;gBAC5B,WAA+B,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;YAC5D,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;gBAC1D,wEAAwE;gBACxE,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAClE,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,OAAO,CAAC,GAAG,EAClB,MAAM,CAAC,WAAW,CACnB,CAAC;oBACF,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;oBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;oBACpC,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;oBAE7B,MAAM,QAAQ,GAAG,8BAA8B,CAC7C,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,QAAQ,EACR,MAAM,CAAC,aAAa,EACpB,EAAE,CACH,CAAC;oBAEF,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;gBACvB,CAAC;qBAAM,CAAC;oBACN,SAAS;oBACT,MAAM,QAAQ,GAAG,uBAAuB,CACtC,IAAI,EACJ,MAAM,CAAC,OAAO,CAAC,GAAG,EAClB,MAAM,CAAC,WAAW,CACnB,CAAC;oBAEF,SAAS;oBACT,oBAAoB,CAClB,IAAI,EACJ,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,QAAQ,EACR,MAAM,CAAC,aAAa,EACpB,MAAM,CAAC,WAAW,CACnB,CAAC;gBACJ,CAAC;YACH,CAAC;YAED,MAAM;QACR,CAAC;QACD;YACE,WAAW,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC5B,MAAW,EACX,IAAiB,EACjB,WAAuB;IAEvB,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAE7D,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,KAAK,EAAE,CAAC;QACV,WAAW,GAAG,CAAC,CAAC;QAChB,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACnC,EAAE,EAAE,CAAC;IACP,CAAC;IAED,MAAM,QAAQ,GAAG,wBAAwB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAEtD,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;IAExC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAC3B,IAAiB,EACjB,MAAW,EACX,QAAiB,EACjB,aAAsC,EACtC,WAAuB;IAEvB,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAE7D,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,KAAK,EAAE,CAAC;QACV,WAAW,GAAG,CAAC,CAAC;QAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAClC,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,QAAQ,GAAG,8BAA8B,CAC7C,MAAM,EACN,QAAQ,EACR,aAAa,EACb,EAAE,CACH,CAAC;IAEF,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,uBAAuB,CAC9B,IAAiB,EACjB,GAAQ,EACR,WAAuB;IAEvB,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IAC1D,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;IACpC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;IAE3B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,yEAAyE;AACzE,SAAS,YAAY,CAAC,IAAiB,EAAE,MAAW,EAAE,UAAsB;IAC1E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAQ,EAAE,MAAa,CAAC,CAAC;QAC/D,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAChB,CAAC;aAAM,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,OAAO,EAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,EAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAC,CAAC;AAClC,CAAC;AAED,SAAS,8BAA8B,CACrC,MAAW,EACX,QAAiB,EACjB,aAAsC,EACtC,EAAU;IAEV,MAAM,KAAK,GAAG,wBAAwB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACnD,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;QACzC,MAAM,CAAC,CAAC,CAAC,YAAY,IAAI,MAAM,CAAC,EAAE,6BAA6B,CAAC,CAAC;QACjE,KAAK,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CACxB,WAAkB,EAClB,YAAoB;IAEpB,MAAM,IAAI,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;IACvC,WAAW,CAAC,IAAI,CAAC,CAAC;IAClB,OAAO,IAAmB,CAAC;AAC7B,CAAC;AAED,SAAS,aAAa,CAAC,CAAU;IAC/B,YAAY,CAAE,CAAsB,CAAC,cAAc,CAAC,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,gBAAgB,CAAC,WAAkB,EAAE,YAAoB;IAChE,MAAM,CAAC,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;IACpC,YAAY,CAAE,CAAsB,CAAC,cAAc,CAAC,CAAC,CAAC;IACtD,OAAO,CAAY,CAAC;AACtB,CAAC;AAED,SAAS,wBAAwB,CAAC,GAAQ,EAAE,EAAU;IACpD,OAAO,EAAC,GAAG,GAAG,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,EAAC,CAAC;AACxC,CAAC"}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@rocicorp/zero",
|
|
3
|
-
"version": "0.17.
|
|
3
|
+
"version": "0.17.2025032000",
|
|
4
4
|
"scripts": {
|
|
5
5
|
"build": "rm -rf out && npm run build-server && npm run build-client",
|
|
6
6
|
"build-client": "tsc -p tsconfig.client.json && tsc-alias -p tsconfig.client.json && npx tsx tool/build.js",
|
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
{
|
|
2
|
-
"version": 3,
|
|
3
|
-
"sources": ["../../shared/src/asserts.ts", "../../shared/src/must.ts", "../../zql/src/ivm/data.ts", "../../zql/src/ivm/view-apply-change.ts"],
|
|
4
|
-
"sourcesContent": ["export function assert(\n b: unknown,\n msg: string | (() => string) = 'Assertion failed',\n): asserts b {\n if (!b) {\n throw new Error(typeof msg === 'string' ? msg : msg());\n }\n}\n\nexport function assertString(v: unknown): asserts v is string {\n assertType(v, 'string');\n}\n\nexport function assertNumber(v: unknown): asserts v is number {\n assertType(v, 'number');\n}\n\nexport function assertBoolean(v: unknown): asserts v is boolean {\n assertType(v, 'boolean');\n}\n\nfunction assertType(v: unknown, t: string) {\n if (typeof v !== t) {\n throwInvalidType(v, t);\n }\n}\n\nexport function assertObject(v: unknown): asserts v is Record<string, unknown> {\n if (v === null) {\n throwInvalidType(v, 'object');\n }\n assertType(v, 'object');\n}\n\nexport function assertArray(v: unknown): asserts v is unknown[] {\n if (!Array.isArray(v)) {\n throwInvalidType(v, 'array');\n }\n}\n\nexport function invalidType(v: unknown, t: string): string {\n let s = 'Invalid type: ';\n if (v === null || v === undefined) {\n s += v;\n } else {\n s += `${typeof v} \\`${v}\\``;\n }\n return s + `, expected ${t}`;\n}\n\nexport function throwInvalidType(v: unknown, t: string): never {\n throw new Error(invalidType(v, t));\n}\n\nexport function assertNotNull<T>(v: T | null): asserts v is T {\n if (v === null) {\n throw new Error('Expected non-null value');\n }\n}\n\nexport function assertUndefined<T>(\n v: T | undefined,\n msg = 'Expected undefined value',\n): asserts v is T {\n if (v !== undefined) {\n throw new Error(msg);\n }\n}\n\nexport function assertNotUndefined<T>(\n v: T | undefined,\n msg = 'Expected non undefined value',\n): asserts v is T {\n if (v === undefined) {\n throw new Error(msg);\n }\n}\n\nexport function assertInstanceof<T>(\n v: unknown,\n t: new (...args: unknown[]) => T,\n): asserts v is T {\n if (!(v instanceof t)) {\n throw new Error(`Expected instanceof ${t.name}`);\n }\n}\n\nexport function assertUint8Array(v: unknown): asserts v is Uint8Array {\n assertInstanceof(v, Uint8Array);\n}\n\nexport function unreachable(): never;\nexport function unreachable(v: never): never;\nexport function unreachable(_?: never): never {\n throw new Error('Unreachable');\n}\n\nexport function notImplemented(): never {\n throw new Error('Not implemented');\n}\n", "export function must<T>(v: T | undefined | null, msg?: string): T {\n // eslint-disable-next-line eqeqeq\n if (v == null) {\n throw new Error(msg ?? `Unexpected ${v} value`);\n }\n return v;\n}\n", "import {compareUTF8} from 'compare-utf8';\nimport {\n assertBoolean,\n assertNumber,\n assertString,\n} from '../../../shared/src/asserts.ts';\nimport type {Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {Stream} from './stream.ts';\n\n/**\n * A row flowing through the pipeline, plus its relationships.\n * Relationships are generated lazily as read.\n */\nexport type Node = {\n row: Row;\n relationships: Record<string, () => Stream<Node>>;\n};\n\n/**\n * Compare two values. The values must be of the same type. This function\n * throws at runtime if the types differ.\n *\n * Note, this function considers `null === null` and\n * `undefined === undefined`. This is different than SQL. In join code,\n * null must be treated separately.\n *\n * See: https://github.com/rocicorp/mono/pull/2116/files#r1704811479\n *\n * @returns < 0 if a < b, 0 if a === b, > 0 if a > b\n */\nexport function compareValues(a: Value, b: Value): number {\n a = normalizeUndefined(a);\n b = normalizeUndefined(b);\n\n if (a === b) {\n return 0;\n }\n if (a === null) {\n return -1;\n }\n if (b === null) {\n return 1;\n }\n if (typeof a === 'boolean') {\n assertBoolean(b);\n return a ? 1 : -1;\n }\n if (typeof a === 'number') {\n assertNumber(b);\n return a - b;\n }\n if (typeof a === 'string') {\n assertString(b);\n // We compare all strings in Zero as UTF-8. This is the default on SQLite\n // and we need to match it. See:\n // https://blog.replicache.dev/blog/replicache-11-adventures-in-text-encoding.\n //\n // TODO: We could change this since SQLite supports UTF-16. Microbenchmark\n // to see if there's a big win.\n //\n // https://www.sqlite.org/c3ref/create_collation.html\n return compareUTF8(a, b);\n }\n throw new Error(`Unsupported type: ${a}`);\n}\n\nexport type NormalizedValue = Exclude<Value, undefined>;\n\n/**\n * We allow undefined to be passed for the convenience of developers, but we\n * treat it equivalently to null. It's better for perf to not create an copy\n * of input values, so we just normalize at use when necessary.\n */\nexport function normalizeUndefined(v: Value): NormalizedValue {\n return v ?? null;\n}\n\nexport type Comparator = (r1: Row, r2: Row) => number;\n\nexport function makeComparator(\n order: Ordering,\n reverse?: boolean | undefined,\n): Comparator {\n return (a, b) => {\n // Skip destructuring here since it is hot code.\n for (const ord of order) {\n const field = ord[0];\n const comp = compareValues(a[field], b[field]);\n if (comp !== 0) {\n const result = ord[1] === 'asc' ? comp : -comp;\n return reverse ? -result : result;\n }\n }\n return 0;\n };\n}\n\n/**\n * Determine if two values are equal. Note that unlike compareValues() above,\n * this function treats `null` as unequal to itself (and same for `undefined`).\n * This is required to make joins work correctly, but may not be the right\n * semantic for your application.\n */\nexport function valuesEqual(a: Value, b: Value): boolean {\n // eslint-disable-next-line eqeqeq\n if (a == null || b == null) {\n return false;\n }\n return a === b;\n}\n\nexport function drainStreams(node: Node) {\n for (const stream of Object.values(node.relationships)) {\n for (const node of stream()) {\n drainStreams(node);\n }\n }\n}\n", "import {\n assert,\n assertArray,\n assertObject,\n unreachable,\n} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport {drainStreams, type Comparator, type Node} from './data.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Entry, EntryList, Format} from './view.ts';\n\n/**\n * `applyChange` does not consume the `relationships` of `ChildChange#node`,\n * `EditChange#node` and `EditChange#oldNode`. The `ViewChange` type\n * documents and enforces this via the type system.\n */\nexport type ViewChange =\n | AddViewChange\n | RemoveViewChange\n | ChildViewChange\n | EditViewChange;\n\nexport type RowOnlyNode = {row: Row};\n\nexport type AddViewChange = {\n type: 'add';\n node: Node;\n};\n\nexport type RemoveViewChange = {\n type: 'remove';\n node: Node;\n};\n\ntype ChildViewChange = {\n type: 'child';\n node: RowOnlyNode;\n child: {\n relationshipName: string;\n change: ViewChange;\n };\n};\n\ntype EditViewChange = {\n type: 'edit';\n node: RowOnlyNode;\n oldNode: RowOnlyNode;\n};\n\n/**\n * This is a subset of WeakMap but restricted to what we need.\n */\nexport interface RefCountMap {\n get(entry: Entry): number | undefined;\n set(entry: Entry, refCount: number): void;\n delete(entry: Entry): boolean;\n}\n\nexport function applyChange(\n parentEntry: Entry,\n change: ViewChange,\n schema: SourceSchema,\n relationship: string,\n format: Format,\n refCountMap: RefCountMap,\n) {\n if (schema.isHidden) {\n switch (change.type) {\n case 'add':\n case 'remove':\n for (const [relationship, children] of Object.entries(\n change.node.relationships,\n )) {\n const childSchema = must(schema.relationships[relationship]);\n for (const node of children()) {\n applyChange(\n parentEntry,\n {type: change.type, node},\n childSchema,\n relationship,\n format,\n refCountMap,\n );\n }\n }\n return;\n case 'edit':\n // If hidden at this level it means that the hidden row was changed. If\n // the row was changed in such a way that it would change the\n // relationships then the edit would have been split into remove and\n // add.\n return;\n case 'child': {\n const childSchema = must(\n schema.relationships[change.child.relationshipName],\n );\n applyChange(\n parentEntry,\n change.child.change,\n childSchema,\n relationship,\n format,\n refCountMap,\n );\n return;\n }\n default:\n unreachable(change);\n }\n }\n\n const {singular, relationships: childFormats} = format;\n switch (change.type) {\n case 'add': {\n // TODO: Only create a new entry if we need to mutate the existing one.\n const newEntry: Entry = {\n ...change.node.row,\n };\n if (singular) {\n const oldEntry = parentEntry[relationship] as Entry | undefined;\n if (oldEntry !== undefined) {\n assert(\n schema.compareRows(oldEntry, newEntry) === 0,\n 'single output already exists',\n );\n // adding same again.\n const rc = must(refCountMap.get(oldEntry));\n refCountMap.delete(oldEntry);\n // @ts-expect-error parentEntry is readonly\n parentEntry[relationship] = newEntry;\n refCountMap.set(newEntry, rc + 1);\n } else {\n // @ts-expect-error parentEntry is readonly\n parentEntry[relationship] = newEntry;\n refCountMap.set(newEntry, 1);\n }\n } else {\n const view = getChildEntryList(parentEntry, relationship);\n const {pos, found} = binarySearch(view, newEntry, schema.compareRows);\n\n let deleteCount = 0;\n let rc = 1;\n if (found) {\n deleteCount = 1;\n rc = must(refCountMap.get(view[pos])) + 1;\n refCountMap.delete(view[pos]);\n }\n\n // @ts-expect-error view is readonly\n view.splice(pos, deleteCount, newEntry);\n refCountMap.set(newEntry, rc);\n }\n for (const [relationship, children] of Object.entries(\n change.node.relationships,\n )) {\n // TODO: Is there a flag to make TypeScript complain that dictionary access might be undefined?\n const childSchema = must(schema.relationships[relationship]);\n const childFormat = childFormats[relationship];\n if (childFormat === undefined) {\n continue;\n }\n\n const newView = childFormat.singular ? undefined : ([] as EntryList);\n // @ts-expect-error newEntry is readonly\n newEntry[relationship] = newView;\n for (const node of children()) {\n applyChange(\n newEntry,\n {type: 'add', node},\n childSchema,\n relationship,\n childFormat,\n refCountMap,\n );\n }\n }\n break;\n }\n case 'remove': {\n if (singular) {\n const oldEntry = parentEntry[relationship] as Entry | undefined;\n assert(oldEntry !== undefined, 'node does not exist');\n const rc = must(refCountMap.get(oldEntry));\n if (rc === 1) {\n refCountMap.delete(oldEntry);\n // @ts-expect-error parentEntry is readonly\n parentEntry[relationship] = undefined;\n } else {\n refCountMap.set(oldEntry, rc - 1);\n }\n } else {\n const view = getChildEntryList(parentEntry, relationship);\n const {pos, found} = binarySearch(\n view,\n change.node.row,\n schema.compareRows,\n );\n assert(found, 'node does not exist');\n const rc = must(refCountMap.get(view[pos]));\n if (rc === 1) {\n refCountMap.delete(view[pos]);\n // @ts-expect-error view is readonly\n view.splice(pos, 1);\n } else {\n refCountMap.set(view[pos], rc - 1);\n }\n }\n // Needed to ensure cleanup of operator state is fully done.\n drainStreams(change.node);\n break;\n }\n case 'child': {\n let existing: Entry;\n if (singular) {\n assertObject(parentEntry[relationship]);\n existing = parentEntry[relationship];\n } else {\n const view = getChildEntryList(parentEntry, relationship);\n const {pos, found} = binarySearch(\n view,\n change.node.row,\n schema.compareRows,\n );\n assert(found, 'node does not exist');\n existing = view[pos];\n }\n\n const childSchema = must(\n schema.relationships[change.child.relationshipName],\n );\n const childFormat = format.relationships[change.child.relationshipName];\n if (childFormat !== undefined) {\n applyChange(\n existing,\n change.child.change,\n childSchema,\n change.child.relationshipName,\n childFormat,\n refCountMap,\n );\n }\n break;\n }\n case 'edit': {\n if (singular) {\n const existing = parentEntry[relationship];\n assertEntry(existing);\n const rc = must(refCountMap.get(existing));\n const newEntry = {\n ...existing,\n ...change.node.row,\n };\n refCountMap.set(newEntry, rc);\n refCountMap.delete(existing);\n // @ts-expect-error parentEntry is readonly\n parentEntry[relationship] = newEntry;\n } else {\n const view = parentEntry[relationship];\n assertEntryList(view);\n // If the order changed due to the edit, we need to remove and reinsert.\n if (schema.compareRows(change.oldNode.row, change.node.row) === 0) {\n const {pos, found} = binarySearch(\n view,\n change.oldNode.row,\n schema.compareRows,\n );\n assert(found, 'node does not exists');\n const rc = must(refCountMap.get(view[pos]));\n refCountMap.delete(view[pos]);\n // @ts-expect-error view is readonly\n view[pos] = makeEntryPreserveRelationships(\n change.node.row,\n view[pos],\n format.relationships,\n );\n refCountMap.set(view[pos], rc);\n } else {\n // Remove\n const {pos, found} = binarySearch(\n view,\n change.oldNode.row,\n schema.compareRows,\n );\n assert(found, 'node does not exists');\n const oldEntry = view[pos];\n const rc = must(refCountMap.get(oldEntry));\n if (rc === 1) {\n refCountMap.delete(oldEntry);\n // @ts-expect-error view is readonly\n view.splice(pos, 1);\n } else {\n refCountMap.set(oldEntry, rc - 1);\n }\n\n // Insert\n {\n const {pos, found} = binarySearch(\n view,\n change.node.row,\n schema.compareRows,\n );\n let rc = 1;\n const newEntry = makeEntryPreserveRelationships(\n change.node.row,\n oldEntry,\n format.relationships,\n );\n let deleteCount = 0;\n if (found) {\n // We changed a row to a row that already exists. The existing row\n // should increase its ref count.\n deleteCount = 1;\n const existing = view[pos];\n rc = must(refCountMap.get(existing)) + 1;\n refCountMap.delete(existing);\n }\n // @ts-expect-error view is readonly\n view.splice(pos, deleteCount, newEntry);\n refCountMap.set(newEntry, rc);\n }\n }\n }\n break;\n }\n default:\n unreachable(change);\n }\n}\n\n// TODO: Do not return an object. It puts unnecessary pressure on the GC.\nfunction binarySearch(view: EntryList, target: Entry, comparator: Comparator) {\n let low = 0;\n let high = view.length - 1;\n while (low <= high) {\n const mid = (low + high) >>> 1;\n const comparison = comparator(view[mid] as Row, target as Row);\n if (comparison < 0) {\n low = mid + 1;\n } else if (comparison > 0) {\n high = mid - 1;\n } else {\n return {pos: mid, found: true};\n }\n }\n return {pos: low, found: false};\n}\n\nfunction makeEntryPreserveRelationships(\n row: Row,\n entry: Entry,\n relationships: {[key: string]: Format},\n): Entry {\n const result: Entry = {...row};\n for (const relationship in relationships) {\n assert(!(relationship in row), 'Relationship already exists');\n // @ts-expect-error entry is readonly\n result[relationship] = entry[relationship];\n }\n return result;\n}\n\nfunction getChildEntryList(\n parentEntry: Entry,\n relationship: string,\n): EntryList {\n const view = parentEntry[relationship] as unknown;\n assertArray(view);\n return view as EntryList;\n}\n\nfunction assertEntryList(v: unknown): asserts v is EntryList {\n assertArray(v);\n}\n\nfunction assertEntry(v: unknown): asserts v is Entry {\n assertObject(v);\n}\n"],
|
|
5
|
-
"mappings": ";AAAO,SAAS,OACd,GACA,MAA+B,oBACpB;AACX,MAAI,CAAC,GAAG;AACN,UAAM,IAAI,MAAM,OAAO,QAAQ,WAAW,MAAM,IAAI,CAAC;AAAA,EACvD;AACF;AAEO,SAAS,aAAa,GAAiC;AAC5D,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,aAAa,GAAiC;AAC5D,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,cAAc,GAAkC;AAC9D,aAAW,GAAG,SAAS;AACzB;AAEA,SAAS,WAAW,GAAY,GAAW;AACzC,MAAI,OAAO,MAAM,GAAG;AAClB,qBAAiB,GAAG,CAAC;AAAA,EACvB;AACF;AAEO,SAAS,aAAa,GAAkD;AAC7E,MAAI,MAAM,MAAM;AACd,qBAAiB,GAAG,QAAQ;AAAA,EAC9B;AACA,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,YAAY,GAAoC;AAC9D,MAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,qBAAiB,GAAG,OAAO;AAAA,EAC7B;AACF;AAEO,SAAS,YAAY,GAAY,GAAmB;AACzD,MAAI,IAAI;AACR,MAAI,MAAM,QAAQ,MAAM,QAAW;AACjC,SAAK;AAAA,EACP,OAAO;AACL,SAAK,GAAG,OAAO,CAAC,MAAM,CAAC;AAAA,EACzB;AACA,SAAO,IAAI,cAAc,CAAC;AAC5B;AAEO,SAAS,iBAAiB,GAAY,GAAkB;AAC7D,QAAM,IAAI,MAAM,YAAY,GAAG,CAAC,CAAC;AACnC;AAEO,SAAS,cAAiB,GAA6B;AAC5D,MAAI,MAAM,MAAM;AACd,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AACF;AAmCO,SAAS,YAAY,GAAkB;AAC5C,QAAM,IAAI,MAAM,aAAa;AAC/B;;;AC/FO,SAAS,KAAQ,GAAyB,KAAiB;AAEhE,MAAI,KAAK,MAAM;AACb,UAAM,IAAI,MAAM,OAAO,cAAc,CAAC,QAAQ;AAAA,EAChD;AACA,SAAO;AACT;;;ACNA,SAAQ,mBAAkB;AA+BnB,SAAS,cAAc,GAAU,GAAkB;AACxD,MAAI,mBAAmB,CAAC;AACxB,MAAI,mBAAmB,CAAC;AAExB,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,MAAM,WAAW;AAC1B,kBAAc,CAAC;AACf,WAAO,IAAI,IAAI;AAAA,EACjB;AACA,MAAI,OAAO,MAAM,UAAU;AACzB,iBAAa,CAAC;AACd,WAAO,IAAI;AAAA,EACb;AACA,MAAI,OAAO,MAAM,UAAU;AACzB,iBAAa,CAAC;AASd,WAAO,YAAY,GAAG,CAAC;AAAA,EACzB;AACA,QAAM,IAAI,MAAM,qBAAqB,CAAC,EAAE;AAC1C;AASO,SAAS,mBAAmB,GAA2B;AAC5D,SAAO,KAAK;AACd;AAIO,SAAS,eACd,OACA,SACY;AACZ,SAAO,CAAC,GAAG,MAAM;AAEf,eAAW,OAAO,OAAO;AACvB,YAAM,QAAQ,IAAI,CAAC;AACnB,YAAM,OAAO,cAAc,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC;AAC7C,UAAI,SAAS,GAAG;AACd,cAAM,SAAS,IAAI,CAAC,MAAM,QAAQ,OAAO,CAAC;AAC1C,eAAO,UAAU,CAAC,SAAS;AAAA,MAC7B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAQO,SAAS,YAAY,GAAU,GAAmB;AAEvD,MAAI,KAAK,QAAQ,KAAK,MAAM;AAC1B,WAAO;AAAA,EACT;AACA,SAAO,MAAM;AACf;AAEO,SAAS,aAAa,MAAY;AACvC,aAAW,UAAU,OAAO,OAAO,KAAK,aAAa,GAAG;AACtD,eAAWA,SAAQ,OAAO,GAAG;AAC3B,mBAAaA,KAAI;AAAA,IACnB;AAAA,EACF;AACF;;;AC3DO,SAAS,YACd,aACA,QACA,QACA,cACA,QACA,aACA;AACA,MAAI,OAAO,UAAU;AACnB,YAAQ,OAAO,MAAM;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AACH,mBAAW,CAACC,eAAc,QAAQ,KAAK,OAAO;AAAA,UAC5C,OAAO,KAAK;AAAA,QACd,GAAG;AACD,gBAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,qBAAW,QAAQ,SAAS,GAAG;AAC7B;AAAA,cACE;AAAA,cACA,EAAC,MAAM,OAAO,MAAM,KAAI;AAAA,cACxB;AAAA,cACAA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF,KAAK;AAKH;AAAA,MACF,KAAK,SAAS;AACZ,cAAM,cAAc;AAAA,UAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,QACpD;AACA;AAAA,UACE;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MACF;AAAA,MACA;AACE,oBAAY,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,EAAC,UAAU,eAAe,aAAY,IAAI;AAChD,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK,OAAO;AAEV,YAAM,WAAkB;AAAA,QACtB,GAAG,OAAO,KAAK;AAAA,MACjB;AACA,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,YAAI,aAAa,QAAW;AAC1B;AAAA,YACE,OAAO,YAAY,UAAU,QAAQ,MAAM;AAAA,YAC3C;AAAA,UACF;AAEA,gBAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,sBAAY,OAAO,QAAQ;AAE3B,sBAAY,YAAY,IAAI;AAC5B,sBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,QAClC,OAAO;AAEL,sBAAY,YAAY,IAAI;AAC5B,sBAAY,IAAI,UAAU,CAAC;AAAA,QAC7B;AAAA,MACF,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI,aAAa,MAAM,UAAU,OAAO,WAAW;AAEpE,YAAI,cAAc;AAClB,YAAI,KAAK;AACT,YAAI,OAAO;AACT,wBAAc;AACd,eAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI;AACxC,sBAAY,OAAO,KAAK,GAAG,CAAC;AAAA,QAC9B;AAGA,aAAK,OAAO,KAAK,aAAa,QAAQ;AACtC,oBAAY,IAAI,UAAU,EAAE;AAAA,MAC9B;AACA,iBAAW,CAACA,eAAc,QAAQ,KAAK,OAAO;AAAA,QAC5C,OAAO,KAAK;AAAA,MACd,GAAG;AAED,cAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,cAAM,cAAc,aAAaA,aAAY;AAC7C,YAAI,gBAAgB,QAAW;AAC7B;AAAA,QACF;AAEA,cAAM,UAAU,YAAY,WAAW,SAAa,CAAC;AAErD,iBAASA,aAAY,IAAI;AACzB,mBAAW,QAAQ,SAAS,GAAG;AAC7B;AAAA,YACE;AAAA,YACA,EAAC,MAAM,OAAO,KAAI;AAAA,YAClB;AAAA,YACAA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,UAAU;AACb,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,eAAO,aAAa,QAAW,qBAAqB;AACpD,cAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,YAAI,OAAO,GAAG;AACZ,sBAAY,OAAO,QAAQ;AAE3B,sBAAY,YAAY,IAAI;AAAA,QAC9B,OAAO;AACL,sBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,QAClC;AAAA,MACF,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI;AAAA,UACnB;AAAA,UACA,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QACT;AACA,eAAO,OAAO,qBAAqB;AACnC,cAAM,KAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC;AAC1C,YAAI,OAAO,GAAG;AACZ,sBAAY,OAAO,KAAK,GAAG,CAAC;AAE5B,eAAK,OAAO,KAAK,CAAC;AAAA,QACpB,OAAO;AACL,sBAAY,IAAI,KAAK,GAAG,GAAG,KAAK,CAAC;AAAA,QACnC;AAAA,MACF;AAEA,mBAAa,OAAO,IAAI;AACxB;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,UAAI;AACJ,UAAI,UAAU;AACZ,qBAAa,YAAY,YAAY,CAAC;AACtC,mBAAW,YAAY,YAAY;AAAA,MACrC,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI;AAAA,UACnB;AAAA,UACA,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QACT;AACA,eAAO,OAAO,qBAAqB;AACnC,mBAAW,KAAK,GAAG;AAAA,MACrB;AAEA,YAAM,cAAc;AAAA,QAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,MACpD;AACA,YAAM,cAAc,OAAO,cAAc,OAAO,MAAM,gBAAgB;AACtE,UAAI,gBAAgB,QAAW;AAC7B;AAAA,UACE;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,QAAQ;AACX,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,oBAAY,QAAQ;AACpB,cAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,cAAM,WAAW;AAAA,UACf,GAAG;AAAA,UACH,GAAG,OAAO,KAAK;AAAA,QACjB;AACA,oBAAY,IAAI,UAAU,EAAE;AAC5B,oBAAY,OAAO,QAAQ;AAE3B,oBAAY,YAAY,IAAI;AAAA,MAC9B,OAAO;AACL,cAAM,OAAO,YAAY,YAAY;AACrC,wBAAgB,IAAI;AAEpB,YAAI,OAAO,YAAY,OAAO,QAAQ,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AACjE,gBAAM,EAAC,KAAK,MAAK,IAAI;AAAA,YACnB;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UACT;AACA,iBAAO,OAAO,sBAAsB;AACpC,gBAAM,KAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC;AAC1C,sBAAY,OAAO,KAAK,GAAG,CAAC;AAE5B,eAAK,GAAG,IAAI;AAAA,YACV,OAAO,KAAK;AAAA,YACZ,KAAK,GAAG;AAAA,YACR,OAAO;AAAA,UACT;AACA,sBAAY,IAAI,KAAK,GAAG,GAAG,EAAE;AAAA,QAC/B,OAAO;AAEL,gBAAM,EAAC,KAAK,MAAK,IAAI;AAAA,YACnB;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UACT;AACA,iBAAO,OAAO,sBAAsB;AACpC,gBAAM,WAAW,KAAK,GAAG;AACzB,gBAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,cAAI,OAAO,GAAG;AACZ,wBAAY,OAAO,QAAQ;AAE3B,iBAAK,OAAO,KAAK,CAAC;AAAA,UACpB,OAAO;AACL,wBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,UAClC;AAGA;AACE,kBAAM,EAAC,KAAAC,MAAK,OAAAC,OAAK,IAAI;AAAA,cACnB;AAAA,cACA,OAAO,KAAK;AAAA,cACZ,OAAO;AAAA,YACT;AACA,gBAAIC,MAAK;AACT,kBAAM,WAAW;AAAA,cACf,OAAO,KAAK;AAAA,cACZ;AAAA,cACA,OAAO;AAAA,YACT;AACA,gBAAI,cAAc;AAClB,gBAAID,QAAO;AAGT,4BAAc;AACd,oBAAM,WAAW,KAAKD,IAAG;AACzB,cAAAE,MAAK,KAAK,YAAY,IAAI,QAAQ,CAAC,IAAI;AACvC,0BAAY,OAAO,QAAQ;AAAA,YAC7B;AAEA,iBAAK,OAAOF,MAAK,aAAa,QAAQ;AACtC,wBAAY,IAAI,UAAUE,GAAE;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA;AACE,kBAAY,MAAM;AAAA,EACtB;AACF;AAGA,SAAS,aAAa,MAAiB,QAAe,YAAwB;AAC5E,MAAI,MAAM;AACV,MAAI,OAAO,KAAK,SAAS;AACzB,SAAO,OAAO,MAAM;AAClB,UAAM,MAAO,MAAM,SAAU;AAC7B,UAAM,aAAa,WAAW,KAAK,GAAG,GAAU,MAAa;AAC7D,QAAI,aAAa,GAAG;AAClB,YAAM,MAAM;AAAA,IACd,WAAW,aAAa,GAAG;AACzB,aAAO,MAAM;AAAA,IACf,OAAO;AACL,aAAO,EAAC,KAAK,KAAK,OAAO,KAAI;AAAA,IAC/B;AAAA,EACF;AACA,SAAO,EAAC,KAAK,KAAK,OAAO,MAAK;AAChC;AAEA,SAAS,+BACP,KACA,OACA,eACO;AACP,QAAM,SAAgB,EAAC,GAAG,IAAG;AAC7B,aAAW,gBAAgB,eAAe;AACxC,WAAO,EAAE,gBAAgB,MAAM,6BAA6B;AAE5D,WAAO,YAAY,IAAI,MAAM,YAAY;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,kBACP,aACA,cACW;AACX,QAAM,OAAO,YAAY,YAAY;AACrC,cAAY,IAAI;AAChB,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAoC;AAC3D,cAAY,CAAC;AACf;AAEA,SAAS,YAAY,GAAgC;AACnD,eAAa,CAAC;AAChB;",
|
|
6
|
-
"names": ["node", "relationship", "pos", "found", "rc"]
|
|
7
|
-
}
|