@dxos/effect 0.8.3-staging.0fa589b → 0.8.4-main.1da679c
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/index.mjs +231 -28
- package/dist/lib/browser/index.mjs.map +4 -4
- package/dist/lib/browser/meta.json +1 -1
- package/dist/lib/node-esm/index.mjs +231 -28
- package/dist/lib/node-esm/index.mjs.map +4 -4
- package/dist/lib/node-esm/meta.json +1 -1
- package/dist/types/src/ast.d.ts +5 -1
- package/dist/types/src/ast.d.ts.map +1 -1
- package/dist/types/src/context.d.ts +4 -0
- package/dist/types/src/context.d.ts.map +1 -0
- package/dist/types/src/errors.d.ts +43 -0
- package/dist/types/src/errors.d.ts.map +1 -0
- package/dist/types/src/errors.test.d.ts +2 -0
- package/dist/types/src/errors.test.d.ts.map +1 -0
- package/dist/types/src/index.d.ts +4 -0
- package/dist/types/src/index.d.ts.map +1 -1
- package/dist/types/src/interrupt.test.d.ts +2 -0
- package/dist/types/src/interrupt.test.d.ts.map +1 -0
- package/dist/types/src/jsonPath.d.ts.map +1 -1
- package/dist/types/src/layers.test.d.ts +2 -0
- package/dist/types/src/layers.test.d.ts.map +1 -0
- package/dist/types/src/resource.d.ts +4 -0
- package/dist/types/src/resource.d.ts.map +1 -0
- package/dist/types/src/resource.test.d.ts +2 -0
- package/dist/types/src/resource.test.d.ts.map +1 -0
- package/dist/types/src/testing.d.ts +44 -0
- package/dist/types/src/testing.d.ts.map +1 -0
- package/dist/types/src/url.d.ts +1 -1
- package/dist/types/src/url.d.ts.map +1 -1
- package/dist/types/tsconfig.tsbuildinfo +1 -1
- package/package.json +8 -6
- package/src/ast.test.ts +19 -2
- package/src/ast.ts +36 -12
- package/src/context.ts +15 -0
- package/src/errors.test.ts +22 -0
- package/src/errors.ts +186 -0
- package/src/index.ts +4 -0
- package/src/interrupt.test.ts +34 -0
- package/src/jsonPath.test.ts +1 -1
- package/src/jsonPath.ts +1 -1
- package/src/layers.test.ts +106 -0
- package/src/resource.test.ts +32 -0
- package/src/resource.ts +25 -0
- package/src/testing.ts +82 -0
- package/src/url.ts +1 -1
- package/dist/lib/node/index.cjs +0 -487
- package/dist/lib/node/index.cjs.map +0 -7
- package/dist/lib/node/meta.json +0 -1
|
@@ -1,12 +1,17 @@
|
|
|
1
1
|
import "@dxos/node-std/globals";
|
|
2
2
|
|
|
3
|
-
//
|
|
4
|
-
import { Option,
|
|
3
|
+
// src/ast.ts
|
|
4
|
+
import { Option, Schema, SchemaAST, pipe } from "effect";
|
|
5
|
+
import { isUndefinedKeyword } from "effect/SchemaAST";
|
|
5
6
|
import { invariant } from "@dxos/invariant";
|
|
6
7
|
import { isNonNullable } from "@dxos/util";
|
|
7
|
-
var __dxlog_file = "/
|
|
8
|
+
var __dxlog_file = "/__w/dxos/dxos/packages/common/effect/src/ast.ts";
|
|
9
|
+
var isTupleType = (node) => {
|
|
10
|
+
return SchemaAST.isTupleType(node) && node.elements.length > 0;
|
|
11
|
+
};
|
|
8
12
|
var getSimpleType = (node) => {
|
|
9
|
-
if (SchemaAST.isDeclaration(node) || SchemaAST.isObjectKeyword(node) || SchemaAST.isTypeLiteral(node) ||
|
|
13
|
+
if (SchemaAST.isDeclaration(node) || SchemaAST.isObjectKeyword(node) || SchemaAST.isTypeLiteral(node) || // TODO(wittjosiah): Tuples are actually arrays.
|
|
14
|
+
isTupleType(node) || isDiscriminatedUnion(node)) {
|
|
10
15
|
return "object";
|
|
11
16
|
}
|
|
12
17
|
if (SchemaAST.isStringKeyword(node)) {
|
|
@@ -47,12 +52,12 @@ var isSimpleType = (node) => !!getSimpleType(node);
|
|
|
47
52
|
}
|
|
48
53
|
};
|
|
49
54
|
})(SimpleType || (SimpleType = {}));
|
|
50
|
-
var VisitResult = /* @__PURE__ */ function(VisitResult2) {
|
|
55
|
+
var VisitResult = /* @__PURE__ */ (function(VisitResult2) {
|
|
51
56
|
VisitResult2[VisitResult2["CONTINUE"] = 0] = "CONTINUE";
|
|
52
57
|
VisitResult2[VisitResult2["SKIP"] = 1] = "SKIP";
|
|
53
58
|
VisitResult2[VisitResult2["EXIT"] = 2] = "EXIT";
|
|
54
59
|
return VisitResult2;
|
|
55
|
-
}({});
|
|
60
|
+
})({});
|
|
56
61
|
var defaultTest = isSimpleType;
|
|
57
62
|
var visit = (node, testOrVisitor, visitor) => {
|
|
58
63
|
if (!visitor) {
|
|
@@ -62,8 +67,8 @@ var visit = (node, testOrVisitor, visitor) => {
|
|
|
62
67
|
}
|
|
63
68
|
};
|
|
64
69
|
var visitNode = (node, test, visitor, path = [], depth = 0) => {
|
|
65
|
-
const
|
|
66
|
-
const result =
|
|
70
|
+
const $result = test?.(node, path, depth);
|
|
71
|
+
const result = $result === void 0 ? 0 : typeof $result === "boolean" ? $result ? 0 : 1 : $result;
|
|
67
72
|
if (result === 2) {
|
|
68
73
|
return result;
|
|
69
74
|
}
|
|
@@ -124,12 +129,13 @@ var findNode = (node, test) => {
|
|
|
124
129
|
}
|
|
125
130
|
}
|
|
126
131
|
} else if (SchemaAST.isUnion(node)) {
|
|
127
|
-
if (
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
132
|
+
if (isLiteralUnion(node)) {
|
|
133
|
+
return void 0;
|
|
134
|
+
}
|
|
135
|
+
for (const type of node.types) {
|
|
136
|
+
const child = findNode(type, test);
|
|
137
|
+
if (child) {
|
|
138
|
+
return child;
|
|
133
139
|
}
|
|
134
140
|
}
|
|
135
141
|
} else if (SchemaAST.isRefinement(node)) {
|
|
@@ -142,7 +148,7 @@ var findProperty = (schema, path) => {
|
|
|
142
148
|
const typeNode = findNode(node, SchemaAST.isTypeLiteral);
|
|
143
149
|
invariant(typeNode, void 0, {
|
|
144
150
|
F: __dxlog_file,
|
|
145
|
-
L:
|
|
151
|
+
L: 257,
|
|
146
152
|
S: void 0,
|
|
147
153
|
A: [
|
|
148
154
|
"typeNode",
|
|
@@ -202,7 +208,7 @@ var isDiscriminatedUnion = (node) => {
|
|
|
202
208
|
var getDiscriminatingProps = (node) => {
|
|
203
209
|
invariant(SchemaAST.isUnion(node), void 0, {
|
|
204
210
|
F: __dxlog_file,
|
|
205
|
-
L:
|
|
211
|
+
L: 354,
|
|
206
212
|
S: void 0,
|
|
207
213
|
A: [
|
|
208
214
|
"SchemaAST.isUnion(node)",
|
|
@@ -220,7 +226,7 @@ var getDiscriminatingProps = (node) => {
|
|
|
220
226
|
var getDiscriminatedType = (node, value = {}) => {
|
|
221
227
|
invariant(SchemaAST.isUnion(node), void 0, {
|
|
222
228
|
F: __dxlog_file,
|
|
223
|
-
L:
|
|
229
|
+
L: 378,
|
|
224
230
|
S: void 0,
|
|
225
231
|
A: [
|
|
226
232
|
"SchemaAST.isUnion(node)",
|
|
@@ -229,7 +235,7 @@ var getDiscriminatedType = (node, value = {}) => {
|
|
|
229
235
|
});
|
|
230
236
|
invariant(value, void 0, {
|
|
231
237
|
F: __dxlog_file,
|
|
232
|
-
L:
|
|
238
|
+
L: 379,
|
|
233
239
|
S: void 0,
|
|
234
240
|
A: [
|
|
235
241
|
"value",
|
|
@@ -244,7 +250,7 @@ var getDiscriminatedType = (node, value = {}) => {
|
|
|
244
250
|
const match = SchemaAST.getPropertySignatures(type).filter((prop) => props?.includes(prop.name.toString())).every((prop) => {
|
|
245
251
|
invariant(SchemaAST.isLiteral(prop.type), void 0, {
|
|
246
252
|
F: __dxlog_file,
|
|
247
|
-
L:
|
|
253
|
+
L: 390,
|
|
248
254
|
S: void 0,
|
|
249
255
|
A: [
|
|
250
256
|
"SchemaAST.isLiteral(prop.type)",
|
|
@@ -262,7 +268,7 @@ var getDiscriminatedType = (node, value = {}) => {
|
|
|
262
268
|
const literal = SchemaAST.getPropertySignatures(type).find((p) => p.name.toString() === prop);
|
|
263
269
|
invariant(SchemaAST.isLiteral(literal.type), void 0, {
|
|
264
270
|
F: __dxlog_file,
|
|
265
|
-
L:
|
|
271
|
+
L: 408,
|
|
266
272
|
S: void 0,
|
|
267
273
|
A: [
|
|
268
274
|
"SchemaAST.isLiteral(literal.type)",
|
|
@@ -299,13 +305,16 @@ var mapAst = (ast, f) => {
|
|
|
299
305
|
}
|
|
300
306
|
}
|
|
301
307
|
};
|
|
308
|
+
var isArrayType = (node) => {
|
|
309
|
+
return SchemaAST.isTupleType(node) || SchemaAST.isUnion(node) && node.types.some(isArrayType) && node.types.some(isUndefinedKeyword) && node.types.length === 2;
|
|
310
|
+
};
|
|
302
311
|
var SimpleType;
|
|
303
312
|
|
|
304
|
-
//
|
|
305
|
-
import {
|
|
313
|
+
// src/jsonPath.ts
|
|
314
|
+
import { Option as Option2, Schema as Schema2 } from "effect";
|
|
306
315
|
import { JSONPath } from "jsonpath-plus";
|
|
307
316
|
import { invariant as invariant2 } from "@dxos/invariant";
|
|
308
|
-
var __dxlog_file2 = "/
|
|
317
|
+
var __dxlog_file2 = "/__w/dxos/dxos/packages/common/effect/src/jsonPath.ts";
|
|
309
318
|
var PATH_REGEX = /^($|[a-zA-Z_$][\w$]*(?:\.[a-zA-Z_$][\w$]*|\[\d+\](?:\.)?)*$)/;
|
|
310
319
|
var PROP_REGEX = /^\w+$/;
|
|
311
320
|
var JsonPath = Schema2.String.pipe(Schema2.pattern(PATH_REGEX)).annotations({
|
|
@@ -363,18 +372,28 @@ var getField = (object, path) => {
|
|
|
363
372
|
})[0];
|
|
364
373
|
};
|
|
365
374
|
|
|
366
|
-
//
|
|
367
|
-
import {
|
|
375
|
+
// src/url.ts
|
|
376
|
+
import { Option as Option3, SchemaAST as SchemaAST2, pipe as pipe2 } from "effect";
|
|
368
377
|
import { decamelize } from "@dxos/util";
|
|
378
|
+
function _define_property(obj, key, value) {
|
|
379
|
+
if (key in obj) {
|
|
380
|
+
Object.defineProperty(obj, key, {
|
|
381
|
+
value,
|
|
382
|
+
enumerable: true,
|
|
383
|
+
configurable: true,
|
|
384
|
+
writable: true
|
|
385
|
+
});
|
|
386
|
+
} else {
|
|
387
|
+
obj[key] = value;
|
|
388
|
+
}
|
|
389
|
+
return obj;
|
|
390
|
+
}
|
|
369
391
|
var ParamKeyAnnotationId = Symbol.for("@dxos/schema/annotation/ParamKey");
|
|
370
392
|
var getParamKeyAnnotation = SchemaAST2.getAnnotation(ParamKeyAnnotationId);
|
|
371
393
|
var ParamKeyAnnotation = (value) => (self) => self.annotations({
|
|
372
394
|
[ParamKeyAnnotationId]: value
|
|
373
395
|
});
|
|
374
396
|
var UrlParser = class {
|
|
375
|
-
constructor(_schema) {
|
|
376
|
-
this._schema = _schema;
|
|
377
|
-
}
|
|
378
397
|
/**
|
|
379
398
|
* Parse URL params.
|
|
380
399
|
*/
|
|
@@ -415,14 +434,193 @@ var UrlParser = class {
|
|
|
415
434
|
});
|
|
416
435
|
return url;
|
|
417
436
|
}
|
|
437
|
+
constructor(_schema) {
|
|
438
|
+
_define_property(this, "_schema", void 0);
|
|
439
|
+
this._schema = _schema;
|
|
440
|
+
}
|
|
441
|
+
};
|
|
442
|
+
|
|
443
|
+
// src/context.ts
|
|
444
|
+
import { Effect } from "effect";
|
|
445
|
+
import { Context } from "@dxos/context";
|
|
446
|
+
var __dxlog_file3 = "/__w/dxos/dxos/packages/common/effect/src/context.ts";
|
|
447
|
+
var contextFromScope = () => Effect.gen(function* () {
|
|
448
|
+
const ctx = new Context(void 0, {
|
|
449
|
+
F: __dxlog_file3,
|
|
450
|
+
L: 12
|
|
451
|
+
});
|
|
452
|
+
yield* Effect.addFinalizer(() => Effect.promise(() => ctx.dispose()));
|
|
453
|
+
return ctx;
|
|
454
|
+
});
|
|
455
|
+
|
|
456
|
+
// src/errors.ts
|
|
457
|
+
import { Cause, Chunk, Effect as Effect2, Exit, GlobalValue, Option as Option4 } from "effect";
|
|
458
|
+
var spanSymbol = Symbol.for("effect/SpanAnnotation");
|
|
459
|
+
var originalSymbol = Symbol.for("effect/OriginalAnnotation");
|
|
460
|
+
var spanToTrace = GlobalValue.globalValue("effect/Tracer/spanToTrace", () => /* @__PURE__ */ new WeakMap());
|
|
461
|
+
var locationRegex = /\((.*)\)/g;
|
|
462
|
+
var prettyErrorStack = (error, appendStacks = []) => {
|
|
463
|
+
const span = error[spanSymbol];
|
|
464
|
+
const lines = typeof error.stack === "string" ? error.stack.split("\n") : [];
|
|
465
|
+
const out = [];
|
|
466
|
+
let atStack = false;
|
|
467
|
+
for (let i = 0; i < lines.length; i++) {
|
|
468
|
+
if (!atStack && !lines[i].startsWith(" at ")) {
|
|
469
|
+
out.push(lines[i]);
|
|
470
|
+
continue;
|
|
471
|
+
}
|
|
472
|
+
atStack = true;
|
|
473
|
+
if (lines[i].includes(" at new BaseEffectError") || lines[i].includes(" at new YieldableError")) {
|
|
474
|
+
i++;
|
|
475
|
+
continue;
|
|
476
|
+
}
|
|
477
|
+
if (lines[i].includes("Generator.next")) {
|
|
478
|
+
break;
|
|
479
|
+
}
|
|
480
|
+
if (lines[i].includes("effect_internal_function")) {
|
|
481
|
+
break;
|
|
482
|
+
}
|
|
483
|
+
out.push(lines[i].replace(/at .*effect_instruction_i.*\((.*)\)/, "at $1").replace(/EffectPrimitive\.\w+/, "<anonymous>").replace(/at Arguments\./, "at "));
|
|
484
|
+
}
|
|
485
|
+
if (span) {
|
|
486
|
+
let current = span;
|
|
487
|
+
let i = 0;
|
|
488
|
+
while (current && current._tag === "Span" && i < 10) {
|
|
489
|
+
const stackFn = spanToTrace.get(current);
|
|
490
|
+
if (typeof stackFn === "function") {
|
|
491
|
+
const stack = stackFn();
|
|
492
|
+
if (typeof stack === "string") {
|
|
493
|
+
const locationMatchAll = stack.matchAll(locationRegex);
|
|
494
|
+
let match = false;
|
|
495
|
+
for (const [, location] of locationMatchAll) {
|
|
496
|
+
match = true;
|
|
497
|
+
out.push(` at ${current.name} (${location})`);
|
|
498
|
+
}
|
|
499
|
+
if (!match) {
|
|
500
|
+
out.push(` at ${current.name} (${stack.replace(/^at /, "")})`);
|
|
501
|
+
}
|
|
502
|
+
} else {
|
|
503
|
+
out.push(` at ${current.name}`);
|
|
504
|
+
}
|
|
505
|
+
} else {
|
|
506
|
+
out.push(` at ${current.name}`);
|
|
507
|
+
}
|
|
508
|
+
current = Option4.getOrUndefined(current.parent);
|
|
509
|
+
i++;
|
|
510
|
+
}
|
|
511
|
+
}
|
|
512
|
+
out.push(...appendStacks);
|
|
513
|
+
if (error[originalSymbol]) {
|
|
514
|
+
error = error[originalSymbol];
|
|
515
|
+
}
|
|
516
|
+
if (error.cause) {
|
|
517
|
+
error.cause = prettyErrorStack(error.cause);
|
|
518
|
+
}
|
|
519
|
+
Object.defineProperty(error, "stack", {
|
|
520
|
+
value: out.join("\n"),
|
|
521
|
+
writable: true,
|
|
522
|
+
enumerable: false,
|
|
523
|
+
configurable: true
|
|
524
|
+
});
|
|
525
|
+
return error;
|
|
418
526
|
};
|
|
527
|
+
var causeToError = (cause) => {
|
|
528
|
+
if (Cause.isEmpty(cause)) {
|
|
529
|
+
return new Error("Fiber failed without a cause");
|
|
530
|
+
} else if (Cause.isInterruptedOnly(cause)) {
|
|
531
|
+
return new Error("Fiber was interrupted");
|
|
532
|
+
} else {
|
|
533
|
+
const errors = [
|
|
534
|
+
...Chunk.toArray(Cause.failures(cause)),
|
|
535
|
+
...Chunk.toArray(Cause.defects(cause))
|
|
536
|
+
];
|
|
537
|
+
const getStackFrames = () => {
|
|
538
|
+
const o = {};
|
|
539
|
+
Error.captureStackTrace(o, getStackFrames);
|
|
540
|
+
return o.stack.split("\n").slice(1);
|
|
541
|
+
};
|
|
542
|
+
const stackFrames = getStackFrames();
|
|
543
|
+
const newErrors = errors.map((error) => prettyErrorStack(error, stackFrames));
|
|
544
|
+
if (newErrors.length === 1) {
|
|
545
|
+
return newErrors[0];
|
|
546
|
+
} else {
|
|
547
|
+
return new AggregateError(newErrors);
|
|
548
|
+
}
|
|
549
|
+
}
|
|
550
|
+
};
|
|
551
|
+
var throwCause = (cause) => {
|
|
552
|
+
throw causeToError(cause);
|
|
553
|
+
};
|
|
554
|
+
var unwrapExit = (exit) => {
|
|
555
|
+
if (Exit.isSuccess(exit)) {
|
|
556
|
+
return exit.value;
|
|
557
|
+
}
|
|
558
|
+
return throwCause(exit.cause);
|
|
559
|
+
};
|
|
560
|
+
var runAndForwardErrors = async (effect, options) => {
|
|
561
|
+
const exit = await Effect2.runPromiseExit(effect, options);
|
|
562
|
+
return unwrapExit(exit);
|
|
563
|
+
};
|
|
564
|
+
var promiseWithCauseCapture = (evaluate) => Effect2.promise(async (signal) => {
|
|
565
|
+
try {
|
|
566
|
+
const result = await evaluate(signal);
|
|
567
|
+
return Effect2.succeed(result);
|
|
568
|
+
} catch (err) {
|
|
569
|
+
return Effect2.die(err);
|
|
570
|
+
}
|
|
571
|
+
}).pipe(Effect2.flatten);
|
|
572
|
+
|
|
573
|
+
// src/testing.ts
|
|
574
|
+
import { Effect as Effect3 } from "effect";
|
|
575
|
+
(function(TestHelpers2) {
|
|
576
|
+
TestHelpers2.runIf = (condition) => (effect, ctx) => Effect3.gen(function* () {
|
|
577
|
+
if (!condition) {
|
|
578
|
+
ctx.skip();
|
|
579
|
+
} else {
|
|
580
|
+
return yield* effect;
|
|
581
|
+
}
|
|
582
|
+
});
|
|
583
|
+
TestHelpers2.skipIf = (condition) => (effect, ctx) => Effect3.gen(function* () {
|
|
584
|
+
if (condition) {
|
|
585
|
+
ctx.skip();
|
|
586
|
+
} else {
|
|
587
|
+
return yield* effect;
|
|
588
|
+
}
|
|
589
|
+
});
|
|
590
|
+
TestHelpers2.taggedTest = (tag) => (effect, ctx) => Effect3.gen(function* () {
|
|
591
|
+
if (!process.env.DX_TEST_TAGS?.includes(tag)) {
|
|
592
|
+
ctx.skip();
|
|
593
|
+
} else {
|
|
594
|
+
return yield* effect;
|
|
595
|
+
}
|
|
596
|
+
});
|
|
597
|
+
})(TestHelpers || (TestHelpers = {}));
|
|
598
|
+
var TestHelpers;
|
|
599
|
+
|
|
600
|
+
// src/resource.ts
|
|
601
|
+
import { Effect as Effect4 } from "effect";
|
|
602
|
+
var accuireReleaseResource = (getResource) => Effect4.acquireRelease(Effect4.gen(function* () {
|
|
603
|
+
const resource = getResource();
|
|
604
|
+
yield* Effect4.promise(async () => {
|
|
605
|
+
resource.open?.();
|
|
606
|
+
return void 0;
|
|
607
|
+
});
|
|
608
|
+
return resource;
|
|
609
|
+
}), (resource) => Effect4.promise(async () => {
|
|
610
|
+
resource.close?.();
|
|
611
|
+
return void 0;
|
|
612
|
+
}));
|
|
419
613
|
export {
|
|
420
614
|
JsonPath,
|
|
421
615
|
JsonProp,
|
|
422
616
|
ParamKeyAnnotation,
|
|
423
617
|
SimpleType,
|
|
618
|
+
TestHelpers,
|
|
424
619
|
UrlParser,
|
|
425
620
|
VisitResult,
|
|
621
|
+
accuireReleaseResource,
|
|
622
|
+
causeToError,
|
|
623
|
+
contextFromScope,
|
|
426
624
|
createJsonPath,
|
|
427
625
|
findAnnotation,
|
|
428
626
|
findNode,
|
|
@@ -434,13 +632,18 @@ export {
|
|
|
434
632
|
getField,
|
|
435
633
|
getParamKeyAnnotation,
|
|
436
634
|
getSimpleType,
|
|
635
|
+
isArrayType,
|
|
437
636
|
isDiscriminatedUnion,
|
|
438
637
|
isJsonPath,
|
|
439
638
|
isLiteralUnion,
|
|
440
639
|
isOption,
|
|
441
640
|
isSimpleType,
|
|
442
641
|
mapAst,
|
|
642
|
+
promiseWithCauseCapture,
|
|
643
|
+
runAndForwardErrors,
|
|
443
644
|
splitJsonPath,
|
|
645
|
+
throwCause,
|
|
646
|
+
unwrapExit,
|
|
444
647
|
visit
|
|
445
648
|
};
|
|
446
649
|
//# sourceMappingURL=index.mjs.map
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
|
-
"sources": ["../../../src/ast.ts", "../../../src/jsonPath.ts", "../../../src/url.ts"],
|
|
4
|
-
"sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { Option, pipe, SchemaAST, Schema } from 'effect';\n\nimport { invariant } from '@dxos/invariant';\nimport { isNonNullable } from '@dxos/util';\n\nimport { type JsonPath, type JsonProp } from './jsonPath';\n\n//\n// Refs\n// https://effect.website/docs/schema/introduction\n// https://www.npmjs.com/package/@effect/schema\n// https://effect-ts.github.io/effect/schema/SchemaAST.ts.html\n//\n\nexport type SimpleType = 'object' | 'string' | 'number' | 'boolean' | 'enum' | 'literal';\n\n/**\n * Get the base type; e.g., traverse through refinements.\n */\nexport const getSimpleType = (node: SchemaAST.AST): SimpleType | undefined => {\n if (\n SchemaAST.isDeclaration(node) ||\n SchemaAST.isObjectKeyword(node) ||\n SchemaAST.isTypeLiteral(node) ||\n isDiscriminatedUnion(node)\n ) {\n return 'object';\n }\n\n if (SchemaAST.isStringKeyword(node)) {\n return 'string';\n }\n if (SchemaAST.isNumberKeyword(node)) {\n return 'number';\n }\n if (SchemaAST.isBooleanKeyword(node)) {\n return 'boolean';\n }\n\n if (SchemaAST.isEnums(node)) {\n return 'enum';\n }\n\n if (SchemaAST.isLiteral(node)) {\n return 'literal';\n }\n};\n\nexport const isSimpleType = (node: SchemaAST.AST): boolean => !!getSimpleType(node);\n\nexport namespace SimpleType {\n /**\n * Returns the default empty value for a given SimpleType.\n * Used for initializing new array values etc.\n */\n export const getDefaultValue = (type: SimpleType): any => {\n switch (type) {\n case 'string': {\n return '';\n }\n case 'number': {\n return 0;\n }\n case 'boolean': {\n return false;\n }\n case 'object': {\n return {};\n }\n default: {\n throw new Error(`Unsupported type for default value: ${type}`);\n }\n }\n };\n}\n\n//\n// Branded types\n//\n\nexport enum VisitResult {\n CONTINUE = 0,\n /**\n * Skip visiting children.\n */\n SKIP = 1,\n /**\n * Stop traversing immediately.\n */\n EXIT = 2,\n}\n\nexport type Path = (string | number)[];\n\nexport type TestFn = (node: SchemaAST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;\n\nexport type VisitorFn = (node: SchemaAST.AST, path: Path, depth: number) => void;\n\nconst defaultTest: TestFn = isSimpleType;\n\n/**\n * Visit leaf nodes.\n * Refs:\n * - https://github.com/syntax-tree/unist-util-visit?tab=readme-ov-file#visitor\n * - https://github.com/syntax-tree/unist-util-is?tab=readme-ov-file#test\n */\nexport const visit: {\n (node: SchemaAST.AST, visitor: VisitorFn): void;\n (node: SchemaAST.AST, test: TestFn, visitor: VisitorFn): void;\n} = (node: SchemaAST.AST, testOrVisitor: TestFn | VisitorFn, visitor?: VisitorFn): void => {\n if (!visitor) {\n visitNode(node, defaultTest, testOrVisitor);\n } else {\n visitNode(node, testOrVisitor as TestFn, visitor);\n }\n};\n\nconst visitNode = (\n node: SchemaAST.AST,\n test: TestFn | undefined,\n visitor: VisitorFn,\n path: Path = [],\n depth = 0,\n): VisitResult | undefined => {\n const _result = test?.(node, path, depth);\n const result: VisitResult =\n _result === undefined\n ? VisitResult.CONTINUE\n : typeof _result === 'boolean'\n ? _result\n ? VisitResult.CONTINUE\n : VisitResult.SKIP\n : _result;\n\n if (result === VisitResult.EXIT) {\n return result;\n }\n if (result !== VisitResult.SKIP) {\n visitor(node, path, depth);\n }\n\n // Object.\n if (SchemaAST.isTypeLiteral(node)) {\n for (const prop of SchemaAST.getPropertySignatures(node)) {\n const currentPath = [...path, prop.name.toString()];\n const result = visitNode(prop.type, test, visitor, currentPath, depth + 1);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n }\n\n // Array.\n else if (SchemaAST.isTupleType(node)) {\n for (const [i, element] of node.elements.entries()) {\n const currentPath = [...path, i];\n const result = visitNode(element.type, test, visitor, currentPath, depth);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n }\n\n // Branching union (e.g., optional, discriminated unions).\n else if (SchemaAST.isUnion(node)) {\n for (const type of node.types) {\n const result = visitNode(type, test, visitor, path, depth);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n }\n\n // Refinement.\n else if (SchemaAST.isRefinement(node)) {\n const result = visitNode(node.from, test, visitor, path, depth);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n\n // TODO(burdon): Transforms?\n};\n\n/**\n * Recursively descend into AST to find first node that passes the test.\n */\n// TODO(burdon): Rewrite using visitNode?\nexport const findNode = (node: SchemaAST.AST, test: (node: SchemaAST.AST) => boolean): SchemaAST.AST | undefined => {\n if (test(node)) {\n return node;\n }\n\n // Object.\n else if (SchemaAST.isTypeLiteral(node)) {\n for (const prop of SchemaAST.getPropertySignatures(node)) {\n const child = findNode(prop.type, test);\n if (child) {\n return child;\n }\n }\n }\n\n // Tuple.\n else if (SchemaAST.isTupleType(node)) {\n for (const [_, element] of node.elements.entries()) {\n const child = findNode(element.type, test);\n if (child) {\n return child;\n }\n }\n }\n\n // Branching union (e.g., optional, discriminated unions).\n else if (SchemaAST.isUnion(node)) {\n if (isOption(node)) {\n for (const type of node.types) {\n const child = findNode(type, test);\n if (child) {\n return child;\n }\n }\n }\n }\n\n // Refinement.\n else if (SchemaAST.isRefinement(node)) {\n return findNode(node.from, test);\n }\n};\n\n/**\n * Get the AST node for the given property (dot-path).\n */\nexport const findProperty = (\n schema: Schema.Schema.AnyNoContext,\n path: JsonPath | JsonProp,\n): SchemaAST.AST | undefined => {\n const getProp = (node: SchemaAST.AST, path: JsonProp[]): SchemaAST.AST | undefined => {\n const [name, ...rest] = path;\n const typeNode = findNode(node, SchemaAST.isTypeLiteral);\n invariant(typeNode);\n for (const prop of SchemaAST.getPropertySignatures(typeNode)) {\n if (prop.name === name) {\n if (rest.length) {\n return getProp(prop.type, rest);\n } else {\n return prop.type;\n }\n }\n }\n };\n\n return getProp(schema.ast, path.split('.') as JsonProp[]);\n};\n\n//\n// Annotations\n//\n\nconst defaultAnnotations: Record<string, SchemaAST.Annotated> = {\n ['ObjectKeyword' as const]: SchemaAST.objectKeyword,\n ['StringKeyword' as const]: SchemaAST.stringKeyword,\n ['NumberKeyword' as const]: SchemaAST.numberKeyword,\n ['BooleanKeyword' as const]: SchemaAST.booleanKeyword,\n};\n\n/**\n * Get annotation or return undefined.\n * @param annotationId\n * @param noDefault If true, then return undefined for effect library defined values.\n */\nexport const getAnnotation =\n <T>(annotationId: symbol, noDefault = true) =>\n (node: SchemaAST.AST): T | undefined => {\n // Title fallback seems to be the identifier.\n const id = pipe(SchemaAST.getIdentifierAnnotation(node), Option.getOrUndefined);\n const value = pipe(SchemaAST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n return undefined;\n }\n\n return value;\n };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: SchemaAST.AST, annotationId: symbol, noDefault = true): T | undefined => {\n const getAnnotationById = getAnnotation(annotationId, noDefault);\n\n const getBaseAnnotation = (node: SchemaAST.AST): T | undefined => {\n const value = getAnnotationById(node);\n if (value !== undefined) {\n return value as T;\n }\n\n if (SchemaAST.isUnion(node)) {\n if (isOption(node)) {\n return getAnnotationById(node.types[0]) as T;\n }\n }\n };\n\n return getBaseAnnotation(node);\n};\n\n//\n// Unions\n//\n\n/**\n * Effect Schema.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: SchemaAST.AST): boolean => {\n return SchemaAST.isUnion(node) && node.types.length === 2 && SchemaAST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: SchemaAST.AST): boolean => {\n return SchemaAST.isUnion(node) && node.types.every(SchemaAST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: SchemaAST.AST): boolean => {\n return SchemaAST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: SchemaAST.AST): string[] | undefined => {\n invariant(SchemaAST.isUnion(node));\n if (isOption(node)) {\n return;\n }\n\n // Get common literals across all types.\n return node.types.reduce<string[]>((shared, type) => {\n const props = SchemaAST.getPropertySignatures(type)\n // TODO(burdon): Should check each literal is unique.\n .filter((p) => SchemaAST.isLiteral(p.type))\n .map((p) => p.name.toString());\n\n // Return common literals.\n return shared.length === 0 ? props : shared.filter((prop) => props.includes(prop));\n }, []);\n};\n\n/**\n * Get the discriminated type for the given value.\n */\nexport const getDiscriminatedType = (\n node: SchemaAST.AST,\n value: Record<string, any> = {},\n): SchemaAST.AST | undefined => {\n invariant(SchemaAST.isUnion(node));\n invariant(value);\n const props = getDiscriminatingProps(node);\n if (!props?.length) {\n return;\n }\n\n // Match provided values.\n for (const type of node.types) {\n const match = SchemaAST.getPropertySignatures(type)\n .filter((prop) => props?.includes(prop.name.toString()))\n .every((prop) => {\n invariant(SchemaAST.isLiteral(prop.type));\n return prop.type.literal === value[prop.name.toString()];\n });\n\n if (match) {\n return type;\n }\n }\n\n // Create union of discriminating properties.\n // NOTE: This may not work with non-overlapping variants.\n // TODO(burdon): Iterate through props and knock-out variants that don't match.\n const fields = Object.fromEntries(\n props\n .map((prop) => {\n const literals = node.types\n .map((type) => {\n const literal = SchemaAST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n invariant(SchemaAST.isLiteral(literal.type));\n return literal.type.literal;\n })\n .filter(isNonNullable);\n\n return literals.length ? [prop, Schema.Literal(...literals)] : undefined;\n })\n .filter(isNonNullable),\n );\n\n const schema = Schema.Struct(fields);\n return schema.ast;\n};\n\n/**\n * Maps AST nodes.\n * The user is responsible for recursively calling {@link mapAst} on the SchemaAST.\n * NOTE: Will evaluate suspended ASTs.\n */\nexport const mapAst = (\n ast: SchemaAST.AST,\n f: (ast: SchemaAST.AST, key: keyof any | undefined) => SchemaAST.AST,\n): SchemaAST.AST => {\n switch (ast._tag) {\n case 'TypeLiteral': {\n return new SchemaAST.TypeLiteral(\n ast.propertySignatures.map(\n (prop) =>\n new SchemaAST.PropertySignature(\n prop.name,\n f(prop.type, prop.name),\n prop.isOptional,\n prop.isReadonly,\n prop.annotations,\n ),\n ),\n ast.indexSignatures,\n );\n }\n case 'Union': {\n return SchemaAST.Union.make(ast.types.map(f), ast.annotations);\n }\n case 'TupleType': {\n return new SchemaAST.TupleType(\n ast.elements.map((t, index) => new SchemaAST.OptionalType(f(t.type, index), t.isOptional, t.annotations)),\n ast.rest.map((t) => new SchemaAST.Type(f(t.type, undefined), t.annotations)),\n ast.isReadonly,\n ast.annotations,\n );\n }\n case 'Suspend': {\n const newAst = f(ast.f(), undefined);\n return new SchemaAST.Suspend(() => newAst, ast.annotations);\n }\n default: {\n // TODO(dmaretskyi): Support more nodes.\n return ast;\n }\n }\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Schema, Option } from 'effect';\nimport { JSONPath } from 'jsonpath-plus';\n\nimport { invariant } from '@dxos/invariant';\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^($|[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\](?:\\.)?)*$)/;\nconst PROP_REGEX = /^\\w+$/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = Schema.String.pipe(Schema.pattern(PATH_REGEX)).annotations({\n title: 'JSON path',\n description: 'JSON path to a property',\n}) as any as Schema.Schema<JsonPath>;\nexport const JsonProp = Schema.NonEmptyString.pipe(\n Schema.pattern(PROP_REGEX, {\n message: () => 'Property name must contain only letters, numbers, and underscores',\n }),\n) as any as Schema.Schema<JsonProp>;\n\nexport const isJsonPath = (value: unknown): value is JsonPath => {\n return Option.isSome(Schema.validateOption(JsonPath)(value));\n};\n\n/**\n * Creates a JsonPath from an array of path segments.\n *\n * Currently supports:\n * - Simple property access (e.g., 'foo.bar')\n * - Array indexing with non-negative integers (e.g., 'foo[0]')\n * - Identifiers starting with letters, underscore, or $ (e.g., '$foo', '_bar')\n * - Dot notation for nested properties (e.g., 'foo.bar.baz')\n *\n * Does not support (yet?).\n * - Recursive descent (..)\n * - Wildcards (*)\n * - Array slicing\n * - Filters\n * - Negative indices\n *\n * @param path Array of string or number segments\n * @returns Valid JsonPath or undefined if invalid\n */\nexport const createJsonPath = (path: (string | number)[]): JsonPath => {\n const candidatePath = path\n .map((p, i) => {\n if (typeof p === 'number') {\n return `[${p}]`;\n } else {\n return i === 0 ? p : `.${p}`;\n }\n })\n .join('');\n\n invariant(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`);\n return candidatePath;\n};\n\n/**\n * Converts Effect validation path format (e.g. \"addresses.[0].zip\")\n * to JsonPath format (e.g., \"addresses[0].zip\")\n */\nexport const fromEffectValidationPath = (effectPath: string): JsonPath => {\n // Handle array notation: convert \"prop.[0]\" to \"prop[0]\"\n const jsonPath = effectPath.replace(/\\.\\[(\\d+)\\]/g, '[$1]');\n invariant(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`);\n return jsonPath;\n};\n\n/**\n * Splits a JsonPath into its constituent parts.\n * Handles property access and array indexing.\n */\nexport const splitJsonPath = (path: JsonPath): string[] => {\n if (!isJsonPath(path)) {\n return [];\n }\n\n return (\n path\n .match(/[a-zA-Z_$][\\w$]*|\\[\\d+\\]/g)\n ?.map((part) => (part.startsWith('[') ? part.replace(/[[\\]]/g, '') : part)) ?? []\n );\n};\n\n/**\n * Applies a JsonPath to an object.\n */\nexport const getField = (object: any, path: JsonPath): any => {\n // By default, JSONPath returns an array of results.\n return JSONPath({ path, json: object })[0];\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { SchemaAST, type Schema, Option, pipe } from 'effect';\n\nimport { decamelize } from '@dxos/util';\n\nconst ParamKeyAnnotationId = Symbol.for('@dxos/schema/annotation/ParamKey');\n\ntype ParamKeyAnnotationValue = { key: string };\n\nexport const getParamKeyAnnotation: (annotated: SchemaAST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n SchemaAST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n (value: ParamKeyAnnotationValue) =>\n <S extends Schema.Annotable.All>(self: S): Schema.Annotable.Self<S> =>\n self.annotations({ [ParamKeyAnnotationId]: value });\n\n/**\n * HTTP params parser.\n * Supports custom key serialization.\n */\nexport class UrlParser<T extends Record<string, any>> {\n constructor(private readonly _schema: Schema.Struct<T>) {}\n\n /**\n * Parse URL params.\n */\n parse(_url: string): T {\n const url = new URL(_url);\n return Object.entries(this._schema.fields).reduce<Record<string, any>>((params, [key, type]) => {\n let value = url.searchParams.get(decamelize(key));\n if (value == null) {\n value = url.searchParams.get(key);\n }\n\n if (value != null) {\n if (SchemaAST.isNumberKeyword(type.ast)) {\n params[key] = parseInt(value);\n } else if (SchemaAST.isBooleanKeyword(type.ast)) {\n params[key] = value === 'true' || value === '1';\n } else {\n params[key] = value;\n }\n }\n\n return params;\n }, {}) as T;\n }\n\n /**\n * Return URL with encoded params.\n */\n create(_url: string, params: T): URL {\n const url = new URL(_url);\n Object.entries(params).forEach(([key, value]) => {\n if (value !== undefined) {\n const field = this._schema.fields[key];\n if (field) {\n const { key: serializedKey } = pipe(\n getParamKeyAnnotation(field.ast),\n Option.getOrElse(() => ({\n key: decamelize(key),\n })),\n );\n\n url.searchParams.set(serializedKey, String(value));\n }\n }\n });\n\n return url;\n }\n}\n"],
|
|
5
|
-
"mappings": ";;;AAIA,SAASA,QAAQC,MAAMC,WAAWC,cAAc;AAEhD,SAASC,iBAAiB;AAC1B,SAASC,qBAAqB;;AAgBvB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MACEL,UAAUM,cAAcD,IAAAA,KACxBL,UAAUO,gBAAgBF,IAAAA,KAC1BL,UAAUQ,cAAcH,IAAAA,KACxBI,qBAAqBJ,IAAAA,GACrB;AACA,WAAO;EACT;AAEA,MAAIL,UAAUU,gBAAgBL,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAIL,UAAUW,gBAAgBN,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAIL,UAAUY,iBAAiBP,IAAAA,GAAO;AACpC,WAAO;EACT;AAEA,MAAIL,UAAUa,QAAQR,IAAAA,GAAO;AAC3B,WAAO;EACT;AAEA,MAAIL,UAAUc,UAAUT,IAAAA,GAAO;AAC7B,WAAO;EACT;AACF;AAEO,IAAMU,eAAe,CAACV,SAAiC,CAAC,CAACD,cAAcC,IAAAA;UAE7DW,aAAAA;cAKFC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;AA8BV,IAAKI,cAAAA,yBAAAA,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;SARSA;;AAkBZ,IAAMC,cAAsBN;AAQrB,IAAMO,QAGT,CAACjB,MAAqBkB,eAAmCC,YAAAA;AAC3D,MAAI,CAACA,SAAS;AACZC,cAAUpB,MAAMgB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUpB,MAAMkB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBpB,MACAqB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOrB,MAAMsB,MAAMC,KAAAA;AACnC,QAAME,SACJD,YAAYE,SAAAA,IAER,OAAOF,YAAY,YACjBA,UAAAA,IAAAA,IAGAA;AAER,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BN,YAAQnB,MAAMsB,MAAMC,KAAAA;EACtB;AAGA,MAAI5B,UAAUQ,cAAcH,IAAAA,GAAO;AACjC,eAAW2B,QAAQhC,UAAUiC,sBAAsB5B,IAAAA,GAAO;AACxD,YAAM6B,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKd,MAAMQ,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS9B,UAAUqC,YAAYhC,IAAAA,GAAO;AACpC,eAAW,CAACiC,GAAGC,OAAAA,KAAYlC,KAAKmC,SAASC,QAAO,GAAI;AAClD,YAAMP,cAAc;WAAIP;QAAMW;;AAC9B,YAAMR,UAASL,UAAUc,QAAQrB,MAAMQ,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS9B,UAAU0C,QAAQrC,IAAAA,GAAO;AAChC,eAAWa,QAAQb,KAAKsC,OAAO;AAC7B,YAAMb,UAASL,UAAUP,MAAMQ,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS9B,UAAU4C,aAAavC,IAAAA,GAAO;AACrC,UAAMyB,UAASL,UAAUpB,KAAKwC,MAAMnB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAACzC,MAAqBqB,SAAAA;AAC5C,MAAIA,KAAKrB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSL,UAAUQ,cAAcH,IAAAA,GAAO;AACtC,eAAW2B,QAAQhC,UAAUiC,sBAAsB5B,IAAAA,GAAO;AACxD,YAAM0C,QAAQD,SAASd,KAAKd,MAAMQ,IAAAA;AAClC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGS/C,UAAUqC,YAAYhC,IAAAA,GAAO;AACpC,eAAW,CAAC2C,GAAGT,OAAAA,KAAYlC,KAAKmC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQrB,MAAMQ,IAAAA;AACrC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGS/C,UAAU0C,QAAQrC,IAAAA,GAAO;AAChC,QAAI4C,SAAS5C,IAAAA,GAAO;AAClB,iBAAWa,QAAQb,KAAKsC,OAAO;AAC7B,cAAMI,QAAQD,SAAS5B,MAAMQ,IAAAA;AAC7B,YAAIqB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGS/C,UAAU4C,aAAavC,IAAAA,GAAO;AACrC,WAAOyC,SAASzC,KAAKwC,MAAMnB,IAAAA;EAC7B;AACF;AAKO,IAAMwB,eAAe,CAC1BC,QACAxB,SAAAA;AAEA,QAAMyB,UAAU,CAAC/C,MAAqBsB,UAAAA;AACpC,UAAM,CAACQ,MAAM,GAAGkB,IAAAA,IAAQ1B;AACxB,UAAM2B,WAAWR,SAASzC,MAAML,UAAUQ,aAAa;AACvDN,cAAUoD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWtB,QAAQhC,UAAUiC,sBAAsBqB,QAAAA,GAAW;AAC5D,UAAItB,KAAKG,SAASA,MAAM;AACtB,YAAIkB,KAAKE,QAAQ;AACf,iBAAOH,QAAQpB,KAAKd,MAAMmC,IAAAA;QAC5B,OAAO;AACL,iBAAOrB,KAAKd;QACd;MACF;IACF;EACF;AAEA,SAAOkC,QAAQD,OAAOK,KAAK7B,KAAK8B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAA0D;EAC9D,CAAC,eAAA,GAA2B1D,UAAU2D;EACtC,CAAC,eAAA,GAA2B3D,UAAU4D;EACtC,CAAC,eAAA,GAA2B5D,UAAU6D;EACtC,CAAC,gBAAA,GAA4B7D,UAAU8D;AACzC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC5D,SAAAA;AAEC,QAAM6D,KAAKnE,KAAKC,UAAUmE,wBAAwB9D,IAAAA,GAAOP,OAAOsE,cAAc;AAC9E,QAAMC,QAAQtE,KAAKC,UAAU+D,cAAiBC,YAAAA,EAAc3D,IAAAA,GAAOP,OAAOsE,cAAc;AACxF,MAAIH,cAAcI,UAAUX,mBAAmBrD,KAAKiE,IAAI,GAAGC,YAAYP,YAAAA,KAAiBK,UAAUH,KAAK;AACrG,WAAOnC;EACT;AAEA,SAAOsC;AACT;AAOK,IAAMG,iBAAiB,CAAInE,MAAqB2D,cAAsBC,YAAY,SAAI;AAC3F,QAAMQ,oBAAoBV,cAAcC,cAAcC,SAAAA;AAEtD,QAAMS,oBAAoB,CAACrE,UAAAA;AACzB,UAAMgE,QAAQI,kBAAkBpE,KAAAA;AAChC,QAAIgE,UAAUtC,QAAW;AACvB,aAAOsC;IACT;AAEA,QAAIrE,UAAU0C,QAAQrC,KAAAA,GAAO;AAC3B,UAAI4C,SAAS5C,KAAAA,GAAO;AAClB,eAAOoE,kBAAkBpE,MAAKsC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAO+B,kBAAkBrE,IAAAA;AAC3B;AASO,IAAM4C,WAAW,CAAC5C,SAAAA;AACvB,SAAOL,UAAU0C,QAAQrC,IAAAA,KAASA,KAAKsC,MAAMY,WAAW,KAAKvD,UAAU2E,mBAAmBtE,KAAKsC,MAAM,CAAA,CAAE;AACzG;AAKO,IAAMiC,iBAAiB,CAACvE,SAAAA;AAC7B,SAAOL,UAAU0C,QAAQrC,IAAAA,KAASA,KAAKsC,MAAMkC,MAAM7E,UAAUc,SAAS;AACxE;AAKO,IAAML,uBAAuB,CAACJ,SAAAA;AACnC,SAAOL,UAAU0C,QAAQrC,IAAAA,KAAS,CAAC,CAACyE,uBAAuBzE,IAAAA,GAAOkD;AACpE;AAKO,IAAMuB,yBAAyB,CAACzE,SAAAA;AACrCH,YAAUF,UAAU0C,QAAQrC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5B,MAAI4C,SAAS5C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKsC,MAAMoC,OAAiB,CAACC,QAAQ9D,SAAAA;AAC1C,UAAM+D,QAAQjF,UAAUiC,sBAAsBf,IAAAA,EAE3CgE,OAAO,CAACC,MAAMnF,UAAUc,UAAUqE,EAAEjE,IAAI,CAAA,EACxCkE,IAAI,CAACD,MAAMA,EAAEhD,KAAKC,SAAQ,CAAA;AAG7B,WAAO4C,OAAOzB,WAAW,IAAI0B,QAAQD,OAAOE,OAAO,CAAClD,SAASiD,MAAMI,SAASrD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMsD,uBAAuB,CAClCjF,MACAgE,QAA6B,CAAC,MAAC;AAE/BnE,YAAUF,UAAU0C,QAAQrC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5BH,YAAUmE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMY,QAAQH,uBAAuBzE,IAAAA;AACrC,MAAI,CAAC4E,OAAO1B,QAAQ;AAClB;EACF;AAGA,aAAWrC,QAAQb,KAAKsC,OAAO;AAC7B,UAAM4C,QAAQvF,UAAUiC,sBAAsBf,IAAAA,EAC3CgE,OAAO,CAAClD,SAASiD,OAAOI,SAASrD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDyC,MAAM,CAAC7C,SAAAA;AACN9B,gBAAUF,UAAUc,UAAUkB,KAAKd,IAAI,GAAA,QAAA;;;;;;;;;AACvC,aAAOc,KAAKd,KAAKsE,YAAYnB,MAAMrC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAImD,OAAO;AACT,aAAOrE;IACT;EACF;AAKA,QAAMuE,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACpD,SAAAA;AACJ,UAAM4D,WAAWvF,KAAKsC,MACnByC,IAAI,CAAClE,SAAAA;AACJ,YAAMsE,UAAUxF,UAAUiC,sBAAsBf,IAAAA,EAAM2E,KAAK,CAACV,MAAMA,EAAEhD,KAAKC,SAAQ,MAAOJ,IAAAA;AACxF9B,gBAAUF,UAAUc,UAAU0E,QAAQtE,IAAI,GAAA,QAAA;;;;;;;;;AAC1C,aAAOsE,QAAQtE,KAAKsE;IACtB,CAAA,EACCN,OAAO/E,aAAAA;AAEV,WAAOyF,SAASrC,SAAS;MAACvB;MAAM/B,OAAO6F,QAAO,GAAIF,QAAAA;QAAa7D;EACjE,CAAA,EACCmD,OAAO/E,aAAAA,CAAAA;AAGZ,QAAMgD,SAASlD,OAAO8F,OAAON,MAAAA;AAC7B,SAAOtC,OAAOK;AAChB;AAOO,IAAMwC,SAAS,CACpBxC,KACAyC,MAAAA;AAEA,UAAQzC,IAAIc,MAAI;IACd,KAAK,eAAe;AAClB,aAAO,IAAItE,UAAUkG,YACnB1C,IAAI2C,mBAAmBf,IACrB,CAACpD,SACC,IAAIhC,UAAUoG,kBACZpE,KAAKG,MACL8D,EAAEjE,KAAKd,MAAMc,KAAKG,IAAI,GACtBH,KAAKqE,YACLrE,KAAKsE,YACLtE,KAAKuC,WAAW,CAAA,GAGtBf,IAAI+C,eAAe;IAEvB;IACA,KAAK,SAAS;AACZ,aAAOvG,UAAUwG,MAAMC,KAAKjD,IAAIb,MAAMyC,IAAIa,CAAAA,GAAIzC,IAAIe,WAAW;IAC/D;IACA,KAAK,aAAa;AAChB,aAAO,IAAIvE,UAAU0G,UACnBlD,IAAIhB,SAAS4C,IAAI,CAACuB,GAAGC,UAAU,IAAI5G,UAAU6G,aAAaZ,EAAEU,EAAEzF,MAAM0F,KAAAA,GAAQD,EAAEN,YAAYM,EAAEpC,WAAW,CAAA,GACvGf,IAAIH,KAAK+B,IAAI,CAACuB,MAAM,IAAI3G,UAAU8G,KAAKb,EAAEU,EAAEzF,MAAMa,MAAAA,GAAY4E,EAAEpC,WAAW,CAAA,GAC1Ef,IAAI8C,YACJ9C,IAAIe,WAAW;IAEnB;IACA,KAAK,WAAW;AACd,YAAMwC,SAASd,EAAEzC,IAAIyC,EAAC,GAAIlE,MAAAA;AAC1B,aAAO,IAAI/B,UAAUgH,QAAQ,MAAMD,QAAQvD,IAAIe,WAAW;IAC5D;IACA,SAAS;AAEP,aAAOf;IACT;EACF;AACF;;;;ACncA,SAASyD,UAAAA,SAAQC,UAAAA,eAAc;AAC/B,SAASC,gBAAgB;AAEzB,SAASC,aAAAA,kBAAiB;;AAK1B,IAAMC,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWN,QAAOO,OAAOC,KAAKR,QAAOS,QAAQL,UAAAA,CAAAA,EAAaM,YAAY;EACjFC,OAAO;EACPC,aAAa;AACf,CAAA;AACO,IAAMC,WAAWb,QAAOc,eAAeN,KAC5CR,QAAOS,QAAQJ,YAAY;EACzBU,SAAS,MAAM;AACjB,CAAA,CAAA;AAGK,IAAMC,aAAa,CAACC,UAAAA;AACzB,SAAOhB,QAAOiB,OAAOlB,QAAOmB,eAAeb,QAAAA,EAAUW,KAAAA,CAAAA;AACvD;AAqBO,IAAMG,iBAAiB,CAACC,SAAAA;AAC7B,QAAMC,gBAAgBD,KACnBE,IAAI,CAACC,GAAGC,MAAAA;AACP,QAAI,OAAOD,MAAM,UAAU;AACzB,aAAO,IAAIA,CAAAA;IACb,OAAO;AACL,aAAOC,MAAM,IAAID,IAAI,IAAIA,CAAAA;IAC3B;EACF,CAAA,EACCE,KAAK,EAAA;AAERvB,EAAAA,WAAUa,WAAWM,aAAAA,GAAgB,qBAAqBA,aAAAA,IAAe;;;;;;;;;AACzE,SAAOA;AACT;AAMO,IAAMK,2BAA2B,CAACC,eAAAA;AAEvC,QAAMC,WAAWD,WAAWE,QAAQ,gBAAgB,MAAA;AACpD3B,EAAAA,WAAUa,WAAWa,QAAAA,GAAW,qBAAqBA,QAAAA,IAAU;;;;;;;;;AAC/D,SAAOA;AACT;AAMO,IAAME,gBAAgB,CAACV,SAAAA;AAC5B,MAAI,CAACL,WAAWK,IAAAA,GAAO;AACrB,WAAO,CAAA;EACT;AAEA,SACEA,KACGW,MAAM,2BAAA,GACLT,IAAI,CAACU,SAAUA,KAAKC,WAAW,GAAA,IAAOD,KAAKH,QAAQ,UAAU,EAAA,IAAMG,IAAAA,KAAU,CAAA;AAErF;AAKO,IAAME,WAAW,CAACC,QAAaf,SAAAA;AAEpC,SAAOnB,SAAS;IAAEmB;IAAMgB,MAAMD;EAAO,CAAA,EAAG,CAAA;AAC1C;;;AC/FA,SAASE,aAAAA,YAAwBC,UAAAA,SAAQC,QAAAA,aAAY;AAErD,SAASC,kBAAkB;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXC,WAAUC,cAAuCL,oBAAAA;AAE5C,IAAMM,qBACX,CAACC,UACD,CAAiCC,SAC/BA,KAAKC,YAAY;EAAE,CAACT,oBAAAA,GAAuBO;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;EACX,YAA6BC,SAA2B;SAA3BA,UAAAA;EAA4B;;;;EAKzDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKN,QAAQO,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIf,QAAQO,IAAIS,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAId,SAAS,MAAM;AACjBA,gBAAQO,IAAIS,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAId,SAAS,MAAM;AACjB,YAAIH,WAAUsB,gBAAgBJ,KAAKK,GAAG,GAAG;AACvCP,iBAAOC,GAAAA,IAAOO,SAASrB,KAAAA;QACzB,WAAWH,WAAUyB,iBAAiBP,KAAKK,GAAG,GAAG;AAC/CP,iBAAOC,GAAAA,IAAOd,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLa,iBAAOC,GAAAA,IAAOd;QAChB;MACF;AAEA,aAAOa;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOjB,MAAcO,QAAgB;AACnC,UAAMN,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQG,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKd,KAAAA,MAAM;AAC1C,UAAIA,UAAUyB,QAAW;AACvB,cAAMC,QAAQ,KAAKtB,QAAQO,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAKC,MAC7BhC,sBAAsB8B,MAAMN,GAAG,GAC/BS,QAAOC,UAAU,OAAO;YACtBhB,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFP,cAAIS,aAAae,IAAIJ,eAAeK,OAAOhC,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOO;EACT;AACF;",
|
|
6
|
-
"names": ["Option", "
|
|
3
|
+
"sources": ["../../../src/ast.ts", "../../../src/jsonPath.ts", "../../../src/url.ts", "../../../src/context.ts", "../../../src/errors.ts", "../../../src/testing.ts", "../../../src/resource.ts"],
|
|
4
|
+
"sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { Option, Schema, SchemaAST, pipe } from 'effect';\nimport { isUndefinedKeyword } from 'effect/SchemaAST';\n\nimport { invariant } from '@dxos/invariant';\nimport { isNonNullable } from '@dxos/util';\n\nimport { type JsonPath, type JsonProp } from './jsonPath';\n\n//\n// Refs\n// https://effect.website/docs/schema/introduction\n// https://www.npmjs.com/package/@effect/schema\n// https://effect-ts.github.io/effect/schema/SchemaAST.ts.html\n//\n\n// TODO(wittjosiah): What is a \"simple type\"?\nexport type SimpleType = 'object' | 'string' | 'number' | 'boolean' | 'enum' | 'literal';\n\nconst isTupleType = (node: SchemaAST.AST): boolean => {\n // NOTE: Arrays are represented as tuples with no elements and a rest part.\n return SchemaAST.isTupleType(node) && node.elements.length > 0;\n};\n\n/**\n * Get the base type; e.g., traverse through refinements.\n */\nexport const getSimpleType = (node: SchemaAST.AST): SimpleType | undefined => {\n if (\n SchemaAST.isDeclaration(node) ||\n SchemaAST.isObjectKeyword(node) ||\n SchemaAST.isTypeLiteral(node) ||\n // TODO(wittjosiah): Tuples are actually arrays.\n isTupleType(node) ||\n isDiscriminatedUnion(node)\n ) {\n return 'object';\n }\n\n if (SchemaAST.isStringKeyword(node)) {\n return 'string';\n }\n if (SchemaAST.isNumberKeyword(node)) {\n return 'number';\n }\n if (SchemaAST.isBooleanKeyword(node)) {\n return 'boolean';\n }\n\n if (SchemaAST.isEnums(node)) {\n return 'enum';\n }\n\n if (SchemaAST.isLiteral(node)) {\n return 'literal';\n }\n};\n\nexport const isSimpleType = (node: SchemaAST.AST): boolean => !!getSimpleType(node);\n\nexport namespace SimpleType {\n /**\n * Returns the default empty value for a given SimpleType.\n * Used for initializing new array values etc.\n */\n export const getDefaultValue = (type: SimpleType): any => {\n switch (type) {\n case 'string': {\n return '';\n }\n case 'number': {\n return 0;\n }\n case 'boolean': {\n return false;\n }\n case 'object': {\n return {};\n }\n default: {\n throw new Error(`Unsupported type for default value: ${type}`);\n }\n }\n };\n}\n\n//\n// Branded types\n//\n\nexport enum VisitResult {\n CONTINUE = 0,\n /**\n * Skip visiting children.\n */\n SKIP = 1,\n /**\n * Stop traversing immediately.\n */\n EXIT = 2,\n}\n\nexport type Path = (string | number)[];\n\nexport type TestFn = (node: SchemaAST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;\n\nexport type VisitorFn = (node: SchemaAST.AST, path: Path, depth: number) => void;\n\nconst defaultTest: TestFn = isSimpleType;\n\n/**\n * Visit leaf nodes.\n * Refs:\n * - https://github.com/syntax-tree/unist-util-visit?tab=readme-ov-file#visitor\n * - https://github.com/syntax-tree/unist-util-is?tab=readme-ov-file#test\n */\nexport const visit: {\n (node: SchemaAST.AST, visitor: VisitorFn): void;\n (node: SchemaAST.AST, test: TestFn, visitor: VisitorFn): void;\n} = (node: SchemaAST.AST, testOrVisitor: TestFn | VisitorFn, visitor?: VisitorFn): void => {\n if (!visitor) {\n visitNode(node, defaultTest, testOrVisitor);\n } else {\n visitNode(node, testOrVisitor as TestFn, visitor);\n }\n};\n\nconst visitNode = (\n node: SchemaAST.AST,\n test: TestFn | undefined,\n visitor: VisitorFn,\n path: Path = [],\n depth = 0,\n): VisitResult | undefined => {\n const $result = test?.(node, path, depth);\n const result: VisitResult =\n $result === undefined\n ? VisitResult.CONTINUE\n : typeof $result === 'boolean'\n ? $result\n ? VisitResult.CONTINUE\n : VisitResult.SKIP\n : $result;\n\n if (result === VisitResult.EXIT) {\n return result;\n }\n if (result !== VisitResult.SKIP) {\n visitor(node, path, depth);\n }\n\n // Object.\n if (SchemaAST.isTypeLiteral(node)) {\n for (const prop of SchemaAST.getPropertySignatures(node)) {\n const currentPath = [...path, prop.name.toString()];\n const result = visitNode(prop.type, test, visitor, currentPath, depth + 1);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n }\n\n // Array.\n else if (SchemaAST.isTupleType(node)) {\n for (const [i, element] of node.elements.entries()) {\n const currentPath = [...path, i];\n const result = visitNode(element.type, test, visitor, currentPath, depth);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n }\n\n // Branching union (e.g., optional, discriminated unions).\n else if (SchemaAST.isUnion(node)) {\n for (const type of node.types) {\n const result = visitNode(type, test, visitor, path, depth);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n }\n\n // Refinement.\n else if (SchemaAST.isRefinement(node)) {\n const result = visitNode(node.from, test, visitor, path, depth);\n if (result === VisitResult.EXIT) {\n return result;\n }\n }\n\n // TODO(burdon): Transforms?\n};\n\n/**\n * Recursively descend into AST to find first node that passes the test.\n */\n// TODO(burdon): Rewrite using visitNode?\nexport const findNode = (node: SchemaAST.AST, test: (node: SchemaAST.AST) => boolean): SchemaAST.AST | undefined => {\n if (test(node)) {\n return node;\n }\n\n // Object.\n else if (SchemaAST.isTypeLiteral(node)) {\n for (const prop of SchemaAST.getPropertySignatures(node)) {\n const child = findNode(prop.type, test);\n if (child) {\n return child;\n }\n }\n }\n\n // Tuple.\n else if (SchemaAST.isTupleType(node)) {\n for (const [_, element] of node.elements.entries()) {\n const child = findNode(element.type, test);\n if (child) {\n return child;\n }\n }\n }\n\n // Branching union (e.g., optional, discriminated unions).\n else if (SchemaAST.isUnion(node)) {\n if (isLiteralUnion(node)) {\n return undefined;\n }\n\n for (const type of node.types) {\n const child = findNode(type, test);\n if (child) {\n return child;\n }\n }\n }\n\n // Refinement.\n else if (SchemaAST.isRefinement(node)) {\n return findNode(node.from, test);\n }\n};\n\n/**\n * Get the AST node for the given property (dot-path).\n */\nexport const findProperty = (\n schema: Schema.Schema.AnyNoContext,\n path: JsonPath | JsonProp,\n): SchemaAST.AST | undefined => {\n const getProp = (node: SchemaAST.AST, path: JsonProp[]): SchemaAST.AST | undefined => {\n const [name, ...rest] = path;\n const typeNode = findNode(node, SchemaAST.isTypeLiteral);\n invariant(typeNode);\n for (const prop of SchemaAST.getPropertySignatures(typeNode)) {\n if (prop.name === name) {\n if (rest.length) {\n return getProp(prop.type, rest);\n } else {\n return prop.type;\n }\n }\n }\n };\n\n return getProp(schema.ast, path.split('.') as JsonProp[]);\n};\n\n//\n// Annotations\n//\n\nconst defaultAnnotations: Record<string, SchemaAST.Annotated> = {\n ['ObjectKeyword' as const]: SchemaAST.objectKeyword,\n ['StringKeyword' as const]: SchemaAST.stringKeyword,\n ['NumberKeyword' as const]: SchemaAST.numberKeyword,\n ['BooleanKeyword' as const]: SchemaAST.booleanKeyword,\n};\n\n/**\n * Get annotation or return undefined.\n * @param annotationId\n * @param noDefault If true, then return undefined for effect library defined values.\n */\nexport const getAnnotation =\n <T>(annotationId: symbol, noDefault = true) =>\n (node: SchemaAST.AST): T | undefined => {\n // Title fallback seems to be the identifier.\n const id = pipe(SchemaAST.getIdentifierAnnotation(node), Option.getOrUndefined);\n const value = pipe(SchemaAST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n return undefined;\n }\n\n return value;\n };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: SchemaAST.AST, annotationId: symbol, noDefault = true): T | undefined => {\n const getAnnotationById = getAnnotation(annotationId, noDefault);\n\n const getBaseAnnotation = (node: SchemaAST.AST): T | undefined => {\n const value = getAnnotationById(node);\n if (value !== undefined) {\n return value as T;\n }\n\n if (SchemaAST.isUnion(node)) {\n if (isOption(node)) {\n return getAnnotationById(node.types[0]) as T;\n }\n }\n };\n\n return getBaseAnnotation(node);\n};\n\n//\n// Unions\n//\n\n/**\n * Effect Schema.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: SchemaAST.AST): boolean => {\n return SchemaAST.isUnion(node) && node.types.length === 2 && SchemaAST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: SchemaAST.AST): boolean => {\n return SchemaAST.isUnion(node) && node.types.every(SchemaAST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: SchemaAST.AST): boolean => {\n return SchemaAST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: SchemaAST.AST): string[] | undefined => {\n invariant(SchemaAST.isUnion(node));\n if (isOption(node)) {\n return;\n }\n\n // Get common literals across all types.\n return node.types.reduce<string[]>((shared, type) => {\n const props = SchemaAST.getPropertySignatures(type)\n // TODO(burdon): Should check each literal is unique.\n .filter((p) => SchemaAST.isLiteral(p.type))\n .map((p) => p.name.toString());\n\n // Return common literals.\n return shared.length === 0 ? props : shared.filter((prop) => props.includes(prop));\n }, []);\n};\n\n/**\n * Get the discriminated type for the given value.\n */\nexport const getDiscriminatedType = (\n node: SchemaAST.AST,\n value: Record<string, any> = {},\n): SchemaAST.AST | undefined => {\n invariant(SchemaAST.isUnion(node));\n invariant(value);\n const props = getDiscriminatingProps(node);\n if (!props?.length) {\n return;\n }\n\n // Match provided values.\n for (const type of node.types) {\n const match = SchemaAST.getPropertySignatures(type)\n .filter((prop) => props?.includes(prop.name.toString()))\n .every((prop) => {\n invariant(SchemaAST.isLiteral(prop.type));\n return prop.type.literal === value[prop.name.toString()];\n });\n\n if (match) {\n return type;\n }\n }\n\n // Create union of discriminating properties.\n // NOTE: This may not work with non-overlapping variants.\n // TODO(burdon): Iterate through props and knock-out variants that don't match.\n const fields = Object.fromEntries(\n props\n .map((prop) => {\n const literals = node.types\n .map((type) => {\n const literal = SchemaAST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n invariant(SchemaAST.isLiteral(literal.type));\n return literal.type.literal;\n })\n .filter(isNonNullable);\n\n return literals.length ? [prop, Schema.Literal(...literals)] : undefined;\n })\n .filter(isNonNullable),\n );\n\n const schema = Schema.Struct(fields);\n return schema.ast;\n};\n\n/**\n * Maps AST nodes.\n * The user is responsible for recursively calling {@link mapAst} on the SchemaAST.\n * NOTE: Will evaluate suspended ASTs.\n */\nexport const mapAst = (\n ast: SchemaAST.AST,\n f: (ast: SchemaAST.AST, key: keyof any | undefined) => SchemaAST.AST,\n): SchemaAST.AST => {\n switch (ast._tag) {\n case 'TypeLiteral': {\n return new SchemaAST.TypeLiteral(\n ast.propertySignatures.map(\n (prop) =>\n new SchemaAST.PropertySignature(\n prop.name,\n f(prop.type, prop.name),\n prop.isOptional,\n prop.isReadonly,\n prop.annotations,\n ),\n ),\n ast.indexSignatures,\n );\n }\n case 'Union': {\n return SchemaAST.Union.make(ast.types.map(f), ast.annotations);\n }\n case 'TupleType': {\n return new SchemaAST.TupleType(\n ast.elements.map((t, index) => new SchemaAST.OptionalType(f(t.type, index), t.isOptional, t.annotations)),\n ast.rest.map((t) => new SchemaAST.Type(f(t.type, undefined), t.annotations)),\n ast.isReadonly,\n ast.annotations,\n );\n }\n case 'Suspend': {\n const newAst = f(ast.f(), undefined);\n return new SchemaAST.Suspend(() => newAst, ast.annotations);\n }\n default: {\n // TODO(dmaretskyi): Support more nodes.\n return ast;\n }\n }\n};\n\n/**\n * @returns true if AST is for Array(T) or optional(Array(T)).\n */\nexport const isArrayType = (node: SchemaAST.AST): boolean => {\n return (\n SchemaAST.isTupleType(node) ||\n (SchemaAST.isUnion(node) &&\n node.types.some(isArrayType) &&\n node.types.some(isUndefinedKeyword) &&\n node.types.length === 2)\n );\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Option, Schema } from 'effect';\nimport { JSONPath } from 'jsonpath-plus';\n\nimport { invariant } from '@dxos/invariant';\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^($|[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\](?:\\.)?)*$)/;\nconst PROP_REGEX = /^\\w+$/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = Schema.String.pipe(Schema.pattern(PATH_REGEX)).annotations({\n title: 'JSON path',\n description: 'JSON path to a property',\n}) as any as Schema.Schema<JsonPath>;\nexport const JsonProp = Schema.NonEmptyString.pipe(\n Schema.pattern(PROP_REGEX, {\n message: () => 'Property name must contain only letters, numbers, and underscores',\n }),\n) as any as Schema.Schema<JsonProp>;\n\nexport const isJsonPath = (value: unknown): value is JsonPath => {\n return Option.isSome(Schema.validateOption(JsonPath)(value));\n};\n\n/**\n * Creates a JsonPath from an array of path segments.\n *\n * Currently supports:\n * - Simple property access (e.g., 'foo.bar')\n * - Array indexing with non-negative integers (e.g., 'foo[0]')\n * - Identifiers starting with letters, underscore, or $ (e.g., '$foo', '_bar')\n * - Dot notation for nested properties (e.g., 'foo.bar.baz')\n *\n * Does not support (yet?).\n * - Recursive descent (..)\n * - Wildcards (*)\n * - Array slicing\n * - Filters\n * - Negative indices\n *\n * @param path Array of string or number segments\n * @returns Valid JsonPath or undefined if invalid\n */\nexport const createJsonPath = (path: (string | number)[]): JsonPath => {\n const candidatePath = path\n .map((p, i) => {\n if (typeof p === 'number') {\n return `[${p}]`;\n } else {\n return i === 0 ? p : `.${p}`;\n }\n })\n .join('');\n\n invariant(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`);\n return candidatePath;\n};\n\n/**\n * Converts Effect validation path format (e.g. \"addresses.[0].zip\")\n * to JsonPath format (e.g., \"addresses[0].zip\")\n */\nexport const fromEffectValidationPath = (effectPath: string): JsonPath => {\n // Handle array notation: convert \"prop.[0]\" to \"prop[0]\"\n const jsonPath = effectPath.replace(/\\.\\[(\\d+)\\]/g, '[$1]');\n invariant(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`);\n return jsonPath;\n};\n\n/**\n * Splits a JsonPath into its constituent parts.\n * Handles property access and array indexing.\n */\nexport const splitJsonPath = (path: JsonPath): string[] => {\n if (!isJsonPath(path)) {\n return [];\n }\n\n return (\n path\n .match(/[a-zA-Z_$][\\w$]*|\\[\\d+\\]/g)\n ?.map((part) => (part.startsWith('[') ? part.replace(/[[\\]]/g, '') : part)) ?? []\n );\n};\n\n/**\n * Applies a JsonPath to an object.\n */\nexport const getField = (object: any, path: JsonPath): any => {\n // By default, JSONPath returns an array of results.\n return JSONPath({ path, json: object })[0];\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { Option, type Schema, SchemaAST, pipe } from 'effect';\n\nimport { decamelize } from '@dxos/util';\n\nconst ParamKeyAnnotationId = Symbol.for('@dxos/schema/annotation/ParamKey');\n\ntype ParamKeyAnnotationValue = { key: string };\n\nexport const getParamKeyAnnotation: (annotated: SchemaAST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n SchemaAST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n (value: ParamKeyAnnotationValue) =>\n <S extends Schema.Annotable.All>(self: S): Schema.Annotable.Self<S> =>\n self.annotations({ [ParamKeyAnnotationId]: value });\n\n/**\n * HTTP params parser.\n * Supports custom key serialization.\n */\nexport class UrlParser<T extends Record<string, any>> {\n constructor(private readonly _schema: Schema.Struct<T>) {}\n\n /**\n * Parse URL params.\n */\n parse(_url: string): T {\n const url = new URL(_url);\n return Object.entries(this._schema.fields).reduce<Record<string, any>>((params, [key, type]) => {\n let value = url.searchParams.get(decamelize(key));\n if (value == null) {\n value = url.searchParams.get(key);\n }\n\n if (value != null) {\n if (SchemaAST.isNumberKeyword(type.ast)) {\n params[key] = parseInt(value);\n } else if (SchemaAST.isBooleanKeyword(type.ast)) {\n params[key] = value === 'true' || value === '1';\n } else {\n params[key] = value;\n }\n }\n\n return params;\n }, {}) as T;\n }\n\n /**\n * Return URL with encoded params.\n */\n create(_url: string, params: T): URL {\n const url = new URL(_url);\n Object.entries(params).forEach(([key, value]) => {\n if (value !== undefined) {\n const field = this._schema.fields[key];\n if (field) {\n const { key: serializedKey } = pipe(\n getParamKeyAnnotation(field.ast),\n Option.getOrElse(() => ({\n key: decamelize(key),\n })),\n );\n\n url.searchParams.set(serializedKey, String(value));\n }\n }\n });\n\n return url;\n }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Effect, type Scope } from 'effect';\n\nimport { Context } from '@dxos/context';\n\n// TODO(dmaretskyi): Error handling.\nexport const contextFromScope = (): Effect.Effect<Context, never, Scope.Scope> =>\n Effect.gen(function* () {\n const ctx = new Context();\n yield* Effect.addFinalizer(() => Effect.promise(() => ctx.dispose()));\n return ctx;\n });\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Cause, Chunk, Effect, Exit, GlobalValue, Option } from 'effect';\nimport type { AnySpan, Span } from 'effect/Tracer';\n\nconst spanSymbol = Symbol.for('effect/SpanAnnotation');\nconst originalSymbol = Symbol.for('effect/OriginalAnnotation');\nconst spanToTrace = GlobalValue.globalValue('effect/Tracer/spanToTrace', () => new WeakMap());\nconst locationRegex = /\\((.*)\\)/g;\n\n/**\n * Adds effect spans.\n * Removes effect internal functions.\n * Unwraps error proxy.\n */\nconst prettyErrorStack = (error: any, appendStacks: string[] = []): any => {\n const span = error[spanSymbol];\n\n const lines = typeof error.stack === 'string' ? error.stack.split('\\n') : [];\n const out = [];\n\n let atStack = false;\n for (let i = 0; i < lines.length; i++) {\n if (!atStack && !lines[i].startsWith(' at ')) {\n out.push(lines[i]);\n continue;\n }\n atStack = true;\n\n if (lines[i].includes(' at new BaseEffectError') || lines[i].includes(' at new YieldableError')) {\n i++;\n continue;\n }\n if (lines[i].includes('Generator.next')) {\n break;\n }\n if (lines[i].includes('effect_internal_function')) {\n break;\n }\n out.push(\n lines[i]\n .replace(/at .*effect_instruction_i.*\\((.*)\\)/, 'at $1')\n .replace(/EffectPrimitive\\.\\w+/, '<anonymous>')\n .replace(/at Arguments\\./, 'at '),\n );\n }\n\n if (span) {\n let current: Span | AnySpan | undefined = span;\n let i = 0;\n while (current && current._tag === 'Span' && i < 10) {\n const stackFn = spanToTrace.get(current);\n if (typeof stackFn === 'function') {\n const stack = stackFn();\n if (typeof stack === 'string') {\n const locationMatchAll = stack.matchAll(locationRegex);\n let match = false;\n for (const [, location] of locationMatchAll) {\n match = true;\n out.push(` at ${current.name} (${location})`);\n }\n if (!match) {\n out.push(` at ${current.name} (${stack.replace(/^at /, '')})`);\n }\n } else {\n out.push(` at ${current.name}`);\n }\n } else {\n out.push(` at ${current.name}`);\n }\n current = Option.getOrUndefined(current.parent);\n i++;\n }\n }\n\n out.push(...appendStacks);\n\n if (error[originalSymbol]) {\n error = error[originalSymbol];\n }\n if (error.cause) {\n error.cause = prettyErrorStack(error.cause);\n }\n\n Object.defineProperty(error, 'stack', {\n value: out.join('\\n'),\n writable: true,\n enumerable: false,\n configurable: true,\n });\n\n return error;\n};\n\n/**\n * Converts a cause to an error.\n * Inserts effect spans as stack frames.\n * The error will have stack frames of where the effect was run (if stack trace limit allows).\n * Removes effect runtime internal stack frames.\n *\n * To be used in place of `Effect.runPromise`.\n *\n * @throws AggregateError if there are multiple errors.\n */\nexport const causeToError = (cause: Cause.Cause<any>): Error => {\n if (Cause.isEmpty(cause)) {\n return new Error('Fiber failed without a cause');\n } else if (Cause.isInterruptedOnly(cause)) {\n return new Error('Fiber was interrupted');\n } else {\n const errors = [...Chunk.toArray(Cause.failures(cause)), ...Chunk.toArray(Cause.defects(cause))];\n\n const getStackFrames = (): string[] => {\n const o: { stack: string } = {} as any;\n Error.captureStackTrace(o, getStackFrames);\n return o.stack.split('\\n').slice(1);\n };\n\n const stackFrames = getStackFrames();\n const newErrors = errors.map((error) => prettyErrorStack(error, stackFrames));\n\n if (newErrors.length === 1) {\n return newErrors[0];\n } else {\n return new AggregateError(newErrors);\n }\n }\n};\n\n/**\n * Throws an error based on the cause.\n * Inserts effect spans as stack frames.\n * The error will have stack frames of where the effect was run (if stack trace limit allows).\n * Removes effect runtime internal stack frames.\n *\n * To be used in place of `Effect.runPromise`.\n *\n * @throws AggregateError if there are multiple errors.\n */\nexport const throwCause = (cause: Cause.Cause<any>): never => {\n throw causeToError(cause);\n};\n\nexport const unwrapExit = <A>(exit: Exit.Exit<A, any>): A => {\n if (Exit.isSuccess(exit)) {\n return exit.value;\n }\n\n return throwCause(exit.cause);\n};\n\n/**\n * Runs the embedded effect asynchronously and throws any failures and defects as errors.\n * Inserts effect spans as stack frames.\n * The error will have stack frames of where the effect was run (if stack trace limit allows).\n * Removes effect runtime internal stack frames.\n *\n * To be used in place of `Effect.runPromise`.\n *\n * @throws AggregateError if there are multiple errors.\n */\nexport const runAndForwardErrors = async <A, E>(\n effect: Effect.Effect<A, E, never>,\n options?: { signal?: AbortSignal },\n): Promise<A> => {\n const exit = await Effect.runPromiseExit(effect, options);\n return unwrapExit(exit);\n};\n\n/**\n * Like `Effect.promise` but also caputes spans for defects.\n * Workaround for: https://github.com/Effect-TS/effect/issues/5436\n */\nexport const promiseWithCauseCapture: <A>(evaluate: (signal: AbortSignal) => PromiseLike<A>) => Effect.Effect<A> = (\n evaluate,\n) =>\n Effect.promise(async (signal) => {\n try {\n const result = await evaluate(signal);\n return Effect.succeed(result);\n } catch (err) {\n return Effect.die(err);\n }\n }).pipe(Effect.flatten);\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Effect } from 'effect';\nimport type { TestContext } from 'vitest';\n\n// TODO(dmaretskyi): Add all different test tags here.\nexport type TestTag =\n | 'flaky' // Flaky tests.\n | 'llm' // Tests with AI.\n | 'sync'; // Sync with external services.\n\nexport namespace TestHelpers {\n /**\n * Skip the test if the condition is false.\n *\n * Exmaple:\n * ```ts\n * it.effect(\n * 'should process an agentic loop using Claude',\n * Effect.fn(function* ({ expect }) {\n * // ...\n * }),\n * TestHelpers.runIf(process.env.ANTHROPIC_API_KEY),\n * );\n * ```\n */\n export const runIf =\n (condition: unknown) =>\n <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n Effect.gen(function* () {\n if (!condition) {\n ctx.skip();\n } else {\n return yield* effect;\n }\n });\n\n /**\n * Skip the test if the condition is true.\n *\n * Exmaple:\n * ```ts\n * it.effect(\n * 'should process an agentic loop using Claude',\n * Effect.fn(function* ({ expect }) {\n * // ...\n * }),\n * TestHelpers.skipIf(!process.env.ANTHROPIC_API_KEY),\n * );\n * ```\n */\n export const skipIf =\n (condition: unknown) =>\n <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n Effect.gen(function* () {\n if (condition) {\n ctx.skip();\n } else {\n return yield* effect;\n }\n });\n\n /**\n * Skips this test if the tag is not in the list of tags to run.\n * Tags are specified in the `DX_TEST_TAGS` environment variable.\n *\n * @param tag\n * @returns\n */\n export const taggedTest =\n (tag: TestTag) =>\n <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n Effect.gen(function* () {\n if (!process.env.DX_TEST_TAGS?.includes(tag)) {\n ctx.skip();\n } else {\n return yield* effect;\n }\n });\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Effect } from 'effect';\n\nimport type { Lifecycle } from '@dxos/context';\n\n// TODO(dmaretskyi): Extract to effect-utils.\nexport const accuireReleaseResource = <T extends Lifecycle>(getResource: () => T) =>\n Effect.acquireRelease(\n Effect.gen(function* () {\n const resource = getResource();\n yield* Effect.promise(async () => {\n resource.open?.();\n return undefined;\n });\n return resource;\n }),\n (resource) =>\n Effect.promise(async () => {\n resource.close?.();\n return undefined;\n }),\n );\n"],
|
|
5
|
+
"mappings": ";;;AAIA,SAASA,QAAQC,QAAQC,WAAWC,YAAY;AAChD,SAASC,0BAA0B;AAEnC,SAASC,iBAAiB;AAC1B,SAASC,qBAAqB;;AAc9B,IAAMC,cAAc,CAACC,SAAAA;AAEnB,SAAON,UAAUK,YAAYC,IAAAA,KAASA,KAAKC,SAASC,SAAS;AAC/D;AAKO,IAAMC,gBAAgB,CAACH,SAAAA;AAC5B,MACEN,UAAUU,cAAcJ,IAAAA,KACxBN,UAAUW,gBAAgBL,IAAAA,KAC1BN,UAAUY,cAAcN,IAAAA;EAExBD,YAAYC,IAAAA,KACZO,qBAAqBP,IAAAA,GACrB;AACA,WAAO;EACT;AAEA,MAAIN,UAAUc,gBAAgBR,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAIN,UAAUe,gBAAgBT,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAIN,UAAUgB,iBAAiBV,IAAAA,GAAO;AACpC,WAAO;EACT;AAEA,MAAIN,UAAUiB,QAAQX,IAAAA,GAAO;AAC3B,WAAO;EACT;AAEA,MAAIN,UAAUkB,UAAUZ,IAAAA,GAAO;AAC7B,WAAO;EACT;AACF;AAEO,IAAMa,eAAe,CAACb,SAAiC,CAAC,CAACG,cAAcH,IAAAA;UAE7Dc,aAAAA;cAKFC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;AA8BV,IAAKI,cAAAA,0BAAAA,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;SARSA;;AAkBZ,IAAMC,cAAsBN;AAQrB,IAAMO,QAGT,CAACpB,MAAqBqB,eAAmCC,YAAAA;AAC3D,MAAI,CAACA,SAAS;AACZC,cAAUvB,MAAMmB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUvB,MAAMqB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBvB,MACAwB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOxB,MAAMyB,MAAMC,KAAAA;AACnC,QAAME,SACJD,YAAYE,SAAAA,IAER,OAAOF,YAAY,YACjBA,UAAAA,IAAAA,IAGAA;AAER,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BN,YAAQtB,MAAMyB,MAAMC,KAAAA;EACtB;AAGA,MAAIhC,UAAUY,cAAcN,IAAAA,GAAO;AACjC,eAAW8B,QAAQpC,UAAUqC,sBAAsB/B,IAAAA,GAAO;AACxD,YAAMgC,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKd,MAAMQ,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,UAAUK,YAAYC,IAAAA,GAAO;AACpC,eAAW,CAACmC,GAAGC,OAAAA,KAAYpC,KAAKC,SAASoC,QAAO,GAAI;AAClD,YAAML,cAAc;WAAIP;QAAMU;;AAC9B,YAAMP,UAASL,UAAUa,QAAQpB,MAAMQ,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,UAAU4C,QAAQtC,IAAAA,GAAO;AAChC,eAAWgB,QAAQhB,KAAKuC,OAAO;AAC7B,YAAMX,UAASL,UAAUP,MAAMQ,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,UAAU8C,aAAaxC,IAAAA,GAAO;AACrC,UAAM4B,UAASL,UAAUvB,KAAKyC,MAAMjB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMc,WAAW,CAAC1C,MAAqBwB,SAAAA;AAC5C,MAAIA,KAAKxB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSN,UAAUY,cAAcN,IAAAA,GAAO;AACtC,eAAW8B,QAAQpC,UAAUqC,sBAAsB/B,IAAAA,GAAO;AACxD,YAAM2C,QAAQD,SAASZ,KAAKd,MAAMQ,IAAAA;AAClC,UAAImB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSjD,UAAUK,YAAYC,IAAAA,GAAO;AACpC,eAAW,CAAC4C,GAAGR,OAAAA,KAAYpC,KAAKC,SAASoC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASN,QAAQpB,MAAMQ,IAAAA;AACrC,UAAImB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSjD,UAAU4C,QAAQtC,IAAAA,GAAO;AAChC,QAAI6C,eAAe7C,IAAAA,GAAO;AACxB,aAAO6B;IACT;AAEA,eAAWb,QAAQhB,KAAKuC,OAAO;AAC7B,YAAMI,QAAQD,SAAS1B,MAAMQ,IAAAA;AAC7B,UAAImB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSjD,UAAU8C,aAAaxC,IAAAA,GAAO;AACrC,WAAO0C,SAAS1C,KAAKyC,MAAMjB,IAAAA;EAC7B;AACF;AAKO,IAAMsB,eAAe,CAC1BC,QACAtB,SAAAA;AAEA,QAAMuB,UAAU,CAAChD,MAAqByB,UAAAA;AACpC,UAAM,CAACQ,MAAM,GAAGgB,IAAAA,IAAQxB;AACxB,UAAMyB,WAAWR,SAAS1C,MAAMN,UAAUY,aAAa;AACvDT,cAAUqD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWpB,QAAQpC,UAAUqC,sBAAsBmB,QAAAA,GAAW;AAC5D,UAAIpB,KAAKG,SAASA,MAAM;AACtB,YAAIgB,KAAK/C,QAAQ;AACf,iBAAO8C,QAAQlB,KAAKd,MAAMiC,IAAAA;QAC5B,OAAO;AACL,iBAAOnB,KAAKd;QACd;MACF;IACF;EACF;AAEA,SAAOgC,QAAQD,OAAOI,KAAK1B,KAAK2B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAA0D;EAC9D,CAAC,eAAA,GAA2B3D,UAAU4D;EACtC,CAAC,eAAA,GAA2B5D,UAAU6D;EACtC,CAAC,eAAA,GAA2B7D,UAAU8D;EACtC,CAAC,gBAAA,GAA4B9D,UAAU+D;AACzC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC5D,SAAAA;AAEC,QAAM6D,KAAKlE,KAAKD,UAAUoE,wBAAwB9D,IAAAA,GAAOR,OAAOuE,cAAc;AAC9E,QAAMC,QAAQrE,KAAKD,UAAUgE,cAAiBC,YAAAA,EAAc3D,IAAAA,GAAOR,OAAOuE,cAAc;AACxF,MAAIH,cAAcI,UAAUX,mBAAmBrD,KAAKiE,IAAI,GAAGC,YAAYP,YAAAA,KAAiBK,UAAUH,KAAK;AACrG,WAAOhC;EACT;AAEA,SAAOmC;AACT;AAOK,IAAMG,iBAAiB,CAAInE,MAAqB2D,cAAsBC,YAAY,SAAI;AAC3F,QAAMQ,oBAAoBV,cAAcC,cAAcC,SAAAA;AAEtD,QAAMS,oBAAoB,CAACrE,UAAAA;AACzB,UAAMgE,QAAQI,kBAAkBpE,KAAAA;AAChC,QAAIgE,UAAUnC,QAAW;AACvB,aAAOmC;IACT;AAEA,QAAItE,UAAU4C,QAAQtC,KAAAA,GAAO;AAC3B,UAAIsE,SAAStE,KAAAA,GAAO;AAClB,eAAOoE,kBAAkBpE,MAAKuC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAO8B,kBAAkBrE,IAAAA;AAC3B;AASO,IAAMsE,WAAW,CAACtE,SAAAA;AACvB,SAAON,UAAU4C,QAAQtC,IAAAA,KAASA,KAAKuC,MAAMrC,WAAW,KAAKR,UAAUE,mBAAmBI,KAAKuC,MAAM,CAAA,CAAE;AACzG;AAKO,IAAMM,iBAAiB,CAAC7C,SAAAA;AAC7B,SAAON,UAAU4C,QAAQtC,IAAAA,KAASA,KAAKuC,MAAMgC,MAAM7E,UAAUkB,SAAS;AACxE;AAKO,IAAML,uBAAuB,CAACP,SAAAA;AACnC,SAAON,UAAU4C,QAAQtC,IAAAA,KAAS,CAAC,CAACwE,uBAAuBxE,IAAAA,GAAOE;AACpE;AAKO,IAAMsE,yBAAyB,CAACxE,SAAAA;AACrCH,YAAUH,UAAU4C,QAAQtC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5B,MAAIsE,SAAStE,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKuC,MAAMkC,OAAiB,CAACC,QAAQ1D,SAAAA;AAC1C,UAAM2D,QAAQjF,UAAUqC,sBAAsBf,IAAAA,EAE3C4D,OAAO,CAACC,MAAMnF,UAAUkB,UAAUiE,EAAE7D,IAAI,CAAA,EACxC8D,IAAI,CAACD,MAAMA,EAAE5C,KAAKC,SAAQ,CAAA;AAG7B,WAAOwC,OAAOxE,WAAW,IAAIyE,QAAQD,OAAOE,OAAO,CAAC9C,SAAS6C,MAAMI,SAASjD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMkD,uBAAuB,CAClChF,MACAgE,QAA6B,CAAC,MAAC;AAE/BnE,YAAUH,UAAU4C,QAAQtC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5BH,YAAUmE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMW,QAAQH,uBAAuBxE,IAAAA;AACrC,MAAI,CAAC2E,OAAOzE,QAAQ;AAClB;EACF;AAGA,aAAWc,QAAQhB,KAAKuC,OAAO;AAC7B,UAAM0C,QAAQvF,UAAUqC,sBAAsBf,IAAAA,EAC3C4D,OAAO,CAAC9C,SAAS6C,OAAOI,SAASjD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDqC,MAAM,CAACzC,SAAAA;AACNjC,gBAAUH,UAAUkB,UAAUkB,KAAKd,IAAI,GAAA,QAAA;;;;;;;;;AACvC,aAAOc,KAAKd,KAAKkE,YAAYlB,MAAMlC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAI+C,OAAO;AACT,aAAOjE;IACT;EACF;AAKA,QAAMmE,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAAChD,SAAAA;AACJ,UAAMwD,WAAWtF,KAAKuC,MACnBuC,IAAI,CAAC9D,SAAAA;AACJ,YAAMkE,UAAUxF,UAAUqC,sBAAsBf,IAAAA,EAAMuE,KAAK,CAACV,MAAMA,EAAE5C,KAAKC,SAAQ,MAAOJ,IAAAA;AACxFjC,gBAAUH,UAAUkB,UAAUsE,QAAQlE,IAAI,GAAA,QAAA;;;;;;;;;AAC1C,aAAOkE,QAAQlE,KAAKkE;IACtB,CAAA,EACCN,OAAO9E,aAAAA;AAEV,WAAOwF,SAASpF,SAAS;MAAC4B;MAAMrC,OAAO+F,QAAO,GAAIF,QAAAA;QAAazD;EACjE,CAAA,EACC+C,OAAO9E,aAAAA,CAAAA;AAGZ,QAAMiD,SAAStD,OAAOgG,OAAON,MAAAA;AAC7B,SAAOpC,OAAOI;AAChB;AAOO,IAAMuC,SAAS,CACpBvC,KACAwC,MAAAA;AAEA,UAAQxC,IAAIc,MAAI;IACd,KAAK,eAAe;AAClB,aAAO,IAAIvE,UAAUkG,YACnBzC,IAAI0C,mBAAmBf,IACrB,CAAChD,SACC,IAAIpC,UAAUoG,kBACZhE,KAAKG,MACL0D,EAAE7D,KAAKd,MAAMc,KAAKG,IAAI,GACtBH,KAAKiE,YACLjE,KAAKkE,YACLlE,KAAKoC,WAAW,CAAA,GAGtBf,IAAI8C,eAAe;IAEvB;IACA,KAAK,SAAS;AACZ,aAAOvG,UAAUwG,MAAMC,KAAKhD,IAAIZ,MAAMuC,IAAIa,CAAAA,GAAIxC,IAAIe,WAAW;IAC/D;IACA,KAAK,aAAa;AAChB,aAAO,IAAIxE,UAAU0G,UACnBjD,IAAIlD,SAAS6E,IAAI,CAACuB,GAAGC,UAAU,IAAI5G,UAAU6G,aAAaZ,EAAEU,EAAErF,MAAMsF,KAAAA,GAAQD,EAAEN,YAAYM,EAAEnC,WAAW,CAAA,GACvGf,IAAIF,KAAK6B,IAAI,CAACuB,MAAM,IAAI3G,UAAU8G,KAAKb,EAAEU,EAAErF,MAAMa,MAAAA,GAAYwE,EAAEnC,WAAW,CAAA,GAC1Ef,IAAI6C,YACJ7C,IAAIe,WAAW;IAEnB;IACA,KAAK,WAAW;AACd,YAAMuC,SAASd,EAAExC,IAAIwC,EAAC,GAAI9D,MAAAA;AAC1B,aAAO,IAAInC,UAAUgH,QAAQ,MAAMD,QAAQtD,IAAIe,WAAW;IAC5D;IACA,SAAS;AAEP,aAAOf;IACT;EACF;AACF;AAKO,IAAMwD,cAAc,CAAC3G,SAAAA;AAC1B,SACEN,UAAUK,YAAYC,IAAAA,KACrBN,UAAU4C,QAAQtC,IAAAA,KACjBA,KAAKuC,MAAMqE,KAAKD,WAAAA,KAChB3G,KAAKuC,MAAMqE,KAAKhH,kBAAAA,KAChBI,KAAKuC,MAAMrC,WAAW;AAE5B;;;;AC3dA,SAAS2G,UAAAA,SAAQC,UAAAA,eAAc;AAC/B,SAASC,gBAAgB;AAEzB,SAASC,aAAAA,kBAAiB;;AAK1B,IAAMC,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWL,QAAOM,OAAOC,KAAKP,QAAOQ,QAAQL,UAAAA,CAAAA,EAAaM,YAAY;EACjFC,OAAO;EACPC,aAAa;AACf,CAAA;AACO,IAAMC,WAAWZ,QAAOa,eAAeN,KAC5CP,QAAOQ,QAAQJ,YAAY;EACzBU,SAAS,MAAM;AACjB,CAAA,CAAA;AAGK,IAAMC,aAAa,CAACC,UAAAA;AACzB,SAAOjB,QAAOkB,OAAOjB,QAAOkB,eAAeb,QAAAA,EAAUW,KAAAA,CAAAA;AACvD;AAqBO,IAAMG,iBAAiB,CAACC,SAAAA;AAC7B,QAAMC,gBAAgBD,KACnBE,IAAI,CAACC,GAAGC,MAAAA;AACP,QAAI,OAAOD,MAAM,UAAU;AACzB,aAAO,IAAIA,CAAAA;IACb,OAAO;AACL,aAAOC,MAAM,IAAID,IAAI,IAAIA,CAAAA;IAC3B;EACF,CAAA,EACCE,KAAK,EAAA;AAERvB,EAAAA,WAAUa,WAAWM,aAAAA,GAAgB,qBAAqBA,aAAAA,IAAe;;;;;;;;;AACzE,SAAOA;AACT;AAMO,IAAMK,2BAA2B,CAACC,eAAAA;AAEvC,QAAMC,WAAWD,WAAWE,QAAQ,gBAAgB,MAAA;AACpD3B,EAAAA,WAAUa,WAAWa,QAAAA,GAAW,qBAAqBA,QAAAA,IAAU;;;;;;;;;AAC/D,SAAOA;AACT;AAMO,IAAME,gBAAgB,CAACV,SAAAA;AAC5B,MAAI,CAACL,WAAWK,IAAAA,GAAO;AACrB,WAAO,CAAA;EACT;AAEA,SACEA,KACGW,MAAM,2BAAA,GACLT,IAAI,CAACU,SAAUA,KAAKC,WAAW,GAAA,IAAOD,KAAKH,QAAQ,UAAU,EAAA,IAAMG,IAAAA,KAAU,CAAA;AAErF;AAKO,IAAME,WAAW,CAACC,QAAaf,SAAAA;AAEpC,SAAOnB,SAAS;IAAEmB;IAAMgB,MAAMD;EAAO,CAAA,EAAG,CAAA;AAC1C;;;AC/FA,SAASE,UAAAA,SAAqBC,aAAAA,YAAWC,QAAAA,aAAY;AAErD,SAASC,kBAAkB;;;;;;;;;;;;;;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXC,WAAUC,cAAuCL,oBAAAA;AAE5C,IAAMM,qBACX,CAACC,UACD,CAAiCC,SAC/BA,KAAKC,YAAY;EAAE,CAACT,oBAAAA,GAAuBO;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;;;;EAMXC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKC,QAAQC,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIf,QAAQM,IAAIU,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAId,SAAS,MAAM;AACjBA,gBAAQM,IAAIU,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAId,SAAS,MAAM;AACjB,YAAIH,WAAUsB,gBAAgBJ,KAAKK,GAAG,GAAG;AACvCP,iBAAOC,GAAAA,IAAOO,SAASrB,KAAAA;QACzB,WAAWH,WAAUyB,iBAAiBP,KAAKK,GAAG,GAAG;AAC/CP,iBAAOC,GAAAA,IAAOd,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLa,iBAAOC,GAAAA,IAAOd;QAChB;MACF;AAEA,aAAOa;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOlB,MAAcQ,QAAgB;AACnC,UAAMP,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQI,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKd,KAAAA,MAAM;AAC1C,UAAIA,UAAUyB,QAAW;AACvB,cAAMC,QAAQ,KAAKhB,QAAQC,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAKC,MAC7BhC,sBAAsB8B,MAAMN,GAAG,GAC/BS,QAAOC,UAAU,OAAO;YACtBhB,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFR,cAAIU,aAAae,IAAIJ,eAAeK,OAAOhC,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOM;EACT;EAjDA,YAA6BI,SAA2B;;SAA3BA,UAAAA;EAA4B;AAkD3D;;;ACvEA,SAASuB,cAA0B;AAEnC,SAASC,eAAe;;AAGjB,IAAMC,mBAAmB,MAC9BF,OAAOG,IAAI,aAAA;AACT,QAAMC,MAAM,IAAIH,QAAAA,QAAAA;;;;AAChB,SAAOD,OAAOK,aAAa,MAAML,OAAOM,QAAQ,MAAMF,IAAIG,QAAO,CAAA,CAAA;AACjE,SAAOH;AACT,CAAA;;;ACVF,SAASI,OAAOC,OAAOC,UAAAA,SAAQC,MAAMC,aAAaC,UAAAA,eAAc;AAGhE,IAAMC,aAAaC,OAAOC,IAAI,uBAAA;AAC9B,IAAMC,iBAAiBF,OAAOC,IAAI,2BAAA;AAClC,IAAME,cAAcC,YAAYC,YAAY,6BAA6B,MAAM,oBAAIC,QAAAA,CAAAA;AACnF,IAAMC,gBAAgB;AAOtB,IAAMC,mBAAmB,CAACC,OAAYC,eAAyB,CAAA,MAAE;AAC/D,QAAMC,OAAOF,MAAMV,UAAAA;AAEnB,QAAMa,QAAQ,OAAOH,MAAMI,UAAU,WAAWJ,MAAMI,MAAMC,MAAM,IAAA,IAAQ,CAAA;AAC1E,QAAMC,MAAM,CAAA;AAEZ,MAAIC,UAAU;AACd,WAASC,IAAI,GAAGA,IAAIL,MAAMM,QAAQD,KAAK;AACrC,QAAI,CAACD,WAAW,CAACJ,MAAMK,CAAAA,EAAGE,WAAW,SAAA,GAAY;AAC/CJ,UAAIK,KAAKR,MAAMK,CAAAA,CAAE;AACjB;IACF;AACAD,cAAU;AAEV,QAAIJ,MAAMK,CAAAA,EAAGI,SAAS,yBAAA,KAA8BT,MAAMK,CAAAA,EAAGI,SAAS,wBAAA,GAA2B;AAC/FJ;AACA;IACF;AACA,QAAIL,MAAMK,CAAAA,EAAGI,SAAS,gBAAA,GAAmB;AACvC;IACF;AACA,QAAIT,MAAMK,CAAAA,EAAGI,SAAS,0BAAA,GAA6B;AACjD;IACF;AACAN,QAAIK,KACFR,MAAMK,CAAAA,EACHK,QAAQ,uCAAuC,OAAA,EAC/CA,QAAQ,wBAAwB,aAAA,EAChCA,QAAQ,kBAAkB,KAAA,CAAA;EAEjC;AAEA,MAAIX,MAAM;AACR,QAAIY,UAAsCZ;AAC1C,QAAIM,IAAI;AACR,WAAOM,WAAWA,QAAQC,SAAS,UAAUP,IAAI,IAAI;AACnD,YAAMQ,UAAUtB,YAAYuB,IAAIH,OAAAA;AAChC,UAAI,OAAOE,YAAY,YAAY;AACjC,cAAMZ,QAAQY,QAAAA;AACd,YAAI,OAAOZ,UAAU,UAAU;AAC7B,gBAAMc,mBAAmBd,MAAMe,SAASrB,aAAAA;AACxC,cAAIsB,QAAQ;AACZ,qBAAW,CAAA,EAAGC,QAAAA,KAAaH,kBAAkB;AAC3CE,oBAAQ;AACRd,gBAAIK,KAAK,UAAUG,QAAQQ,IAAI,KAAKD,QAAAA,GAAW;UACjD;AACA,cAAI,CAACD,OAAO;AACVd,gBAAIK,KAAK,UAAUG,QAAQQ,IAAI,KAAKlB,MAAMS,QAAQ,QAAQ,EAAA,CAAA,GAAM;UAClE;QACF,OAAO;AACLP,cAAIK,KAAK,UAAUG,QAAQQ,IAAI,EAAE;QACnC;MACF,OAAO;AACLhB,YAAIK,KAAK,UAAUG,QAAQQ,IAAI,EAAE;MACnC;AACAR,gBAAUS,QAAOC,eAAeV,QAAQW,MAAM;AAC9CjB;IACF;EACF;AAEAF,MAAIK,KAAI,GAAIV,YAAAA;AAEZ,MAAID,MAAMP,cAAAA,GAAiB;AACzBO,YAAQA,MAAMP,cAAAA;EAChB;AACA,MAAIO,MAAM0B,OAAO;AACf1B,UAAM0B,QAAQ3B,iBAAiBC,MAAM0B,KAAK;EAC5C;AAEAC,SAAOC,eAAe5B,OAAO,SAAS;IACpC6B,OAAOvB,IAAIwB,KAAK,IAAA;IAChBC,UAAU;IACVC,YAAY;IACZC,cAAc;EAChB,CAAA;AAEA,SAAOjC;AACT;AAYO,IAAMkC,eAAe,CAACR,UAAAA;AAC3B,MAAIS,MAAMC,QAAQV,KAAAA,GAAQ;AACxB,WAAO,IAAIW,MAAM,8BAAA;EACnB,WAAWF,MAAMG,kBAAkBZ,KAAAA,GAAQ;AACzC,WAAO,IAAIW,MAAM,uBAAA;EACnB,OAAO;AACL,UAAME,SAAS;SAAIC,MAAMC,QAAQN,MAAMO,SAAShB,KAAAA,CAAAA;SAAYc,MAAMC,QAAQN,MAAMQ,QAAQjB,KAAAA,CAAAA;;AAExF,UAAMkB,iBAAiB,MAAA;AACrB,YAAMC,IAAuB,CAAC;AAC9BR,YAAMS,kBAAkBD,GAAGD,cAAAA;AAC3B,aAAOC,EAAEzC,MAAMC,MAAM,IAAA,EAAM0C,MAAM,CAAA;IACnC;AAEA,UAAMC,cAAcJ,eAAAA;AACpB,UAAMK,YAAYV,OAAOW,IAAI,CAAClD,UAAUD,iBAAiBC,OAAOgD,WAAAA,CAAAA;AAEhE,QAAIC,UAAUxC,WAAW,GAAG;AAC1B,aAAOwC,UAAU,CAAA;IACnB,OAAO;AACL,aAAO,IAAIE,eAAeF,SAAAA;IAC5B;EACF;AACF;AAYO,IAAMG,aAAa,CAAC1B,UAAAA;AACzB,QAAMQ,aAAaR,KAAAA;AACrB;AAEO,IAAM2B,aAAa,CAAIC,SAAAA;AAC5B,MAAIC,KAAKC,UAAUF,IAAAA,GAAO;AACxB,WAAOA,KAAKzB;EACd;AAEA,SAAOuB,WAAWE,KAAK5B,KAAK;AAC9B;AAYO,IAAM+B,sBAAsB,OACjCC,QACAC,YAAAA;AAEA,QAAML,OAAO,MAAMM,QAAOC,eAAeH,QAAQC,OAAAA;AACjD,SAAON,WAAWC,IAAAA;AACpB;AAMO,IAAMQ,0BAAsG,CACjHC,aAEAH,QAAOI,QAAQ,OAAOC,WAAAA;AACpB,MAAI;AACF,UAAMC,SAAS,MAAMH,SAASE,MAAAA;AAC9B,WAAOL,QAAOO,QAAQD,MAAAA;EACxB,SAASE,KAAK;AACZ,WAAOR,QAAOS,IAAID,GAAAA;EACpB;AACF,CAAA,EAAGE,KAAKV,QAAOW,OAAO;;;ACrLxB,SAASC,UAAAA,eAAc;UASNC,cAAAA;eAeFC,QACX,CAACC,cACD,CAAUC,QAAgCC,QACxCC,QAAOC,IAAI,aAAA;AACT,QAAI,CAACJ,WAAW;AACdE,UAAIG,KAAI;IACV,OAAO;AACL,aAAO,OAAOJ;IAChB;EACF,CAAA;eAgBSK,SACX,CAACN,cACD,CAAUC,QAAgCC,QACxCC,QAAOC,IAAI,aAAA;AACT,QAAIJ,WAAW;AACbE,UAAIG,KAAI;IACV,OAAO;AACL,aAAO,OAAOJ;IAChB;EACF,CAAA;eASSM,aACX,CAACC,QACD,CAAUP,QAAgCC,QACxCC,QAAOC,IAAI,aAAA;AACT,QAAI,CAACK,QAAQC,IAAIC,cAAcC,SAASJ,GAAAA,GAAM;AAC5CN,UAAIG,KAAI;IACV,OAAO;AACL,aAAO,OAAOJ;IAChB;EACF,CAAA;AACN,GApEiBH,gBAAAA,cAAAA,CAAAA,EAAAA;;;;ACTjB,SAASe,UAAAA,eAAc;AAKhB,IAAMC,yBAAyB,CAAsBC,gBAC1DC,QAAOC,eACLD,QAAOE,IAAI,aAAA;AACT,QAAMC,WAAWJ,YAAAA;AACjB,SAAOC,QAAOI,QAAQ,YAAA;AACpBD,aAASE,OAAI;AACb,WAAOC;EACT,CAAA;AACA,SAAOH;AACT,CAAA,GACA,CAACA,aACCH,QAAOI,QAAQ,YAAA;AACbD,WAASI,QAAK;AACd,SAAOD;AACT,CAAA,CAAA;",
|
|
6
|
+
"names": ["Option", "Schema", "SchemaAST", "pipe", "isUndefinedKeyword", "invariant", "isNonNullable", "isTupleType", "node", "elements", "length", "getSimpleType", "isDeclaration", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "SimpleType", "getDefaultValue", "type", "Error", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "$result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "i", "element", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "_", "isLiteralUnion", "findProperty", "schema", "getProp", "rest", "typeNode", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "getAnnotation", "annotationId", "noDefault", "id", "getIdentifierAnnotation", "getOrUndefined", "value", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "isOption", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "Literal", "Struct", "mapAst", "f", "TypeLiteral", "propertySignatures", "PropertySignature", "isOptional", "isReadonly", "indexSignatures", "Union", "make", "TupleType", "t", "index", "OptionalType", "Type", "newAst", "Suspend", "isArrayType", "some", "Option", "Schema", "JSONPath", "invariant", "PATH_REGEX", "PROP_REGEX", "JsonPath", "String", "pipe", "pattern", "annotations", "title", "description", "JsonProp", "NonEmptyString", "message", "isJsonPath", "value", "isSome", "validateOption", "createJsonPath", "path", "candidatePath", "map", "p", "i", "join", "fromEffectValidationPath", "effectPath", "jsonPath", "replace", "splitJsonPath", "match", "part", "startsWith", "getField", "object", "json", "Option", "SchemaAST", "pipe", "decamelize", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "SchemaAST", "getAnnotation", "ParamKeyAnnotation", "value", "self", "annotations", "UrlParser", "parse", "_url", "url", "URL", "Object", "entries", "_schema", "fields", "reduce", "params", "key", "type", "searchParams", "get", "decamelize", "isNumberKeyword", "ast", "parseInt", "isBooleanKeyword", "create", "forEach", "undefined", "field", "serializedKey", "pipe", "Option", "getOrElse", "set", "String", "Effect", "Context", "contextFromScope", "gen", "ctx", "addFinalizer", "promise", "dispose", "Cause", "Chunk", "Effect", "Exit", "GlobalValue", "Option", "spanSymbol", "Symbol", "for", "originalSymbol", "spanToTrace", "GlobalValue", "globalValue", "WeakMap", "locationRegex", "prettyErrorStack", "error", "appendStacks", "span", "lines", "stack", "split", "out", "atStack", "i", "length", "startsWith", "push", "includes", "replace", "current", "_tag", "stackFn", "get", "locationMatchAll", "matchAll", "match", "location", "name", "Option", "getOrUndefined", "parent", "cause", "Object", "defineProperty", "value", "join", "writable", "enumerable", "configurable", "causeToError", "Cause", "isEmpty", "Error", "isInterruptedOnly", "errors", "Chunk", "toArray", "failures", "defects", "getStackFrames", "o", "captureStackTrace", "slice", "stackFrames", "newErrors", "map", "AggregateError", "throwCause", "unwrapExit", "exit", "Exit", "isSuccess", "runAndForwardErrors", "effect", "options", "Effect", "runPromiseExit", "promiseWithCauseCapture", "evaluate", "promise", "signal", "result", "succeed", "err", "die", "pipe", "flatten", "Effect", "TestHelpers", "runIf", "condition", "effect", "ctx", "Effect", "gen", "skip", "skipIf", "taggedTest", "tag", "process", "env", "DX_TEST_TAGS", "includes", "Effect", "accuireReleaseResource", "getResource", "Effect", "acquireRelease", "gen", "resource", "promise", "open", "undefined", "close"]
|
|
7
7
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"inputs":{"
|
|
1
|
+
{"inputs":{"src/ast.ts":{"bytes":43393,"imports":[{"path":"effect","kind":"import-statement","external":true},{"path":"effect/SchemaAST","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"src/jsonPath.ts":{"bytes":9719,"imports":[{"path":"effect","kind":"import-statement","external":true},{"path":"jsonpath-plus","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"src/url.ts":{"bytes":7910,"imports":[{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"src/context.ts":{"bytes":1663,"imports":[{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/context","kind":"import-statement","external":true}],"format":"esm"},"src/errors.ts":{"bytes":18787,"imports":[{"path":"effect","kind":"import-statement","external":true}],"format":"esm"},"src/testing.ts":{"bytes":4845,"imports":[{"path":"effect","kind":"import-statement","external":true}],"format":"esm"},"src/resource.ts":{"bytes":2161,"imports":[{"path":"effect","kind":"import-statement","external":true}],"format":"esm"},"src/index.ts":{"bytes":947,"imports":[{"path":"src/ast.ts","kind":"import-statement","original":"./ast"},{"path":"src/jsonPath.ts","kind":"import-statement","original":"./jsonPath"},{"path":"src/url.ts","kind":"import-statement","original":"./url"},{"path":"src/context.ts","kind":"import-statement","original":"./context"},{"path":"src/errors.ts","kind":"import-statement","original":"./errors"},{"path":"src/testing.ts","kind":"import-statement","original":"./testing"},{"path":"src/resource.ts","kind":"import-statement","original":"./resource"}],"format":"esm"}},"outputs":{"dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":45388},"dist/lib/browser/index.mjs":{"imports":[{"path":"effect","kind":"import-statement","external":true},{"path":"effect/SchemaAST","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"jsonpath-plus","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/context","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true}],"exports":["JsonPath","JsonProp","ParamKeyAnnotation","SimpleType","TestHelpers","UrlParser","VisitResult","accuireReleaseResource","causeToError","contextFromScope","createJsonPath","findAnnotation","findNode","findProperty","fromEffectValidationPath","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getField","getParamKeyAnnotation","getSimpleType","isArrayType","isDiscriminatedUnion","isJsonPath","isLiteralUnion","isOption","isSimpleType","mapAst","promiseWithCauseCapture","runAndForwardErrors","splitJsonPath","throwCause","unwrapExit","visit"],"entryPoint":"src/index.ts","inputs":{"src/ast.ts":{"bytesInOutput":9264},"src/index.ts":{"bytesInOutput":0},"src/jsonPath.ts":{"bytesInOutput":1862},"src/url.ts":{"bytesInOutput":1916},"src/context.ts":{"bytesInOutput":370},"src/errors.ts":{"bytesInOutput":3693},"src/testing.ts":{"bytesInOutput":680},"src/resource.ts":{"bytesInOutput":372}},"bytes":18953}}}
|