npm - @atproto/lex-document - Versions diffs - 0.0.21 → 0.1.0 - Mend

@atproto/lex-document 0.0.21 → 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (16) hide show

package/CHANGELOG.md +17 -0
package/dist/index.d.ts +2 -2
package/dist/index.d.ts.map +1 -1
package/dist/index.js +6 -9
package/dist/index.js.map +1 -1
package/dist/lexicon-document.js +161 -164
package/dist/lexicon-document.js.map +1 -1
package/dist/lexicon-indexer.js +1 -2
package/dist/lexicon-iterable-indexer.js +1 -6
package/dist/lexicon-iterable-indexer.js.map +1 -1
package/dist/lexicon-schema-builder.js +54 -59
package/dist/lexicon-schema-builder.js.map +1 -1
package/package.json +7 -8
package/src/core-js.d.ts +2 -0
package/src/index.ts +2 -2
package/tsconfig.tests.json +1 -1

package/CHANGELOG.md CHANGED Viewed

@@ -1,5 +1,22 @@
 # @atproto/lex-document
+## 0.1.0
+### Minor Changes
+- [#4929](https://github.com/bluesky-social/atproto/pull/4929) [`f01c59f`](https://github.com/bluesky-social/atproto/commit/f01c59f5bd3f75fb8b47a9eecd4858b84033fb7c) Thanks [@devinivy](https://github.com/devinivy)! - **BREAKING:** Drop support for Node.js 18 and 20. Node.js 22 is now the minimum supported version. Docker images now use Node.js 24.
+- [#4943](https://github.com/bluesky-social/atproto/pull/4943) [`c459153`](https://github.com/bluesky-social/atproto/commit/c459153395a30ce89e050892c8fab7dc98e019b9) Thanks [@devinivy](https://github.com/devinivy)! - **BREAKING:** Convert to pure ESM. All packages now ship `"type": "module"` with ES module output and Node16 module resolution.
+  Node.js 22's `require()` compatibility layer can still load these packages in CommonJS code.
+- [#4930](https://github.com/bluesky-social/atproto/pull/4930) [`908bece`](https://github.com/bluesky-social/atproto/commit/908bece169258bff5ad121e5eec157d6ded6f705) Thanks [@devinivy](https://github.com/devinivy)! - Build with TypeScript 6.0.
+### Patch Changes
+- Updated dependencies [[`f01c59f`](https://github.com/bluesky-social/atproto/commit/f01c59f5bd3f75fb8b47a9eecd4858b84033fb7c), [`c459153`](https://github.com/bluesky-social/atproto/commit/c459153395a30ce89e050892c8fab7dc98e019b9), [`908bece`](https://github.com/bluesky-social/atproto/commit/908bece169258bff5ad121e5eec157d6ded6f705)]:
+  - @atproto/lex-schema@0.1.0
 ## 0.0.21
 ### Patch Changes

package/dist/index.d.ts CHANGED Viewed

@@ -1,5 +1,5 @@
-import 'core-js/modules/esnext.symbol.async-dispose';
-import 'core-js/modules/esnext.symbol.dispose';
+import 'core-js/es/symbol/async-dispose.js';
+import 'core-js/es/symbol/dispose.js';
 export * from './lexicon-document.js';
 export * from './lexicon-indexer.js';
 export * from './lexicon-schema-builder.js';

package/dist/index.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,~~6CAA6C~~,CAAA;~~AACpD~~,OAAO,~~uCAAuC~~,CAAA;~~AAE9C~~,cAAc,uBAAuB,CAAA;AACrC,cAAc,sBAAsB,CAAA;AACpC,cAAc,6BAA6B,CAAA;AAC3C,cAAc,+BAA+B,CAAA"}
1	+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,oCAAoC,CAAA;AAC3C,OAAO,8BAA8B,CAAA;AAErC,cAAc,uBAAuB,CAAA;AACrC,cAAc,sBAAsB,CAAA;AACpC,cAAc,6BAA6B,CAAA;AAC3C,cAAc,+BAA+B,CAAA"}

package/dist/index.js CHANGED Viewed

@@ -1,10 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-require("core-js/modules/esnext.symbol.async-dispose");
-require("core-js/modules/esnext.symbol.dispose");
-tslib_1.__exportStar(require("./lexicon-document.js"), exports);
-tslib_1.__exportStar(require("./lexicon-indexer.js"), exports);
-tslib_1.__exportStar(require("./lexicon-schema-builder.js"), exports);
-tslib_1.__exportStar(require("./lexicon-iterable-indexer.js"), exports);
+import 'core-js/es/symbol/async-dispose.js';
+import 'core-js/es/symbol/dispose.js';
+export * from './lexicon-document.js';
+export * from './lexicon-indexer.js';
+export * from './lexicon-schema-builder.js';
+export * from './lexicon-iterable-indexer.js';
 //# sourceMappingURL=index.js.map

package/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"~~;;;~~AAAA,~~uDAAoD~~;~~AACpD~~,~~iDAA8C~~;~~AAE9C~~,~~gEAAqC~~;AACrC~~,+DAAoC~~;AACpC,~~sEAA2C~~;AAC3C,~~wEAA6C~~","sourcesContent":["import 'core-js/~~modules~~/~~esnext.~~symbol.async-dispose'\nimport 'core-js/~~modules~~/~~esnext.~~symbol.~~dispose~~'\n\nexport * from './lexicon-document.js'\nexport * from './lexicon-indexer.js'\nexport * from './lexicon-schema-builder.js'\nexport * from './lexicon-iterable-indexer.js'\n"]}
1	+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,oCAAoC,CAAA;AAC3C,OAAO,8BAA8B,CAAA;AAErC,cAAc,uBAAuB,CAAA;AACrC,cAAc,sBAAsB,CAAA;AACpC,cAAc,6BAA6B,CAAA;AAC3C,cAAc,+BAA+B,CAAA","sourcesContent":["import 'core-js/es/symbol/async-dispose.js'\nimport 'core-js/es/symbol/dispose.js'\n\nexport * from './lexicon-document.js'\nexport * from './lexicon-indexer.js'\nexport * from './lexicon-schema-builder.js'\nexport * from './lexicon-iterable-indexer.js'\n"]}

package/dist/lexicon-document.js CHANGED Viewed

@@ -1,7 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.lexiconDocumentSchema = exports.lexiconIdentifierSchema = exports.lexiconPermissionSetSchema = exports.lexiconPermissionSchema = exports.lexiconLanguageDict = exports.lexiconLanguageSchema = exports.lexiconSubscriptionSchema = exports.lexiconProcedureSchema = exports.lexiconQuerySchema = exports.lexiconError = exports.lexiconPayload = exports.lexiconParameters = exports.lexiconRecordSchema = exports.lexiconRecordKeySchema = exports.lexiconObjectSchema = exports.lexiconArraySchema = exports.lexiconRefUnionSchema = exports.lexiconRefSchema = exports.lexiconTokenSchema = exports.lexiconUnknownSchema = exports.lexiconBlobSchema = exports.lexiconCidLinkSchema = exports.lexiconBytesSchema = exports.lexiconStringSchema = exports.lexiconIntegerSchema = exports.lexiconBooleanSchema = void 0;
-const lex_schema_1 = require("@atproto/lex-schema");
+import { l } from '@atproto/lex-schema';
 // https://atproto.com/specs/lexicon
 // "Concrete" Types
 /**
@@ -10,11 +7,11 @@ const lex_schema_1 = require("@atproto/lex-schema");
  * Validates boolean field definitions that may include a default value,
  * a constant value, and an optional description.
  */
-exports.lexiconBooleanSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('boolean'),
-    default: lex_schema_1.l.optional(lex_schema_1.l.boolean()),
-    const: lex_schema_1.l.optional(lex_schema_1.l.boolean()),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconBooleanSchema = l.object({
+    type: l.literal('boolean'),
+    default: l.optional(l.boolean()),
+    const: l.optional(l.boolean()),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon integer type definitions.
@@ -22,14 +19,14 @@ exports.lexiconBooleanSchema = lex_schema_1.l.object({
  * Validates integer field definitions with support for default values,
  * minimum/maximum constraints, enumerated values, and constant values.
  */
-exports.lexiconIntegerSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('integer'),
-    default: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    minimum: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    maximum: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    enum: lex_schema_1.l.optional(lex_schema_1.l.array(lex_schema_1.l.integer())),
-    const: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconIntegerSchema = l.object({
+    type: l.literal('integer'),
+    default: l.optional(l.integer()),
+    minimum: l.optional(l.integer()),
+    maximum: l.optional(l.integer()),
+    enum: l.optional(l.array(l.integer())),
+    const: l.optional(l.integer()),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon string type definitions.
@@ -38,18 +35,18 @@ exports.lexiconIntegerSchema = lex_schema_1.l.object({
  * length constraints (both character and grapheme-based), enumerated values,
  * known values, and constant values.
  */
-exports.lexiconStringSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('string'),
-    format: lex_schema_1.l.optional(lex_schema_1.l.enum(lex_schema_1.l.STRING_FORMATS)),
-    default: lex_schema_1.l.optional(lex_schema_1.l.string()),
-    minLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    maxLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    minGraphemes: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    maxGraphemes: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    enum: lex_schema_1.l.optional(lex_schema_1.l.array(lex_schema_1.l.string())),
-    const: lex_schema_1.l.optional(lex_schema_1.l.string()),
-    knownValues: lex_schema_1.l.optional(lex_schema_1.l.array(lex_schema_1.l.string())),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconStringSchema = l.object({
+    type: l.literal('string'),
+    format: l.optional(l.enum(l.STRING_FORMATS)),
+    default: l.optional(l.string()),
+    minLength: l.optional(l.integer()),
+    maxLength: l.optional(l.integer()),
+    minGraphemes: l.optional(l.integer()),
+    maxGraphemes: l.optional(l.integer()),
+    enum: l.optional(l.array(l.string())),
+    const: l.optional(l.string()),
+    knownValues: l.optional(l.array(l.string())),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon bytes type definitions.
@@ -57,11 +54,11 @@ exports.lexiconStringSchema = lex_schema_1.l.object({
  * Validates binary data field definitions with optional length constraints.
  * Used for raw byte arrays in DAG-CBOR encoding.
  */
-exports.lexiconBytesSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('bytes'),
-    maxLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    minLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconBytesSchema = l.object({
+    type: l.literal('bytes'),
+    maxLength: l.optional(l.integer()),
+    minLength: l.optional(l.integer()),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon CID link type definitions.
@@ -69,9 +66,9 @@ exports.lexiconBytesSchema = lex_schema_1.l.object({
  * Validates Content Identifier (CID) link field definitions.
  * CIDs are used to reference content-addressed data in IPFS/IPLD.
  */
-exports.lexiconCidLinkSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('cid-link'),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconCidLinkSchema = l.object({
+    type: l.literal('cid-link'),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon blob type definitions.
@@ -79,25 +76,25 @@ exports.lexiconCidLinkSchema = lex_schema_1.l.object({
  * Validates blob field definitions with optional MIME type acceptance list
  * and maximum size constraints. Blobs represent uploaded file references.
  */
-exports.lexiconBlobSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('blob'),
-    accept: lex_schema_1.l.optional(lex_schema_1.l.array(lex_schema_1.l.string())),
-    maxSize: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconBlobSchema = l.object({
+    type: l.literal('blob'),
+    accept: l.optional(l.array(l.string())),
+    maxSize: l.optional(l.integer()),
+    description: l.optional(l.string()),
 });
 /**
  * Array of all concrete (primitive) Lexicon type schemas.
  * Includes boolean, integer, string, bytes, cid-link, and blob types.
  */
 const CONCRETE_TYPES = [
-    exports.lexiconBooleanSchema,
-    exports.lexiconIntegerSchema,
-    exports.lexiconStringSchema,
+    lexiconBooleanSchema,
+    lexiconIntegerSchema,
+    lexiconStringSchema,
     // Lexicon (DAG-CBOR)
-    exports.lexiconBytesSchema,
-    exports.lexiconCidLinkSchema,
+    lexiconBytesSchema,
+    lexiconCidLinkSchema,
     // Lexicon Specific
-    exports.lexiconBlobSchema,
+    lexiconBlobSchema,
 ];
 // Meta types
 /**
@@ -106,9 +103,9 @@ const CONCRETE_TYPES = [
  * Validates unknown field definitions which accept any valid data.
  * Used when the schema cannot determine the type ahead of time.
  */
-exports.lexiconUnknownSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('unknown'),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconUnknownSchema = l.object({
+    type: l.literal('unknown'),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon token type definitions.
@@ -117,9 +114,9 @@ exports.lexiconUnknownSchema = lex_schema_1.l.object({
  * Tokens are used to define enumeration-like values that can be
  * referenced across different lexicons.
  */
-exports.lexiconTokenSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('token'),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconTokenSchema = l.object({
+    type: l.literal('token'),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon reference type definitions.
@@ -128,10 +125,10 @@ exports.lexiconTokenSchema = lex_schema_1.l.object({
  * within the same or different Lexicon documents. References use the
  * format "nsid#defName" for cross-document refs or "#defName" for local refs.
  */
-exports.lexiconRefSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('ref'),
-    ref: lex_schema_1.l.string(),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconRefSchema = l.object({
+    type: l.literal('ref'),
+    ref: l.string(),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon union reference type definitions.
@@ -140,19 +137,19 @@ exports.lexiconRefSchema = lex_schema_1.l.object({
  * The union can be closed (only listed types allowed) or open (allows
  * additional unlisted types).
  */
-exports.lexiconRefUnionSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('union'),
-    refs: lex_schema_1.l.array(lex_schema_1.l.string()),
-    closed: lex_schema_1.l.optional(lex_schema_1.l.boolean()),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconRefUnionSchema = l.object({
+    type: l.literal('union'),
+    refs: l.array(l.string()),
+    closed: l.optional(l.boolean()),
+    description: l.optional(l.string()),
 });
 // Complex Types
 const ARRAY_ITEMS_SCHEMAS = [
     ...CONCRETE_TYPES,
     // Meta
-    exports.lexiconUnknownSchema,
-    exports.lexiconRefSchema,
-    exports.lexiconRefUnionSchema,
+    lexiconUnknownSchema,
+    lexiconRefSchema,
+    lexiconRefUnionSchema,
 ];
 /**
  * Schema for validating Lexicon array type definitions.
@@ -160,12 +157,12 @@ const ARRAY_ITEMS_SCHEMAS = [
  * Validates array field definitions with specified item type and
  * optional length constraints.
  */
-exports.lexiconArraySchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('array'),
-    items: lex_schema_1.l.discriminatedUnion('type', ARRAY_ITEMS_SCHEMAS),
-    minLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    maxLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconArraySchema = l.object({
+    type: l.literal('array'),
+    items: l.discriminatedUnion('type', ARRAY_ITEMS_SCHEMAS),
+    minLength: l.optional(l.integer()),
+    maxLength: l.optional(l.integer()),
+    description: l.optional(l.string()),
 });
 const requirePropertiesRefinement = {
     check: (v) => !v.required || v.required.every((k) => k in v.properties),
@@ -179,15 +176,15 @@ const requirePropertiesRefinement = {
  * and nullable field lists. Includes refinement to ensure all required
  * properties are defined in the properties map.
  */
-exports.lexiconObjectSchema = lex_schema_1.l.refine(lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('object'),
-    properties: lex_schema_1.l.dict(lex_schema_1.l.string(), lex_schema_1.l.discriminatedUnion('type', [
+export const lexiconObjectSchema = l.refine(l.object({
+    type: l.literal('object'),
+    properties: l.dict(l.string(), l.discriminatedUnion('type', [
         ...ARRAY_ITEMS_SCHEMAS,
-        exports.lexiconArraySchema,
+        lexiconArraySchema,
     ])),
-    required: lex_schema_1.l.optional(lex_schema_1.l.array(lex_schema_1.l.string())),
-    nullable: lex_schema_1.l.optional(lex_schema_1.l.array(lex_schema_1.l.string())),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+    required: l.optional(l.array(l.string())),
+    nullable: l.optional(l.array(l.string())),
+    description: l.optional(l.string()),
 }), requirePropertiesRefinement);
 // Records
 /**
@@ -199,7 +196,7 @@ exports.lexiconObjectSchema = lex_schema_1.l.refine(lex_schema_1.l.object({
  * - "tid": Timestamp identifier
  * - "literal:<string>": A specific literal string value
  */
-exports.lexiconRecordKeySchema = lex_schema_1.l.custom(lex_schema_1.l.isLexiconRecordKey, 'Invalid record key definition (must be "any", "nsid", "tid", or "literal:<string>")');
+export const lexiconRecordKeySchema = l.custom(l.isLexiconRecordKey, 'Invalid record key definition (must be "any", "nsid", "tid", or "literal:<string>")');
 /**
  * Schema for validating Lexicon record type definitions.
  *
@@ -207,11 +204,11 @@ exports.lexiconRecordKeySchema = lex_schema_1.l.custom(lex_schema_1.l.isLexiconR
  * stored in AT Protocol repositories. Records have a key type
  * and an object schema defining the record's data structure.
  */
-exports.lexiconRecordSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('record'),
-    record: exports.lexiconObjectSchema,
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
-    key: exports.lexiconRecordKeySchema,
+export const lexiconRecordSchema = l.object({
+    type: l.literal('record'),
+    record: lexiconObjectSchema,
+    description: l.optional(l.string()),
+    key: lexiconRecordKeySchema,
 });
 // XRPC Methods
 /**
@@ -221,26 +218,26 @@ exports.lexiconRecordSchema = lex_schema_1.l.object({
  * Parameters can only be primitive types (boolean, integer, string)
  * or arrays of primitives.
  */
-exports.lexiconParameters = lex_schema_1.l.refine(lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('params'),
-    properties: lex_schema_1.l.dict(lex_schema_1.l.string(), lex_schema_1.l.discriminatedUnion('type', [
-        exports.lexiconBooleanSchema,
-        exports.lexiconIntegerSchema,
-        exports.lexiconStringSchema,
-        lex_schema_1.l.object({
-            type: lex_schema_1.l.literal('array'),
-            items: lex_schema_1.l.discriminatedUnion('type', [
-                exports.lexiconBooleanSchema,
-                exports.lexiconIntegerSchema,
-                exports.lexiconStringSchema,
+export const lexiconParameters = l.refine(l.object({
+    type: l.literal('params'),
+    properties: l.dict(l.string(), l.discriminatedUnion('type', [
+        lexiconBooleanSchema,
+        lexiconIntegerSchema,
+        lexiconStringSchema,
+        l.object({
+            type: l.literal('array'),
+            items: l.discriminatedUnion('type', [
+                lexiconBooleanSchema,
+                lexiconIntegerSchema,
+                lexiconStringSchema,
             ]),
-            minLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-            maxLength: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-            description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+            minLength: l.optional(l.integer()),
+            maxLength: l.optional(l.integer()),
+            description: l.optional(l.string()),
         }),
     ])),
-    required: lex_schema_1.l.optional(lex_schema_1.l.array(lex_schema_1.l.string())),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+    required: l.optional(l.array(l.string())),
+    description: l.optional(l.string()),
 }), requirePropertiesRefinement);
 /**
  * Schema for validating Lexicon XRPC method payloads.
@@ -249,17 +246,17 @@ exports.lexiconParameters = lex_schema_1.l.refine(lex_schema_1.l.object({
  * Payloads specify the encoding (MIME type) and optional schema for
  * the request or response body.
  */
-exports.lexiconPayload = lex_schema_1.l.object({
-    encoding: lex_schema_1.l.refine(lex_schema_1.l.string(), {
+export const lexiconPayload = l.object({
+    encoding: l.refine(l.string(), {
         check: (v) => !v.includes(',') && !v.includes(';') && !v.includes(' '),
         message: 'Invalid encoding string (must be a single MIME type without parameters)',
     }),
-    schema: lex_schema_1.l.optional(lex_schema_1.l.discriminatedUnion('type', [
-        exports.lexiconRefSchema,
-        exports.lexiconRefUnionSchema,
-        exports.lexiconObjectSchema,
+    schema: l.optional(l.discriminatedUnion('type', [
+        lexiconRefSchema,
+        lexiconRefUnionSchema,
+        lexiconObjectSchema,
     ])),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon XRPC error definitions.
@@ -267,9 +264,9 @@ exports.lexiconPayload = lex_schema_1.l.object({
  * Validates error definitions that can be returned by XRPC methods.
  * Each error has a name and optional description.
  */
-exports.lexiconError = lex_schema_1.l.object({
-    name: lex_schema_1.l.string({ minLength: 1 }),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconError = l.object({
+    name: l.string({ minLength: 1 }),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon query (GET) method definitions.
@@ -278,12 +275,12 @@ exports.lexiconError = lex_schema_1.l.object({
  * operations. Queries can have parameters, an output payload, and
  * defined error types.
  */
-exports.lexiconQuerySchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('query'),
-    parameters: lex_schema_1.l.optional(exports.lexiconParameters),
-    output: lex_schema_1.l.optional(exports.lexiconPayload),
-    errors: lex_schema_1.l.optional(lex_schema_1.l.array(exports.lexiconError)),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconQuerySchema = l.object({
+    type: l.literal('query'),
+    parameters: l.optional(lexiconParameters),
+    output: l.optional(lexiconPayload),
+    errors: l.optional(l.array(lexiconError)),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon procedure (POST) method definitions.
@@ -292,13 +289,13 @@ exports.lexiconQuerySchema = lex_schema_1.l.object({
  * operations that may modify state. Procedures can have parameters,
  * input payload, output payload, and defined error types.
  */
-exports.lexiconProcedureSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('procedure'),
-    parameters: lex_schema_1.l.optional(exports.lexiconParameters),
-    input: lex_schema_1.l.optional(exports.lexiconPayload),
-    output: lex_schema_1.l.optional(exports.lexiconPayload),
-    errors: lex_schema_1.l.optional(lex_schema_1.l.array(exports.lexiconError)),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconProcedureSchema = l.object({
+    type: l.literal('procedure'),
+    parameters: l.optional(lexiconParameters),
+    input: l.optional(lexiconPayload),
+    output: l.optional(lexiconPayload),
+    errors: l.optional(l.array(lexiconError)),
+    description: l.optional(l.string()),
 });
 /**
  * Schema for validating Lexicon subscription (WebSocket) method definitions.
@@ -307,57 +304,57 @@ exports.lexiconProcedureSchema = lex_schema_1.l.object({
  * streaming connections over WebSocket. Subscriptions have parameters,
  * a message schema defining the streamed data format, and error types.
  */
-exports.lexiconSubscriptionSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('subscription'),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
-    parameters: lex_schema_1.l.optional(exports.lexiconParameters),
-    message: lex_schema_1.l.object({
-        description: lex_schema_1.l.optional(lex_schema_1.l.string()),
-        schema: exports.lexiconRefUnionSchema,
+export const lexiconSubscriptionSchema = l.object({
+    type: l.literal('subscription'),
+    description: l.optional(l.string()),
+    parameters: l.optional(lexiconParameters),
+    message: l.object({
+        description: l.optional(l.string()),
+        schema: lexiconRefUnionSchema,
     }),
-    errors: lex_schema_1.l.optional(lex_schema_1.l.array(exports.lexiconError)),
+    errors: l.optional(l.array(lexiconError)),
 });
 // Permissions
 /**
  * Schema for validating language codes in Lexicon permission definitions.
  */
-exports.lexiconLanguageSchema = lex_schema_1.l.string({ format: 'language' });
+export const lexiconLanguageSchema = l.string({ format: 'language' });
 /**
  * Schema for validating language-keyed string dictionaries.
  * Used for localized text in permission definitions.
  */
-exports.lexiconLanguageDict = lex_schema_1.l.dict(exports.lexiconLanguageSchema, lex_schema_1.l.string());
+export const lexiconLanguageDict = l.dict(lexiconLanguageSchema, l.string());
 /**
  * Schema for validating individual Lexicon permission definitions.
  */
-exports.lexiconPermissionSchema = lex_schema_1.l.intersection(lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('permission'),
-    resource: lex_schema_1.l.string({ minLength: 1 }),
-}), lex_schema_1.l.dict(lex_schema_1.l.string(), lex_schema_1.l.paramSchema));
+export const lexiconPermissionSchema = l.intersection(l.object({
+    type: l.literal('permission'),
+    resource: l.string({ minLength: 1 }),
+}), l.dict(l.string(), l.paramSchema));
 /**
  * Schema for validating Lexicon permission set definitions.
  */
-exports.lexiconPermissionSetSchema = lex_schema_1.l.object({
-    type: lex_schema_1.l.literal('permission-set'),
-    permissions: lex_schema_1.l.array(exports.lexiconPermissionSchema),
-    title: lex_schema_1.l.optional(lex_schema_1.l.string()),
-    'title:lang': lex_schema_1.l.optional(exports.lexiconLanguageDict),
-    detail: lex_schema_1.l.optional(lex_schema_1.l.string()),
-    'detail:lang': lex_schema_1.l.optional(exports.lexiconLanguageDict),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
+export const lexiconPermissionSetSchema = l.object({
+    type: l.literal('permission-set'),
+    permissions: l.array(lexiconPermissionSchema),
+    title: l.optional(l.string()),
+    'title:lang': l.optional(lexiconLanguageDict),
+    detail: l.optional(l.string()),
+    'detail:lang': l.optional(lexiconLanguageDict),
+    description: l.optional(l.string()),
 });
 const NAMED_LEXICON_SCHEMAS = [
     ...CONCRETE_TYPES,
-    exports.lexiconArraySchema,
-    exports.lexiconObjectSchema,
-    exports.lexiconTokenSchema,
+    lexiconArraySchema,
+    lexiconObjectSchema,
+    lexiconTokenSchema,
 ];
 const MAIN_LEXICON_SCHEMAS = [
-    exports.lexiconPermissionSetSchema,
-    exports.lexiconProcedureSchema,
-    exports.lexiconQuerySchema,
-    exports.lexiconRecordSchema,
-    exports.lexiconSubscriptionSchema,
+    lexiconPermissionSetSchema,
+    lexiconProcedureSchema,
+    lexiconQuerySchema,
+    lexiconRecordSchema,
+    lexiconSubscriptionSchema,
     ...NAMED_LEXICON_SCHEMAS,
 ];
 /**
@@ -366,7 +363,7 @@ const MAIN_LEXICON_SCHEMAS = [
  * Validates that the identifier follows the Namespaced Identifier format
  * (e.g., "com.atproto.repo.createRecord").
  */
-exports.lexiconIdentifierSchema = lex_schema_1.l.string({ format: 'nsid' });
+export const lexiconIdentifierSchema = l.string({ format: 'nsid' });
 /**
  * Schema for validating complete Lexicon document structures.
  *
@@ -403,13 +400,13 @@ exports.lexiconIdentifierSchema = lex_schema_1.l.string({ format: 'nsid' });
  * })
  * ```
  */
-exports.lexiconDocumentSchema = lex_schema_1.l.object({
-    lexicon: lex_schema_1.l.literal(1),
-    id: exports.lexiconIdentifierSchema,
-    revision: lex_schema_1.l.optional(lex_schema_1.l.integer()),
-    description: lex_schema_1.l.optional(lex_schema_1.l.string()),
-    defs: lex_schema_1.l.intersection(lex_schema_1.l.object({
-        main: lex_schema_1.l.optional(lex_schema_1.l.discriminatedUnion('type', MAIN_LEXICON_SCHEMAS)),
-    }), lex_schema_1.l.dict(lex_schema_1.l.string({ minLength: 1 }), lex_schema_1.l.discriminatedUnion('type', NAMED_LEXICON_SCHEMAS))),
+export const lexiconDocumentSchema = l.object({
+    lexicon: l.literal(1),
+    id: lexiconIdentifierSchema,
+    revision: l.optional(l.integer()),
+    description: l.optional(l.string()),
+    defs: l.intersection(l.object({
+        main: l.optional(l.discriminatedUnion('type', MAIN_LEXICON_SCHEMAS)),
+    }), l.dict(l.string({ minLength: 1 }), l.discriminatedUnion('type', NAMED_LEXICON_SCHEMAS))),
 });
 //# sourceMappingURL=lexicon-document.js.map

package/dist/lexicon-document.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"lexicon-document.js","sourceRoot":"","sources":["../src/lexicon-document.ts"],"names":[],"mappings":";;;AAAA,oDAAuC;AAEvC,oCAAoC;AAEpC,mBAAmB;AAEnB;;;;;GAKG;AACU,QAAA,oBAAoB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IAC1B,OAAO,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAChC,KAAK,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAC9B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACU,QAAA,oBAAoB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IAC1B,OAAO,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAChC,OAAO,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAChC,OAAO,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAChC,IAAI,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IACtC,KAAK,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAC9B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;;GAMG;AACU,QAAA,mBAAmB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC1C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,IAAI,CAAiB,cAAC,CAAC,cAAc,CAAC,CAAC;IAC5D,OAAO,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IAC/B,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAClC,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAClC,YAAY,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IACrC,YAAY,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IACrC,IAAI,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACrC,KAAK,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IAC7B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACU,QAAA,kBAAkB,GAAG,cAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAClC,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAClC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACU,QAAA,oBAAoB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,UAAU,CAAC;IAC3B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;GAKG;AACU,QAAA,iBAAiB,GAAG,cAAC,CAAC,MAAM,CAAC;IACxC,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IACvB,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACvC,OAAO,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAChC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;GAGG;AACH,MAAM,cAAc,GAAG;IACrB,4BAAoB;IACpB,4BAAoB;IACpB,2BAAmB;IACnB,qBAAqB;IACrB,0BAAkB;IAClB,4BAAoB;IACpB,mBAAmB;IACnB,yBAAiB;CACT,CAAA;AAEV,aAAa;AAEb;;;;;GAKG;AACU,QAAA,oBAAoB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IAC1B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACU,QAAA,kBAAkB,GAAG,cAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACU,QAAA,gBAAgB,GAAG,cAAC,CAAC,MAAM,CAAC;IACvC,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,KAAK,CAAC;IACtB,GAAG,EAAE,cAAC,CAAC,MAAM,EAAE;IACf,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;;GAMG;AACU,QAAA,qBAAqB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC5C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,IAAI,EAAE,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IACzB,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAC/B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF,gBAAgB;AAEhB,MAAM,mBAAmB,GAAG;IAC1B,GAAG,cAAc;IACjB,OAAO;IACP,4BAAoB;IACpB,wBAAgB;IAChB,6BAAqB;CACb,CAAA;AASV;;;;;GAKG;AACU,QAAA,kBAAkB,GAAG,cAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,KAAK,EAAE,cAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,mBAAmB,CAAC;IACxD,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAClC,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IAClC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF,MAAM,2BAA2B,GAG5B;IACH,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC;IACvE,OAAO,EAAE,uDAAuD;IAChE,IAAI,EAAE,UAAU;CACjB,CAAA;AAED;;;;;;GAMG;AACU,QAAA,mBAAmB,GAAG,cAAC,CAAC,MAAM,CACzC,cAAC,CAAC,MAAM,CAAC;IACP,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,UAAU,EAAE,cAAC,CAAC,IAAI,CAChB,cAAC,CAAC,MAAM,EAAE,EACV,cAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;QAC3B,GAAG,mBAAmB;QACtB,0BAAkB;KACnB,CAAC,CACH;IACD,QAAQ,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,QAAQ,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,EACF,2BAA2B,CAC5B,CAAA;AAYD,UAAU;AAEV;;;;;;;;GAQG;AACU,QAAA,sBAAsB,GAAG,cAAC,CAAC,MAAM,CAC5C,cAAC,CAAC,kBAAkB,EACpB,qFAAqF,CACtF,CAAA;AAWD;;;;;;GAMG;AACU,QAAA,mBAAmB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC1C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,MAAM,EAAE,2BAAmB;IAC3B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IACnC,GAAG,EAAE,8BAAsB;CAC5B,CAAC,CAAA;AAYF,eAAe;AAEf;;;;;;GAMG;AACU,QAAA,iBAAiB,GAAG,cAAC,CAAC,MAAM,CACvC,cAAC,CAAC,MAAM,CAAC;IACP,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,UAAU,EAAE,cAAC,CAAC,IAAI,CAChB,cAAC,CAAC,MAAM,EAAE,EACV,cAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;QAC3B,4BAAoB;QACpB,4BAAoB;QACpB,2BAAmB;QACnB,cAAC,CAAC,MAAM,CAAC;YACP,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,KAAK,EAAE,cAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;gBAClC,4BAAoB;gBACpB,4BAAoB;gBACpB,2BAAmB;aACpB,CAAC;YACF,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;YAClC,SAAS,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;YAClC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;SACpC,CAAC;KACH,CAAC,CACH;IACD,QAAQ,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,EACF,2BAA2B,CAC5B,CAAA;AAWD;;;;;;GAMG;AACU,QAAA,cAAc,GAAG,cAAC,CAAC,MAAM,CAAC;IACrC,QAAQ,EAAE,cAAC,CAAC,MAAM,CAAC,cAAC,CAAC,MAAM,EAAE,EAAE;QAC7B,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QACtE,OAAO,EACL,yEAAyE;KAC5E,CAAC;IACF,MAAM,EAAE,cAAC,CAAC,QAAQ,CAChB,cAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;QAC3B,wBAAgB;QAChB,6BAAqB;QACrB,2BAAmB;KACpB,CAAC,CACH;IACD,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACU,QAAA,YAAY,GAAG,cAAC,CAAC,MAAM,CAAC;IACnC,IAAI,EAAE,cAAC,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IAChC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACU,QAAA,kBAAkB,GAAG,cAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,UAAU,EAAE,cAAC,CAAC,QAAQ,CAAC,yBAAiB,CAAC;IACzC,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,sBAAc,CAAC;IAClC,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,oBAAY,CAAC,CAAC;IACzC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACU,QAAA,sBAAsB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC7C,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,WAAW,CAAC;IAC5B,UAAU,EAAE,cAAC,CAAC,QAAQ,CAAC,yBAAiB,CAAC;IACzC,KAAK,EAAE,cAAC,CAAC,QAAQ,CAAC,sBAAc,CAAC;IACjC,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,sBAAc,CAAC;IAClC,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,oBAAY,CAAC,CAAC;IACzC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACU,QAAA,yBAAyB,GAAG,cAAC,CAAC,MAAM,CAAC;IAChD,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,cAAc,CAAC;IAC/B,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IACnC,UAAU,EAAE,cAAC,CAAC,QAAQ,CAAC,yBAAiB,CAAC;IACzC,OAAO,EAAE,cAAC,CAAC,MAAM,CAAC;QAChB,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,EAAE,6BAAqB;KAC9B,CAAC;IACF,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,KAAK,CAAC,oBAAY,CAAC,CAAC;CAC1C,CAAC,CAAA;AAWF,cAAc;AAEd;;GAEG;AACU,QAAA,qBAAqB,GAAG,cAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAA;AASrE;;;GAGG;AACU,QAAA,mBAAmB,GAAG,cAAC,CAAC,IAAI,CAAC,6BAAqB,EAAE,cAAC,CAAC,MAAM,EAAE,CAAC,CAAA;AAS5E;;GAEG;AACU,QAAA,uBAAuB,GAAG,cAAC,CAAC,YAAY,CACnD,cAAC,CAAC,MAAM,CAAC;IACP,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,YAAY,CAAC;IAC7B,QAAQ,EAAE,cAAC,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;CACrC,CAAC,EACF,cAAC,CAAC,IAAI,CAAC,cAAC,CAAC,MAAM,EAAE,EAAE,cAAC,CAAC,WAAW,CAAC,CAClC,CAAA;AAYD;;GAEG;AACU,QAAA,0BAA0B,GAAG,cAAC,CAAC,MAAM,CAAC;IACjD,IAAI,EAAE,cAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC;IACjC,WAAW,EAAE,cAAC,CAAC,KAAK,CAAC,+BAAuB,CAAC;IAC7C,KAAK,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IAC7B,YAAY,EAAE,cAAC,CAAC,QAAQ,CAAC,2BAAmB,CAAC;IAC7C,MAAM,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IAC9B,aAAa,EAAE,cAAC,CAAC,QAAQ,CAAC,2BAAmB,CAAC;IAC9C,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF,MAAM,qBAAqB,GAAG;IAC5B,GAAG,cAAc;IACjB,0BAAkB;IAClB,2BAAmB;IACnB,0BAAkB;CACV,CAAA;AAYV,MAAM,oBAAoB,GAAG;IAC3B,kCAA0B;IAC1B,8BAAsB;IACtB,0BAAkB;IAClB,2BAAmB;IACnB,iCAAyB;IACzB,GAAG,qBAAqB;CAChB,CAAA;AAYV;;;;;GAKG;AACU,QAAA,uBAAuB,GAAG,cAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;AAWnE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACU,QAAA,qBAAqB,GAAG,cAAC,CAAC,MAAM,CAAC;IAC5C,OAAO,EAAE,cAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACrB,EAAE,EAAE,+BAAuB;IAC3B,QAAQ,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,OAAO,EAAE,CAAC;IACjC,WAAW,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,MAAM,EAAE,CAAC;IACnC,IAAI,EAAE,cAAC,CAAC,YAAY,CAClB,cAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,cAAC,CAAC,QAAQ,CAAC,cAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,oBAAoB,CAAC,CAAC;KACrE,CAAC,EACF,cAAC,CAAC,IAAI,CACJ,cAAC,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,EAC1B,cAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,qBAAqB,CAAC,CACpD,CACF;CACF,CAAC,CAAA","sourcesContent":["import { l } from '@atproto/lex-schema'\n\n// https://atproto.com/specs/lexicon\n\n// \"Concrete\" Types\n\n/*\n Schema for validating Lexicon boolean type definitions.\n \n Validates boolean field definitions that may include a default value,\n * a constant value, and an optional description.\n /\nexport const lexiconBooleanSchema = l.object({\n type: l.literal('boolean'),\n default: l.optional(l.boolean()),\n const: l.optional(l.boolean()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon boolean definition.\n \n Represents the structure of a boolean field in a Lexicon document,\n * including optional default, const, and description properties.\n \n @see {@link lexiconBooleanSchema} for the schema definition\n /\nexport type LexiconBoolean = l.Infer<typeof lexiconBooleanSchema>\n\n/\n Schema for validating Lexicon integer type definitions.\n \n Validates integer field definitions with support for default values,\n * minimum/maximum constraints, enumerated values, and constant values.\n /\nexport const lexiconIntegerSchema = l.object({\n type: l.literal('integer'),\n default: l.optional(l.integer()),\n minimum: l.optional(l.integer()),\n maximum: l.optional(l.integer()),\n enum: l.optional(l.array(l.integer())),\n const: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon integer definition.\n \n Represents the structure of an integer field in a Lexicon document,\n * including optional constraints like minimum, maximum, enum, and const.\n \n @see {@link lexiconIntegerSchema} for the schema definition\n /\nexport type LexiconInteger = l.Infer<typeof lexiconIntegerSchema>\n\n/\n Schema for validating Lexicon string type definitions.\n \n Validates string field definitions with support for format validation,\n * length constraints (both character and grapheme-based), enumerated values,\n * known values, and constant values.\n /\nexport const lexiconStringSchema = l.object({\n type: l.literal('string'),\n format: l.optional(l.enum<l.StringFormat>(l.STRING_FORMATS)),\n default: l.optional(l.string()),\n minLength: l.optional(l.integer()),\n maxLength: l.optional(l.integer()),\n minGraphemes: l.optional(l.integer()),\n maxGraphemes: l.optional(l.integer()),\n enum: l.optional(l.array(l.string())),\n const: l.optional(l.string()),\n knownValues: l.optional(l.array(l.string())),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon string definition.\n \n Represents the structure of a string field in a Lexicon document,\n * including optional format, length constraints, enum, const, and knownValues.\n \n @see {@link lexiconStringSchema} for the schema definition\n /\nexport type LexiconString = l.Infer<typeof lexiconStringSchema>\n\n/\n Schema for validating Lexicon bytes type definitions.\n \n Validates binary data field definitions with optional length constraints.\n * Used for raw byte arrays in DAG-CBOR encoding.\n /\nexport const lexiconBytesSchema = l.object({\n type: l.literal('bytes'),\n maxLength: l.optional(l.integer()),\n minLength: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon bytes definition.\n \n Represents the structure of a binary data field in a Lexicon document,\n * including optional minLength and maxLength constraints.\n \n @see {@link lexiconBytesSchema} for the schema definition\n /\nexport type LexiconBytes = l.Infer<typeof lexiconBytesSchema>\n\n/\n Schema for validating Lexicon CID link type definitions.\n \n Validates Content Identifier (CID) link field definitions.\n * CIDs are used to reference content-addressed data in IPFS/IPLD.\n /\nexport const lexiconCidLinkSchema = l.object({\n type: l.literal('cid-link'),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon CID link definition.\n \n Represents the structure of a CID link field in a Lexicon document.\n \n @see {@link lexiconCidLinkSchema} for the schema definition\n /\nexport type LexiconCid = l.Infer<typeof lexiconCidLinkSchema>\n\n/\n Schema for validating Lexicon blob type definitions.\n \n Validates blob field definitions with optional MIME type acceptance list\n * and maximum size constraints. Blobs represent uploaded file references.\n /\nexport const lexiconBlobSchema = l.object({\n type: l.literal('blob'),\n accept: l.optional(l.array(l.string())),\n maxSize: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon blob definition.\n \n Represents the structure of a blob field in a Lexicon document,\n * including optional accept list and maxSize constraints.\n \n @see {@link lexiconBlobSchema} for the schema definition\n /\nexport type LexiconBlob = l.Infer<typeof lexiconBlobSchema>\n\n/\n Array of all concrete (primitive) Lexicon type schemas.\n * Includes boolean, integer, string, bytes, cid-link, and blob types.\n /\nconst CONCRETE_TYPES = [\n lexiconBooleanSchema,\n lexiconIntegerSchema,\n lexiconStringSchema,\n // Lexicon (DAG-CBOR)\n lexiconBytesSchema,\n lexiconCidLinkSchema,\n // Lexicon Specific\n lexiconBlobSchema,\n] as const\n\n// Meta types\n\n/\n Schema for validating Lexicon unknown type definitions.\n \n Validates unknown field definitions which accept any valid data.\n * Used when the schema cannot determine the type ahead of time.\n /\nexport const lexiconUnknownSchema = l.object({\n type: l.literal('unknown'),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon unknown definition.\n \n Represents the structure of an unknown field in a Lexicon document.\n \n @see {@link lexiconUnknownSchema} for the schema definition\n /\nexport type LexiconUnknown = l.Infer<typeof lexiconUnknownSchema>\n\n/\n Schema for validating Lexicon token type definitions.\n \n Validates token definitions which represent symbolic constants.\n * Tokens are used to define enumeration-like values that can be\n * referenced across different lexicons.\n /\nexport const lexiconTokenSchema = l.object({\n type: l.literal('token'),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon token definition.\n \n Represents the structure of a token in a Lexicon document.\n \n @see {@link lexiconTokenSchema} for the schema definition\n /\nexport type LexiconToken = l.Infer<typeof lexiconTokenSchema>\n\n/\n Schema for validating Lexicon reference type definitions.\n \n Validates reference definitions which point to other type definitions\n * within the same or different Lexicon documents. References use the\n * format \"nsid#defName\" for cross-document refs or \"#defName\" for local refs.\n /\nexport const lexiconRefSchema = l.object({\n type: l.literal('ref'),\n ref: l.string(),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon reference definition.\n \n Represents the structure of a reference field in a Lexicon document,\n * including the ref string pointing to another definition.\n \n @see {@link lexiconRefSchema} for the schema definition\n /\nexport type LexiconRef = l.Infer<typeof lexiconRefSchema>\n\n/\n Schema for validating Lexicon union reference type definitions.\n \n Validates union definitions which can reference multiple possible types.\n * The union can be closed (only listed types allowed) or open (allows\n * additional unlisted types).\n /\nexport const lexiconRefUnionSchema = l.object({\n type: l.literal('union'),\n refs: l.array(l.string()),\n closed: l.optional(l.boolean()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon union reference definition.\n \n Represents the structure of a union field in a Lexicon document,\n * including an array of reference strings and optional closed flag.\n \n @see {@link lexiconRefUnionSchema} for the schema definition\n /\nexport type LexiconRefUnion = l.Infer<typeof lexiconRefUnionSchema>\n\n// Complex Types\n\nconst ARRAY_ITEMS_SCHEMAS = [\n ...CONCRETE_TYPES,\n // Meta\n lexiconUnknownSchema,\n lexiconRefSchema,\n lexiconRefUnionSchema,\n] as const\n\n/\n TypeScript type representing valid item types for Lexicon arrays.\n \n Union of all types that can appear as items within a Lexicon array definition.\n /\nexport type LexiconArrayItems = l.Infer<(typeof ARRAY_ITEMS_SCHEMAS)[number]>\n\n/\n Schema for validating Lexicon array type definitions.\n \n Validates array field definitions with specified item type and\n * optional length constraints.\n /\nexport const lexiconArraySchema = l.object({\n type: l.literal('array'),\n items: l.discriminatedUnion('type', ARRAY_ITEMS_SCHEMAS),\n minLength: l.optional(l.integer()),\n maxLength: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon array definition.\n \n Represents the structure of an array field in a Lexicon document,\n * including the items schema and optional length constraints.\n \n @see {@link lexiconArraySchema} for the schema definition\n /\nexport type LexiconArray = l.Infer<typeof lexiconArraySchema>\n\nconst requirePropertiesRefinement: l.RefinementCheck<{\n required?: string[]\n properties: Record<string, unknown>\n}> = {\n check: (v) => !v.required \|\| v.required.every((k) => k in v.properties),\n message: 'All required parameters must be defined in properties',\n path: 'required',\n}\n\n/\n Schema for validating Lexicon object type definitions.\n \n Validates object definitions with named properties, required field lists,\n * and nullable field lists. Includes refinement to ensure all required\n * properties are defined in the properties map.\n /\nexport const lexiconObjectSchema = l.refine(\n l.object({\n type: l.literal('object'),\n properties: l.dict(\n l.string(),\n l.discriminatedUnion('type', [\n ...ARRAY_ITEMS_SCHEMAS,\n lexiconArraySchema,\n ]),\n ),\n required: l.optional(l.array(l.string())),\n nullable: l.optional(l.array(l.string())),\n description: l.optional(l.string()),\n }),\n requirePropertiesRefinement,\n)\n\n/\n TypeScript type for a Lexicon object definition.\n \n Represents the structure of an object type in a Lexicon document,\n * including properties map, required array, and nullable array.\n \n @see {@link lexiconObjectSchema} for the schema definition\n /\nexport type LexiconObject = l.Infer<typeof lexiconObjectSchema>\n\n// Records\n\n/\n Schema for validating Lexicon record key definitions.\n \n Validates record key type specifications. Valid values are:\n * - \"any\": Any valid record key\n * - \"nsid\": Namespaced identifier\n * - \"tid\": Timestamp identifier\n * - \"literal:<string>\": A specific literal string value\n /\nexport const lexiconRecordKeySchema = l.custom(\n l.isLexiconRecordKey,\n 'Invalid record key definition (must be \"any\", \"nsid\", \"tid\", or \"literal:<string>\")',\n)\n\n/\n TypeScript type for valid Lexicon record key values.\n \n Can be \"any\", \"nsid\", \"tid\", or \"literal:<string>\".\n \n @see {@link lexiconRecordKeySchema} for the schema definition\n /\nexport type LexiconRecordKey = l.LexiconRecordKey\n\n/\n Schema for validating Lexicon record type definitions.\n \n Validates record definitions which define the structure of data\n * stored in AT Protocol repositories. Records have a key type\n * and an object schema defining the record's data structure.\n /\nexport const lexiconRecordSchema = l.object({\n type: l.literal('record'),\n record: lexiconObjectSchema,\n description: l.optional(l.string()),\n key: lexiconRecordKeySchema,\n})\n\n/\n TypeScript type for a Lexicon record definition.\n \n Represents the structure of a record type in a Lexicon document,\n * including the key type and the object schema for the record data.\n \n @see {@link lexiconRecordSchema} for the schema definition\n /\nexport type LexiconRecord = l.Infer<typeof lexiconRecordSchema>\n\n// XRPC Methods\n\n/\n Schema for validating Lexicon XRPC method parameters.\n \n Validates the parameters definition for query and procedure methods.\n * Parameters can only be primitive types (boolean, integer, string)\n * or arrays of primitives.\n /\nexport const lexiconParameters = l.refine(\n l.object({\n type: l.literal('params'),\n properties: l.dict(\n l.string(),\n l.discriminatedUnion('type', [\n lexiconBooleanSchema,\n lexiconIntegerSchema,\n lexiconStringSchema,\n l.object({\n type: l.literal('array'),\n items: l.discriminatedUnion('type', [\n lexiconBooleanSchema,\n lexiconIntegerSchema,\n lexiconStringSchema,\n ]),\n minLength: l.optional(l.integer()),\n maxLength: l.optional(l.integer()),\n description: l.optional(l.string()),\n }),\n ]),\n ),\n required: l.optional(l.array(l.string())),\n description: l.optional(l.string()),\n }),\n requirePropertiesRefinement,\n)\n\n/\n TypeScript type for Lexicon XRPC method parameters.\n \n Represents the structure of parameters for query and procedure methods.\n \n @see {@link lexiconParameters} for the schema definition\n /\nexport type LexiconParameters = l.Infer<typeof lexiconParameters>\n\n/\n Schema for validating Lexicon XRPC method payloads.\n \n Validates input/output payload definitions for procedures and queries.\n * Payloads specify the encoding (MIME type) and optional schema for\n * the request or response body.\n /\nexport const lexiconPayload = l.object({\n encoding: l.refine(l.string(), {\n check: (v) => !v.includes(',') && !v.includes(';') && !v.includes(' '),\n message:\n 'Invalid encoding string (must be a single MIME type without parameters)',\n }),\n schema: l.optional(\n l.discriminatedUnion('type', [\n lexiconRefSchema,\n lexiconRefUnionSchema,\n lexiconObjectSchema,\n ]),\n ),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon XRPC payload definition.\n \n Represents the structure of an input or output payload,\n * including encoding type and optional schema.\n \n @see {@link lexiconPayload} for the schema definition\n /\nexport type LexiconPayload = l.Infer<typeof lexiconPayload>\n\n/\n Schema for validating Lexicon XRPC error definitions.\n \n Validates error definitions that can be returned by XRPC methods.\n * Each error has a name and optional description.\n /\nexport const lexiconError = l.object({\n name: l.string({ minLength: 1 }),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon XRPC error definition.\n \n Represents an error that can be returned by an XRPC method.\n \n @see {@link lexiconError} for the schema definition\n /\nexport type LexiconError = l.Infer<typeof lexiconError>\n\n/\n Schema for validating Lexicon query (GET) method definitions.\n \n Validates query method definitions which represent read-only HTTP GET\n * operations. Queries can have parameters, an output payload, and\n * defined error types.\n /\nexport const lexiconQuerySchema = l.object({\n type: l.literal('query'),\n parameters: l.optional(lexiconParameters),\n output: l.optional(lexiconPayload),\n errors: l.optional(l.array(lexiconError)),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon query method definition.\n \n Represents the structure of an XRPC query (GET) method.\n \n @see {@link lexiconQuerySchema} for the schema definition\n /\nexport type LexiconQuery = l.Infer<typeof lexiconQuerySchema>\n\n/\n Schema for validating Lexicon procedure (POST) method definitions.\n \n Validates procedure method definitions which represent HTTP POST\n * operations that may modify state. Procedures can have parameters,\n * input payload, output payload, and defined error types.\n /\nexport const lexiconProcedureSchema = l.object({\n type: l.literal('procedure'),\n parameters: l.optional(lexiconParameters),\n input: l.optional(lexiconPayload),\n output: l.optional(lexiconPayload),\n errors: l.optional(l.array(lexiconError)),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon procedure method definition.\n \n Represents the structure of an XRPC procedure (POST) method.\n \n @see {@link lexiconProcedureSchema} for the schema definition\n /\nexport type LexiconProcedure = l.Infer<typeof lexiconProcedureSchema>\n\n/\n Schema for validating Lexicon subscription (WebSocket) method definitions.\n \n Validates subscription method definitions which represent real-time\n * streaming connections over WebSocket. Subscriptions have parameters,\n * a message schema defining the streamed data format, and error types.\n /\nexport const lexiconSubscriptionSchema = l.object({\n type: l.literal('subscription'),\n description: l.optional(l.string()),\n parameters: l.optional(lexiconParameters),\n message: l.object({\n description: l.optional(l.string()),\n schema: lexiconRefUnionSchema,\n }),\n errors: l.optional(l.array(lexiconError)),\n})\n\n/\n TypeScript type for a Lexicon subscription method definition.\n \n Represents the structure of an XRPC subscription (WebSocket) method.\n \n @see {@link lexiconSubscriptionSchema} for the schema definition\n /\nexport type LexiconSubscription = l.Infer<typeof lexiconSubscriptionSchema>\n\n// Permissions\n\n/\n Schema for validating language codes in Lexicon permission definitions.\n /\nexport const lexiconLanguageSchema = l.string({ format: 'language' })\n\n/\n TypeScript type for a BCP 47 language code string.\n \n @see {@link lexiconLanguageSchema} for the schema definition\n /\nexport type LexiconLanguage = l.Infer<typeof lexiconLanguageSchema>\n\n/\n Schema for validating language-keyed string dictionaries.\n * Used for localized text in permission definitions.\n /\nexport const lexiconLanguageDict = l.dict(lexiconLanguageSchema, l.string())\n\n/\n TypeScript type for a language-keyed dictionary of localized strings.\n \n @see {@link lexiconLanguageDict} for the schema definition\n /\nexport type LexiconLanguageDict = l.Infer<typeof lexiconLanguageDict>\n\n/\n Schema for validating individual Lexicon permission definitions.\n /\nexport const lexiconPermissionSchema = l.intersection(\n l.object({\n type: l.literal('permission'),\n resource: l.string({ minLength: 1 }),\n }),\n l.dict(l.string(), l.paramSchema),\n)\n\n/\n TypeScript type for a Lexicon permission definition.\n \n Represents a single permission with a resource identifier\n * and optional additional parameters.\n \n @see {@link lexiconPermissionSchema} for the schema definition\n /\nexport type LexiconPermission = l.Infer<typeof lexiconPermissionSchema>\n\n/\n Schema for validating Lexicon permission set definitions.\n /\nexport const lexiconPermissionSetSchema = l.object({\n type: l.literal('permission-set'),\n permissions: l.array(lexiconPermissionSchema),\n title: l.optional(l.string()),\n 'title:lang': l.optional(lexiconLanguageDict),\n detail: l.optional(l.string()),\n 'detail:lang': l.optional(lexiconLanguageDict),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon permission set definition.\n \n Represents a collection of permissions with optional\n * localized title and detail text.\n \n @see {@link lexiconPermissionSetSchema} for the schema definition\n /\nexport type LexiconPermissionSet = l.Infer<typeof lexiconPermissionSetSchema>\n\nconst NAMED_LEXICON_SCHEMAS = [\n ...CONCRETE_TYPES,\n lexiconArraySchema,\n lexiconObjectSchema,\n lexiconTokenSchema,\n] as const\n\n/\n TypeScript type for any named Lexicon definition.\n \n Union of all definition types that can appear in the defs section\n * of a Lexicon document (excluding main-only types).\n /\nexport type NamedLexiconDefinition = l.Infer<\n (typeof NAMED_LEXICON_SCHEMAS)[number]\n>\n\nconst MAIN_LEXICON_SCHEMAS = [\n lexiconPermissionSetSchema,\n lexiconProcedureSchema,\n lexiconQuerySchema,\n lexiconRecordSchema,\n lexiconSubscriptionSchema,\n ...NAMED_LEXICON_SCHEMAS,\n] as const\n\n/\n TypeScript type for main Lexicon definitions.\n \n Union of all definition types that can appear as the \"main\" entry\n * in a Lexicon document's defs section.\n /\nexport type MainLexiconDefinition = l.Infer<\n (typeof MAIN_LEXICON_SCHEMAS)[number]\n>\n\n/\n Schema for validating Lexicon document identifiers (NSIDs).\n \n Validates that the identifier follows the Namespaced Identifier format\n * (e.g., \"com.atproto.repo.createRecord\").\n /\nexport const lexiconIdentifierSchema = l.string({ format: 'nsid' })\n\n/\n TypeScript type for a Lexicon document identifier.\n \n A Namespaced Identifier (NSID) string in reverse-domain format.\n \n @see {@link lexiconIdentifierSchema} for the schema definition\n /\nexport type LexiconIdentifier = l.Infer<typeof lexiconIdentifierSchema>\n\n/\n Schema for validating complete Lexicon document structures.\n \n Validates the top-level structure of a Lexicon document, including:\n * - `lexicon`: Must be 1 (the current Lexicon version)\n * - `id`: The document's NSID\n * - `revision`: Optional version number\n * - `description`: Optional document description\n * - `defs`: Map of definition names to their schemas\n \n The \"main\" definition (if present) can be any main-only type,\n * while other definitions are limited to named types.\n \n @example\n * ```ts\n * const result = lexiconDocumentSchema.parse({\n * lexicon: 1,\n * id: 'com.example.getProfile',\n * defs: {\n * main: {\n * type: 'query',\n * output: {\n * encoding: 'application/json',\n * schema: { type: 'ref', ref: '#profile' }\n * }\n * },\n * profile: {\n * type: 'object',\n * properties: {\n * name: { type: 'string' }\n * }\n * }\n * }\n * })\n * ```\n /\nexport const lexiconDocumentSchema = l.object({\n lexicon: l.literal(1),\n id: lexiconIdentifierSchema,\n revision: l.optional(l.integer()),\n description: l.optional(l.string()),\n defs: l.intersection(\n l.object({\n main: l.optional(l.discriminatedUnion('type', MAIN_LEXICON_SCHEMAS)),\n }),\n l.dict(\n l.string({ minLength: 1 }),\n l.discriminatedUnion('type', NAMED_LEXICON_SCHEMAS),\n ),\n ),\n})\n\n/\n TypeScript type for a complete Lexicon document.\n \n Represents the full structure of a Lexicon JSON document,\n * including the version, identifier, and all type definitions.\n \n @see {@link lexiconDocumentSchema} for the schema definition\n */\nexport type LexiconDocument = l.Infer<typeof lexiconDocumentSchema>\n"]}
1	+ {"version":3,"file":"lexicon-document.js","sourceRoot":"","sources":["../src/lexicon-document.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,qBAAqB,CAAA;AAEvC,oCAAoC;AAEpC,mBAAmB;AAEnB;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IAC1B,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAChC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IAC1B,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAChC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAChC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAChC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IACtC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAiB,CAAC,CAAC,cAAc,CAAC,CAAC;IAC5D,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC/B,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,YAAY,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACrC,YAAY,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACrC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACrC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC7B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;IAC3B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IACvB,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACvC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAChC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;GAGG;AACH,MAAM,cAAc,GAAG;IACrB,oBAAoB;IACpB,oBAAoB;IACpB,mBAAmB;IACnB,qBAAqB;IACrB,kBAAkB;IAClB,oBAAoB;IACpB,mBAAmB;IACnB,iBAAiB;CACT,CAAA;AAEV,aAAa;AAEb;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IAC1B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;IACtB,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE;IACf,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC5C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACzB,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC/B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF,gBAAgB;AAEhB,MAAM,mBAAmB,GAAG;IAC1B,GAAG,cAAc;IACjB,OAAO;IACP,oBAAoB;IACpB,gBAAgB;IAChB,qBAAqB;CACb,CAAA;AASV;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,KAAK,EAAE,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,mBAAmB,CAAC;IACxD,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF,MAAM,2BAA2B,GAG5B;IACH,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC;IACvE,OAAO,EAAE,uDAAuD;IAChE,IAAI,EAAE,UAAU;CACjB,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CACzC,CAAC,CAAC,MAAM,CAAC;IACP,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,UAAU,EAAE,CAAC,CAAC,IAAI,CAChB,CAAC,CAAC,MAAM,EAAE,EACV,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;QAC3B,GAAG,mBAAmB;QACtB,kBAAkB;KACnB,CAAC,CACH;IACD,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,EACF,2BAA2B,CAC5B,CAAA;AAYD,UAAU;AAEV;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAC5C,CAAC,CAAC,kBAAkB,EACpB,qFAAqF,CACtF,CAAA;AAWD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,MAAM,EAAE,mBAAmB;IAC3B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACnC,GAAG,EAAE,sBAAsB;CAC5B,CAAC,CAAA;AAYF,eAAe;AAEf;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CACvC,CAAC,CAAC,MAAM,CAAC;IACP,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACzB,UAAU,EAAE,CAAC,CAAC,IAAI,CAChB,CAAC,CAAC,MAAM,EAAE,EACV,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;QAC3B,oBAAoB;QACpB,oBAAoB;QACpB,mBAAmB;QACnB,CAAC,CAAC,MAAM,CAAC;YACP,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,KAAK,EAAE,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;gBAClC,oBAAoB;gBACpB,oBAAoB;gBACpB,mBAAmB;aACpB,CAAC;YACF,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAClC,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAClC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACpC,CAAC;KACH,CAAC,CACH;IACD,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,EACF,2BAA2B,CAC5B,CAAA;AAWD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IACrC,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE;QAC7B,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QACtE,OAAO,EACL,yEAAyE;KAC5E,CAAC;IACF,MAAM,EAAE,CAAC,CAAC,QAAQ,CAChB,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;QAC3B,gBAAgB;QAChB,qBAAqB;QACrB,mBAAmB;KACpB,CAAC,CACH;IACD,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC;IACnC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IAChC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IACzC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC;IAClC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACzC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;IAC5B,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IACzC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC;IACjC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC;IAClC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACzC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAWF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAC,MAAM,CAAC;IAChD,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC;IAC/B,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACnC,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IACzC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC;QAChB,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,EAAE,qBAAqB;KAC9B,CAAC;IACF,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;CAC1C,CAAC,CAAA;AAWF,cAAc;AAEd;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAA;AASrE;;;GAGG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAA;AAS5E;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC,YAAY,CACnD,CAAC,CAAC,MAAM,CAAC;IACP,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC;IAC7B,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;CACrC,CAAC,EACF,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,CAClC,CAAA;AAYD;;GAEG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC,MAAM,CAAC;IACjD,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC;IACjC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,uBAAuB,CAAC;IAC7C,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC7B,YAAY,EAAE,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;IAC7C,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC9B,aAAa,EAAE,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;IAC9C,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CACpC,CAAC,CAAA;AAYF,MAAM,qBAAqB,GAAG;IAC5B,GAAG,cAAc;IACjB,kBAAkB;IAClB,mBAAmB;IACnB,kBAAkB;CACV,CAAA;AAYV,MAAM,oBAAoB,GAAG;IAC3B,0BAA0B;IAC1B,sBAAsB;IACtB,kBAAkB;IAClB,mBAAmB;IACnB,yBAAyB;IACzB,GAAG,qBAAqB;CAChB,CAAA;AAYV;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;AAWnE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC5C,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACrB,EAAE,EAAE,uBAAuB;IAC3B,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACjC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACnC,IAAI,EAAE,CAAC,CAAC,YAAY,CAClB,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,oBAAoB,CAAC,CAAC;KACrE,CAAC,EACF,CAAC,CAAC,IAAI,CACJ,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,EAC1B,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,qBAAqB,CAAC,CACpD,CACF;CACF,CAAC,CAAA","sourcesContent":["import { l } from '@atproto/lex-schema'\n\n// https://atproto.com/specs/lexicon\n\n// \"Concrete\" Types\n\n/*\n Schema for validating Lexicon boolean type definitions.\n \n Validates boolean field definitions that may include a default value,\n * a constant value, and an optional description.\n /\nexport const lexiconBooleanSchema = l.object({\n type: l.literal('boolean'),\n default: l.optional(l.boolean()),\n const: l.optional(l.boolean()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon boolean definition.\n \n Represents the structure of a boolean field in a Lexicon document,\n * including optional default, const, and description properties.\n \n @see {@link lexiconBooleanSchema} for the schema definition\n /\nexport type LexiconBoolean = l.Infer<typeof lexiconBooleanSchema>\n\n/\n Schema for validating Lexicon integer type definitions.\n \n Validates integer field definitions with support for default values,\n * minimum/maximum constraints, enumerated values, and constant values.\n /\nexport const lexiconIntegerSchema = l.object({\n type: l.literal('integer'),\n default: l.optional(l.integer()),\n minimum: l.optional(l.integer()),\n maximum: l.optional(l.integer()),\n enum: l.optional(l.array(l.integer())),\n const: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon integer definition.\n \n Represents the structure of an integer field in a Lexicon document,\n * including optional constraints like minimum, maximum, enum, and const.\n \n @see {@link lexiconIntegerSchema} for the schema definition\n /\nexport type LexiconInteger = l.Infer<typeof lexiconIntegerSchema>\n\n/\n Schema for validating Lexicon string type definitions.\n \n Validates string field definitions with support for format validation,\n * length constraints (both character and grapheme-based), enumerated values,\n * known values, and constant values.\n /\nexport const lexiconStringSchema = l.object({\n type: l.literal('string'),\n format: l.optional(l.enum<l.StringFormat>(l.STRING_FORMATS)),\n default: l.optional(l.string()),\n minLength: l.optional(l.integer()),\n maxLength: l.optional(l.integer()),\n minGraphemes: l.optional(l.integer()),\n maxGraphemes: l.optional(l.integer()),\n enum: l.optional(l.array(l.string())),\n const: l.optional(l.string()),\n knownValues: l.optional(l.array(l.string())),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon string definition.\n \n Represents the structure of a string field in a Lexicon document,\n * including optional format, length constraints, enum, const, and knownValues.\n \n @see {@link lexiconStringSchema} for the schema definition\n /\nexport type LexiconString = l.Infer<typeof lexiconStringSchema>\n\n/\n Schema for validating Lexicon bytes type definitions.\n \n Validates binary data field definitions with optional length constraints.\n * Used for raw byte arrays in DAG-CBOR encoding.\n /\nexport const lexiconBytesSchema = l.object({\n type: l.literal('bytes'),\n maxLength: l.optional(l.integer()),\n minLength: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon bytes definition.\n \n Represents the structure of a binary data field in a Lexicon document,\n * including optional minLength and maxLength constraints.\n \n @see {@link lexiconBytesSchema} for the schema definition\n /\nexport type LexiconBytes = l.Infer<typeof lexiconBytesSchema>\n\n/\n Schema for validating Lexicon CID link type definitions.\n \n Validates Content Identifier (CID) link field definitions.\n * CIDs are used to reference content-addressed data in IPFS/IPLD.\n /\nexport const lexiconCidLinkSchema = l.object({\n type: l.literal('cid-link'),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon CID link definition.\n \n Represents the structure of a CID link field in a Lexicon document.\n \n @see {@link lexiconCidLinkSchema} for the schema definition\n /\nexport type LexiconCid = l.Infer<typeof lexiconCidLinkSchema>\n\n/\n Schema for validating Lexicon blob type definitions.\n \n Validates blob field definitions with optional MIME type acceptance list\n * and maximum size constraints. Blobs represent uploaded file references.\n /\nexport const lexiconBlobSchema = l.object({\n type: l.literal('blob'),\n accept: l.optional(l.array(l.string())),\n maxSize: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon blob definition.\n \n Represents the structure of a blob field in a Lexicon document,\n * including optional accept list and maxSize constraints.\n \n @see {@link lexiconBlobSchema} for the schema definition\n /\nexport type LexiconBlob = l.Infer<typeof lexiconBlobSchema>\n\n/\n Array of all concrete (primitive) Lexicon type schemas.\n * Includes boolean, integer, string, bytes, cid-link, and blob types.\n /\nconst CONCRETE_TYPES = [\n lexiconBooleanSchema,\n lexiconIntegerSchema,\n lexiconStringSchema,\n // Lexicon (DAG-CBOR)\n lexiconBytesSchema,\n lexiconCidLinkSchema,\n // Lexicon Specific\n lexiconBlobSchema,\n] as const\n\n// Meta types\n\n/\n Schema for validating Lexicon unknown type definitions.\n \n Validates unknown field definitions which accept any valid data.\n * Used when the schema cannot determine the type ahead of time.\n /\nexport const lexiconUnknownSchema = l.object({\n type: l.literal('unknown'),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon unknown definition.\n \n Represents the structure of an unknown field in a Lexicon document.\n \n @see {@link lexiconUnknownSchema} for the schema definition\n /\nexport type LexiconUnknown = l.Infer<typeof lexiconUnknownSchema>\n\n/\n Schema for validating Lexicon token type definitions.\n \n Validates token definitions which represent symbolic constants.\n * Tokens are used to define enumeration-like values that can be\n * referenced across different lexicons.\n /\nexport const lexiconTokenSchema = l.object({\n type: l.literal('token'),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon token definition.\n \n Represents the structure of a token in a Lexicon document.\n \n @see {@link lexiconTokenSchema} for the schema definition\n /\nexport type LexiconToken = l.Infer<typeof lexiconTokenSchema>\n\n/\n Schema for validating Lexicon reference type definitions.\n \n Validates reference definitions which point to other type definitions\n * within the same or different Lexicon documents. References use the\n * format \"nsid#defName\" for cross-document refs or \"#defName\" for local refs.\n /\nexport const lexiconRefSchema = l.object({\n type: l.literal('ref'),\n ref: l.string(),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon reference definition.\n \n Represents the structure of a reference field in a Lexicon document,\n * including the ref string pointing to another definition.\n \n @see {@link lexiconRefSchema} for the schema definition\n /\nexport type LexiconRef = l.Infer<typeof lexiconRefSchema>\n\n/\n Schema for validating Lexicon union reference type definitions.\n \n Validates union definitions which can reference multiple possible types.\n * The union can be closed (only listed types allowed) or open (allows\n * additional unlisted types).\n /\nexport const lexiconRefUnionSchema = l.object({\n type: l.literal('union'),\n refs: l.array(l.string()),\n closed: l.optional(l.boolean()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon union reference definition.\n \n Represents the structure of a union field in a Lexicon document,\n * including an array of reference strings and optional closed flag.\n \n @see {@link lexiconRefUnionSchema} for the schema definition\n /\nexport type LexiconRefUnion = l.Infer<typeof lexiconRefUnionSchema>\n\n// Complex Types\n\nconst ARRAY_ITEMS_SCHEMAS = [\n ...CONCRETE_TYPES,\n // Meta\n lexiconUnknownSchema,\n lexiconRefSchema,\n lexiconRefUnionSchema,\n] as const\n\n/\n TypeScript type representing valid item types for Lexicon arrays.\n \n Union of all types that can appear as items within a Lexicon array definition.\n /\nexport type LexiconArrayItems = l.Infer<(typeof ARRAY_ITEMS_SCHEMAS)[number]>\n\n/\n Schema for validating Lexicon array type definitions.\n \n Validates array field definitions with specified item type and\n * optional length constraints.\n /\nexport const lexiconArraySchema = l.object({\n type: l.literal('array'),\n items: l.discriminatedUnion('type', ARRAY_ITEMS_SCHEMAS),\n minLength: l.optional(l.integer()),\n maxLength: l.optional(l.integer()),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon array definition.\n \n Represents the structure of an array field in a Lexicon document,\n * including the items schema and optional length constraints.\n \n @see {@link lexiconArraySchema} for the schema definition\n /\nexport type LexiconArray = l.Infer<typeof lexiconArraySchema>\n\nconst requirePropertiesRefinement: l.RefinementCheck<{\n required?: string[]\n properties: Record<string, unknown>\n}> = {\n check: (v) => !v.required \|\| v.required.every((k) => k in v.properties),\n message: 'All required parameters must be defined in properties',\n path: 'required',\n}\n\n/\n Schema for validating Lexicon object type definitions.\n \n Validates object definitions with named properties, required field lists,\n * and nullable field lists. Includes refinement to ensure all required\n * properties are defined in the properties map.\n /\nexport const lexiconObjectSchema = l.refine(\n l.object({\n type: l.literal('object'),\n properties: l.dict(\n l.string(),\n l.discriminatedUnion('type', [\n ...ARRAY_ITEMS_SCHEMAS,\n lexiconArraySchema,\n ]),\n ),\n required: l.optional(l.array(l.string())),\n nullable: l.optional(l.array(l.string())),\n description: l.optional(l.string()),\n }),\n requirePropertiesRefinement,\n)\n\n/\n TypeScript type for a Lexicon object definition.\n \n Represents the structure of an object type in a Lexicon document,\n * including properties map, required array, and nullable array.\n \n @see {@link lexiconObjectSchema} for the schema definition\n /\nexport type LexiconObject = l.Infer<typeof lexiconObjectSchema>\n\n// Records\n\n/\n Schema for validating Lexicon record key definitions.\n \n Validates record key type specifications. Valid values are:\n * - \"any\": Any valid record key\n * - \"nsid\": Namespaced identifier\n * - \"tid\": Timestamp identifier\n * - \"literal:<string>\": A specific literal string value\n /\nexport const lexiconRecordKeySchema = l.custom(\n l.isLexiconRecordKey,\n 'Invalid record key definition (must be \"any\", \"nsid\", \"tid\", or \"literal:<string>\")',\n)\n\n/\n TypeScript type for valid Lexicon record key values.\n \n Can be \"any\", \"nsid\", \"tid\", or \"literal:<string>\".\n \n @see {@link lexiconRecordKeySchema} for the schema definition\n /\nexport type LexiconRecordKey = l.LexiconRecordKey\n\n/\n Schema for validating Lexicon record type definitions.\n \n Validates record definitions which define the structure of data\n * stored in AT Protocol repositories. Records have a key type\n * and an object schema defining the record's data structure.\n /\nexport const lexiconRecordSchema = l.object({\n type: l.literal('record'),\n record: lexiconObjectSchema,\n description: l.optional(l.string()),\n key: lexiconRecordKeySchema,\n})\n\n/\n TypeScript type for a Lexicon record definition.\n \n Represents the structure of a record type in a Lexicon document,\n * including the key type and the object schema for the record data.\n \n @see {@link lexiconRecordSchema} for the schema definition\n /\nexport type LexiconRecord = l.Infer<typeof lexiconRecordSchema>\n\n// XRPC Methods\n\n/\n Schema for validating Lexicon XRPC method parameters.\n \n Validates the parameters definition for query and procedure methods.\n * Parameters can only be primitive types (boolean, integer, string)\n * or arrays of primitives.\n /\nexport const lexiconParameters = l.refine(\n l.object({\n type: l.literal('params'),\n properties: l.dict(\n l.string(),\n l.discriminatedUnion('type', [\n lexiconBooleanSchema,\n lexiconIntegerSchema,\n lexiconStringSchema,\n l.object({\n type: l.literal('array'),\n items: l.discriminatedUnion('type', [\n lexiconBooleanSchema,\n lexiconIntegerSchema,\n lexiconStringSchema,\n ]),\n minLength: l.optional(l.integer()),\n maxLength: l.optional(l.integer()),\n description: l.optional(l.string()),\n }),\n ]),\n ),\n required: l.optional(l.array(l.string())),\n description: l.optional(l.string()),\n }),\n requirePropertiesRefinement,\n)\n\n/\n TypeScript type for Lexicon XRPC method parameters.\n \n Represents the structure of parameters for query and procedure methods.\n \n @see {@link lexiconParameters} for the schema definition\n /\nexport type LexiconParameters = l.Infer<typeof lexiconParameters>\n\n/\n Schema for validating Lexicon XRPC method payloads.\n \n Validates input/output payload definitions for procedures and queries.\n * Payloads specify the encoding (MIME type) and optional schema for\n * the request or response body.\n /\nexport const lexiconPayload = l.object({\n encoding: l.refine(l.string(), {\n check: (v) => !v.includes(',') && !v.includes(';') && !v.includes(' '),\n message:\n 'Invalid encoding string (must be a single MIME type without parameters)',\n }),\n schema: l.optional(\n l.discriminatedUnion('type', [\n lexiconRefSchema,\n lexiconRefUnionSchema,\n lexiconObjectSchema,\n ]),\n ),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon XRPC payload definition.\n \n Represents the structure of an input or output payload,\n * including encoding type and optional schema.\n \n @see {@link lexiconPayload} for the schema definition\n /\nexport type LexiconPayload = l.Infer<typeof lexiconPayload>\n\n/\n Schema for validating Lexicon XRPC error definitions.\n \n Validates error definitions that can be returned by XRPC methods.\n * Each error has a name and optional description.\n /\nexport const lexiconError = l.object({\n name: l.string({ minLength: 1 }),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon XRPC error definition.\n \n Represents an error that can be returned by an XRPC method.\n \n @see {@link lexiconError} for the schema definition\n /\nexport type LexiconError = l.Infer<typeof lexiconError>\n\n/\n Schema for validating Lexicon query (GET) method definitions.\n \n Validates query method definitions which represent read-only HTTP GET\n * operations. Queries can have parameters, an output payload, and\n * defined error types.\n /\nexport const lexiconQuerySchema = l.object({\n type: l.literal('query'),\n parameters: l.optional(lexiconParameters),\n output: l.optional(lexiconPayload),\n errors: l.optional(l.array(lexiconError)),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon query method definition.\n \n Represents the structure of an XRPC query (GET) method.\n \n @see {@link lexiconQuerySchema} for the schema definition\n /\nexport type LexiconQuery = l.Infer<typeof lexiconQuerySchema>\n\n/\n Schema for validating Lexicon procedure (POST) method definitions.\n \n Validates procedure method definitions which represent HTTP POST\n * operations that may modify state. Procedures can have parameters,\n * input payload, output payload, and defined error types.\n /\nexport const lexiconProcedureSchema = l.object({\n type: l.literal('procedure'),\n parameters: l.optional(lexiconParameters),\n input: l.optional(lexiconPayload),\n output: l.optional(lexiconPayload),\n errors: l.optional(l.array(lexiconError)),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon procedure method definition.\n \n Represents the structure of an XRPC procedure (POST) method.\n \n @see {@link lexiconProcedureSchema} for the schema definition\n /\nexport type LexiconProcedure = l.Infer<typeof lexiconProcedureSchema>\n\n/\n Schema for validating Lexicon subscription (WebSocket) method definitions.\n \n Validates subscription method definitions which represent real-time\n * streaming connections over WebSocket. Subscriptions have parameters,\n * a message schema defining the streamed data format, and error types.\n /\nexport const lexiconSubscriptionSchema = l.object({\n type: l.literal('subscription'),\n description: l.optional(l.string()),\n parameters: l.optional(lexiconParameters),\n message: l.object({\n description: l.optional(l.string()),\n schema: lexiconRefUnionSchema,\n }),\n errors: l.optional(l.array(lexiconError)),\n})\n\n/\n TypeScript type for a Lexicon subscription method definition.\n \n Represents the structure of an XRPC subscription (WebSocket) method.\n \n @see {@link lexiconSubscriptionSchema} for the schema definition\n /\nexport type LexiconSubscription = l.Infer<typeof lexiconSubscriptionSchema>\n\n// Permissions\n\n/\n Schema for validating language codes in Lexicon permission definitions.\n /\nexport const lexiconLanguageSchema = l.string({ format: 'language' })\n\n/\n TypeScript type for a BCP 47 language code string.\n \n @see {@link lexiconLanguageSchema} for the schema definition\n /\nexport type LexiconLanguage = l.Infer<typeof lexiconLanguageSchema>\n\n/\n Schema for validating language-keyed string dictionaries.\n * Used for localized text in permission definitions.\n /\nexport const lexiconLanguageDict = l.dict(lexiconLanguageSchema, l.string())\n\n/\n TypeScript type for a language-keyed dictionary of localized strings.\n \n @see {@link lexiconLanguageDict} for the schema definition\n /\nexport type LexiconLanguageDict = l.Infer<typeof lexiconLanguageDict>\n\n/\n Schema for validating individual Lexicon permission definitions.\n /\nexport const lexiconPermissionSchema = l.intersection(\n l.object({\n type: l.literal('permission'),\n resource: l.string({ minLength: 1 }),\n }),\n l.dict(l.string(), l.paramSchema),\n)\n\n/\n TypeScript type for a Lexicon permission definition.\n \n Represents a single permission with a resource identifier\n * and optional additional parameters.\n \n @see {@link lexiconPermissionSchema} for the schema definition\n /\nexport type LexiconPermission = l.Infer<typeof lexiconPermissionSchema>\n\n/\n Schema for validating Lexicon permission set definitions.\n /\nexport const lexiconPermissionSetSchema = l.object({\n type: l.literal('permission-set'),\n permissions: l.array(lexiconPermissionSchema),\n title: l.optional(l.string()),\n 'title:lang': l.optional(lexiconLanguageDict),\n detail: l.optional(l.string()),\n 'detail:lang': l.optional(lexiconLanguageDict),\n description: l.optional(l.string()),\n})\n\n/\n TypeScript type for a Lexicon permission set definition.\n \n Represents a collection of permissions with optional\n * localized title and detail text.\n \n @see {@link lexiconPermissionSetSchema} for the schema definition\n /\nexport type LexiconPermissionSet = l.Infer<typeof lexiconPermissionSetSchema>\n\nconst NAMED_LEXICON_SCHEMAS = [\n ...CONCRETE_TYPES,\n lexiconArraySchema,\n lexiconObjectSchema,\n lexiconTokenSchema,\n] as const\n\n/\n TypeScript type for any named Lexicon definition.\n \n Union of all definition types that can appear in the defs section\n * of a Lexicon document (excluding main-only types).\n /\nexport type NamedLexiconDefinition = l.Infer<\n (typeof NAMED_LEXICON_SCHEMAS)[number]\n>\n\nconst MAIN_LEXICON_SCHEMAS = [\n lexiconPermissionSetSchema,\n lexiconProcedureSchema,\n lexiconQuerySchema,\n lexiconRecordSchema,\n lexiconSubscriptionSchema,\n ...NAMED_LEXICON_SCHEMAS,\n] as const\n\n/\n TypeScript type for main Lexicon definitions.\n \n Union of all definition types that can appear as the \"main\" entry\n * in a Lexicon document's defs section.\n /\nexport type MainLexiconDefinition = l.Infer<\n (typeof MAIN_LEXICON_SCHEMAS)[number]\n>\n\n/\n Schema for validating Lexicon document identifiers (NSIDs).\n \n Validates that the identifier follows the Namespaced Identifier format\n * (e.g., \"com.atproto.repo.createRecord\").\n /\nexport const lexiconIdentifierSchema = l.string({ format: 'nsid' })\n\n/\n TypeScript type for a Lexicon document identifier.\n \n A Namespaced Identifier (NSID) string in reverse-domain format.\n \n @see {@link lexiconIdentifierSchema} for the schema definition\n /\nexport type LexiconIdentifier = l.Infer<typeof lexiconIdentifierSchema>\n\n/\n Schema for validating complete Lexicon document structures.\n \n Validates the top-level structure of a Lexicon document, including:\n * - `lexicon`: Must be 1 (the current Lexicon version)\n * - `id`: The document's NSID\n * - `revision`: Optional version number\n * - `description`: Optional document description\n * - `defs`: Map of definition names to their schemas\n \n The \"main\" definition (if present) can be any main-only type,\n * while other definitions are limited to named types.\n \n @example\n * ```ts\n * const result = lexiconDocumentSchema.parse({\n * lexicon: 1,\n * id: 'com.example.getProfile',\n * defs: {\n * main: {\n * type: 'query',\n * output: {\n * encoding: 'application/json',\n * schema: { type: 'ref', ref: '#profile' }\n * }\n * },\n * profile: {\n * type: 'object',\n * properties: {\n * name: { type: 'string' }\n * }\n * }\n * }\n * })\n * ```\n /\nexport const lexiconDocumentSchema = l.object({\n lexicon: l.literal(1),\n id: lexiconIdentifierSchema,\n revision: l.optional(l.integer()),\n description: l.optional(l.string()),\n defs: l.intersection(\n l.object({\n main: l.optional(l.discriminatedUnion('type', MAIN_LEXICON_SCHEMAS)),\n }),\n l.dict(\n l.string({ minLength: 1 }),\n l.discriminatedUnion('type', NAMED_LEXICON_SCHEMAS),\n ),\n ),\n})\n\n/\n TypeScript type for a complete Lexicon document.\n \n Represents the full structure of a Lexicon JSON document,\n * including the version, identifier, and all type definitions.\n \n @see {@link lexiconDocumentSchema} for the schema definition\n */\nexport type LexiconDocument = l.Infer<typeof lexiconDocumentSchema>\n"]}

package/dist/lexicon-indexer.js CHANGED Viewed

@@ -1,3 +1,2 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
+export {};
 //# sourceMappingURL=lexicon-indexer.js.map

package/dist/lexicon-iterable-indexer.js CHANGED Viewed

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LexiconIterableIndexer = void 0;
 /**
  * Lazily indexes Lexicon documents from an iterable source.
  *
@@ -31,8 +28,7 @@ exports.LexiconIterableIndexer = void 0;
  * const schemas = await LexiconSchemaBuilder.buildAll(indexer)
  * ```
  */
-class LexiconIterableIndexer {
-    source;
+export class LexiconIterableIndexer {
     #lexicons = new Map();
     #iterator;
     /**
@@ -114,5 +110,4 @@ class LexiconIterableIndexer {
         await this.#iterator.return?.();
     }
 }
-exports.LexiconIterableIndexer = LexiconIterableIndexer;
 //# sourceMappingURL=lexicon-iterable-indexer.js.map

package/dist/lexicon-iterable-indexer.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"lexicon-iterable-indexer.js","sourceRoot":"","sources":["../src/lexicon-iterable-indexer.ts"],"names":[],"mappings":"~~;;;~~AAGA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,~~MAAa~~,sBAAsB;~~IAsBtB;IArBF~~,SAAS,GAAiC,IAAI,GAAG,EAAE,CAAA;IACnD,SAAS,CAE0B;IAE5C;;;;;;;;;;;;;;OAcG;IACH,YACW,MAAkE;QAAlE,WAAM,GAAN,MAAM,CAA4D;QAE3E,IAAI,CAAC,SAAS;YACZ,MAAM,CAAC,aAAa,IAAI,MAAM;gBAC5B,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE;gBAChC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IACjC,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACrC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAA;QAEzB,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,GAAG,CAAC,EAAE,KAAK,EAAE;gBAAE,OAAO,GAAG,CAAA;QAC/B,CAAC;QAED,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,YAAY,CAAC,EAAE;YACxD,IAAI,EAAE,QAAQ;SACf,CAAC,CAAA;IACJ,CAAC;IAED,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC;QAK3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;QAElC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACpB,MAAM,GAAG,CAAA;QACX,CAAC;QAED,GAAG,CAAC;YACF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAA;YAEnD,IAAI,IAAI;gBAAE,MAAK;YAEf,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,kCAAkC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnE,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAA;gBACjC,MAAM,GAAG,CAAA,CAAC,0DAA0D;YACtE,CAAC;YAED,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YACnC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;YACtB,MAAM,KAAK,CAAA;QACb,CAAC,QAAQ,IAAI,EAAC;QAEd,0EAA0E;QAC1E,yEAAyE;QACzE,4EAA4E;QAC5E,2EAA2E;QAC3E,4EAA4E;QAC5E,uEAAuE;QACvE,2CAA2C;QAE3C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACpB,MAAM,GAAG,CAAA;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC;QACzB,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAA;IACjC,CAAC;CACF~~;AAlGD,wDAkGC~~","sourcesContent":["import { LexiconDocument } from './lexicon-document.js'\nimport { LexiconIndexer } from './lexicon-indexer.js'\n\n/*\n Lazily indexes Lexicon documents from an iterable source.\n \n This class implements `LexiconIndexer` by consuming documents from an\n * iterable (sync or async) and caching them for efficient retrieval.\n * Documents are indexed on-demand as they are requested or iterated over.\n \n @example\n * ```ts\n * // From an array of documents\n * const docs = [lexiconDoc1, lexiconDoc2, lexiconDoc3]\n * const indexer = new LexiconIterableIndexer(docs)\n \n // Documents are indexed lazily as requested\n * const doc = await indexer.get('com.example.post')\n * ```\n \n @example\n * ```ts\n * // From an async generator (e.g., reading from files)\n * async function* loadLexicons() {\n * for (const file of lexiconFiles) {\n * yield JSON.parse(await fs.readFile(file, 'utf8'))\n * }\n * }\n \n await using indexer = new LexiconIterableIndexer(loadLexicons())\n * const schemas = await LexiconSchemaBuilder.buildAll(indexer)\n * ```\n /\nexport class LexiconIterableIndexer implements LexiconIndexer, AsyncDisposable {\n readonly #lexicons: Map<string, LexiconDocument> = new Map()\n readonly #iterator:\n \| AsyncIterator<LexiconDocument, void, unknown>\n \| Iterator<LexiconDocument, void, unknown>\n\n /\n Creates a new {@link LexiconIterableIndexer} from an iterable source.\n \n @param source - An iterable or async iterable of Lexicon documents.\n * The iterator is consumed lazily as documents are requested.\n \n @example\n * ```ts\n * // Sync iterable (array, Set, Map.values(), etc.)\n * const indexer = new LexiconIterableIndexer(lexiconDocuments)\n \n // Async iterable (async generator, ReadableStream, etc.)\n * const indexer = new LexiconIterableIndexer(asyncLexiconStream)\n * ```\n /\n constructor(\n readonly source: AsyncIterable<LexiconDocument> \| Iterable<LexiconDocument>,\n ) {\n this.#iterator =\n Symbol.asyncIterator in source\n ? source[Symbol.asyncIterator]()\n : source[Symbol.iterator]()\n }\n\n /\n Retrieves a Lexicon document by its NSID.\n \n If the document has already been indexed, it is returned from cache.\n * Otherwise, the source iterator is consumed until the document is found.\n \n @see {@link LexiconIndexer.get}\n /\n async get(id: string): Promise<LexiconDocument> {\n const cached = this.#lexicons.get(id)\n if (cached) return cached\n\n for await (const doc of this) {\n if (doc.id === id) return doc\n }\n\n throw Object.assign(new Error(`Lexicon ${id} not found`), {\n code: 'ENOENT',\n })\n }\n\n async [Symbol.asyncIterator](): AsyncIterator<\n LexiconDocument,\n void,\n undefined\n > {\n const returned = new Set<string>()\n\n for (const doc of this.#lexicons.values()) {\n returned.add(doc.id)\n yield doc\n }\n\n do {\n const { value, done } = await this.#iterator.next()\n\n if (done) break\n\n if (returned.has(value.id)) {\n const err = new Error(`Duplicate lexicon document id: ${value.id}`)\n await this.#iterator.throw?.(err)\n throw err // In case iterator.throw does not exist or does not throw\n }\n\n this.#lexicons.set(value.id, value)\n returned.add(value.id)\n yield value\n } while (true)\n\n // At this point, the underlying iterator is done. However, there may have\n // been requests (.get()) for documents that caused the iterator to yield\n // those documents during concurrent execution of this loop. If that was the\n // case, new documents may have been added to `#lexicons` that have not yet\n // been yielded. We need to yield those as well. Since we yield control back\n // to the caller, we need to repeat this process until no new documents\n // appear sunce we don't know what happens.\n\n for (const doc of this.#lexicons.values()) {\n if (!returned.has(doc.id)) {\n returned.add(doc.id)\n yield doc\n }\n }\n }\n\n async [Symbol.asyncDispose](): Promise<void> {\n await this.#iterator.return?.()\n }\n}\n"]}
1	+ {"version":3,"file":"lexicon-iterable-indexer.js","sourceRoot":"","sources":["../src/lexicon-iterable-indexer.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,OAAO,sBAAsB;IACxB,SAAS,GAAiC,IAAI,GAAG,EAAE,CAAA;IACnD,SAAS,CAE0B;IAE5C;;;;;;;;;;;;;;OAcG;IACH,YACW,MAAkE;QAAlE,WAAM,GAAN,MAAM,CAA4D;QAE3E,IAAI,CAAC,SAAS;YACZ,MAAM,CAAC,aAAa,IAAI,MAAM;gBAC5B,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE;gBAChC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IACjC,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACrC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAA;QAEzB,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,GAAG,CAAC,EAAE,KAAK,EAAE;gBAAE,OAAO,GAAG,CAAA;QAC/B,CAAC;QAED,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,YAAY,CAAC,EAAE;YACxD,IAAI,EAAE,QAAQ;SACf,CAAC,CAAA;IACJ,CAAC;IAED,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC;QAK3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;QAElC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACpB,MAAM,GAAG,CAAA;QACX,CAAC;QAED,GAAG,CAAC;YACF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAA;YAEnD,IAAI,IAAI;gBAAE,MAAK;YAEf,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,kCAAkC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnE,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAA;gBACjC,MAAM,GAAG,CAAA,CAAC,0DAA0D;YACtE,CAAC;YAED,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YACnC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;YACtB,MAAM,KAAK,CAAA;QACb,CAAC,QAAQ,IAAI,EAAC;QAEd,0EAA0E;QAC1E,yEAAyE;QACzE,4EAA4E;QAC5E,2EAA2E;QAC3E,4EAA4E;QAC5E,uEAAuE;QACvE,2CAA2C;QAE3C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACpB,MAAM,GAAG,CAAA;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC;QACzB,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAA;IACjC,CAAC;CACF","sourcesContent":["import { LexiconDocument } from './lexicon-document.js'\nimport { LexiconIndexer } from './lexicon-indexer.js'\n\n/*\n Lazily indexes Lexicon documents from an iterable source.\n \n This class implements `LexiconIndexer` by consuming documents from an\n * iterable (sync or async) and caching them for efficient retrieval.\n * Documents are indexed on-demand as they are requested or iterated over.\n \n @example\n * ```ts\n * // From an array of documents\n * const docs = [lexiconDoc1, lexiconDoc2, lexiconDoc3]\n * const indexer = new LexiconIterableIndexer(docs)\n \n // Documents are indexed lazily as requested\n * const doc = await indexer.get('com.example.post')\n * ```\n \n @example\n * ```ts\n * // From an async generator (e.g., reading from files)\n * async function* loadLexicons() {\n * for (const file of lexiconFiles) {\n * yield JSON.parse(await fs.readFile(file, 'utf8'))\n * }\n * }\n \n await using indexer = new LexiconIterableIndexer(loadLexicons())\n * const schemas = await LexiconSchemaBuilder.buildAll(indexer)\n * ```\n /\nexport class LexiconIterableIndexer implements LexiconIndexer, AsyncDisposable {\n readonly #lexicons: Map<string, LexiconDocument> = new Map()\n readonly #iterator:\n \| AsyncIterator<LexiconDocument, void, unknown>\n \| Iterator<LexiconDocument, void, unknown>\n\n /\n Creates a new {@link LexiconIterableIndexer} from an iterable source.\n \n @param source - An iterable or async iterable of Lexicon documents.\n * The iterator is consumed lazily as documents are requested.\n \n @example\n * ```ts\n * // Sync iterable (array, Set, Map.values(), etc.)\n * const indexer = new LexiconIterableIndexer(lexiconDocuments)\n \n // Async iterable (async generator, ReadableStream, etc.)\n * const indexer = new LexiconIterableIndexer(asyncLexiconStream)\n * ```\n /\n constructor(\n readonly source: AsyncIterable<LexiconDocument> \| Iterable<LexiconDocument>,\n ) {\n this.#iterator =\n Symbol.asyncIterator in source\n ? source[Symbol.asyncIterator]()\n : source[Symbol.iterator]()\n }\n\n /\n Retrieves a Lexicon document by its NSID.\n \n If the document has already been indexed, it is returned from cache.\n * Otherwise, the source iterator is consumed until the document is found.\n \n @see {@link LexiconIndexer.get}\n /\n async get(id: string): Promise<LexiconDocument> {\n const cached = this.#lexicons.get(id)\n if (cached) return cached\n\n for await (const doc of this) {\n if (doc.id === id) return doc\n }\n\n throw Object.assign(new Error(`Lexicon ${id} not found`), {\n code: 'ENOENT',\n })\n }\n\n async [Symbol.asyncIterator](): AsyncIterator<\n LexiconDocument,\n void,\n undefined\n > {\n const returned = new Set<string>()\n\n for (const doc of this.#lexicons.values()) {\n returned.add(doc.id)\n yield doc\n }\n\n do {\n const { value, done } = await this.#iterator.next()\n\n if (done) break\n\n if (returned.has(value.id)) {\n const err = new Error(`Duplicate lexicon document id: ${value.id}`)\n await this.#iterator.throw?.(err)\n throw err // In case iterator.throw does not exist or does not throw\n }\n\n this.#lexicons.set(value.id, value)\n returned.add(value.id)\n yield value\n } while (true)\n\n // At this point, the underlying iterator is done. However, there may have\n // been requests (.get()) for documents that caused the iterator to yield\n // those documents during concurrent execution of this loop. If that was the\n // case, new documents may have been added to `#lexicons` that have not yet\n // been yielded. We need to yield those as well. Since we yield control back\n // to the caller, we need to repeat this process until no new documents\n // appear sunce we don't know what happens.\n\n for (const doc of this.#lexicons.values()) {\n if (!returned.has(doc.id)) {\n returned.add(doc.id)\n yield doc\n }\n }\n }\n\n async [Symbol.asyncDispose](): Promise<void> {\n await this.#iterator.return?.()\n }\n}\n"]}

package/dist/lexicon-schema-builder.js CHANGED Viewed

@@ -1,8 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LexiconSchemaBuilder = void 0;
-exports.memoize = memoize;
-const lex_schema_1 = require("@atproto/lex-schema");
+import { l } from '@atproto/lex-schema';
 /**
  * Builds validators for Lexicon documents.
  *
@@ -38,8 +34,7 @@ const lex_schema_1 = require("@atproto/lex-schema");
  * }
  * ```
  */
-class LexiconSchemaBuilder {
-    indexer;
+export class LexiconSchemaBuilder {
     /**
      * Builds a validator for a single Lexicon definition reference.
      *
@@ -62,7 +57,7 @@ class LexiconSchemaBuilder {
         const ctx = new LexiconSchemaBuilder(indexer);
         try {
             const result = await ctx.buildFullRef(fullRef);
-            if (!(result instanceof lex_schema_1.l.Schema)) {
+            if (!(result instanceof l.Schema)) {
                 throw new Error(`Ref ${fullRef} is not a schema type`);
             }
             return result;
@@ -116,7 +111,7 @@ class LexiconSchemaBuilder {
             await builder.done();
         }
     }
-    #asyncTasks = new AsyncTasks();
+    #asyncTasks;
     /**
      * Creates a new LexiconSchemaBuilder instance.
      *
@@ -127,6 +122,21 @@ class LexiconSchemaBuilder {
      */
     constructor(indexer) {
         this.indexer = indexer;
+        this.#asyncTasks = new AsyncTasks();
+        /**
+         * Builds a validator for a full reference (memoized).
+         *
+         * Results are cached, so calling with the same reference returns
+         * the same promise/result.
+         *
+         * @param fullRef - The full reference in format "nsid#defName"
+         * @returns A promise resolving to the built schema or method definition
+         */
+        this.buildFullRef = memoize(async (fullRef) => {
+            const { nsid, hash } = parseRef(fullRef);
+            const doc = await this.indexer.get(nsid);
+            return this.compileDef(doc, hash);
+        });
     }
     /**
      * Waits for all pending reference resolution tasks to complete.
@@ -144,24 +154,10 @@ class LexiconSchemaBuilder {
     async [Symbol.asyncDispose]() {
         await this.done();
     }
-    /**
-     * Builds a validator for a full reference (memoized).
-     *
-     * Results are cached, so calling with the same reference returns
-     * the same promise/result.
-     *
-     * @param fullRef - The full reference in format "nsid#defName"
-     * @returns A promise resolving to the built schema or method definition
-     */
-    buildFullRef = memoize(async (fullRef) => {
-        const { nsid, hash } = parseRef(fullRef);
-        const doc = await this.indexer.get(nsid);
-        return this.compileDef(doc, hash);
-    });
     buildRefGetter(fullRef) {
         let schema;
         this.#asyncTasks.add(this.buildFullRef(fullRef).then((v) => {
-            if (!(v instanceof lex_schema_1.l.Schema)) {
+            if (!(v instanceof l.Schema)) {
                 throw new Error(`Only refs to schema types are allowed`);
             }
             schema = v;
@@ -175,7 +171,7 @@ class LexiconSchemaBuilder {
     buildTypedRefGetter(fullRef) {
         let validator;
         this.#asyncTasks.add(this.buildFullRef(fullRef).then((v) => {
-            if (v instanceof lex_schema_1.l.TypedObjectSchema || v instanceof lex_schema_1.l.RecordSchema) {
+            if (v instanceof l.TypedObjectSchema || v instanceof l.RecordSchema) {
                 validator = v;
             }
             else {
@@ -195,19 +191,19 @@ class LexiconSchemaBuilder {
         }
         switch (def.type) {
             case 'permission-set':
-                return lex_schema_1.l.permissionSet(doc.id, def.permissions.map(({ resource, type, ...p }) => lex_schema_1.l.permission(resource, p)), def);
+                return l.permissionSet(doc.id, def.permissions.map(({ resource, type, ...p }) => l.permission(resource, p)), def);
             case 'procedure':
-                return lex_schema_1.l.procedure(doc.id, this.compileParams(doc, def.parameters), this.compilePayload(doc, def.input), this.compilePayload(doc, def.output), this.compileErrors(doc, def.errors));
+                return l.procedure(doc.id, this.compileParams(doc, def.parameters), this.compilePayload(doc, def.input), this.compilePayload(doc, def.output), this.compileErrors(doc, def.errors));
             case 'query':
-                return lex_schema_1.l.query(doc.id, this.compileParams(doc, def.parameters), this.compilePayload(doc, def.output), this.compileErrors(doc, def.errors));
+                return l.query(doc.id, this.compileParams(doc, def.parameters), this.compilePayload(doc, def.output), this.compileErrors(doc, def.errors));
             case 'subscription':
-                return lex_schema_1.l.subscription(doc.id, this.compileParams(doc, def.parameters), this.compilePayloadSchema(doc, def.message.schema), this.compileErrors(doc, def.errors));
+                return l.subscription(doc.id, this.compileParams(doc, def.parameters), this.compilePayloadSchema(doc, def.message.schema), this.compileErrors(doc, def.errors));
             case 'token':
-                return lex_schema_1.l.token(doc.id, hash);
+                return l.token(doc.id, hash);
             case 'record':
-                return lex_schema_1.l.record(def.key, doc.id, this.compileObject(doc, def.record));
+                return l.record(def.key, doc.id, this.compileObject(doc, def.record));
             case 'object':
-                return lex_schema_1.l.typedObject(doc.id, hash, this.compileObject(doc, def));
+                return l.typedObject(doc.id, hash, this.compileObject(doc, def));
             default:
                 return this.compileLeaf(doc, def);
         }
@@ -218,11 +214,11 @@ class LexiconSchemaBuilder {
             def.enum != null &&
             def.const !== undefined &&
             !def.enum.includes(def.const)) {
-            return lex_schema_1.l.never();
+            return l.never();
         }
         switch (def.type) {
             case 'string': {
-                const schema = lex_schema_1.l.string(def);
+                const schema = l.string(def);
                 if (def.default != null)
                     schema.check(def.default);
                 if (def.const != null)
@@ -231,14 +227,14 @@ class LexiconSchemaBuilder {
                     for (const v of def.enum)
                         schema.check(v);
                 const result = def.const != null
-                    ? lex_schema_1.l.literal(def.const)
+                    ? l.literal(def.const)
                     : def.enum != null
-                        ? lex_schema_1.l.enum(def.enum)
+                        ? l.enum(def.enum)
                         : schema;
-                return def.default != null ? lex_schema_1.l.withDefault(result, def.default) : result;
+                return def.default != null ? l.withDefault(result, def.default) : result;
             }
             case 'integer': {
-                const schema = lex_schema_1.l.integer(def);
+                const schema = l.integer(def);
                 if (def.default != null)
                     schema.check(def.default);
                 if (def.const != null)
@@ -247,26 +243,26 @@ class LexiconSchemaBuilder {
                     for (const v of def.enum)
                         schema.check(v);
                 const result = def.const != null
-                    ? lex_schema_1.l.literal(def.const)
+                    ? l.literal(def.const)
                     : def.enum != null
-                        ? lex_schema_1.l.enum(def.enum)
+                        ? l.enum(def.enum)
                         : schema;
-                return def.default != null ? lex_schema_1.l.withDefault(result, def.default) : result;
+                return def.default != null ? l.withDefault(result, def.default) : result;
             }
             case 'boolean': {
-                const result = def.const != null ? lex_schema_1.l.literal(def.const) : lex_schema_1.l.boolean();
-                return def.default != null ? lex_schema_1.l.withDefault(result, def.default) : result;
+                const result = def.const != null ? l.literal(def.const) : l.boolean();
+                return def.default != null ? l.withDefault(result, def.default) : result;
             }
             case 'blob':
-                return lex_schema_1.l.blob(def);
+                return l.blob(def);
             case 'cid-link':
-                return lex_schema_1.l.cid();
+                return l.cid();
             case 'bytes':
-                return lex_schema_1.l.bytes(def);
+                return l.bytes(def);
             case 'unknown':
-                return lex_schema_1.l.lexMap();
+                return l.lexMap();
             case 'array':
-                return lex_schema_1.l.array(this.compileLeaf(doc, def.items), def);
+                return l.array(this.compileLeaf(doc, def.items), def);
             default:
                 return this.compileRef(doc, def);
         }
@@ -274,9 +270,9 @@ class LexiconSchemaBuilder {
     compileRef(doc, def) {
         switch (def.type) {
             case 'ref':
-                return lex_schema_1.l.ref(this.buildRefGetter(buildFullRef(doc, def.ref)));
+                return l.ref(this.buildRefGetter(buildFullRef(doc, def.ref)));
             case 'union':
-                return lex_schema_1.l.typedUnion(def.refs.map((r) => lex_schema_1.l.typedRef(this.buildTypedRefGetter(buildFullRef(doc, r)))), def.closed ?? false);
+                return l.typedUnion(def.refs.map((r) => l.typedRef(this.buildTypedRefGetter(buildFullRef(doc, r)))), def.closed ?? false);
             default:
                 // @ts-expect-error
                 throw new Error(`Unknown lexicon type: ${def.type}`);
@@ -291,17 +287,17 @@ class LexiconSchemaBuilder {
             const isRequired = def.required?.includes(key);
             let schema = this.compileLeaf(doc, propDef);
             if (isNullable) {
-                schema = lex_schema_1.l.nullable(schema);
+                schema = l.nullable(schema);
             }
             if (!isRequired) {
-                schema = lex_schema_1.l.optional(schema);
+                schema = l.optional(schema);
             }
             props[key] = schema;
         }
-        return lex_schema_1.l.object(props);
+        return l.object(props);
     }
     compilePayload(doc, def) {
-        return lex_schema_1.l.payload(def?.encoding, def?.schema ? this.compilePayloadSchema(doc, def.schema) : undefined);
+        return l.payload(def?.encoding, def?.schema ? this.compilePayloadSchema(doc, def.schema) : undefined);
     }
     compileErrors(_doc, errors) {
         return errors?.map((e) => e.name);
@@ -316,19 +312,18 @@ class LexiconSchemaBuilder {
     }
     compileParams(doc, def) {
         if (!def)
-            return lex_schema_1.l.params();
+            return l.params();
         const shape = {};
         for (const [paramName, paramDef] of Object.entries(def.properties)) {
             if (paramDef === undefined)
                 continue;
             const isRequired = def.required?.includes(paramName);
             const propSchema = this.compileLeaf(doc, paramDef);
-            shape[paramName] = isRequired ? propSchema : lex_schema_1.l.optional(propSchema);
+            shape[paramName] = isRequired ? propSchema : l.optional(propSchema);
         }
-        return lex_schema_1.l.params(shape);
+        return l.params(shape);
     }
 }
-exports.LexiconSchemaBuilder = LexiconSchemaBuilder;
 class AsyncTasks {
     /**
      * A set that, eventually, contains only rejected promises.
@@ -369,7 +364,7 @@ function buildFullRef(from, ref) {
         return `${from.id}${ref}`;
     return ref;
 }
-function memoize(fn) {
+export function memoize(fn) {
     const cache = new Map();
     return ((arg) => {
         if (cache.has(arg))

package/dist/lexicon-schema-builder.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"lexicon-schema-builder.js","sourceRoot":"","sources":["../src/lexicon-schema-builder.ts"],"names":[],"mappings":";;;AAieA,0BAQC;AAxeD,oDAAuC;AAcvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAa,oBAAoB;IAiGT;IAhGtB;;;;;;;;;;;;;;;;;OAiBG;IACH,MAAM,CAAC,KAAK,CAAC,KAAK,CAChB,OAAuB,EACvB,OAAe;QAEf,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAA;QAC7C,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;YAC9C,IAAI,CAAC,CAAC,MAAM,YAAY,cAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,MAAM,IAAI,KAAK,CAAC,OAAO,OAAO,uBAAuB,CAAC,CAAA;YACxD,CAAC;YACD,OAAO,MAAM,CAAA;QACf,CAAC;gBAAS,CAAC;YACT,MAAM,GAAG,CAAC,IAAI,EAAE,CAAA;QAClB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAuB;QAC3C,MAAM,OAAO,GAAG,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAA;QACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAOpB,CAAA;QACH,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAA;QACzE,CAAC;QACD,IAAI,CAAC;YACH,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAChC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzC,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,EAAE,IAAI,IAAI,EAAE,CAAA;oBACnC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;oBAClD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;gBAC9B,CAAC;YACH,CAAC;YACD,OAAO,OAAO,CAAA;QAChB,CAAC;gBAAS,CAAC;YACT,MAAM,OAAO,CAAC,IAAI,EAAE,CAAA;QACtB,CAAC;IACH,CAAC;IAED,WAAW,GAAG,IAAI,UAAU,EAAE,CAAA;IAE9B;;;;;;;OAOG;IACH,YAAsB,OAAuB;QAAvB,YAAO,GAAP,OAAO,CAAgB;IAAG,CAAC;IAEjD;;;;;;;;;OASG;IACH,KAAK,CAAC,IAAI;QACR,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAA;IAC/B,CAAC;IAED,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC;QACzB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAA;IACnB,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,GAAG,OAAO,CAAC,KAAK,EAAE,OAAe,EAAE,EAAE;QAC/C,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAExC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAExC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;IACnC,CAAC,CAAC,CAAA;IAEQ,cAAc,CAAC,OAAe;QACtC,IAAI,MAA0B,CAAA;QAE9B,IAAI,CAAC,WAAW,CAAC,GAAG,CAClB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,CAAC,CAAC,YAAY,cAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;YAC1D,CAAC;YACD,MAAM,GAAG,CAAC,CAAA;QACZ,CAAC,CAAC,CACH,CAAA;QAED,OAAO,GAAG,EAAE;YACV,IAAI,MAAM;gBAAE,OAAO,MAAM,CAAA;YACzB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAA;QACnE,CAAC,CAAA;IACH,CAAC;IAES,mBAAmB,CAC3B,OAAe;QAEf,IAAI,SAA+C,CAAA;QAEnD,IAAI,CAAC,WAAW,CAAC,GAAG,CAClB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,YAAY,cAAC,CAAC,iBAAiB,IAAI,CAAC,YAAY,cAAC,CAAC,YAAY,EAAE,CAAC;gBACpE,SAAS,GAAG,CAAC,CAAA;YACf,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CACb,yDAAyD,CAC1D,CAAA;YACH,CAAC;QACH,CAAC,CAAC,CACH,CAAA;QAED,OAAO,GAAG,EAAE;YACV,IAAI,SAAS;gBAAE,OAAO,SAAS,CAAA;YAC/B,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAA;QACnE,CAAC,CAAA;IACH,CAAC;IAES,UAAU,CAAC,GAAoB,EAAE,IAAY;QACrD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACjE,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CACb,iCAAiC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,EAAE,CACtE,CAAA;QACH,CAAC;QACD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,gBAAgB;gBACnB,OAAO,cAAC,CAAC,aAAa,CACpB,GAAG,CAAC,EAAE,EACN,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,CAC/C,cAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,CAC1B,EACD,GAAG,CACJ,CAAA;YACH,KAAK,WAAW;gBACd,OAAO,cAAC,CAAC,SAAS,CAChB,GAAG,CAAC,EAAE,EACN,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,UAAU,CAAC,EACvC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,EACnC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,EACpC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CACpC,CAAA;YACH,KAAK,OAAO;gBACV,OAAO,cAAC,CAAC,KAAK,CACZ,GAAG,CAAC,EAAE,EACN,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,UAAU,CAAC,EACvC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,EACpC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CACpC,CAAA;YACH,KAAK,cAAc;gBACjB,OAAO,cAAC,CAAC,YAAY,CACnB,GAAG,CAAC,EAAE,EACN,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,UAAU,CAAC,EACvC,IAAI,CAAC,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,EAClD,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CACpC,CAAA;YACH,KAAK,OAAO;gBACV,OAAO,cAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;YAC9B,KAAK,QAAQ;gBACX,OAAO,cAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;YACvE,KAAK,QAAQ;gBACX,OAAO,cAAC,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;YAClE;gBACE,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACrC,CAAC;IACH,CAAC;IAES,WAAW,CACnB,GAAoB,EACpB,GAAqC;QAErC,IACE,OAAO,IAAI,GAAG;YACd,MAAM,IAAI,GAAG;YACb,GAAG,CAAC,IAAI,IAAI,IAAI;YAChB,GAAG,CAAC,KAAK,KAAK,SAAS;YACvB,CAAE,GAAG,CAAC,IAA2B,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EACrD,CAAC;YACD,OAAO,cAAC,CAAC,KAAK,EAAE,CAAA;QAClB,CAAC;QAED,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,MAAM,GAAG,cAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAC5B,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBAClD,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAC9C,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI;oBAAE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAE/D,MAAM,MAAM,GACV,GAAG,CAAC,KAAK,IAAI,IAAI;oBACf,CAAC,CAAC,cAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBACtB,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI;wBAChB,CAAC,CAAC,cAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;wBAClB,CAAC,CAAC,MAAM,CAAA;gBAEd,OAAO,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,cAAC,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;YAC1E,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,MAAM,MAAM,GAAG,cAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;gBAC7B,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBAClD,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAC9C,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI;oBAAE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAE/D,MAAM,MAAM,GACV,GAAG,CAAC,KAAK,IAAI,IAAI;oBACf,CAAC,CAAC,cAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBACtB,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI;wBAChB,CAAC,CAAC,cAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;wBAClB,CAAC,CAAC,MAAM,CAAA;gBAEd,OAAO,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,cAAC,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;YAC1E,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,cAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAC,CAAC,OAAO,EAAE,CAAA;gBAErE,OAAO,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,cAAC,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;YAC1E,CAAC;YACD,KAAK,MAAM;gBACT,OAAO,cAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACpB,KAAK,UAAU;gBACb,OAAO,cAAC,CAAC,GAAG,EAAE,CAAA;YAChB,KAAK,OAAO;gBACV,OAAO,cAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACrB,KAAK,SAAS;gBACZ,OAAO,cAAC,CAAC,MAAM,EAAE,CAAA;YACnB,KAAK,OAAO;gBACV,OAAO,cAAC,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAA;YACvD;gBACE,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACpC,CAAC;IACH,CAAC;IAES,UAAU,CAClB,GAAoB,EACpB,GAAiC;QAEjC,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,KAAK;gBACR,OAAO,cAAC,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YAC/D,KAAK,OAAO;gBACV,OAAO,cAAC,CAAC,UAAU,CACjB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACjB,cAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAC3D,EACD,GAAG,CAAC,MAAM,IAAI,KAAK,CACpB,CAAA;YACH;gBACE,mBAAmB;gBACnB,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,CAAC,IAAI,EAAE,CAAC,CAAA;QACxD,CAAC;IACH,CAAC;IAES,aAAa,CAAC,GAAoB,EAAE,GAAkB;QAC9D,MAAM,KAAK,GAAmD,EAAE,CAAA;QAChE,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5D,IAAI,OAAO,KAAK,SAAS;gBAAE,SAAQ;YAEnC,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;YAC9C,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;YAE9C,IAAI,MAAM,GAAmC,IAAI,CAAC,WAAW,CAC3D,GAAG,EACH,OAAO,CACR,CAAA;YAED,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,GAAG,cAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YAC7B,CAAC;YAED,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,MAAM,GAAG,cAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YAC7B,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,CAAA;QACrB,CAAC;QACD,OAAO,cAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACxB,CAAC;IAES,cAAc,CACtB,GAAoB,EACpB,GAA+B;QAE/B,OAAO,cAAC,CAAC,OAAO,CACd,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CACrE,CAAA;IACH,CAAC;IAES,aAAa,CACrB,IAAqB,EACrB,MAAgC;QAEhC,OAAO,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IAES,oBAAoB,CAC5B,GAAoB,EACpB,GAAiD;QAEjD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;YACrC;gBACE,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACpC,CAAC;IACH,CAAC;IAES,aAAa,CAAC,GAAoB,EAAE,GAAuB;QACnE,IAAI,CAAC,GAAG;YAAE,OAAO,cAAC,CAAC,MAAM,EAAE,CAAA;QAE3B,MAAM,KAAK,GAAkB,EAAE,CAAA;QAC/B,KAAK,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACnE,IAAI,QAAQ,KAAK,SAAS;gBAAE,SAAQ;YAEpC,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAA;YAEpD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,QAAQ,CAMf,CAAA;YAElC,KAAK,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,cAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAA;QACrE,CAAC;QAED,OAAO,cAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACxB,CAAC;CACF;AAlYD,oDAkYC;AAED,MAAM,UAAU;IACd;;OAEG;IACH,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAA;IAEpC,KAAK,CAAC,IAAI;QACR,GAAG,CAAC;YACF,uEAAuE;YACvE,gBAAgB;YAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS;gBAAE,MAAM,CAAC,CAAA;YACvC,mEAAmE;YACnE,uEAAuE;YACvE,0CAA0C;QAC5C,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,EAAC;IACnC,CAAC;IAED,GAAG,CAAC,CAAgB;QAClB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;YAC3C,yCAAyC;YACzC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QAChC,CAAC,CAAC,CAAA;QAEF,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE;YAC1B,0DAA0D;QAC5D,CAAC,CAAC,CAAA;QAEF,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IAC7B,CAAC;CACF;AAED,SAAS,QAAQ,CAAC,OAAe;IAC/B,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACvD,IAAI,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAA;IACvE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;IAChE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;AACvB,CAAC;AAED,SAAS,YAAY,CAAC,IAAqB,EAAE,GAAW;IACtD,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,CAAA;IAClD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAgB,OAAO,CAAsC,EAAM;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAA;IAC/C,OAAO,CAAC,CAAC,GAAW,EAAE,EAAE;QACtB,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAA;QAC1C,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAmB,CAAA;QACxC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACtB,OAAO,MAAM,CAAA;IACf,CAAC,CAAO,CAAA;AACV,CAAC;AAED,SAAS,qBAAqB,CAC5B,GAAM;IAEN,OAAO,CACL,GAAG,IAAI,IAAI;QACX,OAAO,GAAG,KAAK,QAAQ;QACvB,MAAM,CAAC,aAAa,IAAI,GAAG;QAC3B,OAAO,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,CAChD,CAAA;AACH,CAAC","sourcesContent":["import { LexValue } from '@atproto/lex-data'\nimport { l } from '@atproto/lex-schema'\nimport {\n LexiconArray,\n LexiconArrayItems,\n LexiconDocument,\n LexiconError,\n LexiconObject,\n LexiconParameters,\n LexiconPayload,\n LexiconRef,\n LexiconRefUnion,\n} from './lexicon-document.js'\nimport { LexiconIndexer } from './lexicon-indexer.js'\n\n/*\n Builds validators for Lexicon documents.\n \n This class converts Lexicon type definitions into runtime validators\n * that can validate data against the schema. It handles reference resolution,\n * supporting both local (`#defName`) and cross-document (`nsid#defName`) refs.\n \n @example\n * ```ts\n * import { LexiconSchemaBuilder, LexiconIterableIndexer } from '@atproto/lex-document'\n \n // Build a single validator\n * const indexer = new LexiconIterableIndexer(lexiconDocs)\n * const validator = await LexiconSchemaBuilder.build(indexer, 'com.example.post#main')\n \n // Validate data\n * const result = validator.safeParse(myPostData)\n * if (result.success) {\n * console.log('Valid:', result.value)\n * } else {\n * console.log('Invalid:', result.error)\n * }\n * ```\n \n @example\n * ```ts\n * // Build all validators from an iterable indexer\n * const indexer = new LexiconIterableIndexer(lexiconDocs)\n * const allSchemas = await LexiconSchemaBuilder.buildAll(indexer)\n \n for (const [ref, schema] of allSchemas) {\n * console.log(`Built validator for ${ref}`)\n * }\n * ```\n /\nexport class LexiconSchemaBuilder implements AsyncDisposable {\n /\n Builds a validator for a single Lexicon definition reference.\n \n @param indexer - The Lexicon indexer to resolve documents from\n * @param fullRef - The full reference to build, in format \"nsid#defName\"\n * @returns A promise resolving to a validator for the referenced definition\n * @throws Error if the reference does not point to a schema type\n \n @example\n * ```ts\n * const validator = await LexiconSchemaBuilder.build(\n * indexer,\n * 'app.bsky.feed.post#main'\n * )\n \n validator.parse(postRecord) // Throws if invalid\n * ```\n /\n static async build(\n indexer: LexiconIndexer,\n fullRef: string,\n ): Promise<l.Schema<LexValue>> {\n const ctx = new LexiconSchemaBuilder(indexer)\n try {\n const result = await ctx.buildFullRef(fullRef)\n if (!(result instanceof l.Schema)) {\n throw new Error(`Ref ${fullRef} is not a schema type`)\n }\n return result\n } finally {\n await ctx.done()\n }\n }\n\n /\n Builds validators for all definitions in all documents from an iterable indexer.\n \n This method iterates over all Lexicon documents available in the indexer\n * and builds validators for every definition in each document.\n \n @param indexer - An iterable Lexicon indexer (must implement `Symbol.asyncIterator`)\n * @returns A promise resolving to a Map of full references to their validators.\n * The map values can be validators, Query, Subscription, Procedure, or PermissionSet.\n * @throws Error if the indexer does not support iteration\n \n @example\n * ```ts\n * const indexer = new LexiconIterableIndexer(allLexiconDocs)\n * const schemas = await LexiconSchemaBuilder.buildAll(indexer)\n \n // Access a specific schema\n * const postSchema = schemas.get('app.bsky.feed.post#main')\n \n // Iterate all schemas\n * for (const [ref, schema] of schemas) {\n * console.log(ref, schema)\n * }\n * ```\n /\n static async buildAll(indexer: LexiconIndexer) {\n const builder = new LexiconSchemaBuilder(indexer)\n const schemas = new Map<\n string,\n \| l.Schema<LexValue>\n \| l.Query\n \| l.Subscription\n \| l.Procedure\n \| l.PermissionSet\n >()\n if (!isAsyncIterableObject(indexer)) {\n throw new Error('An iterable indexer is required to build all schemas')\n }\n try {\n for await (const doc of indexer) {\n for (const hash of Object.keys(doc.defs)) {\n const fullRef = `${doc.id}#${hash}`\n const schema = await builder.buildFullRef(fullRef)\n schemas.set(fullRef, schema)\n }\n }\n return schemas\n } finally {\n await builder.done()\n }\n }\n\n #asyncTasks = new AsyncTasks()\n\n /\n Creates a new LexiconSchemaBuilder instance.\n \n Note: For most use cases, prefer using the static `build()` or `buildAll()`\n * methods instead of instantiating directly.\n \n @param indexer - The Lexicon indexer to resolve documents from\n /\n constructor(protected indexer: LexiconIndexer) {}\n\n /\n Waits for all pending reference resolution tasks to complete.\n \n When building schemas with cross-references, the builder schedules\n * async tasks to resolve those references. This method must be called\n * to ensure all references are fully resolved before using the validators.\n \n @returns A promise that resolves when all pending tasks are complete\n * @throws Rethrows any errors from failed reference resolution\n /\n async done(): Promise<void> {\n await this.#asyncTasks.done()\n }\n\n async [Symbol.asyncDispose]() {\n await this.done()\n }\n\n /\n Builds a validator for a full reference (memoized).\n \n Results are cached, so calling with the same reference returns\n * the same promise/result.\n \n @param fullRef - The full reference in format \"nsid#defName\"\n * @returns A promise resolving to the built schema or method definition\n /\n buildFullRef = memoize(async (fullRef: string) => {\n const { nsid, hash } = parseRef(fullRef)\n\n const doc = await this.indexer.get(nsid)\n\n return this.compileDef(doc, hash)\n })\n\n protected buildRefGetter(fullRef: string): () => l.Schema<LexValue> {\n let schema: l.Schema<LexValue>\n\n this.#asyncTasks.add(\n this.buildFullRef(fullRef).then((v) => {\n if (!(v instanceof l.Schema)) {\n throw new Error(`Only refs to schema types are allowed`)\n }\n schema = v\n }),\n )\n\n return () => {\n if (schema) return schema\n throw new Error('Validator not yet built. Did you await done()?')\n }\n }\n\n protected buildTypedRefGetter(\n fullRef: string,\n ): () => l.TypedObjectSchema \| l.RecordSchema {\n let validator: l.TypedObjectSchema \| l.RecordSchema\n\n this.#asyncTasks.add(\n this.buildFullRef(fullRef).then((v) => {\n if (v instanceof l.TypedObjectSchema \|\| v instanceof l.RecordSchema) {\n validator = v\n } else {\n throw new Error(\n 'Only refs to records and object definitions are allowed',\n )\n }\n }),\n )\n\n return () => {\n if (validator) return validator\n throw new Error('Validator not yet built. Did you await done()?')\n }\n }\n\n protected compileDef(doc: LexiconDocument, hash: string) {\n const def = Object.hasOwn(doc.defs, hash) ? doc.defs[hash] : null\n if (!def) {\n throw new Error(\n `No definition found for hash \"${JSON.stringify(hash)}\" in ${doc.id}`,\n )\n }\n switch (def.type) {\n case 'permission-set':\n return l.permissionSet(\n doc.id,\n def.permissions.map(({ resource, type, ...p }) =>\n l.permission(resource, p),\n ),\n def,\n )\n case 'procedure':\n return l.procedure(\n doc.id,\n this.compileParams(doc, def.parameters),\n this.compilePayload(doc, def.input),\n this.compilePayload(doc, def.output),\n this.compileErrors(doc, def.errors),\n )\n case 'query':\n return l.query(\n doc.id,\n this.compileParams(doc, def.parameters),\n this.compilePayload(doc, def.output),\n this.compileErrors(doc, def.errors),\n )\n case 'subscription':\n return l.subscription(\n doc.id,\n this.compileParams(doc, def.parameters),\n this.compilePayloadSchema(doc, def.message.schema),\n this.compileErrors(doc, def.errors),\n )\n case 'token':\n return l.token(doc.id, hash)\n case 'record':\n return l.record(def.key, doc.id, this.compileObject(doc, def.record))\n case 'object':\n return l.typedObject(doc.id, hash, this.compileObject(doc, def))\n default:\n return this.compileLeaf(doc, def)\n }\n }\n\n protected compileLeaf(\n doc: LexiconDocument,\n def: LexiconArray \| LexiconArrayItems,\n ): l.Schema<LexValue> {\n if (\n 'const' in def &&\n 'enum' in def &&\n def.enum != null &&\n def.const !== undefined &&\n !(def.enum as readonly unknown[]).includes(def.const)\n ) {\n return l.never()\n }\n\n switch (def.type) {\n case 'string': {\n const schema = l.string(def)\n if (def.default != null) schema.check(def.default)\n if (def.const != null) schema.check(def.const)\n if (def.enum != null) for (const v of def.enum) schema.check(v)\n\n const result =\n def.const != null\n ? l.literal(def.const)\n : def.enum != null\n ? l.enum(def.enum)\n : schema\n\n return def.default != null ? l.withDefault(result, def.default) : result\n }\n case 'integer': {\n const schema = l.integer(def)\n if (def.default != null) schema.check(def.default)\n if (def.const != null) schema.check(def.const)\n if (def.enum != null) for (const v of def.enum) schema.check(v)\n\n const result =\n def.const != null\n ? l.literal(def.const)\n : def.enum != null\n ? l.enum(def.enum)\n : schema\n\n return def.default != null ? l.withDefault(result, def.default) : result\n }\n case 'boolean': {\n const result = def.const != null ? l.literal(def.const) : l.boolean()\n\n return def.default != null ? l.withDefault(result, def.default) : result\n }\n case 'blob':\n return l.blob(def)\n case 'cid-link':\n return l.cid()\n case 'bytes':\n return l.bytes(def)\n case 'unknown':\n return l.lexMap()\n case 'array':\n return l.array(this.compileLeaf(doc, def.items), def)\n default:\n return this.compileRef(doc, def)\n }\n }\n\n protected compileRef(\n doc: LexiconDocument,\n def: LexiconRef \| LexiconRefUnion,\n ): l.Schema<LexValue> {\n switch (def.type) {\n case 'ref':\n return l.ref(this.buildRefGetter(buildFullRef(doc, def.ref)))\n case 'union':\n return l.typedUnion(\n def.refs.map((r) =>\n l.typedRef(this.buildTypedRefGetter(buildFullRef(doc, r))),\n ),\n def.closed ?? false,\n )\n default:\n // @ts-expect-error\n throw new Error(`Unknown lexicon type: ${def.type}`)\n }\n }\n\n protected compileObject(doc: LexiconDocument, def: LexiconObject) {\n const props: Record<string, l.Schema<undefined \| LexValue>> = {}\n for (const [key, propDef] of Object.entries(def.properties)) {\n if (propDef === undefined) continue\n\n const isNullable = def.nullable?.includes(key)\n const isRequired = def.required?.includes(key)\n\n let schema: l.Schema<undefined \| LexValue> = this.compileLeaf(\n doc,\n propDef,\n )\n\n if (isNullable) {\n schema = l.nullable(schema)\n }\n\n if (!isRequired) {\n schema = l.optional(schema)\n }\n\n props[key] = schema\n }\n return l.object(props)\n }\n\n protected compilePayload(\n doc: LexiconDocument,\n def: LexiconPayload \| undefined,\n ) {\n return l.payload(\n def?.encoding,\n def?.schema ? this.compilePayloadSchema(doc, def.schema) : undefined,\n )\n }\n\n protected compileErrors(\n _doc: LexiconDocument,\n errors?: readonly LexiconError[],\n ): undefined \| string[] {\n return errors?.map((e) => e.name)\n }\n\n protected compilePayloadSchema(\n doc: LexiconDocument,\n def: LexiconObject \| LexiconRef \| LexiconRefUnion,\n ): l.Schema<LexValue, LexValue> {\n switch (def.type) {\n case 'object':\n return this.compileObject(doc, def)\n default:\n return this.compileRef(doc, def)\n }\n }\n\n protected compileParams(doc: LexiconDocument, def?: LexiconParameters) {\n if (!def) return l.params()\n\n const shape: l.ParamsShape = {}\n for (const [paramName, paramDef] of Object.entries(def.properties)) {\n if (paramDef === undefined) continue\n\n const isRequired = def.required?.includes(paramName)\n\n const propSchema = this.compileLeaf(doc, paramDef) as\n \| l.StringSchema\n \| l.BooleanSchema\n \| l.IntegerSchema\n \| l.ArraySchema<l.StringSchema>\n \| l.ArraySchema<l.BooleanSchema>\n \| l.ArraySchema<l.IntegerSchema>\n\n shape[paramName] = isRequired ? propSchema : l.optional(propSchema)\n }\n\n return l.params(shape)\n }\n}\n\nclass AsyncTasks {\n /\n A set that, eventually, contains only rejected promises.\n */\n #promises = new Set<Promise<void>>()\n\n async done(): Promise<void> {\n do {\n // @NOTE this is going to throw on the first rejected promise (which is\n // what we want)\n for (const p of this.#promises) await p\n // At this point, all settled promises should have been removed. If\n // this.#promises is not empty, it means new promises were added during\n // the awaiting process, so we loop again.\n } while (this.#promises.size > 0)\n }\n\n add(p: Promise<void>) {\n const promise = Promise.resolve(p).then(() => {\n // No need to keep the promise any longer\n this.#promises.delete(promise)\n })\n\n void promise.catch((_err) => {\n // ignore errors here, they should be caught though done()\n })\n\n this.#promises.add(promise)\n }\n}\n\nfunction parseRef(fullRef: string) {\n const { length, 0: nsid, 1: hash } = fullRef.split('#')\n if (length !== 2) throw new Error('Uri can only have one hash segment')\n if (!nsid \|\| !hash) throw new Error('Invalid ref, missing hash')\n return { nsid, hash }\n}\n\nfunction buildFullRef(from: LexiconDocument, ref: string) {\n if (ref.startsWith('#')) return `${from.id}${ref}`\n return ref\n}\n\nexport function memoize<Fn extends (arg: string) => unknown>(fn: Fn): Fn {\n const cache = new Map<string, ReturnType<Fn>>()\n return ((arg: string) => {\n if (cache.has(arg)) return cache.get(arg)!\n const result = fn(arg) as ReturnType<Fn>\n cache.set(arg, result)\n return result\n }) as Fn\n}\n\nfunction isAsyncIterableObject<T>(\n obj: T,\n): obj is T & object & AsyncIterable<unknown> {\n return (\n obj != null &&\n typeof obj === 'object' &&\n Symbol.asyncIterator in obj &&\n typeof obj[Symbol.asyncIterator] === 'function'\n )\n}\n"]}
1	+ {"version":3,"file":"lexicon-schema-builder.js","sourceRoot":"","sources":["../src/lexicon-schema-builder.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,qBAAqB,CAAA;AAcvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,OAAO,oBAAoB;IAC/B;;;;;;;;;;;;;;;;;OAiBG;IACH,MAAM,CAAC,KAAK,CAAC,KAAK,CAChB,OAAuB,EACvB,OAAe;QAEf,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAA;QAC7C,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;YAC9C,IAAI,CAAC,CAAC,MAAM,YAAY,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,MAAM,IAAI,KAAK,CAAC,OAAO,OAAO,uBAAuB,CAAC,CAAA;YACxD,CAAC;YACD,OAAO,MAAM,CAAA;QACf,CAAC;gBAAS,CAAC;YACT,MAAM,GAAG,CAAC,IAAI,EAAE,CAAA;QAClB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAuB;QAC3C,MAAM,OAAO,GAAG,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAA;QACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAOpB,CAAA;QACH,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAA;QACzE,CAAC;QACD,IAAI,CAAC;YACH,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAChC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzC,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,EAAE,IAAI,IAAI,EAAE,CAAA;oBACnC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;oBAClD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;gBAC9B,CAAC;YACH,CAAC;YACD,OAAO,OAAO,CAAA;QAChB,CAAC;gBAAS,CAAC;YACT,MAAM,OAAO,CAAC,IAAI,EAAE,CAAA;QACtB,CAAC;IACH,CAAC;IAED,WAAW,CAAmB;IAE9B;;;;;;;OAOG;IACH,YAAsB,OAAuB;QAAvB,YAAO,GAAP,OAAO,CAAgB;QAV7C,gBAAW,GAAG,IAAI,UAAU,EAAE,CAAA;QA8B9B;;;;;;;;WAQG;QACH,iBAAY,GAAG,OAAO,CAAC,KAAK,EAAE,OAAe,EAAE,EAAE;YAC/C,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;YAExC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAExC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QACnC,CAAC,CAAC,CAAA;IAnC8C,CAAC;IAEjD;;;;;;;;;OASG;IACH,KAAK,CAAC,IAAI;QACR,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAA;IAC/B,CAAC;IAED,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC;QACzB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAA;IACnB,CAAC;IAmBS,cAAc,CAAC,OAAe;QACtC,IAAI,MAA0B,CAAA;QAE9B,IAAI,CAAC,WAAW,CAAC,GAAG,CAClB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;YAC1D,CAAC;YACD,MAAM,GAAG,CAAC,CAAA;QACZ,CAAC,CAAC,CACH,CAAA;QAED,OAAO,GAAG,EAAE;YACV,IAAI,MAAM;gBAAE,OAAO,MAAM,CAAA;YACzB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAA;QACnE,CAAC,CAAA;IACH,CAAC;IAES,mBAAmB,CAC3B,OAAe;QAEf,IAAI,SAA+C,CAAA;QAEnD,IAAI,CAAC,WAAW,CAAC,GAAG,CAClB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,YAAY,CAAC,CAAC,iBAAiB,IAAI,CAAC,YAAY,CAAC,CAAC,YAAY,EAAE,CAAC;gBACpE,SAAS,GAAG,CAAC,CAAA;YACf,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CACb,yDAAyD,CAC1D,CAAA;YACH,CAAC;QACH,CAAC,CAAC,CACH,CAAA;QAED,OAAO,GAAG,EAAE;YACV,IAAI,SAAS;gBAAE,OAAO,SAAS,CAAA;YAC/B,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAA;QACnE,CAAC,CAAA;IACH,CAAC;IAES,UAAU,CAAC,GAAoB,EAAE,IAAY;QACrD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACjE,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CACb,iCAAiC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,EAAE,CACtE,CAAA;QACH,CAAC;QACD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,gBAAgB;gBACnB,OAAO,CAAC,CAAC,aAAa,CACpB,GAAG,CAAC,EAAE,EACN,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,CAC/C,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,CAC1B,EACD,GAAG,CACJ,CAAA;YACH,KAAK,WAAW;gBACd,OAAO,CAAC,CAAC,SAAS,CAChB,GAAG,CAAC,EAAE,EACN,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,UAAU,CAAC,EACvC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,EACnC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,EACpC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CACpC,CAAA;YACH,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC,KAAK,CACZ,GAAG,CAAC,EAAE,EACN,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,UAAU,CAAC,EACvC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,EACpC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CACpC,CAAA;YACH,KAAK,cAAc;gBACjB,OAAO,CAAC,CAAC,YAAY,CACnB,GAAG,CAAC,EAAE,EACN,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,UAAU,CAAC,EACvC,IAAI,CAAC,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,EAClD,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CACpC,CAAA;YACH,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;YAC9B,KAAK,QAAQ;gBACX,OAAO,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;YACvE,KAAK,QAAQ;gBACX,OAAO,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;YAClE;gBACE,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACrC,CAAC;IACH,CAAC;IAES,WAAW,CACnB,GAAoB,EACpB,GAAqC;QAErC,IACE,OAAO,IAAI,GAAG;YACd,MAAM,IAAI,GAAG;YACb,GAAG,CAAC,IAAI,IAAI,IAAI;YAChB,GAAG,CAAC,KAAK,KAAK,SAAS;YACvB,CAAE,GAAG,CAAC,IAA2B,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EACrD,CAAC;YACD,OAAO,CAAC,CAAC,KAAK,EAAE,CAAA;QAClB,CAAC;QAED,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAC5B,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBAClD,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAC9C,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI;oBAAE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAE/D,MAAM,MAAM,GACV,GAAG,CAAC,KAAK,IAAI,IAAI;oBACf,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBACtB,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI;wBAChB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;wBAClB,CAAC,CAAC,MAAM,CAAA;gBAEd,OAAO,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;YAC1E,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;gBAC7B,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBAClD,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI;oBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAC9C,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI;oBAAE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAE/D,MAAM,MAAM,GACV,GAAG,CAAC,KAAK,IAAI,IAAI;oBACf,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBACtB,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI;wBAChB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;wBAClB,CAAC,CAAC,MAAM,CAAA;gBAEd,OAAO,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;YAC1E,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAA;gBAErE,OAAO,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;YAC1E,CAAC;YACD,KAAK,MAAM;gBACT,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACpB,KAAK,UAAU;gBACb,OAAO,CAAC,CAAC,GAAG,EAAE,CAAA;YAChB,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACrB,KAAK,SAAS;gBACZ,OAAO,CAAC,CAAC,MAAM,EAAE,CAAA;YACnB,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAA;YACvD;gBACE,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACpC,CAAC;IACH,CAAC;IAES,UAAU,CAClB,GAAoB,EACpB,GAAiC;QAEjC,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,KAAK;gBACR,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YAC/D,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC,UAAU,CACjB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACjB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAC3D,EACD,GAAG,CAAC,MAAM,IAAI,KAAK,CACpB,CAAA;YACH;gBACE,mBAAmB;gBACnB,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,CAAC,IAAI,EAAE,CAAC,CAAA;QACxD,CAAC;IACH,CAAC;IAES,aAAa,CAAC,GAAoB,EAAE,GAAkB;QAC9D,MAAM,KAAK,GAAmD,EAAE,CAAA;QAChE,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5D,IAAI,OAAO,KAAK,SAAS;gBAAE,SAAQ;YAEnC,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;YAC9C,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;YAE9C,IAAI,MAAM,GAAmC,IAAI,CAAC,WAAW,CAC3D,GAAG,EACH,OAAO,CACR,CAAA;YAED,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YAC7B,CAAC;YAED,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YAC7B,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,CAAA;QACrB,CAAC;QACD,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACxB,CAAC;IAES,cAAc,CACtB,GAAoB,EACpB,GAA+B;QAE/B,OAAO,CAAC,CAAC,OAAO,CACd,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CACrE,CAAA;IACH,CAAC;IAES,aAAa,CACrB,IAAqB,EACrB,MAAgC;QAEhC,OAAO,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IAES,oBAAoB,CAC5B,GAAoB,EACpB,GAAiD;QAEjD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;YACrC;gBACE,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACpC,CAAC;IACH,CAAC;IAES,aAAa,CAAC,GAAoB,EAAE,GAAuB;QACnE,IAAI,CAAC,GAAG;YAAE,OAAO,CAAC,CAAC,MAAM,EAAE,CAAA;QAE3B,MAAM,KAAK,GAAkB,EAAE,CAAA;QAC/B,KAAK,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACnE,IAAI,QAAQ,KAAK,SAAS;gBAAE,SAAQ;YAEpC,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAA;YAEpD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,QAAQ,CAMf,CAAA;YAElC,KAAK,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAA;QACrE,CAAC;QAED,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACxB,CAAC;CACF;AAED,MAAM,UAAU;IACd;;OAEG;IACH,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAA;IAEpC,KAAK,CAAC,IAAI;QACR,GAAG,CAAC;YACF,uEAAuE;YACvE,gBAAgB;YAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS;gBAAE,MAAM,CAAC,CAAA;YACvC,mEAAmE;YACnE,uEAAuE;YACvE,0CAA0C;QAC5C,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,EAAC;IACnC,CAAC;IAED,GAAG,CAAC,CAAgB;QAClB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;YAC3C,yCAAyC;YACzC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QAChC,CAAC,CAAC,CAAA;QAEF,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE;YAC1B,0DAA0D;QAC5D,CAAC,CAAC,CAAA;QAEF,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IAC7B,CAAC;CACF;AAED,SAAS,QAAQ,CAAC,OAAe;IAC/B,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACvD,IAAI,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAA;IACvE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;IAChE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;AACvB,CAAC;AAED,SAAS,YAAY,CAAC,IAAqB,EAAE,GAAW;IACtD,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,CAAA;IAClD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,MAAM,UAAU,OAAO,CAAsC,EAAM;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAA;IAC/C,OAAO,CAAC,CAAC,GAAW,EAAE,EAAE;QACtB,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAA;QAC1C,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAmB,CAAA;QACxC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACtB,OAAO,MAAM,CAAA;IACf,CAAC,CAAO,CAAA;AACV,CAAC;AAED,SAAS,qBAAqB,CAC5B,GAAM;IAEN,OAAO,CACL,GAAG,IAAI,IAAI;QACX,OAAO,GAAG,KAAK,QAAQ;QACvB,MAAM,CAAC,aAAa,IAAI,GAAG;QAC3B,OAAO,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,CAChD,CAAA;AACH,CAAC","sourcesContent":["import { LexValue } from '@atproto/lex-data'\nimport { l } from '@atproto/lex-schema'\nimport {\n LexiconArray,\n LexiconArrayItems,\n LexiconDocument,\n LexiconError,\n LexiconObject,\n LexiconParameters,\n LexiconPayload,\n LexiconRef,\n LexiconRefUnion,\n} from './lexicon-document.js'\nimport { LexiconIndexer } from './lexicon-indexer.js'\n\n/*\n Builds validators for Lexicon documents.\n \n This class converts Lexicon type definitions into runtime validators\n * that can validate data against the schema. It handles reference resolution,\n * supporting both local (`#defName`) and cross-document (`nsid#defName`) refs.\n \n @example\n * ```ts\n * import { LexiconSchemaBuilder, LexiconIterableIndexer } from '@atproto/lex-document'\n \n // Build a single validator\n * const indexer = new LexiconIterableIndexer(lexiconDocs)\n * const validator = await LexiconSchemaBuilder.build(indexer, 'com.example.post#main')\n \n // Validate data\n * const result = validator.safeParse(myPostData)\n * if (result.success) {\n * console.log('Valid:', result.value)\n * } else {\n * console.log('Invalid:', result.error)\n * }\n * ```\n \n @example\n * ```ts\n * // Build all validators from an iterable indexer\n * const indexer = new LexiconIterableIndexer(lexiconDocs)\n * const allSchemas = await LexiconSchemaBuilder.buildAll(indexer)\n \n for (const [ref, schema] of allSchemas) {\n * console.log(`Built validator for ${ref}`)\n * }\n * ```\n /\nexport class LexiconSchemaBuilder implements AsyncDisposable {\n /\n Builds a validator for a single Lexicon definition reference.\n \n @param indexer - The Lexicon indexer to resolve documents from\n * @param fullRef - The full reference to build, in format \"nsid#defName\"\n * @returns A promise resolving to a validator for the referenced definition\n * @throws Error if the reference does not point to a schema type\n \n @example\n * ```ts\n * const validator = await LexiconSchemaBuilder.build(\n * indexer,\n * 'app.bsky.feed.post#main'\n * )\n \n validator.parse(postRecord) // Throws if invalid\n * ```\n /\n static async build(\n indexer: LexiconIndexer,\n fullRef: string,\n ): Promise<l.Schema<LexValue>> {\n const ctx = new LexiconSchemaBuilder(indexer)\n try {\n const result = await ctx.buildFullRef(fullRef)\n if (!(result instanceof l.Schema)) {\n throw new Error(`Ref ${fullRef} is not a schema type`)\n }\n return result\n } finally {\n await ctx.done()\n }\n }\n\n /\n Builds validators for all definitions in all documents from an iterable indexer.\n \n This method iterates over all Lexicon documents available in the indexer\n * and builds validators for every definition in each document.\n \n @param indexer - An iterable Lexicon indexer (must implement `Symbol.asyncIterator`)\n * @returns A promise resolving to a Map of full references to their validators.\n * The map values can be validators, Query, Subscription, Procedure, or PermissionSet.\n * @throws Error if the indexer does not support iteration\n \n @example\n * ```ts\n * const indexer = new LexiconIterableIndexer(allLexiconDocs)\n * const schemas = await LexiconSchemaBuilder.buildAll(indexer)\n \n // Access a specific schema\n * const postSchema = schemas.get('app.bsky.feed.post#main')\n \n // Iterate all schemas\n * for (const [ref, schema] of schemas) {\n * console.log(ref, schema)\n * }\n * ```\n /\n static async buildAll(indexer: LexiconIndexer) {\n const builder = new LexiconSchemaBuilder(indexer)\n const schemas = new Map<\n string,\n \| l.Schema<LexValue>\n \| l.Query\n \| l.Subscription\n \| l.Procedure\n \| l.PermissionSet\n >()\n if (!isAsyncIterableObject(indexer)) {\n throw new Error('An iterable indexer is required to build all schemas')\n }\n try {\n for await (const doc of indexer) {\n for (const hash of Object.keys(doc.defs)) {\n const fullRef = `${doc.id}#${hash}`\n const schema = await builder.buildFullRef(fullRef)\n schemas.set(fullRef, schema)\n }\n }\n return schemas\n } finally {\n await builder.done()\n }\n }\n\n #asyncTasks = new AsyncTasks()\n\n /\n Creates a new LexiconSchemaBuilder instance.\n \n Note: For most use cases, prefer using the static `build()` or `buildAll()`\n * methods instead of instantiating directly.\n \n @param indexer - The Lexicon indexer to resolve documents from\n /\n constructor(protected indexer: LexiconIndexer) {}\n\n /\n Waits for all pending reference resolution tasks to complete.\n \n When building schemas with cross-references, the builder schedules\n * async tasks to resolve those references. This method must be called\n * to ensure all references are fully resolved before using the validators.\n \n @returns A promise that resolves when all pending tasks are complete\n * @throws Rethrows any errors from failed reference resolution\n /\n async done(): Promise<void> {\n await this.#asyncTasks.done()\n }\n\n async [Symbol.asyncDispose]() {\n await this.done()\n }\n\n /\n Builds a validator for a full reference (memoized).\n \n Results are cached, so calling with the same reference returns\n * the same promise/result.\n \n @param fullRef - The full reference in format \"nsid#defName\"\n * @returns A promise resolving to the built schema or method definition\n /\n buildFullRef = memoize(async (fullRef: string) => {\n const { nsid, hash } = parseRef(fullRef)\n\n const doc = await this.indexer.get(nsid)\n\n return this.compileDef(doc, hash)\n })\n\n protected buildRefGetter(fullRef: string): () => l.Schema<LexValue> {\n let schema: l.Schema<LexValue>\n\n this.#asyncTasks.add(\n this.buildFullRef(fullRef).then((v) => {\n if (!(v instanceof l.Schema)) {\n throw new Error(`Only refs to schema types are allowed`)\n }\n schema = v\n }),\n )\n\n return () => {\n if (schema) return schema\n throw new Error('Validator not yet built. Did you await done()?')\n }\n }\n\n protected buildTypedRefGetter(\n fullRef: string,\n ): () => l.TypedObjectSchema \| l.RecordSchema {\n let validator: l.TypedObjectSchema \| l.RecordSchema\n\n this.#asyncTasks.add(\n this.buildFullRef(fullRef).then((v) => {\n if (v instanceof l.TypedObjectSchema \|\| v instanceof l.RecordSchema) {\n validator = v\n } else {\n throw new Error(\n 'Only refs to records and object definitions are allowed',\n )\n }\n }),\n )\n\n return () => {\n if (validator) return validator\n throw new Error('Validator not yet built. Did you await done()?')\n }\n }\n\n protected compileDef(doc: LexiconDocument, hash: string) {\n const def = Object.hasOwn(doc.defs, hash) ? doc.defs[hash] : null\n if (!def) {\n throw new Error(\n `No definition found for hash \"${JSON.stringify(hash)}\" in ${doc.id}`,\n )\n }\n switch (def.type) {\n case 'permission-set':\n return l.permissionSet(\n doc.id,\n def.permissions.map(({ resource, type, ...p }) =>\n l.permission(resource, p),\n ),\n def,\n )\n case 'procedure':\n return l.procedure(\n doc.id,\n this.compileParams(doc, def.parameters),\n this.compilePayload(doc, def.input),\n this.compilePayload(doc, def.output),\n this.compileErrors(doc, def.errors),\n )\n case 'query':\n return l.query(\n doc.id,\n this.compileParams(doc, def.parameters),\n this.compilePayload(doc, def.output),\n this.compileErrors(doc, def.errors),\n )\n case 'subscription':\n return l.subscription(\n doc.id,\n this.compileParams(doc, def.parameters),\n this.compilePayloadSchema(doc, def.message.schema),\n this.compileErrors(doc, def.errors),\n )\n case 'token':\n return l.token(doc.id, hash)\n case 'record':\n return l.record(def.key, doc.id, this.compileObject(doc, def.record))\n case 'object':\n return l.typedObject(doc.id, hash, this.compileObject(doc, def))\n default:\n return this.compileLeaf(doc, def)\n }\n }\n\n protected compileLeaf(\n doc: LexiconDocument,\n def: LexiconArray \| LexiconArrayItems,\n ): l.Schema<LexValue> {\n if (\n 'const' in def &&\n 'enum' in def &&\n def.enum != null &&\n def.const !== undefined &&\n !(def.enum as readonly unknown[]).includes(def.const)\n ) {\n return l.never()\n }\n\n switch (def.type) {\n case 'string': {\n const schema = l.string(def)\n if (def.default != null) schema.check(def.default)\n if (def.const != null) schema.check(def.const)\n if (def.enum != null) for (const v of def.enum) schema.check(v)\n\n const result =\n def.const != null\n ? l.literal(def.const)\n : def.enum != null\n ? l.enum(def.enum)\n : schema\n\n return def.default != null ? l.withDefault(result, def.default) : result\n }\n case 'integer': {\n const schema = l.integer(def)\n if (def.default != null) schema.check(def.default)\n if (def.const != null) schema.check(def.const)\n if (def.enum != null) for (const v of def.enum) schema.check(v)\n\n const result =\n def.const != null\n ? l.literal(def.const)\n : def.enum != null\n ? l.enum(def.enum)\n : schema\n\n return def.default != null ? l.withDefault(result, def.default) : result\n }\n case 'boolean': {\n const result = def.const != null ? l.literal(def.const) : l.boolean()\n\n return def.default != null ? l.withDefault(result, def.default) : result\n }\n case 'blob':\n return l.blob(def)\n case 'cid-link':\n return l.cid()\n case 'bytes':\n return l.bytes(def)\n case 'unknown':\n return l.lexMap()\n case 'array':\n return l.array(this.compileLeaf(doc, def.items), def)\n default:\n return this.compileRef(doc, def)\n }\n }\n\n protected compileRef(\n doc: LexiconDocument,\n def: LexiconRef \| LexiconRefUnion,\n ): l.Schema<LexValue> {\n switch (def.type) {\n case 'ref':\n return l.ref(this.buildRefGetter(buildFullRef(doc, def.ref)))\n case 'union':\n return l.typedUnion(\n def.refs.map((r) =>\n l.typedRef(this.buildTypedRefGetter(buildFullRef(doc, r))),\n ),\n def.closed ?? false,\n )\n default:\n // @ts-expect-error\n throw new Error(`Unknown lexicon type: ${def.type}`)\n }\n }\n\n protected compileObject(doc: LexiconDocument, def: LexiconObject) {\n const props: Record<string, l.Schema<undefined \| LexValue>> = {}\n for (const [key, propDef] of Object.entries(def.properties)) {\n if (propDef === undefined) continue\n\n const isNullable = def.nullable?.includes(key)\n const isRequired = def.required?.includes(key)\n\n let schema: l.Schema<undefined \| LexValue> = this.compileLeaf(\n doc,\n propDef,\n )\n\n if (isNullable) {\n schema = l.nullable(schema)\n }\n\n if (!isRequired) {\n schema = l.optional(schema)\n }\n\n props[key] = schema\n }\n return l.object(props)\n }\n\n protected compilePayload(\n doc: LexiconDocument,\n def: LexiconPayload \| undefined,\n ) {\n return l.payload(\n def?.encoding,\n def?.schema ? this.compilePayloadSchema(doc, def.schema) : undefined,\n )\n }\n\n protected compileErrors(\n _doc: LexiconDocument,\n errors?: readonly LexiconError[],\n ): undefined \| string[] {\n return errors?.map((e) => e.name)\n }\n\n protected compilePayloadSchema(\n doc: LexiconDocument,\n def: LexiconObject \| LexiconRef \| LexiconRefUnion,\n ): l.Schema<LexValue, LexValue> {\n switch (def.type) {\n case 'object':\n return this.compileObject(doc, def)\n default:\n return this.compileRef(doc, def)\n }\n }\n\n protected compileParams(doc: LexiconDocument, def?: LexiconParameters) {\n if (!def) return l.params()\n\n const shape: l.ParamsShape = {}\n for (const [paramName, paramDef] of Object.entries(def.properties)) {\n if (paramDef === undefined) continue\n\n const isRequired = def.required?.includes(paramName)\n\n const propSchema = this.compileLeaf(doc, paramDef) as\n \| l.StringSchema\n \| l.BooleanSchema\n \| l.IntegerSchema\n \| l.ArraySchema<l.StringSchema>\n \| l.ArraySchema<l.BooleanSchema>\n \| l.ArraySchema<l.IntegerSchema>\n\n shape[paramName] = isRequired ? propSchema : l.optional(propSchema)\n }\n\n return l.params(shape)\n }\n}\n\nclass AsyncTasks {\n /\n A set that, eventually, contains only rejected promises.\n */\n #promises = new Set<Promise<void>>()\n\n async done(): Promise<void> {\n do {\n // @NOTE this is going to throw on the first rejected promise (which is\n // what we want)\n for (const p of this.#promises) await p\n // At this point, all settled promises should have been removed. If\n // this.#promises is not empty, it means new promises were added during\n // the awaiting process, so we loop again.\n } while (this.#promises.size > 0)\n }\n\n add(p: Promise<void>) {\n const promise = Promise.resolve(p).then(() => {\n // No need to keep the promise any longer\n this.#promises.delete(promise)\n })\n\n void promise.catch((_err) => {\n // ignore errors here, they should be caught though done()\n })\n\n this.#promises.add(promise)\n }\n}\n\nfunction parseRef(fullRef: string) {\n const { length, 0: nsid, 1: hash } = fullRef.split('#')\n if (length !== 2) throw new Error('Uri can only have one hash segment')\n if (!nsid \|\| !hash) throw new Error('Invalid ref, missing hash')\n return { nsid, hash }\n}\n\nfunction buildFullRef(from: LexiconDocument, ref: string) {\n if (ref.startsWith('#')) return `${from.id}${ref}`\n return ref\n}\n\nexport function memoize<Fn extends (arg: string) => unknown>(fn: Fn): Fn {\n const cache = new Map<string, ReturnType<Fn>>()\n return ((arg: string) => {\n if (cache.has(arg)) return cache.get(arg)!\n const result = fn(arg) as ReturnType<Fn>\n cache.set(arg, result)\n return result\n }) as Fn\n}\n\nfunction isAsyncIterableObject<T>(\n obj: T,\n): obj is T & object & AsyncIterable<unknown> {\n return (\n obj != null &&\n typeof obj === 'object' &&\n Symbol.asyncIterator in obj &&\n typeof obj[Symbol.asyncIterator] === 'function'\n )\n}\n"]}

package/package.json CHANGED Viewed

@@ -1,6 +1,9 @@
 {
   "name": "@atproto/lex-document",
-  "version": "0.0.21",
+  "version": "0.1.0",
+  "engines": {
+    "node": ">=22"
+  },
   "license": "MIT",
   "description": "Lexicon document validation tools for AT",
   "keywords": [
@@ -24,25 +27,21 @@
     "./CHANGELOG.md"
   ],
   "sideEffects": false,
-  "type": "commonjs",
-  "main": "./dist/index.js",
-  "types": "./dist/index.d.ts",
+  "type": "module",
   "exports": {
     ".": {
       "types": "./dist/index.d.ts",
-      "browser": "./dist/index.js",
-      "import": "./dist/index.js",
       "default": "./dist/index.js"
     }
   },
   "dependencies": {
     "core-js": "^3",
     "tslib": "^2.8.1",
-    "@atproto/lex-schema": "^0.0.20"
+    "@atproto/lex-schema": "^0.1.0"
   },
   "devDependencies": {
     "vitest": "^4.0.16",
-    "@atproto/lex-data": "^0.0.15"
+    "@atproto/lex-data": "^0.1.0"
   },
   "scripts": {
     "build": "tsc --build tsconfig.build.json",

package/src/core-js.d.ts ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ declare module 'core-js/es/symbol/async-dispose.js'
2	+ declare module 'core-js/es/symbol/dispose.js'

package/src/index.ts CHANGED Viewed

@@ -1,5 +1,5 @@
-import 'core-js/modules/esnext.symbol.async-dispose'
-import 'core-js/modules/esnext.symbol.dispose'
+import 'core-js/es/symbol/async-dispose.js'
+import 'core-js/es/symbol/dispose.js'
 export * from './lexicon-document.js'
 export * from './lexicon-indexer.js'

package/tsconfig.tests.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "extends": "../../../tsconfig/vitest.json",
-  "include": ["./tests", "./src/**/*.test.ts"],
+  "include": ["./tests", "./src/**/*.test.ts", "./src/core-js.d.ts"],
   "compilerOptions": {
     "noImplicitAny": true,
     "rootDir": "./",