@dxos/echo-protocol 0.8.4-main.c1de068 → 0.8.4-main.c85a9c8dae
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/{browser → neutral}/index.mjs +370 -83
- package/dist/lib/neutral/index.mjs.map +7 -0
- package/dist/lib/neutral/meta.json +1 -0
- package/dist/types/src/document-structure.d.ts +15 -1
- package/dist/types/src/document-structure.d.ts.map +1 -1
- package/dist/types/src/echo-feed-codec.d.ts +17 -0
- package/dist/types/src/echo-feed-codec.d.ts.map +1 -0
- package/dist/types/src/foreign-key.d.ts +1 -1
- package/dist/types/src/foreign-key.d.ts.map +1 -1
- package/dist/types/src/index.d.ts +4 -3
- package/dist/types/src/index.d.ts.map +1 -1
- package/dist/types/src/query/ast.d.ts +194 -23
- package/dist/types/src/query/ast.d.ts.map +1 -1
- package/dist/types/src/reference.d.ts +1 -0
- package/dist/types/src/reference.d.ts.map +1 -1
- package/dist/types/tsconfig.tsbuildinfo +1 -1
- package/package.json +14 -11
- package/src/document-structure.ts +24 -2
- package/src/echo-feed-codec.ts +67 -0
- package/src/foreign-key.ts +4 -3
- package/src/index.ts +4 -3
- package/src/query/ast.ts +279 -34
- package/src/reference.ts +5 -2
- package/src/space-id.ts +1 -1
- 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 -525
- package/dist/lib/node-esm/index.mjs.map +0 -7
- package/dist/lib/node-esm/meta.json +0 -1
package/src/query/ast.ts
CHANGED
|
@@ -2,14 +2,15 @@
|
|
|
2
2
|
// Copyright 2025 DXOS.org
|
|
3
3
|
//
|
|
4
4
|
|
|
5
|
-
import
|
|
5
|
+
import * as Match from 'effect/Match';
|
|
6
|
+
import * as Schema from 'effect/Schema';
|
|
6
7
|
|
|
7
8
|
import { DXN, ObjectId } from '@dxos/keys';
|
|
8
9
|
|
|
9
10
|
import { ForeignKey } from '../foreign-key';
|
|
10
11
|
|
|
11
12
|
const TypenameSpecifier = Schema.Union(DXN.Schema, Schema.Null).annotations({
|
|
12
|
-
description: 'DXN or null
|
|
13
|
+
description: 'DXN or null; null matches any type',
|
|
13
14
|
});
|
|
14
15
|
|
|
15
16
|
// NOTE: This pattern with 3 definitions per schema is need to make the types opaque, and circular references in AST to not cause compiler errors.
|
|
@@ -46,6 +47,9 @@ const FilterObject_ = Schema.Struct({
|
|
|
46
47
|
export interface FilterObject extends Schema.Schema.Type<typeof FilterObject_> {}
|
|
47
48
|
export const FilterObject: Schema.Schema<FilterObject> = FilterObject_;
|
|
48
49
|
|
|
50
|
+
/**
|
|
51
|
+
* Compare.
|
|
52
|
+
*/
|
|
49
53
|
const FilterCompare_ = Schema.Struct({
|
|
50
54
|
type: Schema.Literal('compare'),
|
|
51
55
|
operator: Schema.Literal('eq', 'neq', 'gt', 'gte', 'lt', 'lte'),
|
|
@@ -54,6 +58,9 @@ const FilterCompare_ = Schema.Struct({
|
|
|
54
58
|
export interface FilterCompare extends Schema.Schema.Type<typeof FilterCompare_> {}
|
|
55
59
|
export const FilterCompare: Schema.Schema<FilterCompare> = FilterCompare_;
|
|
56
60
|
|
|
61
|
+
/**
|
|
62
|
+
* In.
|
|
63
|
+
*/
|
|
57
64
|
const FilterIn_ = Schema.Struct({
|
|
58
65
|
type: Schema.Literal('in'),
|
|
59
66
|
values: Schema.Array(Schema.Any),
|
|
@@ -61,53 +68,106 @@ const FilterIn_ = Schema.Struct({
|
|
|
61
68
|
export interface FilterIn extends Schema.Schema.Type<typeof FilterIn_> {}
|
|
62
69
|
export const FilterIn: Schema.Schema<FilterIn> = FilterIn_;
|
|
63
70
|
|
|
71
|
+
/**
|
|
72
|
+
* Contains.
|
|
73
|
+
*/
|
|
74
|
+
const FilterContains_ = Schema.Struct({
|
|
75
|
+
type: Schema.Literal('contains'),
|
|
76
|
+
value: Schema.Any,
|
|
77
|
+
});
|
|
78
|
+
|
|
79
|
+
export interface FilterContains extends Schema.Schema.Type<typeof FilterContains_> {}
|
|
80
|
+
|
|
81
|
+
/**
|
|
82
|
+
* Predicate for an array property to contain the provided value.
|
|
83
|
+
* Nested objects are matched using strict structural matching.
|
|
84
|
+
*/
|
|
85
|
+
export const FilterContains: Schema.Schema<FilterContains> = FilterContains_;
|
|
86
|
+
|
|
87
|
+
/**
|
|
88
|
+
* Filters objects that have certain tag.
|
|
89
|
+
*/
|
|
90
|
+
const FilterTag_ = Schema.Struct({
|
|
91
|
+
type: Schema.Literal('tag'),
|
|
92
|
+
tag: Schema.String, // TODO(burdon): Make OR-collection?
|
|
93
|
+
});
|
|
94
|
+
|
|
95
|
+
export interface FilterTag extends Schema.Schema.Type<typeof FilterTag_> {}
|
|
96
|
+
export const FilterTag: Schema.Schema<FilterTag> = FilterTag_;
|
|
97
|
+
|
|
98
|
+
/**
|
|
99
|
+
* Range.
|
|
100
|
+
*/
|
|
64
101
|
const FilterRange_ = Schema.Struct({
|
|
65
102
|
type: Schema.Literal('range'),
|
|
66
103
|
from: Schema.Any,
|
|
67
104
|
to: Schema.Any,
|
|
68
105
|
});
|
|
106
|
+
|
|
69
107
|
export interface FilterRange extends Schema.Schema.Type<typeof FilterRange_> {}
|
|
70
108
|
export const FilterRange: Schema.Schema<FilterRange> = FilterRange_;
|
|
71
109
|
|
|
110
|
+
/**
|
|
111
|
+
* Text search.
|
|
112
|
+
*/
|
|
72
113
|
const FilterTextSearch_ = Schema.Struct({
|
|
73
114
|
type: Schema.Literal('text-search'),
|
|
74
115
|
text: Schema.String,
|
|
75
116
|
searchKind: Schema.optional(Schema.Literal('full-text', 'vector')),
|
|
76
117
|
});
|
|
118
|
+
|
|
77
119
|
export interface FilterTextSearch extends Schema.Schema.Type<typeof FilterTextSearch_> {}
|
|
78
120
|
export const FilterTextSearch: Schema.Schema<FilterTextSearch> = FilterTextSearch_;
|
|
79
121
|
|
|
122
|
+
/**
|
|
123
|
+
* Not.
|
|
124
|
+
*/
|
|
80
125
|
const FilterNot_ = Schema.Struct({
|
|
81
126
|
type: Schema.Literal('not'),
|
|
82
127
|
filter: Schema.suspend(() => Filter),
|
|
83
128
|
});
|
|
129
|
+
|
|
84
130
|
export interface FilterNot extends Schema.Schema.Type<typeof FilterNot_> {}
|
|
85
131
|
export const FilterNot: Schema.Schema<FilterNot> = FilterNot_;
|
|
86
132
|
|
|
133
|
+
/**
|
|
134
|
+
* And.
|
|
135
|
+
*/
|
|
87
136
|
const FilterAnd_ = Schema.Struct({
|
|
88
137
|
type: Schema.Literal('and'),
|
|
89
138
|
filters: Schema.Array(Schema.suspend(() => Filter)),
|
|
90
139
|
});
|
|
140
|
+
|
|
91
141
|
export interface FilterAnd extends Schema.Schema.Type<typeof FilterAnd_> {}
|
|
92
142
|
export const FilterAnd: Schema.Schema<FilterAnd> = FilterAnd_;
|
|
93
143
|
|
|
144
|
+
/**
|
|
145
|
+
* Or.
|
|
146
|
+
*/
|
|
94
147
|
const FilterOr_ = Schema.Struct({
|
|
95
148
|
type: Schema.Literal('or'),
|
|
96
149
|
filters: Schema.Array(Schema.suspend(() => Filter)),
|
|
97
150
|
});
|
|
151
|
+
|
|
98
152
|
export interface FilterOr extends Schema.Schema.Type<typeof FilterOr_> {}
|
|
99
153
|
export const FilterOr: Schema.Schema<FilterOr> = FilterOr_;
|
|
100
154
|
|
|
155
|
+
/**
|
|
156
|
+
* Union of filters.
|
|
157
|
+
*/
|
|
101
158
|
export const Filter = Schema.Union(
|
|
102
159
|
FilterObject,
|
|
103
|
-
FilterTextSearch,
|
|
104
160
|
FilterCompare,
|
|
105
161
|
FilterIn,
|
|
162
|
+
FilterContains,
|
|
163
|
+
FilterTag,
|
|
106
164
|
FilterRange,
|
|
165
|
+
FilterTextSearch,
|
|
107
166
|
FilterNot,
|
|
108
167
|
FilterAnd,
|
|
109
168
|
FilterOr,
|
|
110
|
-
);
|
|
169
|
+
).annotations({ identifier: 'dxos.org/schema/Filter' });
|
|
170
|
+
|
|
111
171
|
export type Filter = Schema.Schema.Type<typeof Filter>;
|
|
112
172
|
|
|
113
173
|
/**
|
|
@@ -117,6 +177,7 @@ const QuerySelectClause_ = Schema.Struct({
|
|
|
117
177
|
type: Schema.Literal('select'),
|
|
118
178
|
filter: Schema.suspend(() => Filter),
|
|
119
179
|
});
|
|
180
|
+
|
|
120
181
|
export interface QuerySelectClause extends Schema.Schema.Type<typeof QuerySelectClause_> {}
|
|
121
182
|
export const QuerySelectClause: Schema.Schema<QuerySelectClause> = QuerySelectClause_;
|
|
122
183
|
|
|
@@ -128,6 +189,7 @@ const QueryFilterClause_ = Schema.Struct({
|
|
|
128
189
|
selection: Schema.suspend(() => Query),
|
|
129
190
|
filter: Schema.suspend(() => Filter),
|
|
130
191
|
});
|
|
192
|
+
|
|
131
193
|
export interface QueryFilterClause extends Schema.Schema.Type<typeof QueryFilterClause_> {}
|
|
132
194
|
export const QueryFilterClause: Schema.Schema<QueryFilterClause> = QueryFilterClause_;
|
|
133
195
|
|
|
@@ -139,6 +201,7 @@ const QueryReferenceTraversalClause_ = Schema.Struct({
|
|
|
139
201
|
anchor: Schema.suspend(() => Query),
|
|
140
202
|
property: Schema.String, // TODO(dmaretskyi): Change to EscapedPropPath.
|
|
141
203
|
});
|
|
204
|
+
|
|
142
205
|
export interface QueryReferenceTraversalClause extends Schema.Schema.Type<typeof QueryReferenceTraversalClause_> {}
|
|
143
206
|
export const QueryReferenceTraversalClause: Schema.Schema<QueryReferenceTraversalClause> =
|
|
144
207
|
QueryReferenceTraversalClause_;
|
|
@@ -149,9 +212,14 @@ export const QueryReferenceTraversalClause: Schema.Schema<QueryReferenceTraversa
|
|
|
149
212
|
const QueryIncomingReferencesClause_ = Schema.Struct({
|
|
150
213
|
type: Schema.Literal('incoming-references'),
|
|
151
214
|
anchor: Schema.suspend(() => Query),
|
|
152
|
-
|
|
215
|
+
/**
|
|
216
|
+
* Property path where the reference is located.
|
|
217
|
+
* If null, matches references from any property.
|
|
218
|
+
*/
|
|
219
|
+
property: Schema.NullOr(Schema.String),
|
|
153
220
|
typename: TypenameSpecifier,
|
|
154
221
|
});
|
|
222
|
+
|
|
155
223
|
export interface QueryIncomingReferencesClause extends Schema.Schema.Type<typeof QueryIncomingReferencesClause_> {}
|
|
156
224
|
export const QueryIncomingReferencesClause: Schema.Schema<QueryIncomingReferencesClause> =
|
|
157
225
|
QueryIncomingReferencesClause_;
|
|
@@ -170,6 +238,7 @@ const QueryRelationClause_ = Schema.Struct({
|
|
|
170
238
|
direction: Schema.Literal('outgoing', 'incoming', 'both'),
|
|
171
239
|
filter: Schema.optional(Schema.suspend(() => Filter)),
|
|
172
240
|
});
|
|
241
|
+
|
|
173
242
|
export interface QueryRelationClause extends Schema.Schema.Type<typeof QueryRelationClause_> {}
|
|
174
243
|
export const QueryRelationClause: Schema.Schema<QueryRelationClause> = QueryRelationClause_;
|
|
175
244
|
|
|
@@ -181,9 +250,27 @@ const QueryRelationTraversalClause_ = Schema.Struct({
|
|
|
181
250
|
anchor: Schema.suspend(() => Query),
|
|
182
251
|
direction: Schema.Literal('source', 'target', 'both'),
|
|
183
252
|
});
|
|
253
|
+
|
|
184
254
|
export interface QueryRelationTraversalClause extends Schema.Schema.Type<typeof QueryRelationTraversalClause_> {}
|
|
185
255
|
export const QueryRelationTraversalClause: Schema.Schema<QueryRelationTraversalClause> = QueryRelationTraversalClause_;
|
|
186
256
|
|
|
257
|
+
/**
|
|
258
|
+
* Traverse parent-child hierarchy.
|
|
259
|
+
*/
|
|
260
|
+
const QueryHierarchyTraversalClause_ = Schema.Struct({
|
|
261
|
+
type: Schema.Literal('hierarchy-traversal'),
|
|
262
|
+
anchor: Schema.suspend(() => Query),
|
|
263
|
+
/**
|
|
264
|
+
* to-parent: traverse from child to parent.
|
|
265
|
+
* to-children: traverse from parent to children.
|
|
266
|
+
*/
|
|
267
|
+
direction: Schema.Literal('to-parent', 'to-children'),
|
|
268
|
+
});
|
|
269
|
+
|
|
270
|
+
export interface QueryHierarchyTraversalClause extends Schema.Schema.Type<typeof QueryHierarchyTraversalClause_> {}
|
|
271
|
+
export const QueryHierarchyTraversalClause: Schema.Schema<QueryHierarchyTraversalClause> =
|
|
272
|
+
QueryHierarchyTraversalClause_;
|
|
273
|
+
|
|
187
274
|
/**
|
|
188
275
|
* Union of multiple queries.
|
|
189
276
|
*/
|
|
@@ -191,6 +278,7 @@ const QueryUnionClause_ = Schema.Struct({
|
|
|
191
278
|
type: Schema.Literal('union'),
|
|
192
279
|
queries: Schema.Array(Schema.suspend(() => Query)),
|
|
193
280
|
});
|
|
281
|
+
|
|
194
282
|
export interface QueryUnionClause extends Schema.Schema.Type<typeof QueryUnionClause_> {}
|
|
195
283
|
export const QueryUnionClause: Schema.Schema<QueryUnionClause> = QueryUnionClause_;
|
|
196
284
|
|
|
@@ -202,9 +290,47 @@ const QuerySetDifferenceClause_ = Schema.Struct({
|
|
|
202
290
|
source: Schema.suspend(() => Query),
|
|
203
291
|
exclude: Schema.suspend(() => Query),
|
|
204
292
|
});
|
|
293
|
+
|
|
205
294
|
export interface QuerySetDifferenceClause extends Schema.Schema.Type<typeof QuerySetDifferenceClause_> {}
|
|
206
295
|
export const QuerySetDifferenceClause: Schema.Schema<QuerySetDifferenceClause> = QuerySetDifferenceClause_;
|
|
207
296
|
|
|
297
|
+
export const OrderDirection = Schema.Literal('asc', 'desc');
|
|
298
|
+
export type OrderDirection = Schema.Schema.Type<typeof OrderDirection>;
|
|
299
|
+
|
|
300
|
+
const Order_ = Schema.Union(
|
|
301
|
+
Schema.Struct({
|
|
302
|
+
// How database wants to order them (in practice - by id).
|
|
303
|
+
kind: Schema.Literal('natural'),
|
|
304
|
+
}),
|
|
305
|
+
Schema.Struct({
|
|
306
|
+
kind: Schema.Literal('property'),
|
|
307
|
+
property: Schema.String,
|
|
308
|
+
direction: OrderDirection,
|
|
309
|
+
}),
|
|
310
|
+
Schema.Struct({
|
|
311
|
+
// Order by relevance rank (for FTS/vector search results).
|
|
312
|
+
// Default direction is 'desc' (higher rank = better match first).
|
|
313
|
+
kind: Schema.Literal('rank'),
|
|
314
|
+
direction: OrderDirection,
|
|
315
|
+
}),
|
|
316
|
+
);
|
|
317
|
+
|
|
318
|
+
export type Order = Schema.Schema.Type<typeof Order_>;
|
|
319
|
+
export const Order: Schema.Schema<Order> = Order_;
|
|
320
|
+
|
|
321
|
+
/**
|
|
322
|
+
* Order the query results.
|
|
323
|
+
* Left-to-right the orders dominate.
|
|
324
|
+
*/
|
|
325
|
+
const QueryOrderClause_ = Schema.Struct({
|
|
326
|
+
type: Schema.Literal('order'),
|
|
327
|
+
query: Schema.suspend(() => Query),
|
|
328
|
+
order: Schema.Array(Order),
|
|
329
|
+
});
|
|
330
|
+
|
|
331
|
+
export interface QueryOrderClause extends Schema.Schema.Type<typeof QueryOrderClause_> {}
|
|
332
|
+
export const QueryOrderClause: Schema.Schema<QueryOrderClause> = QueryOrderClause_;
|
|
333
|
+
|
|
208
334
|
/**
|
|
209
335
|
* Add options to a query.
|
|
210
336
|
*/
|
|
@@ -213,9 +339,37 @@ const QueryOptionsClause_ = Schema.Struct({
|
|
|
213
339
|
query: Schema.suspend(() => Query),
|
|
214
340
|
options: Schema.suspend(() => QueryOptions),
|
|
215
341
|
});
|
|
342
|
+
|
|
216
343
|
export interface QueryOptionsClause extends Schema.Schema.Type<typeof QueryOptionsClause_> {}
|
|
217
344
|
export const QueryOptionsClause: Schema.Schema<QueryOptionsClause> = QueryOptionsClause_;
|
|
218
345
|
|
|
346
|
+
/**
|
|
347
|
+
* Limit the number of results.
|
|
348
|
+
*/
|
|
349
|
+
const QueryLimitClause_ = Schema.Struct({
|
|
350
|
+
type: Schema.Literal('limit'),
|
|
351
|
+
query: Schema.suspend(() => Query),
|
|
352
|
+
limit: Schema.Number,
|
|
353
|
+
});
|
|
354
|
+
|
|
355
|
+
export interface QueryLimitClause extends Schema.Schema.Type<typeof QueryLimitClause_> {}
|
|
356
|
+
export const QueryLimitClause: Schema.Schema<QueryLimitClause> = QueryLimitClause_;
|
|
357
|
+
|
|
358
|
+
export const QueryFromClause_ = Schema.Struct({
|
|
359
|
+
type: Schema.Literal('from'),
|
|
360
|
+
query: Schema.suspend(() => Query),
|
|
361
|
+
from: Schema.Union(
|
|
362
|
+
Schema.TaggedStruct('scope', {
|
|
363
|
+
scope: Schema.suspend(() => Scope),
|
|
364
|
+
}),
|
|
365
|
+
Schema.TaggedStruct('query', {
|
|
366
|
+
query: Schema.suspend(() => Query),
|
|
367
|
+
}),
|
|
368
|
+
),
|
|
369
|
+
});
|
|
370
|
+
export interface QueryFromClause extends Schema.Schema.Type<typeof QueryFromClause_> {}
|
|
371
|
+
export const QueryFromClause: Schema.Schema<QueryFromClause> = QueryFromClause_;
|
|
372
|
+
|
|
219
373
|
const Query_ = Schema.Union(
|
|
220
374
|
QuerySelectClause,
|
|
221
375
|
QueryFilterClause,
|
|
@@ -223,46 +377,137 @@ const Query_ = Schema.Union(
|
|
|
223
377
|
QueryIncomingReferencesClause,
|
|
224
378
|
QueryRelationClause,
|
|
225
379
|
QueryRelationTraversalClause,
|
|
380
|
+
QueryHierarchyTraversalClause,
|
|
226
381
|
QueryUnionClause,
|
|
227
382
|
QuerySetDifferenceClause,
|
|
383
|
+
QueryOrderClause,
|
|
228
384
|
QueryOptionsClause,
|
|
229
|
-
|
|
385
|
+
QueryLimitClause,
|
|
386
|
+
QueryFromClause,
|
|
387
|
+
).annotations({ identifier: 'dxos.org/schema/Query' });
|
|
230
388
|
|
|
231
389
|
export type Query = Schema.Schema.Type<typeof Query_>;
|
|
232
390
|
export const Query: Schema.Schema<Query> = Query_;
|
|
233
391
|
|
|
234
392
|
export const QueryOptions = Schema.Struct({
|
|
235
|
-
|
|
393
|
+
/**
|
|
394
|
+
* Nested select statements will use this option to filter deleted objects.
|
|
395
|
+
*/
|
|
236
396
|
deleted: Schema.optional(Schema.Literal('include', 'exclude', 'only')),
|
|
237
397
|
});
|
|
398
|
+
|
|
238
399
|
export interface QueryOptions extends Schema.Schema.Type<typeof QueryOptions> {}
|
|
239
400
|
|
|
401
|
+
/**
|
|
402
|
+
* Specifies the scope of the data to query from.
|
|
403
|
+
*/
|
|
404
|
+
export const Scope = Schema.Struct({
|
|
405
|
+
/**
|
|
406
|
+
* The nested select statemets will select from the given spaces.
|
|
407
|
+
*
|
|
408
|
+
* NOTE: Spaces and queues are unioned together if both are specified.
|
|
409
|
+
*/
|
|
410
|
+
spaceIds: Schema.optional(Schema.Array(Schema.String)),
|
|
411
|
+
|
|
412
|
+
/**
|
|
413
|
+
* If true, the nested select statements will select from all queues in the spaces specified by `spaceIds`.
|
|
414
|
+
*/
|
|
415
|
+
allQueuesFromSpaces: Schema.optional(Schema.Boolean),
|
|
416
|
+
|
|
417
|
+
/**
|
|
418
|
+
* The nested select statemets will select from the given queues.
|
|
419
|
+
*
|
|
420
|
+
* NOTE: Spaces and queues are unioned together if both are specified.
|
|
421
|
+
*/
|
|
422
|
+
queues: Schema.optional(Schema.Array(DXN.Schema)),
|
|
423
|
+
});
|
|
424
|
+
export interface Scope extends Schema.Schema.Type<typeof Scope> {}
|
|
425
|
+
|
|
240
426
|
export const visit = (query: Query, visitor: (node: Query) => void) => {
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
|
|
247
|
-
|
|
248
|
-
|
|
249
|
-
|
|
250
|
-
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
261
|
-
|
|
262
|
-
|
|
263
|
-
|
|
264
|
-
|
|
265
|
-
|
|
266
|
-
|
|
267
|
-
|
|
427
|
+
visitor(query);
|
|
428
|
+
|
|
429
|
+
Match.value(query).pipe(
|
|
430
|
+
Match.when({ type: 'filter' }, ({ selection }) => visit(selection, visitor)),
|
|
431
|
+
Match.when({ type: 'reference-traversal' }, ({ anchor }) => visit(anchor, visitor)),
|
|
432
|
+
Match.when({ type: 'incoming-references' }, ({ anchor }) => visit(anchor, visitor)),
|
|
433
|
+
Match.when({ type: 'relation' }, ({ anchor }) => visit(anchor, visitor)),
|
|
434
|
+
Match.when({ type: 'options' }, ({ query }) => visit(query, visitor)),
|
|
435
|
+
Match.when({ type: 'relation-traversal' }, ({ anchor }) => visit(anchor, visitor)),
|
|
436
|
+
Match.when({ type: 'hierarchy-traversal' }, ({ anchor }) => visit(anchor, visitor)),
|
|
437
|
+
Match.when({ type: 'union' }, ({ queries }) => queries.forEach((q) => visit(q, visitor))),
|
|
438
|
+
Match.when({ type: 'set-difference' }, ({ source, exclude }) => {
|
|
439
|
+
visit(source, visitor);
|
|
440
|
+
visit(exclude, visitor);
|
|
441
|
+
}),
|
|
442
|
+
Match.when({ type: 'order' }, ({ query }) => visit(query, visitor)),
|
|
443
|
+
Match.when({ type: 'limit' }, ({ query }) => visit(query, visitor)),
|
|
444
|
+
Match.when({ type: 'from' }, (node) => {
|
|
445
|
+
visit(node.query, visitor);
|
|
446
|
+
if (node.from._tag === 'query') {
|
|
447
|
+
visit(node.from.query, visitor);
|
|
448
|
+
}
|
|
449
|
+
}),
|
|
450
|
+
Match.when({ type: 'select' }, () => {}),
|
|
451
|
+
Match.exhaustive,
|
|
452
|
+
);
|
|
453
|
+
};
|
|
454
|
+
|
|
455
|
+
/**
|
|
456
|
+
* Recursively transforms a query tree bottom-up.
|
|
457
|
+
* The mapper receives each node with its children already transformed.
|
|
458
|
+
*/
|
|
459
|
+
export const map = (query: Query, mapper: (node: Query) => Query): Query => {
|
|
460
|
+
const mapped: Query = Match.value(query).pipe(
|
|
461
|
+
Match.when({ type: 'filter' }, (node) => ({ ...node, selection: map(node.selection, mapper) })),
|
|
462
|
+
Match.when({ type: 'reference-traversal' }, (node) => ({ ...node, anchor: map(node.anchor, mapper) })),
|
|
463
|
+
Match.when({ type: 'incoming-references' }, (node) => ({ ...node, anchor: map(node.anchor, mapper) })),
|
|
464
|
+
Match.when({ type: 'relation' }, (node) => ({ ...node, anchor: map(node.anchor, mapper) })),
|
|
465
|
+
Match.when({ type: 'relation-traversal' }, (node) => ({ ...node, anchor: map(node.anchor, mapper) })),
|
|
466
|
+
Match.when({ type: 'hierarchy-traversal' }, (node) => ({ ...node, anchor: map(node.anchor, mapper) })),
|
|
467
|
+
Match.when({ type: 'options' }, (node) => ({ ...node, query: map(node.query, mapper) })),
|
|
468
|
+
Match.when({ type: 'order' }, (node) => ({ ...node, query: map(node.query, mapper) })),
|
|
469
|
+
Match.when({ type: 'limit' }, (node) => ({ ...node, query: map(node.query, mapper) })),
|
|
470
|
+
Match.when({ type: 'from' }, (node) => ({
|
|
471
|
+
...node,
|
|
472
|
+
query: map(node.query, mapper),
|
|
473
|
+
...(node.from._tag === 'query' ? { from: { _tag: 'query' as const, query: map(node.from.query, mapper) } } : {}),
|
|
474
|
+
})),
|
|
475
|
+
Match.when({ type: 'union' }, (node) => ({ ...node, queries: node.queries.map((q) => map(q, mapper)) })),
|
|
476
|
+
Match.when({ type: 'set-difference' }, (node) => ({
|
|
477
|
+
...node,
|
|
478
|
+
source: map(node.source, mapper),
|
|
479
|
+
exclude: map(node.exclude, mapper),
|
|
480
|
+
})),
|
|
481
|
+
Match.when({ type: 'select' }, (node) => node),
|
|
482
|
+
Match.exhaustive,
|
|
483
|
+
);
|
|
484
|
+
return mapper(mapped);
|
|
485
|
+
};
|
|
486
|
+
|
|
487
|
+
export const fold = <T>(query: Query, reducer: (node: Query) => T): T[] => {
|
|
488
|
+
return Match.value(query).pipe(
|
|
489
|
+
Match.withReturnType<T[]>(),
|
|
490
|
+
Match.when({ type: 'filter' }, ({ selection }) => fold(selection, reducer)),
|
|
491
|
+
Match.when({ type: 'reference-traversal' }, ({ anchor }) => fold(anchor, reducer)),
|
|
492
|
+
Match.when({ type: 'incoming-references' }, ({ anchor }) => fold(anchor, reducer)),
|
|
493
|
+
Match.when({ type: 'relation' }, ({ anchor }) => fold(anchor, reducer)),
|
|
494
|
+
Match.when({ type: 'options' }, ({ query }) => fold(query, reducer)),
|
|
495
|
+
Match.when({ type: 'relation-traversal' }, ({ anchor }) => fold(anchor, reducer)),
|
|
496
|
+
Match.when({ type: 'hierarchy-traversal' }, ({ anchor }) => fold(anchor, reducer)),
|
|
497
|
+
Match.when({ type: 'union' }, ({ queries }) => queries.flatMap((q) => fold(q, reducer))),
|
|
498
|
+
Match.when({ type: 'set-difference' }, ({ source, exclude }) =>
|
|
499
|
+
fold(source, reducer).concat(fold(exclude, reducer)),
|
|
500
|
+
),
|
|
501
|
+
Match.when({ type: 'order' }, ({ query }) => fold(query, reducer)),
|
|
502
|
+
Match.when({ type: 'limit' }, ({ query }) => fold(query, reducer)),
|
|
503
|
+
Match.when({ type: 'from' }, (node) => {
|
|
504
|
+
const results = fold(node.query, reducer);
|
|
505
|
+
if (node.from._tag === 'query') {
|
|
506
|
+
return results.concat(fold(node.from.query, reducer));
|
|
507
|
+
}
|
|
508
|
+
return results;
|
|
509
|
+
}),
|
|
510
|
+
Match.when({ type: 'select' }, () => []),
|
|
511
|
+
Match.exhaustive,
|
|
512
|
+
);
|
|
268
513
|
};
|
package/src/reference.ts
CHANGED
|
@@ -170,13 +170,16 @@ export const isEncodedReference = (value: any): value is EncodedReference =>
|
|
|
170
170
|
export const EncodedReference = Object.freeze({
|
|
171
171
|
isEncodedReference,
|
|
172
172
|
getReferenceString: (value: EncodedReference): string => {
|
|
173
|
-
assertArgument(isEncodedReference(value), 'invalid reference');
|
|
173
|
+
assertArgument(isEncodedReference(value), 'value', 'invalid reference');
|
|
174
174
|
return value['/'];
|
|
175
175
|
},
|
|
176
176
|
toDXN: (value: EncodedReference): DXN => {
|
|
177
177
|
return DXN.parse(EncodedReference.getReferenceString(value));
|
|
178
178
|
},
|
|
179
179
|
fromDXN: (dxn: DXN): EncodedReference => {
|
|
180
|
-
return
|
|
180
|
+
return { '/': dxn.toString() };
|
|
181
|
+
},
|
|
182
|
+
fromLegacyTypename: (typename: string): EncodedReference => {
|
|
183
|
+
return { '/': DXN.fromTypename(typename).toString() };
|
|
181
184
|
},
|
|
182
185
|
});
|
package/src/space-id.ts
CHANGED
|
@@ -18,7 +18,7 @@ export const createIdFromSpaceKey = async (spaceKey: PublicKey): Promise<SpaceId
|
|
|
18
18
|
return cachedValue;
|
|
19
19
|
}
|
|
20
20
|
|
|
21
|
-
const digest = await subtleCrypto.digest('SHA-256', spaceKey.asUint8Array());
|
|
21
|
+
const digest = await subtleCrypto.digest('SHA-256', spaceKey.asUint8Array() as Uint8Array<ArrayBuffer>);
|
|
22
22
|
|
|
23
23
|
const bytes = new Uint8Array(digest).slice(0, SpaceId.byteLength);
|
|
24
24
|
const spaceId = SpaceId.encode(bytes);
|
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
{
|
|
2
|
-
"version": 3,
|
|
3
|
-
"sources": ["../../../src/document-structure.ts", "../../../src/reference.ts", "../../../src/space-doc-version.ts", "../../../src/space-id.ts", "../../../src/foreign-key.ts", "../../../src/query/ast.ts"],
|
|
4
|
-
"sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { invariant } from '@dxos/invariant';\nimport type { DXN, ObjectId } from '@dxos/keys';\nimport { visitValues } from '@dxos/util';\n\nimport { type RawString } from './automerge';\nimport type { ForeignKey } from './foreign-key';\nimport { isEncodedReference, type EncodedReference } from './reference';\nimport { type SpaceDocVersion } from './space-doc-version';\n\nexport type SpaceState = {\n // Url of the root automerge document.\n rootUrl?: string;\n};\n\n/**\n * Array indexes get converted to strings.\n */\nexport type ObjectProp = string;\nexport type ObjectPropPath = ObjectProp[];\n\n/**\n * Link to all documents that hold objects in the space.\n */\nexport interface DatabaseDirectory {\n version?: SpaceDocVersion;\n\n access?: {\n spaceKey: string;\n };\n /**\n * Objects inlined in the current document.\n */\n objects?: {\n [id: string]: ObjectStructure;\n };\n /**\n * Object id points to an automerge doc url where the object is embedded.\n */\n links?: {\n [echoId: string]: string | RawString;\n };\n\n /**\n * @deprecated\n * For backward compatibility.\n */\n experimental_spaceKey?: string;\n}\n\nexport const DatabaseDirectory = Object.freeze({\n /**\n * @returns Space key in hex of the space that owns the document. In hex format. Without 0x prefix.\n */\n getSpaceKey: (doc: DatabaseDirectory): string | null => {\n // experimental_spaceKey is set on old documents, new ones are created with doc.access.spaceKey\n const rawSpaceKey = doc.access?.spaceKey ?? doc.experimental_spaceKey;\n if (rawSpaceKey == null) {\n return null;\n }\n\n const rawKey = String(rawSpaceKey);\n invariant(!rawKey.startsWith('0x'), 'Space key must not start with 0x');\n return rawKey;\n },\n\n getInlineObject: (doc: DatabaseDirectory, id: ObjectId): ObjectStructure | undefined => {\n return doc.objects?.[id];\n },\n\n getLink: (doc: DatabaseDirectory, id: ObjectId): string | undefined => {\n return doc.links?.[id]?.toString();\n },\n\n make: ({\n spaceKey,\n objects,\n links,\n }: {\n spaceKey: string;\n objects?: Record<string, ObjectStructure>;\n links?: Record<string, RawString>;\n }): DatabaseDirectory => ({\n access: {\n spaceKey,\n },\n objects: objects ?? {},\n links: links ?? {},\n }),\n});\n\n/**\n * Representation of an ECHO object in an AM document.\n */\nexport type ObjectStructure = {\n // TODO(dmaretskyi): Missing in some cases.\n system?: ObjectSystem;\n\n meta: ObjectMeta;\n /**\n * User-defined data.\n * Adheres to schema in `system.type`\n */\n data: Record<string, any>;\n};\n\n// Helper methods to interact with the {@link ObjectStructure}.\nexport const ObjectStructure = Object.freeze({\n /**\n * @throws On invalid object structure.\n */\n getTypeReference: (object: ObjectStructure): EncodedReference | undefined => {\n return object.system?.type;\n },\n\n /**\n * @throws On invalid object structure.\n */\n getEntityKind: (object: ObjectStructure): 'object' | 'relation' => {\n const kind = object.system?.kind ?? 'object';\n invariant(kind === 'object' || kind === 'relation', 'Invalid kind');\n return kind;\n },\n\n isDeleted: (object: ObjectStructure): boolean => {\n return object.system?.deleted ?? false;\n },\n\n getRelationSource: (object: ObjectStructure): EncodedReference | undefined => {\n return object.system?.source;\n },\n\n getRelationTarget: (object: ObjectStructure): EncodedReference | undefined => {\n return object.system?.target;\n },\n\n /**\n * @returns All references in the data section of the object.\n */\n getAllOutgoingReferences: (object: ObjectStructure): { path: ObjectPropPath; reference: EncodedReference }[] => {\n const references: { path: ObjectPropPath; reference: EncodedReference }[] = [];\n const visit = (path: ObjectPropPath, value: unknown) => {\n if (isEncodedReference(value)) {\n references.push({ path, reference: value });\n } else {\n visitValues(value, (value, key) => visit([...path, String(key)], value));\n }\n };\n visitValues(object.data, (value, key) => visit([String(key)], value));\n return references;\n },\n\n makeObject: ({\n type,\n data,\n keys,\n }: {\n type: DXN.String;\n deleted?: boolean;\n keys?: ForeignKey[];\n data?: unknown;\n }): ObjectStructure => {\n return {\n system: {\n kind: 'object',\n type: { '/': type },\n },\n meta: {\n keys: keys ?? [],\n },\n data: data ?? {},\n };\n },\n\n makeRelation: ({\n type,\n source,\n target,\n deleted,\n keys,\n data,\n }: {\n type: DXN.String;\n source: EncodedReference;\n target: EncodedReference;\n deleted?: boolean;\n keys?: ForeignKey[];\n data?: unknown;\n }): ObjectStructure => {\n return {\n system: {\n kind: 'relation',\n type: { '/': type },\n source,\n target,\n deleted: deleted ?? false,\n },\n meta: {\n keys: keys ?? [],\n },\n data: data ?? {},\n };\n },\n});\n\n/**\n * Echo object metadata.\n */\nexport type ObjectMeta = {\n /**\n * Foreign keys.\n */\n keys: ForeignKey[];\n};\n\n/**\n * Automerge object system properties.\n * (Is automerge specific.)\n */\nexport type ObjectSystem = {\n /**\n * Entity kind.\n */\n kind?: 'object' | 'relation';\n\n /**\n * Object reference ('protobuf' protocol) type.\n */\n type?: EncodedReference;\n\n /**\n * Deletion marker.\n */\n deleted?: boolean;\n\n /**\n * Only for relations.\n */\n source?: EncodedReference;\n\n /**\n * Only for relations.w\n */\n target?: EncodedReference;\n};\n\n/**\n * Id property name.\n */\nexport const PROPERTY_ID = 'id';\n\n/**\n * Data namespace.\n * The key on {@link ObjectStructure} that contains the user-defined data.\n */\nexport const DATA_NAMESPACE = 'data';\n", "//\n// Copyright 2022 DXOS.org\n//\n\nimport { assertArgument } from '@dxos/invariant';\nimport { DXN, LOCAL_SPACE_TAG, type PublicKey } from '@dxos/keys';\nimport { type ObjectId } from '@dxos/protocols';\nimport { type Reference as ReferenceProto } from '@dxos/protocols/proto/dxos/echo/model/document';\n\n/**\n * Runtime representation of an reference in ECHO.\n * Implemented as a DXN, but we might extend it to other URIs in the future.\n * @deprecated Use `EncodedReference` instead.\n */\nexport class Reference {\n /**\n * Protocol references to runtime registered types.\n * @deprecated\n */\n static TYPE_PROTOCOL = 'protobuf';\n\n static fromDXN(dxn: DXN): Reference {\n switch (dxn.kind) {\n case DXN.kind.TYPE:\n return new Reference(dxn.parts[0], Reference.TYPE_PROTOCOL, 'dxos.org', dxn);\n case DXN.kind.ECHO:\n if (dxn.parts[0] === LOCAL_SPACE_TAG) {\n return new Reference(dxn.parts[1], undefined, undefined, dxn);\n } else {\n return new Reference(dxn.parts[1], undefined, dxn.parts[0], dxn);\n }\n default:\n return new Reference(dxn.parts[0], undefined, dxn.parts[0], dxn);\n }\n }\n\n static fromValue(value: ReferenceProto): Reference {\n return new Reference(value.objectId, value.protocol, value.host);\n }\n\n /**\n * Reference an object in the local space.\n */\n static localObjectReference(objectId: ObjectId): Reference {\n return new Reference(objectId);\n }\n\n /**\n * @deprecated\n */\n // TODO(dmaretskyi): Remove.\n static fromLegacyTypename(type: string): Reference {\n return new Reference(type, Reference.TYPE_PROTOCOL, 'dxos.org');\n }\n\n /**\n * @deprecated\n */\n // TODO(dmaretskyi): Remove\n static fromObjectIdAndSpaceKey(objectId: ObjectId, spaceKey: PublicKey): Reference {\n // TODO(dmaretskyi): FIX ME! This should be a space ID not a space key.\n return new Reference(objectId, undefined, spaceKey.toHex());\n }\n\n // prettier-ignore\n private constructor(\n // TODO(dmaretskyi): Remove and just leave DXN.\n private readonly _objectId: ObjectId,\n private readonly _protocol?: string,\n private readonly _host?: string,\n private readonly _dxn?: DXN,\n ) {}\n\n get dxn(): DXN | undefined {\n return this._dxn;\n }\n\n /**\n * @deprecated\n */\n // TODO(dmaretskyi): Remove.\n get objectId(): ObjectId {\n return this._objectId;\n }\n\n /**\n * @deprecated\n */\n // TODO(dmaretskyi): Remove.\n get protocol(): string | undefined {\n return this._protocol;\n }\n\n /**\n * @deprecated\n */\n // TODO(dmaretskyi): Remove.\n get host(): string | undefined {\n return this._host;\n }\n\n encode(): ReferenceProto {\n return { objectId: this.objectId, host: this.host, protocol: this.protocol };\n }\n\n // TODO(dmaretskyi): Remove in favor of `reference.dxn`.\n toDXN(): DXN {\n if (this._dxn) {\n return this._dxn;\n }\n\n if (this.protocol === Reference.TYPE_PROTOCOL) {\n return new DXN(DXN.kind.TYPE, [this.objectId]);\n } else {\n if (this.host) {\n // Host is assumed to be the space key.\n // The DXN should actually have the space ID.\n // TODO(dmaretskyi): Migrate to space id.\n return new DXN(DXN.kind.ECHO, [this.host, this.objectId]);\n } else {\n return new DXN(DXN.kind.ECHO, [LOCAL_SPACE_TAG, this.objectId]);\n }\n }\n }\n}\n\n// TODO(dmaretskyi): Is this used anywhere?\nexport const REFERENCE_TYPE_TAG = 'dxos.echo.model.document.Reference';\n\n/**\n * Reference as it is stored in Automerge document.\n */\nexport type EncodedReference = {\n '/': string;\n};\n\n/**\n * @deprecated Use `EncodedReference.fromDXN` instead.\n */\nexport const encodeReference = (reference: Reference): EncodedReference => ({\n '/': reference.toDXN().toString(),\n});\n\n/**\n * @deprecated Use `EncodedReference.toDXN` instead.\n */\nexport const decodeReference = (value: any) => {\n if (typeof value !== 'object' || value === null || typeof value['/'] !== 'string') {\n throw new Error('Invalid reference');\n }\n const dxnString = value['/'];\n\n if (\n dxnString.length % 2 === 0 &&\n dxnString.slice(0, dxnString.length / 2) === dxnString.slice(dxnString.length / 2) &&\n dxnString.includes('dxn:echo')\n ) {\n throw new Error('Automerge bug detected!');\n }\n\n return Reference.fromDXN(DXN.parse(dxnString));\n};\n\n/**\n * @deprecated Use `EncodedReference.isEncodedReference` instead.\n */\nexport const isEncodedReference = (value: any): value is EncodedReference =>\n typeof value === 'object' && value !== null && Object.keys(value).length === 1 && typeof value['/'] === 'string';\n\nexport const EncodedReference = Object.freeze({\n isEncodedReference,\n getReferenceString: (value: EncodedReference): string => {\n assertArgument(isEncodedReference(value), 'invalid reference');\n return value['/'];\n },\n toDXN: (value: EncodedReference): DXN => {\n return DXN.parse(EncodedReference.getReferenceString(value));\n },\n fromDXN: (dxn: DXN): EncodedReference => {\n return encodeReference(Reference.fromDXN(dxn));\n },\n});\n", "//\n// Copyright 2024 DXOS.org\n//\n\n/**\n * Denotes the data version of the space automerge document as well as the leaf documents for each individual ECHO object.\n */\nexport type SpaceDocVersion = number & { __type: 'SpaceDocVersion' };\n\nexport const SpaceDocVersion = Object.freeze({\n /**\n * For the documents created before the versioning was introduced.\n */\n LEGACY: 0 as SpaceDocVersion,\n\n /**\n * Current version.\n */\n CURRENT: 1 as SpaceDocVersion,\n});\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { subtleCrypto } from '@dxos/crypto';\nimport { PublicKey, SpaceId } from '@dxos/keys';\nimport { ComplexMap } from '@dxos/util';\n\nconst SPACE_IDS_CACHE = new ComplexMap<PublicKey, SpaceId>(PublicKey.hash);\n\n/**\n * Space keys are generated by creating a keypair, and then taking the first 20 bytes of the SHA-256 hash of the public key and encoding them to multibase RFC4648 base-32 format (prefixed with B, see Multibase Table).\n * Inspired by how ethereum addresses are derived.\n */\nexport const createIdFromSpaceKey = async (spaceKey: PublicKey): Promise<SpaceId> => {\n const cachedValue = SPACE_IDS_CACHE.get(spaceKey);\n if (cachedValue !== undefined) {\n return cachedValue;\n }\n\n const digest = await subtleCrypto.digest('SHA-256', spaceKey.asUint8Array());\n\n const bytes = new Uint8Array(digest).slice(0, SpaceId.byteLength);\n const spaceId = SpaceId.encode(bytes);\n SPACE_IDS_CACHE.set(spaceKey, spaceId);\n return spaceId;\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Schema, SchemaAST } from 'effect';\n\nconst ForeignKey_ = Schema.Struct({\n /**\n * Name of the foreign database/system.\n * E.g., `github.com`.\n */\n source: Schema.String,\n\n /**\n * Id within the foreign database.\n */\n // TODO(wittjosiah): This annotation is currently used to ensure id field shows up in forms.\n // TODO(dmaretskyi): `false` is not a valid value for the annotation.\n id: Schema.String.annotations({ [SchemaAST.IdentifierAnnotationId]: false }),\n});\n\nexport type ForeignKey = Schema.Schema.Type<typeof ForeignKey_>;\n\n/**\n * Reference to an object in a foreign database.\n */\nexport const ForeignKey: Schema.Schema<ForeignKey> = ForeignKey_;\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Schema } from 'effect';\n\nimport { DXN, ObjectId } from '@dxos/keys';\n\nimport { ForeignKey } from '../foreign-key';\n\nconst TypenameSpecifier = Schema.Union(DXN.Schema, Schema.Null).annotations({\n description: 'DXN or null. Null means any type will match',\n});\n\n// NOTE: This pattern with 3 definitions per schema is need to make the types opaque, and circular references in AST to not cause compiler errors.\n\n/**\n * Filter by object type and properties.\n *\n * Clauses are combined using logical AND.\n */\n// TODO(burdon): Filter object vs. relation.\nconst FilterObject_ = Schema.Struct({\n type: Schema.Literal('object'),\n\n typename: TypenameSpecifier,\n\n id: Schema.optional(Schema.Array(ObjectId)),\n\n /**\n * Filter by property.\n * Must not include object ID.\n */\n props: Schema.Record({\n key: Schema.String.annotations({ description: 'Property name' }),\n value: Schema.suspend(() => Filter),\n }),\n\n /**\n * Objects that have any of the given foreign keys.\n */\n foreignKeys: Schema.optional(Schema.Array(ForeignKey)),\n\n // NOTE: Make sure to update `FilterStep.isNoop` if you change this.\n});\nexport interface FilterObject extends Schema.Schema.Type<typeof FilterObject_> {}\nexport const FilterObject: Schema.Schema<FilterObject> = FilterObject_;\n\nconst FilterCompare_ = Schema.Struct({\n type: Schema.Literal('compare'),\n operator: Schema.Literal('eq', 'neq', 'gt', 'gte', 'lt', 'lte'),\n value: Schema.Unknown,\n});\nexport interface FilterCompare extends Schema.Schema.Type<typeof FilterCompare_> {}\nexport const FilterCompare: Schema.Schema<FilterCompare> = FilterCompare_;\n\nconst FilterIn_ = Schema.Struct({\n type: Schema.Literal('in'),\n values: Schema.Array(Schema.Any),\n});\nexport interface FilterIn extends Schema.Schema.Type<typeof FilterIn_> {}\nexport const FilterIn: Schema.Schema<FilterIn> = FilterIn_;\n\nconst FilterRange_ = Schema.Struct({\n type: Schema.Literal('range'),\n from: Schema.Any,\n to: Schema.Any,\n});\nexport interface FilterRange extends Schema.Schema.Type<typeof FilterRange_> {}\nexport const FilterRange: Schema.Schema<FilterRange> = FilterRange_;\n\nconst FilterTextSearch_ = Schema.Struct({\n type: Schema.Literal('text-search'),\n text: Schema.String,\n searchKind: Schema.optional(Schema.Literal('full-text', 'vector')),\n});\nexport interface FilterTextSearch extends Schema.Schema.Type<typeof FilterTextSearch_> {}\nexport const FilterTextSearch: Schema.Schema<FilterTextSearch> = FilterTextSearch_;\n\nconst FilterNot_ = Schema.Struct({\n type: Schema.Literal('not'),\n filter: Schema.suspend(() => Filter),\n});\nexport interface FilterNot extends Schema.Schema.Type<typeof FilterNot_> {}\nexport const FilterNot: Schema.Schema<FilterNot> = FilterNot_;\n\nconst FilterAnd_ = Schema.Struct({\n type: Schema.Literal('and'),\n filters: Schema.Array(Schema.suspend(() => Filter)),\n});\nexport interface FilterAnd extends Schema.Schema.Type<typeof FilterAnd_> {}\nexport const FilterAnd: Schema.Schema<FilterAnd> = FilterAnd_;\n\nconst FilterOr_ = Schema.Struct({\n type: Schema.Literal('or'),\n filters: Schema.Array(Schema.suspend(() => Filter)),\n});\nexport interface FilterOr extends Schema.Schema.Type<typeof FilterOr_> {}\nexport const FilterOr: Schema.Schema<FilterOr> = FilterOr_;\n\nexport const Filter = Schema.Union(\n FilterObject,\n FilterTextSearch,\n FilterCompare,\n FilterIn,\n FilterRange,\n FilterNot,\n FilterAnd,\n FilterOr,\n);\nexport type Filter = Schema.Schema.Type<typeof Filter>;\n\n/**\n * Query objects by type, id, and/or predicates.\n */\nconst QuerySelectClause_ = Schema.Struct({\n type: Schema.Literal('select'),\n filter: Schema.suspend(() => Filter),\n});\nexport interface QuerySelectClause extends Schema.Schema.Type<typeof QuerySelectClause_> {}\nexport const QuerySelectClause: Schema.Schema<QuerySelectClause> = QuerySelectClause_;\n\n/**\n * Filter objects from selection.\n */\nconst QueryFilterClause_ = Schema.Struct({\n type: Schema.Literal('filter'),\n selection: Schema.suspend(() => Query),\n filter: Schema.suspend(() => Filter),\n});\nexport interface QueryFilterClause extends Schema.Schema.Type<typeof QueryFilterClause_> {}\nexport const QueryFilterClause: Schema.Schema<QueryFilterClause> = QueryFilterClause_;\n\n/**\n * Traverse references from an anchor object.\n */\nconst QueryReferenceTraversalClause_ = Schema.Struct({\n type: Schema.Literal('reference-traversal'),\n anchor: Schema.suspend(() => Query),\n property: Schema.String, // TODO(dmaretskyi): Change to EscapedPropPath.\n});\nexport interface QueryReferenceTraversalClause extends Schema.Schema.Type<typeof QueryReferenceTraversalClause_> {}\nexport const QueryReferenceTraversalClause: Schema.Schema<QueryReferenceTraversalClause> =\n QueryReferenceTraversalClause_;\n\n/**\n * Traverse incoming references to an anchor object.\n */\nconst QueryIncomingReferencesClause_ = Schema.Struct({\n type: Schema.Literal('incoming-references'),\n anchor: Schema.suspend(() => Query),\n property: Schema.String,\n typename: TypenameSpecifier,\n});\nexport interface QueryIncomingReferencesClause extends Schema.Schema.Type<typeof QueryIncomingReferencesClause_> {}\nexport const QueryIncomingReferencesClause: Schema.Schema<QueryIncomingReferencesClause> =\n QueryIncomingReferencesClause_;\n\n/**\n * Traverse relations connecting to an anchor object.\n */\nconst QueryRelationClause_ = Schema.Struct({\n type: Schema.Literal('relation'),\n anchor: Schema.suspend(() => Query),\n /**\n * outgoing: anchor is the source of the relation.\n * incoming: anchor is the target of the relation.\n * both: anchor is either the source or target of the relation.\n */\n direction: Schema.Literal('outgoing', 'incoming', 'both'),\n filter: Schema.optional(Schema.suspend(() => Filter)),\n});\nexport interface QueryRelationClause extends Schema.Schema.Type<typeof QueryRelationClause_> {}\nexport const QueryRelationClause: Schema.Schema<QueryRelationClause> = QueryRelationClause_;\n\n/**\n * Traverse into the source or target of a relation.\n */\nconst QueryRelationTraversalClause_ = Schema.Struct({\n type: Schema.Literal('relation-traversal'),\n anchor: Schema.suspend(() => Query),\n direction: Schema.Literal('source', 'target', 'both'),\n});\nexport interface QueryRelationTraversalClause extends Schema.Schema.Type<typeof QueryRelationTraversalClause_> {}\nexport const QueryRelationTraversalClause: Schema.Schema<QueryRelationTraversalClause> = QueryRelationTraversalClause_;\n\n/**\n * Union of multiple queries.\n */\nconst QueryUnionClause_ = Schema.Struct({\n type: Schema.Literal('union'),\n queries: Schema.Array(Schema.suspend(() => Query)),\n});\nexport interface QueryUnionClause extends Schema.Schema.Type<typeof QueryUnionClause_> {}\nexport const QueryUnionClause: Schema.Schema<QueryUnionClause> = QueryUnionClause_;\n\n/**\n * Set difference of two queries.\n */\nconst QuerySetDifferenceClause_ = Schema.Struct({\n type: Schema.Literal('set-difference'),\n source: Schema.suspend(() => Query),\n exclude: Schema.suspend(() => Query),\n});\nexport interface QuerySetDifferenceClause extends Schema.Schema.Type<typeof QuerySetDifferenceClause_> {}\nexport const QuerySetDifferenceClause: Schema.Schema<QuerySetDifferenceClause> = QuerySetDifferenceClause_;\n\n/**\n * Add options to a query.\n */\nconst QueryOptionsClause_ = Schema.Struct({\n type: Schema.Literal('options'),\n query: Schema.suspend(() => Query),\n options: Schema.suspend(() => QueryOptions),\n});\nexport interface QueryOptionsClause extends Schema.Schema.Type<typeof QueryOptionsClause_> {}\nexport const QueryOptionsClause: Schema.Schema<QueryOptionsClause> = QueryOptionsClause_;\n\nconst Query_ = Schema.Union(\n QuerySelectClause,\n QueryFilterClause,\n QueryReferenceTraversalClause,\n QueryIncomingReferencesClause,\n QueryRelationClause,\n QueryRelationTraversalClause,\n QueryUnionClause,\n QuerySetDifferenceClause,\n QueryOptionsClause,\n);\n\nexport type Query = Schema.Schema.Type<typeof Query_>;\nexport const Query: Schema.Schema<Query> = Query_;\n\nexport const QueryOptions = Schema.Struct({\n spaceIds: Schema.optional(Schema.Array(Schema.String)),\n deleted: Schema.optional(Schema.Literal('include', 'exclude', 'only')),\n});\nexport interface QueryOptions extends Schema.Schema.Type<typeof QueryOptions> {}\n\nexport const visit = (query: Query, visitor: (node: Query) => void) => {\n switch (query.type) {\n case 'filter':\n visit(query.selection, visitor);\n break;\n case 'reference-traversal':\n visit(query.anchor, visitor);\n break;\n case 'incoming-references':\n visit(query.anchor, visitor);\n break;\n case 'relation':\n visit(query.anchor, visitor);\n break;\n case 'options':\n visit(query.query, visitor);\n break;\n case 'relation-traversal':\n visit(query.anchor, visitor);\n break;\n case 'union':\n query.queries.forEach((q) => visit(q, visitor));\n break;\n case 'set-difference':\n visit(query.source, visitor);\n visit(query.exclude, visitor);\n break;\n }\n};\n"],
|
|
5
|
-
"mappings": ";;;;;;;AAIA,SAASA,iBAAiB;AAE1B,SAASC,mBAAmB;;;ACF5B,SAASC,sBAAsB;AAC/B,SAASC,KAAKC,uBAAuC;AAS9C,IAAMC,YAAN,MAAMA,WAAAA;EAKX;;;;;SAAOC,gBAAgB;;EAEvB,OAAOC,QAAQC,KAAqB;AAClC,YAAQA,IAAIC,MAAI;MACd,KAAKC,IAAID,KAAKE;AACZ,eAAO,IAAIN,WAAUG,IAAII,MAAM,CAAA,GAAIP,WAAUC,eAAe,YAAYE,GAAAA;MAC1E,KAAKE,IAAID,KAAKI;AACZ,YAAIL,IAAII,MAAM,CAAA,MAAOE,iBAAiB;AACpC,iBAAO,IAAIT,WAAUG,IAAII,MAAM,CAAA,GAAIG,QAAWA,QAAWP,GAAAA;QAC3D,OAAO;AACL,iBAAO,IAAIH,WAAUG,IAAII,MAAM,CAAA,GAAIG,QAAWP,IAAII,MAAM,CAAA,GAAIJ,GAAAA;QAC9D;MACF;AACE,eAAO,IAAIH,WAAUG,IAAII,MAAM,CAAA,GAAIG,QAAWP,IAAII,MAAM,CAAA,GAAIJ,GAAAA;IAChE;EACF;EAEA,OAAOQ,UAAUC,OAAkC;AACjD,WAAO,IAAIZ,WAAUY,MAAMC,UAAUD,MAAME,UAAUF,MAAMG,IAAI;EACjE;;;;EAKA,OAAOC,qBAAqBH,UAA+B;AACzD,WAAO,IAAIb,WAAUa,QAAAA;EACvB;;;;;EAMA,OAAOI,mBAAmBC,MAAyB;AACjD,WAAO,IAAIlB,WAAUkB,MAAMlB,WAAUC,eAAe,UAAA;EACtD;;;;;EAMA,OAAOkB,wBAAwBN,UAAoBO,UAAgC;AAEjF,WAAO,IAAIpB,WAAUa,UAAUH,QAAWU,SAASC,MAAK,CAAA;EAC1D;;EAGA,YAEmBC,WACAC,WACAC,OACAC,MACjB;SAJiBH,YAAAA;SACAC,YAAAA;SACAC,QAAAA;SACAC,OAAAA;EAChB;EAEH,IAAItB,MAAuB;AACzB,WAAO,KAAKsB;EACd;;;;;EAMA,IAAIZ,WAAqB;AACvB,WAAO,KAAKS;EACd;;;;;EAMA,IAAIR,WAA+B;AACjC,WAAO,KAAKS;EACd;;;;;EAMA,IAAIR,OAA2B;AAC7B,WAAO,KAAKS;EACd;EAEAE,SAAyB;AACvB,WAAO;MAAEb,UAAU,KAAKA;MAAUE,MAAM,KAAKA;MAAMD,UAAU,KAAKA;IAAS;EAC7E;;EAGAa,QAAa;AACX,QAAI,KAAKF,MAAM;AACb,aAAO,KAAKA;IACd;AAEA,QAAI,KAAKX,aAAad,WAAUC,eAAe;AAC7C,aAAO,IAAII,IAAIA,IAAID,KAAKE,MAAM;QAAC,KAAKO;OAAS;IAC/C,OAAO;AACL,UAAI,KAAKE,MAAM;AAIb,eAAO,IAAIV,IAAIA,IAAID,KAAKI,MAAM;UAAC,KAAKO;UAAM,KAAKF;SAAS;MAC1D,OAAO;AACL,eAAO,IAAIR,IAAIA,IAAID,KAAKI,MAAM;UAACC;UAAiB,KAAKI;SAAS;MAChE;IACF;EACF;AACF;AAGO,IAAMe,qBAAqB;AAY3B,IAAMC,kBAAkB,CAACC,eAA4C;EAC1E,KAAKA,UAAUH,MAAK,EAAGI,SAAQ;AACjC;AAKO,IAAMC,kBAAkB,CAACpB,UAAAA;AAC9B,MAAI,OAAOA,UAAU,YAAYA,UAAU,QAAQ,OAAOA,MAAM,GAAA,MAAS,UAAU;AACjF,UAAM,IAAIqB,MAAM,mBAAA;EAClB;AACA,QAAMC,YAAYtB,MAAM,GAAA;AAExB,MACEsB,UAAUC,SAAS,MAAM,KACzBD,UAAUE,MAAM,GAAGF,UAAUC,SAAS,CAAA,MAAOD,UAAUE,MAAMF,UAAUC,SAAS,CAAA,KAChFD,UAAUG,SAAS,UAAA,GACnB;AACA,UAAM,IAAIJ,MAAM,yBAAA;EAClB;AAEA,SAAOjC,UAAUE,QAAQG,IAAIiC,MAAMJ,SAAAA,CAAAA;AACrC;AAKO,IAAMK,qBAAqB,CAAC3B,UACjC,OAAOA,UAAU,YAAYA,UAAU,QAAQ4B,OAAOC,KAAK7B,KAAAA,EAAOuB,WAAW,KAAK,OAAOvB,MAAM,GAAA,MAAS;AAEnG,IAAM8B,mBAAmBF,OAAOG,OAAO;EAC5CJ;EACAK,oBAAoB,CAAChC,UAAAA;AACnBiC,mBAAeN,mBAAmB3B,KAAAA,GAAQ,mBAAA;AAC1C,WAAOA,MAAM,GAAA;EACf;EACAe,OAAO,CAACf,UAAAA;AACN,WAAOP,IAAIiC,MAAMI,iBAAiBE,mBAAmBhC,KAAAA,CAAAA;EACvD;EACAV,SAAS,CAACC,QAAAA;AACR,WAAO0B,gBAAgB7B,UAAUE,QAAQC,GAAAA,CAAAA;EAC3C;AACF,CAAA;;;;ADhIO,IAAM2C,oBAAoBC,OAAOC,OAAO;;;;EAI7CC,aAAa,CAACC,QAAAA;AAEZ,UAAMC,cAAcD,IAAIE,QAAQC,YAAYH,IAAII;AAChD,QAAIH,eAAe,MAAM;AACvB,aAAO;IACT;AAEA,UAAMI,SAASC,OAAOL,WAAAA;AACtBM,cAAU,CAACF,OAAOG,WAAW,IAAA,GAAO,oCAAA;;;;;;;;;AACpC,WAAOH;EACT;EAEAI,iBAAiB,CAACT,KAAwBU,OAAAA;AACxC,WAAOV,IAAIW,UAAUD,EAAAA;EACvB;EAEAE,SAAS,CAACZ,KAAwBU,OAAAA;AAChC,WAAOV,IAAIa,QAAQH,EAAAA,GAAKI,SAAAA;EAC1B;EAEAC,MAAM,CAAC,EACLZ,UACAQ,SACAE,MAAK,OAKmB;IACxBX,QAAQ;MACNC;IACF;IACAQ,SAASA,WAAW,CAAC;IACrBE,OAAOA,SAAS,CAAC;EACnB;AACF,CAAA;AAkBO,IAAMG,kBAAkBnB,OAAOC,OAAO;;;;EAI3CmB,kBAAkB,CAACC,WAAAA;AACjB,WAAOA,OAAOC,QAAQC;EACxB;;;;EAKAC,eAAe,CAACH,WAAAA;AACd,UAAMI,OAAOJ,OAAOC,QAAQG,QAAQ;AACpCf,cAAUe,SAAS,YAAYA,SAAS,YAAY,gBAAA;;;;;;;;;AACpD,WAAOA;EACT;EAEAC,WAAW,CAACL,WAAAA;AACV,WAAOA,OAAOC,QAAQK,WAAW;EACnC;EAEAC,mBAAmB,CAACP,WAAAA;AAClB,WAAOA,OAAOC,QAAQO;EACxB;EAEAC,mBAAmB,CAACT,WAAAA;AAClB,WAAOA,OAAOC,QAAQS;EACxB;;;;EAKAC,0BAA0B,CAACX,WAAAA;AACzB,UAAMY,aAAsE,CAAA;AAC5E,UAAMC,SAAQ,CAACC,MAAsBC,UAAAA;AACnC,UAAIC,mBAAmBD,KAAAA,GAAQ;AAC7BH,mBAAWK,KAAK;UAAEH;UAAMI,WAAWH;QAAM,CAAA;MAC3C,OAAO;AACLI,oBAAYJ,OAAO,CAACA,QAAOK,QAAQP,OAAM;aAAIC;UAAM1B,OAAOgC,GAAAA;WAAOL,MAAAA,CAAAA;MACnE;IACF;AACAI,gBAAYnB,OAAOqB,MAAM,CAACN,OAAOK,QAAQP,OAAM;MAACzB,OAAOgC,GAAAA;OAAOL,KAAAA,CAAAA;AAC9D,WAAOH;EACT;EAEAU,YAAY,CAAC,EACXpB,MACAmB,MACAE,KAAI,MAML;AACC,WAAO;MACLtB,QAAQ;QACNG,MAAM;QACNF,MAAM;UAAE,KAAKA;QAAK;MACpB;MACAsB,MAAM;QACJD,MAAMA,QAAQ,CAAA;MAChB;MACAF,MAAMA,QAAQ,CAAC;IACjB;EACF;EAEAI,cAAc,CAAC,EACbvB,MACAM,QACAE,QACAJ,SACAiB,MACAF,KAAI,MAQL;AACC,WAAO;MACLpB,QAAQ;QACNG,MAAM;QACNF,MAAM;UAAE,KAAKA;QAAK;QAClBM;QACAE;QACAJ,SAASA,WAAW;MACtB;MACAkB,MAAM;QACJD,MAAMA,QAAQ,CAAA;MAChB;MACAF,MAAMA,QAAQ,CAAC;IACjB;EACF;AACF,CAAA;AA8CO,IAAMK,cAAc;AAMpB,IAAMC,iBAAiB;;;AEzPvB,IAAMC,kBAAkBC,OAAOC,OAAO;;;;EAI3CC,QAAQ;;;;EAKRC,SAAS;AACX,CAAA;;;ACfA,SAASC,oBAAoB;AAC7B,SAASC,WAAWC,eAAe;AACnC,SAASC,kBAAkB;AAE3B,IAAMC,kBAAkB,IAAIC,WAA+BC,UAAUC,IAAI;AAMlE,IAAMC,uBAAuB,OAAOC,aAAAA;AACzC,QAAMC,cAAcN,gBAAgBO,IAAIF,QAAAA;AACxC,MAAIC,gBAAgBE,QAAW;AAC7B,WAAOF;EACT;AAEA,QAAMG,SAAS,MAAMC,aAAaD,OAAO,WAAWJ,SAASM,aAAY,CAAA;AAEzE,QAAMC,QAAQ,IAAIC,WAAWJ,MAAAA,EAAQK,MAAM,GAAGC,QAAQC,UAAU;AAChE,QAAMC,UAAUF,QAAQG,OAAON,KAAAA;AAC/BZ,kBAAgBmB,IAAId,UAAUY,OAAAA;AAC9B,SAAOA;AACT;;;ACtBA,SAASG,QAAQC,iBAAiB;AAElC,IAAMC,cAAcC,OAAOC,OAAO;;;;;EAKhCC,QAAQF,OAAOG;;;;;;EAOfC,IAAIJ,OAAOG,OAAOE,YAAY;IAAE,CAACC,UAAUC,sBAAsB,GAAG;EAAM,CAAA;AAC5E,CAAA;AAOO,IAAMC,aAAwCT;;;AC1BrD;;;;;;;;;;;;;;;;;;;;;;;;AAIA,SAASU,UAAAA,eAAc;AAEvB,SAASC,OAAAA,MAAKC,gBAAgB;AAI9B,IAAMC,oBAAoBC,QAAOC,MAAMC,KAAIF,QAAQA,QAAOG,IAAI,EAAEC,YAAY;EAC1EC,aAAa;AACf,CAAA;AAUA,IAAMC,gBAAgBN,QAAOO,OAAO;EAClCC,MAAMR,QAAOS,QAAQ,QAAA;EAErBC,UAAUX;EAEVY,IAAIX,QAAOY,SAASZ,QAAOa,MAAMC,QAAAA,CAAAA;;;;;EAMjCC,OAAOf,QAAOgB,OAAO;IACnBC,KAAKjB,QAAOkB,OAAOd,YAAY;MAAEC,aAAa;IAAgB,CAAA;IAC9Dc,OAAOnB,QAAOoB,QAAQ,MAAMC,MAAAA;EAC9B,CAAA;;;;EAKAC,aAAatB,QAAOY,SAASZ,QAAOa,MAAMU,UAAAA,CAAAA;AAG5C,CAAA;AAEO,IAAMC,eAA4ClB;AAEzD,IAAMmB,iBAAiBzB,QAAOO,OAAO;EACnCC,MAAMR,QAAOS,QAAQ,SAAA;EACrBiB,UAAU1B,QAAOS,QAAQ,MAAM,OAAO,MAAM,OAAO,MAAM,KAAA;EACzDU,OAAOnB,QAAO2B;AAChB,CAAA;AAEO,IAAMC,gBAA8CH;AAE3D,IAAMI,YAAY7B,QAAOO,OAAO;EAC9BC,MAAMR,QAAOS,QAAQ,IAAA;EACrBqB,QAAQ9B,QAAOa,MAAMb,QAAO+B,GAAG;AACjC,CAAA;AAEO,IAAMC,WAAoCH;AAEjD,IAAMI,eAAejC,QAAOO,OAAO;EACjCC,MAAMR,QAAOS,QAAQ,OAAA;EACrByB,MAAMlC,QAAO+B;EACbI,IAAInC,QAAO+B;AACb,CAAA;AAEO,IAAMK,cAA0CH;AAEvD,IAAMI,oBAAoBrC,QAAOO,OAAO;EACtCC,MAAMR,QAAOS,QAAQ,aAAA;EACrB6B,MAAMtC,QAAOkB;EACbqB,YAAYvC,QAAOY,SAASZ,QAAOS,QAAQ,aAAa,QAAA,CAAA;AAC1D,CAAA;AAEO,IAAM+B,mBAAoDH;AAEjE,IAAMI,aAAazC,QAAOO,OAAO;EAC/BC,MAAMR,QAAOS,QAAQ,KAAA;EACrBiC,QAAQ1C,QAAOoB,QAAQ,MAAMC,MAAAA;AAC/B,CAAA;AAEO,IAAMsB,YAAsCF;AAEnD,IAAMG,aAAa5C,QAAOO,OAAO;EAC/BC,MAAMR,QAAOS,QAAQ,KAAA;EACrBoC,SAAS7C,QAAOa,MAAMb,QAAOoB,QAAQ,MAAMC,MAAAA,CAAAA;AAC7C,CAAA;AAEO,IAAMyB,YAAsCF;AAEnD,IAAMG,YAAY/C,QAAOO,OAAO;EAC9BC,MAAMR,QAAOS,QAAQ,IAAA;EACrBoC,SAAS7C,QAAOa,MAAMb,QAAOoB,QAAQ,MAAMC,MAAAA,CAAAA;AAC7C,CAAA;AAEO,IAAM2B,WAAoCD;AAE1C,IAAM1B,SAASrB,QAAOC,MAC3BuB,cACAgB,kBACAZ,eACAI,UACAI,aACAO,WACAG,WACAE,QAAAA;AAOF,IAAMC,qBAAqBjD,QAAOO,OAAO;EACvCC,MAAMR,QAAOS,QAAQ,QAAA;EACrBiC,QAAQ1C,QAAOoB,QAAQ,MAAMC,MAAAA;AAC/B,CAAA;AAEO,IAAM6B,oBAAsDD;AAKnE,IAAME,qBAAqBnD,QAAOO,OAAO;EACvCC,MAAMR,QAAOS,QAAQ,QAAA;EACrB2C,WAAWpD,QAAOoB,QAAQ,MAAMiC,KAAAA;EAChCX,QAAQ1C,QAAOoB,QAAQ,MAAMC,MAAAA;AAC/B,CAAA;AAEO,IAAMiC,oBAAsDH;AAKnE,IAAMI,iCAAiCvD,QAAOO,OAAO;EACnDC,MAAMR,QAAOS,QAAQ,qBAAA;EACrB+C,QAAQxD,QAAOoB,QAAQ,MAAMiC,KAAAA;EAC7BI,UAAUzD,QAAOkB;AACnB,CAAA;AAEO,IAAMwC,gCACXH;AAKF,IAAMI,iCAAiC3D,QAAOO,OAAO;EACnDC,MAAMR,QAAOS,QAAQ,qBAAA;EACrB+C,QAAQxD,QAAOoB,QAAQ,MAAMiC,KAAAA;EAC7BI,UAAUzD,QAAOkB;EACjBR,UAAUX;AACZ,CAAA;AAEO,IAAM6D,gCACXD;AAKF,IAAME,uBAAuB7D,QAAOO,OAAO;EACzCC,MAAMR,QAAOS,QAAQ,UAAA;EACrB+C,QAAQxD,QAAOoB,QAAQ,MAAMiC,KAAAA;;;;;;EAM7BS,WAAW9D,QAAOS,QAAQ,YAAY,YAAY,MAAA;EAClDiC,QAAQ1C,QAAOY,SAASZ,QAAOoB,QAAQ,MAAMC,MAAAA,CAAAA;AAC/C,CAAA;AAEO,IAAM0C,sBAA0DF;AAKvE,IAAMG,gCAAgChE,QAAOO,OAAO;EAClDC,MAAMR,QAAOS,QAAQ,oBAAA;EACrB+C,QAAQxD,QAAOoB,QAAQ,MAAMiC,KAAAA;EAC7BS,WAAW9D,QAAOS,QAAQ,UAAU,UAAU,MAAA;AAChD,CAAA;AAEO,IAAMwD,+BAA4ED;AAKzF,IAAME,oBAAoBlE,QAAOO,OAAO;EACtCC,MAAMR,QAAOS,QAAQ,OAAA;EACrB0D,SAASnE,QAAOa,MAAMb,QAAOoB,QAAQ,MAAMiC,KAAAA,CAAAA;AAC7C,CAAA;AAEO,IAAMe,mBAAoDF;AAKjE,IAAMG,4BAA4BrE,QAAOO,OAAO;EAC9CC,MAAMR,QAAOS,QAAQ,gBAAA;EACrB6D,QAAQtE,QAAOoB,QAAQ,MAAMiC,KAAAA;EAC7BkB,SAASvE,QAAOoB,QAAQ,MAAMiC,KAAAA;AAChC,CAAA;AAEO,IAAMmB,2BAAoEH;AAKjF,IAAMI,sBAAsBzE,QAAOO,OAAO;EACxCC,MAAMR,QAAOS,QAAQ,SAAA;EACrBiE,OAAO1E,QAAOoB,QAAQ,MAAMiC,KAAAA;EAC5BsB,SAAS3E,QAAOoB,QAAQ,MAAMwD,YAAAA;AAChC,CAAA;AAEO,IAAMC,qBAAwDJ;AAErE,IAAMK,SAAS9E,QAAOC,MACpBiD,mBACAI,mBACAI,+BACAE,+BACAG,qBACAE,8BACAG,kBACAI,0BACAK,kBAAAA;AAIK,IAAMxB,QAA8ByB;AAEpC,IAAMF,eAAe5E,QAAOO,OAAO;EACxCwE,UAAU/E,QAAOY,SAASZ,QAAOa,MAAMb,QAAOkB,MAAM,CAAA;EACpD8D,SAAShF,QAAOY,SAASZ,QAAOS,QAAQ,WAAW,WAAW,MAAA,CAAA;AAChE,CAAA;AAGO,IAAMwE,QAAQ,CAACP,OAAcQ,YAAAA;AAClC,UAAQR,MAAMlE,MAAI;IAChB,KAAK;AACHyE,YAAMP,MAAMtB,WAAW8B,OAAAA;AACvB;IACF,KAAK;AACHD,YAAMP,MAAMlB,QAAQ0B,OAAAA;AACpB;IACF,KAAK;AACHD,YAAMP,MAAMlB,QAAQ0B,OAAAA;AACpB;IACF,KAAK;AACHD,YAAMP,MAAMlB,QAAQ0B,OAAAA;AACpB;IACF,KAAK;AACHD,YAAMP,MAAMA,OAAOQ,OAAAA;AACnB;IACF,KAAK;AACHD,YAAMP,MAAMlB,QAAQ0B,OAAAA;AACpB;IACF,KAAK;AACHR,YAAMP,QAAQgB,QAAQ,CAACC,MAAMH,MAAMG,GAAGF,OAAAA,CAAAA;AACtC;IACF,KAAK;AACHD,YAAMP,MAAMJ,QAAQY,OAAAA;AACpBD,YAAMP,MAAMH,SAASW,OAAAA;AACrB;EACJ;AACF;",
|
|
6
|
-
"names": ["invariant", "visitValues", "assertArgument", "DXN", "LOCAL_SPACE_TAG", "Reference", "TYPE_PROTOCOL", "fromDXN", "dxn", "kind", "DXN", "TYPE", "parts", "ECHO", "LOCAL_SPACE_TAG", "undefined", "fromValue", "value", "objectId", "protocol", "host", "localObjectReference", "fromLegacyTypename", "type", "fromObjectIdAndSpaceKey", "spaceKey", "toHex", "_objectId", "_protocol", "_host", "_dxn", "encode", "toDXN", "REFERENCE_TYPE_TAG", "encodeReference", "reference", "toString", "decodeReference", "Error", "dxnString", "length", "slice", "includes", "parse", "isEncodedReference", "Object", "keys", "EncodedReference", "freeze", "getReferenceString", "assertArgument", "DatabaseDirectory", "Object", "freeze", "getSpaceKey", "doc", "rawSpaceKey", "access", "spaceKey", "experimental_spaceKey", "rawKey", "String", "invariant", "startsWith", "getInlineObject", "id", "objects", "getLink", "links", "toString", "make", "ObjectStructure", "getTypeReference", "object", "system", "type", "getEntityKind", "kind", "isDeleted", "deleted", "getRelationSource", "source", "getRelationTarget", "target", "getAllOutgoingReferences", "references", "visit", "path", "value", "isEncodedReference", "push", "reference", "visitValues", "key", "data", "makeObject", "keys", "meta", "makeRelation", "PROPERTY_ID", "DATA_NAMESPACE", "SpaceDocVersion", "Object", "freeze", "LEGACY", "CURRENT", "subtleCrypto", "PublicKey", "SpaceId", "ComplexMap", "SPACE_IDS_CACHE", "ComplexMap", "PublicKey", "hash", "createIdFromSpaceKey", "spaceKey", "cachedValue", "get", "undefined", "digest", "subtleCrypto", "asUint8Array", "bytes", "Uint8Array", "slice", "SpaceId", "byteLength", "spaceId", "encode", "set", "Schema", "SchemaAST", "ForeignKey_", "Schema", "Struct", "source", "String", "id", "annotations", "SchemaAST", "IdentifierAnnotationId", "ForeignKey", "Schema", "DXN", "ObjectId", "TypenameSpecifier", "Schema", "Union", "DXN", "Null", "annotations", "description", "FilterObject_", "Struct", "type", "Literal", "typename", "id", "optional", "Array", "ObjectId", "props", "Record", "key", "String", "value", "suspend", "Filter", "foreignKeys", "ForeignKey", "FilterObject", "FilterCompare_", "operator", "Unknown", "FilterCompare", "FilterIn_", "values", "Any", "FilterIn", "FilterRange_", "from", "to", "FilterRange", "FilterTextSearch_", "text", "searchKind", "FilterTextSearch", "FilterNot_", "filter", "FilterNot", "FilterAnd_", "filters", "FilterAnd", "FilterOr_", "FilterOr", "QuerySelectClause_", "QuerySelectClause", "QueryFilterClause_", "selection", "Query", "QueryFilterClause", "QueryReferenceTraversalClause_", "anchor", "property", "QueryReferenceTraversalClause", "QueryIncomingReferencesClause_", "QueryIncomingReferencesClause", "QueryRelationClause_", "direction", "QueryRelationClause", "QueryRelationTraversalClause_", "QueryRelationTraversalClause", "QueryUnionClause_", "queries", "QueryUnionClause", "QuerySetDifferenceClause_", "source", "exclude", "QuerySetDifferenceClause", "QueryOptionsClause_", "query", "options", "QueryOptions", "QueryOptionsClause", "Query_", "spaceIds", "deleted", "visit", "visitor", "forEach", "q"]
|
|
7
|
-
}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"inputs":{"src/reference.ts":{"bytes":16981,"imports":[{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/keys","kind":"import-statement","external":true}],"format":"esm"},"src/document-structure.ts":{"bytes":15682,"imports":[{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/reference.ts","kind":"import-statement","original":"./reference"}],"format":"esm"},"src/space-doc-version.ts":{"bytes":1538,"imports":[],"format":"esm"},"src/space-id.ts":{"bytes":3511,"imports":[{"path":"@dxos/crypto","kind":"import-statement","external":true},{"path":"@dxos/keys","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"src/foreign-key.ts":{"bytes":2428,"imports":[{"path":"effect","kind":"import-statement","external":true}],"format":"esm"},"src/query/ast.ts":{"bytes":26583,"imports":[{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/keys","kind":"import-statement","external":true},{"path":"src/foreign-key.ts","kind":"import-statement","original":"../foreign-key"}],"format":"esm"},"src/query/index.ts":{"bytes":516,"imports":[{"path":"src/query/ast.ts","kind":"import-statement","original":"./ast"}],"format":"esm"},"src/index.ts":{"bytes":1011,"imports":[{"path":"src/document-structure.ts","kind":"import-statement","original":"./document-structure"},{"path":"src/reference.ts","kind":"import-statement","original":"./reference"},{"path":"src/space-doc-version.ts","kind":"import-statement","original":"./space-doc-version"},{"path":"src/space-id.ts","kind":"import-statement","original":"./space-id"},{"path":"src/foreign-key.ts","kind":"import-statement","original":"./foreign-key"},{"path":"src/query/index.ts","kind":"import-statement","original":"./query"}],"format":"esm"}},"outputs":{"dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":34948},"dist/lib/browser/index.mjs":{"imports":[{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/keys","kind":"import-statement","external":true},{"path":"@dxos/crypto","kind":"import-statement","external":true},{"path":"@dxos/keys","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/keys","kind":"import-statement","external":true}],"exports":["DATA_NAMESPACE","DatabaseDirectory","EncodedReference","ForeignKey","ObjectStructure","PROPERTY_ID","QueryAST","REFERENCE_TYPE_TAG","Reference","SpaceDocVersion","createIdFromSpaceKey","decodeReference","encodeReference","isEncodedReference"],"entryPoint":"src/index.ts","inputs":{"src/document-structure.ts":{"bytesInOutput":3028},"src/reference.ts":{"bytesInOutput":3669},"src/index.ts":{"bytesInOutput":0},"src/space-doc-version.ts":{"bytesInOutput":179},"src/space-id.ts":{"bytesInOutput":604},"src/foreign-key.ts":{"bytesInOutput":512},"src/query/ast.ts":{"bytesInOutput":6379},"src/query/index.ts":{"bytesInOutput":0}},"bytes":15030}}}
|