effect-grammar 0.2.0 → 0.3.0

package/README.md

@@ -8,24 +8,22 @@ expressions, search queries, or DSLs.
 
 You write the grammar definition once. You get four outputs:
 
-- **A Parser**: Reads text and outputs structured data with line and column
+- **A parser.** Reads text and outputs structured data, with line and column
   error messages.
-- **A Printer**: Converts structured data back to canonical text.
-- **A `Schema.Codec<A, string>`**: Integrates directly with Effect Schema
-  (`decode` parses, `encode` prints, and Schema refinements compose).
-- **A Text Renderer**: Formats the grammar as readable text for documentation
+- **A printer.** Converts structured data back to canonical text.
+- **A `Schema.Codec<A, string>`.** Decoding parses, encoding prints, and Schema
+  refinements compose.
+- **A text renderer.** Formats the grammar as readable text, for documentation
   and schema descriptions.
 
 ## Why effect-grammar?
 
-- **`Schema.transformOrFail`**: Requires you to write and maintain both `decode`
-  and `encode` functions manually.
-- **`Schema.TemplateLiteralParser`**: Supports only flat `${a}-${b}` string
-  patterns.
-- **`effect-grammar`**: Automatically derives the parser and printer for formats
-  with optional parts, repetition, alternation, and recursion.
+`Schema.transformOrFail` makes you write and maintain both directions by hand.
+`Schema.TemplateLiteralParser` only handles flat `${a}-${b}` patterns.
+`effect-grammar` derives both directions for you. It handles optional parts,
+repetition, alternation, recursion, and parts that depend on earlier parts.
 
-This is for format strings, not documents. The parser backtracks with no
+This is for format strings, not documents. The parser backtracks. There is no
 memoization and no left recursion. Printing is canonical, not pretty.
 
 ## Install
@@ -34,105 +32,164 @@ memoization and no left recursion. Printing is canonical, not pretty.
 pnpm add effect-grammar
 ```
 
-Depends on Effect v4. The package pins `effect` to `4.0.0-beta.102` for now.
+Requires Effect `4.0.0-rc.112` or newer in the Effect 4 line.
 
 ## A grammar
 
 ```ts
-import { Schema } from "effect"
 import * as Grammar from "effect-grammar"
 
 const endpoint = Grammar.gen(function* () {
   yield* Grammar.literal("https://")
-  const host = yield* Grammar.field("host", Grammar.regex(/[^:/?#]+/, "host"))
-  const port = yield* Grammar.field(
-    "port",
-    Grammar.optional(Grammar.prefix(":", Grammar.integer)),
-  )
-  return { host, port: port ?? 443 }
+  const host = yield* Grammar.regex(/[^:/?#]+/, "host")
+  const port = yield* Grammar.optional(Grammar.prefix(":", Grammar.integer))
+  return { host, port }
 })
 
 Grammar.parse(endpoint, "https://effect.website:8080")
 // Result.succeed({ host: "effect.website", port: 8080 })
+
 Grammar.parse(endpoint, "https://effect.website:abc")
 // Result.fail(ParseError: line 1, column 24: expected integer, found "a")
+
 Grammar.print(endpoint, { host: "effect.website", port: 443 })
 // Result.succeed("https://effect.website:443")
+
 Grammar.render(endpoint)
 // "https://" host:<host> port:(":" <integer>)?
 ```
 
-A silent grammar (`literal`, `symbol`, `whitespace`, anything under `skip`)
-carries no value and can be `yield*`-ed bare. A value grammar goes through
-`field(name, g)`.
+`gen` runs the generator once, when you build the grammar. Nothing is parsed
+yet.
+
+Inside the generator, `yield*` on a value grammar does not give you a value. It
+gives you a `Ref<A>`: a stand-in for the value that will exist at parse and
+print time. `yield*` on a silent grammar, such as `literal` or `symbol`, gives
+nothing back. Silent grammars carry no value.
+
+The generator's return value is a pattern over those refs. It can be a bare ref,
+an object, an array, or constants around them. Parsing fills the pattern in.
+Printing reads each ref back out of the value you hand it. That is what makes
+the grammar invertible.
+
+```ts
+const nested = Grammar.gen(function* () {
+  const host = yield* Grammar.regex(/[^:]+/, "host")
+  yield* Grammar.literal(":")
+  const port = yield* Grammar.integer
+  return { kind: "endpoint", address: { host, port } } as const
+})
+// Grammar<{ kind: "endpoint"; address: { host: string; port: number } }>
+```
+
+## The one rule
 
-`print` replays the generator. It reads each field from `value[name]` and passes
-that back as the `yield*` result. An `if` on a parsed value takes the same path
-both ways. The generator's return must hold every field under its name, and the
-types enforce it. Return nothing and you get the object of fields.
+Every binding must appear in the return pattern exactly once. `gen` throws at
+build time if one does not. A binding the return does not hold is a value the
+printer could not print.
 
-`render` cannot read a generator. It runs the generator once with no values and
-shows the parts it yields. The rendering is exact when the generator is
-straight-line, as above. If the generator branches on a parsed value, render
-still runs with no values. `if (kind === "a") yield* ...` shows only the path
-`undefined` takes, with no warning. Put the branch in `choice` instead, which
-renders every option.
+To parse something and then drop it, wrap it with `skip`. The grammar prints its
+canonical form instead.
 
-`seq` is the same field object without generator control flow. It renders every
-part:
+## Refs are not values
+
+A ref is a stand-in, so JavaScript cannot look inside it. Comparing a ref with
+`===` is a type error. Interpolating one into a string throws.
+
+Branching on a ref is `match`, described below. For everything else there are
+small helpers: `defaulted` supplies a value when a part is absent.
+`get(ref, key)` reads a property of a ref, including reserved names such as
+`then` and `toJSON`.
+
+## Depending on an earlier part
+
+`match` picks a grammar based on an earlier binding. The printer runs the same
+choice backwards.
 
 ```ts
-const member = Grammar.seq(
-  Grammar.field("key", jsonString),
-  Grammar.symbol(":"),
-  Grammar.field("value", jsonValue),
-)
-// Grammar<{ key: string; value: Json }>
+const tagged = Grammar.gen(function* () {
+  const kind = yield* Grammar.choice(
+    Grammar.literal("n:").pipe(Grammar.as("num")),
+    Grammar.literal("w:").pipe(Grammar.as("word")),
+  )
+  const value = yield* Grammar.match(kind, {
+    num: Grammar.integer,
+    word: Grammar.regex(/[a-z]+/, "word"),
+  })
+  return { kind, value }
+})
+// parses "n:12"  →  { kind: "num", value: 12 }
 ```
 
-## The Schema
+`match` requires the cases to cover every literal of the selector's type.
+`matchValue` is the same idea with number or mixed literal keys. Keys keep their
+type, so `1` and `"1"` are distinct cases.
 
-`toSchema` takes the grammar and the Schema it should decode to. Parsing happens
-first, then the target's refinements. Encoding prints.
+A property of a ref is a ref to that property. A header parsed by one grammar
+can steer the body of another:
 
 ```ts
-const Endpoint = Grammar.toSchema(
-  endpoint,
-  Schema.Struct({
-    host: Schema.NonEmptyString,
-    port: Schema.Int.check(Schema.isBetween({ minimum: 1, maximum: 65535 })),
-  }),
-  { identifier: "Endpoint" },
-)
+const frame = Grammar.gen(function* () {
+  const header = yield* headerGrammar // { kind: "text" | "bin"; size: number }
+  yield* Grammar.literal(":")
+  const body = yield* Grammar.match(header.kind, {
+    text: Grammar.take(header.size),
+    bin: Grammar.repeat(Grammar.regex(/[01]/, "bit"), header.size),
+  })
+  return { header, body }
+})
+```
+
+`take(n)` reads exactly `n` characters (UTF-16 code units). `repeat(g, n)` reads
+exactly `n` repetitions. The count is a value like any other: return it, and
+printing reads it back. A netstring is:
 
-Schema.decodeUnknownSync(Endpoint)("https://effect.website:443")
-// { host: "effect.website", port: 443 }
-Schema.encodeSync(Endpoint)({ host: "effect.website", port: 443 })
-// "https://effect.website:443"
+```ts
+const netstring = Grammar.gen(function* () {
+  const length = yield* Grammar.integer
+  yield* Grammar.literal(":")
+  const payload = yield* Grammar.take(length)
+  yield* Grammar.literal(",")
+  return { length, payload }
+})
+// "5:hello,"  ⇄  { length: 5, payload: "hello" }
 ```
 
+`seq(...silents)` builds a silent sequence.
+
 ## Values and alternatives
 
-`transform` maps a value both ways. `decodeTo` takes a Schema that types
-`decode` and `encode` and checks the value on parse and on print. A `choice` of
-Schema-typed branches picks the matching Schema when printing.
+`transform` maps between two types, in both directions. Write plain functions.
+If a callback throws, the grammar fails cleanly. Use `transformOrFail` when a
+direction should return a `Result` instead:
 
 ```ts
-const Num = Schema.Struct({ kind: Schema.Literal("num"), value: Schema.Finite })
-const num = Grammar.integer.pipe(
-  Grammar.decodeTo(Num)({
-    decode: (value) => ({ kind: "num", value }),
-    encode: (n) => n.value,
+const jsonString = Grammar.regex(/"(?:[^"\\]|\\.)*"/, "string").pipe(
+  Grammar.transformOrFail({
+    decode: (text) =>
+      Result.try({
+        try: () => JSON.parse(text),
+        catch: (error) => ({ message: String(error) }),
+      }),
+    encode: (value) => Result.succeed(JSON.stringify(value)),
   }),
 )
 ```
 
-`as` turns a silent grammar into a constant. `flag` turns presence into a
-boolean:
+`decodeTo` checks the value against a Schema on parse and on print. `as` turns a
+silent grammar into a constant. `flag` turns presence into a boolean.
+
+`choice` tries its options in order and backtracks. It has one round-trip rule:
+the text printed for a branch must not parse as a different value through an
+earlier branch. `taggedChoice` records the chosen branch in the result.
 
 ```ts
-const jsonNull = Grammar.symbol("null").pipe(Grammar.as(null))
-const negate = Grammar.flag("-")
+const value = Grammar.taggedChoice("kind", {
+  number: Grammar.integer,
+  word: Grammar.regex(/[a-z]+/, "word"),
+})
+// parses "12"      →  { kind: "number", value: 12 }
+// prints the same  →  "12"
 ```
 
 Recursion uses `suspend`:
@@ -152,16 +209,47 @@ const jsonValue: Grammar.Grammar<Json> = Grammar.suspend(
 )
 ```
 
-See `examples/` for JSON, Scheme, a Postgres DSN, netstrings, and GitHub's
-search syntax.
+See `examples/` for JSON, Scheme, a Postgres DSN, netstrings, a wire protocol,
+and GitHub's search syntax.
 
-## Errors
+## Products, delimiters, and trivia
 
-`choice` backtracks. Errors report the furthest position the parser reached and
-everything that could have matched there:
+`struct` and `tuple` build products without a generator. Their staged form is
+the same as what `gen` builds.
 
+Delimiter combinators work data-first and data-last:
+
+```ts
+const port = Grammar.integer.pipe(
+  Grammar.prefix(":"),
+  Grammar.optional(),
+  Grammar.defaulted(443),
+)
+
+const pair = Grammar.tuple(
+  Grammar.integer,
+  Grammar.integer.pipe(Grammar.prefix(",")),
+)
 ```
-line 1, column 7: expected one of "null", "true", "false", number, string, "[", "{", found end of input
-```
 
-`label(name)` names a grammar for these messages.
+`between` is the two-sided delimiter. `wrap` is another name for it. `lexeme`
+skips trailing whitespace after a token, and prints none. `symbol` is a literal
+lexeme. `space` is one exact space. `spaces` accepts one or more whitespace
+characters and prints one canonical space.
+
+## Rendering
+
+`render` formats a grammar as readable text, including binding paths. `describe`
+returns a short name for a grammar.
+
+The interpreter AST is private. Public grammars expose only `Grammar<A>`,
+`Ref<A>`, and the combinators.
+
+## Errors
+
+Parse errors report the furthest position reached, with every expected form at
+that position, plus line and column.
+
+Print errors carry a `PrintIssue` tree. It records structural paths, missing
+fields, branch failures, and value mismatches. `PrintError.format` renders the
+tree as text.

package/dist/combinators.d.ts

@@ -1,20 +1,23 @@
-import { Schema } from "effect";
-import { type Field, type Fields, type Grammar, type Silent, type Type } from "./core.ts";
-export { field } from "./core.ts";
+import { Result, Schema } from "effect";
+import { type Grammar, type GrammarInternal, type GrammarIssue, type MatchKey, type Ref, type Silent, type Type } from "./core.ts";
+export { gen, type GenGrammar, get, seq } from "./gen.ts";
 export declare const literal: (value: string) => Silent;
 export declare const empty: Silent;
-/** The regex is made sticky so the parser can match at a position without slicing. */
-export declare const regex: (re: RegExp, name: string) => Grammar<string>;
-export declare function seq(...parts: ReadonlyArray<Silent>): Silent;
-export declare function seq<const Parts extends ReadonlyArray<Silent | Field<string, any>>>(...parts: Parts): Grammar<Fields<Parts[number]>>;
-export declare const gen: <Y extends Silent | Field<string, any>, R extends Fields<Y> | void = void>(run: () => Generator<Y, R, any>) => Grammar<[R] extends [void] ? Fields<Y> : R>;
-export declare function wrap(open: Silent | string, inner: Silent, close: Silent | string): Silent;
-export declare function wrap<A>(open: Silent | string, inner: Grammar<A>, close: Silent | string): Grammar<A>;
+export declare const regex: (expression: RegExp, name: string) => Grammar<string>;
+type PreserveGrammar<G extends GrammarInternal> = G extends Silent ? Silent : G extends Grammar<infer A> ? Grammar<A> : never;
+type OptionalGrammar<G extends GrammarInternal> = G extends Silent ? Silent : G extends Grammar<infer A> ? Grammar<A | undefined> : never;
+export declare function between(open: Silent | string, close: Silent | string): <G extends GrammarInternal>(inner: G) => PreserveGrammar<G>;
+export declare function between(open: Silent | string, inner: Silent, close: Silent | string): Silent;
+export declare function between<A>(open: Silent | string, inner: Grammar<A>, close: Silent | string): Grammar<A>;
+export declare const wrap: typeof between;
+export declare function prefix(open: Silent | string): <G extends GrammarInternal>(inner: G) => PreserveGrammar<G>;
 export declare function prefix(open: Silent | string, inner: Silent): Silent;
 export declare function prefix<A>(open: Silent | string, inner: Grammar<A>): Grammar<A>;
+export declare function suffix(close: Silent | string): <G extends GrammarInternal>(inner: G) => PreserveGrammar<G>;
 export declare function suffix(inner: Silent, close: Silent | string): Silent;
 export declare function suffix<A>(inner: Grammar<A>, close: Silent | string): Grammar<A>;
-export declare const choice: <const Gs extends readonly [Grammar<any>, ...Array<Grammar<any>>]>(...options: Gs) => Grammar<Type<Gs[number]>>;
+export declare const choice: <const Grammars extends readonly [GrammarInternal, ...Array<GrammarInternal>]>(...options: Grammars) => Grammar<Type<Grammars[number]>>;
+export declare function optional(): <G extends GrammarInternal>(inner: G) => OptionalGrammar<G>;
 export declare function optional(inner: Silent): Silent;
 export declare function optional<A>(inner: Grammar<A>): Grammar<A | undefined>;
 export interface RepeatOptions {
@@ -22,12 +25,23 @@ export interface RepeatOptions {
     readonly max?: number;
 }
 export declare const many: {
-    <A>(inner: Grammar<A>, opts?: RepeatOptions): Grammar<ReadonlyArray<A>>;
-    (opts?: RepeatOptions): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
+    <A>(inner: Grammar<A>, options?: RepeatOptions): Grammar<ReadonlyArray<A>>;
+    (options?: RepeatOptions): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
 };
 export declare const sepBy: {
-    <A>(inner: Grammar<A>, sep: Silent | string, opts?: RepeatOptions): Grammar<ReadonlyArray<A>>;
-    (sep: Silent | string, opts?: RepeatOptions): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
+    <A>(inner: Grammar<A>, separator: Silent | string, options?: RepeatOptions): Grammar<ReadonlyArray<A>>;
+    (separator: Silent | string, options?: RepeatOptions): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
+};
+type FiniteString<K extends string> = string extends K ? never : K;
+type CaseOutput<Cases> = Cases extends Readonly<Record<PropertyKey, GrammarInternal>> ? Type<Cases[keyof Cases]> : never;
+export declare const match: <K extends string, const Cases extends Readonly<Record<K, GrammarInternal>>>(scrutinee: Ref<FiniteString<K>>, cases: Cases) => Grammar<CaseOutput<Cases>>;
+type EntryOutput<Entries extends ReadonlyArray<readonly [MatchKey, GrammarInternal]>> = Type<Entries[number][1]>;
+type CompleteEntries<K extends MatchKey, Entries extends ReadonlyArray<readonly [MatchKey, GrammarInternal]>> = Exclude<K, Entries[number][0]> extends never ? Entries : never;
+export declare const matchValue: <K extends MatchKey, const Entries extends ReadonlyArray<readonly [K, GrammarInternal]>>(scrutinee: Ref<K>, entries: CompleteEntries<K, Entries>) => Grammar<EntryOutput<Entries>>;
+export declare const take: (count: Ref<number>) => Grammar<string>;
+export declare const repeat: {
+    <A>(inner: Grammar<A>, count: Ref<number>): Grammar<ReadonlyArray<A>>;
+    (count: Ref<number>): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
 };
 export interface TransformOptions<A, B> {
     readonly decode: (a: A) => B;
@@ -36,18 +50,28 @@ export interface TransformOptions<A, B> {
     readonly name?: string;
 }
 export declare const transform: {
-    <A, B>(f: TransformOptions<A, B>): (inner: Grammar<A>) => Grammar<B>;
-    <A, B>(inner: Grammar<A>, f: TransformOptions<A, B>): Grammar<B>;
+    <A, B>(options: TransformOptions<A, B>): (inner: Grammar<A>) => Grammar<B>;
+    <A, B>(inner: Grammar<A>, options: TransformOptions<A, B>): Grammar<B>;
+};
+export interface TransformOrFailOptions<A, B> {
+    readonly decode: (a: A) => Result.Result<B, GrammarIssue>;
+    readonly encode: (b: B) => Result.Result<A, GrammarIssue>;
+    readonly is?: (value: B) => boolean;
+    readonly name?: string;
+}
+export declare const transformOrFail: {
+    <A, B>(options: TransformOrFailOptions<A, B>): (inner: Grammar<A>) => Grammar<B>;
+    <A, B>(inner: Grammar<A>, options: TransformOrFailOptions<A, B>): Grammar<B>;
 };
 export interface DecodeToOptions<A, T> extends Omit<TransformOptions<A, T>, "is"> {
     readonly is?: ((value: T) => boolean) | undefined;
 }
-export declare const decodeTo: <T>(schema: Schema.Codec<T, unknown, unknown, unknown>) => <A>(f: DecodeToOptions<A, T>) => (inner: Grammar<A>) => Grammar<T>;
+export declare const decodeTo: <T>(schema: Schema.Codec<T, unknown, unknown, unknown>) => <A>(options: DecodeToOptions<A, T>) => (inner: Grammar<A>) => Grammar<T>;
 export declare const as: {
     <const V>(value: V): (inner: Silent) => Grammar<V>;
     <const V>(inner: Silent, value: V): Grammar<V>;
 };
-export declare const flag: (s: Silent | string) => Grammar<boolean>;
+export declare const flag: (value: Silent | string) => Grammar<boolean>;
 export declare const skip: {
     <A>(printAs: A): (inner: Grammar<A>) => Silent;
     <A>(inner: Grammar<A>, printAs: A): Silent;
@@ -57,9 +81,30 @@ export declare const label: {
     <A>(inner: Grammar<A>, name: string): Grammar<A>;
 };
 export declare const suspend: <A>(thunk: () => Grammar<A>, name?: string) => Grammar<A>;
-export declare const whitespace: Silent;
+export declare const defaulted: {
+    <A>(value: A): (inner: Grammar<A | undefined>) => Grammar<A>;
+    <A>(inner: Grammar<A | undefined>, value: A): Grammar<A>;
+};
+type StructFields = Readonly<Record<string, GrammarInternal>>;
+type StructValue<Fields extends StructFields> = {
+    readonly [K in keyof Fields]: Type<Fields[K]>;
+};
+export declare const struct: <const Fields extends StructFields>(fields: Fields) => Grammar<StructValue<Fields>>;
+type TupleValue<Elements extends ReadonlyArray<GrammarInternal>> = {
+    readonly [K in keyof Elements]: Type<Elements[K]>;
+};
+export declare const tuple: <const Elements extends ReadonlyArray<GrammarInternal>>(...elements: Elements) => Grammar<TupleValue<Elements>>;
+type TaggedValue<Tag extends string, Cases extends Readonly<Record<string, GrammarInternal>>> = {
+    readonly [K in keyof Cases & string]: Readonly<Record<Tag, K>> & {
+        readonly value: Type<Cases[K]>;
+    };
+}[keyof Cases & string];
+export declare const taggedChoice: <const Tag extends string, const Cases extends Readonly<Record<string, GrammarInternal>>>(tag: Tag, cases: Cases) => Grammar<TaggedValue<Tag, Cases>>;
+export declare const trivia: Silent;
+export declare const space: Silent;
+export declare const spaces: Silent;
 export declare function lexeme(inner: Silent): Silent;
 export declare function lexeme<A>(inner: Grammar<A>): Grammar<A>;
-export declare const symbol: (s: string) => Silent;
+export declare const symbol: (value: string) => Silent;
 export declare const integer: Grammar<number>;
 //# sourceMappingURL=combinators.d.ts.map

package/dist/combinators.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"combinators.d.ts","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAwB,MAAM,EAAE,MAAM,QAAQ,CAAA;AAErD,OAAO,EAEL,KAAK,KAAK,EACV,KAAK,MAAM,EACX,KAAK,OAAO,EAOZ,KAAK,MAAM,EAEX,KAAK,IAAI,EACV,MAAM,WAAW,CAAA;AAGlB,OAAO,EAAE,KAAK,EAAE,MAAM,WAAW,CAAA;AAEjC,eAAO,MAAM,OAAO,UAAW,MAAM,WAAuC,CAAA;AAE5E,eAAO,MAAM,KAAK,QAAc,CAAA;AAEhC,sFAAsF;AACtF,eAAO,MAAM,KAAK,OAAQ,MAAM,QAAQ,MAAM,KAAG,OAAO,CAAC,MAAM,CAQ9D,CAAA;AAMD,wBAAgB,GAAG,CAAC,GAAG,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,MAAM,CAAA;AAC5D,wBAAgB,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS,aAAa,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,EAChF,GAAG,KAAK,EAAE,KAAK,GACd,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;AAKjC,eAAO,MAAM,GAAG,GAAI,CAAC,SAAS,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,OACrF,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAC9B,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAA+B,CAAA;AAE5E,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AAC1F,wBAAgB,IAAI,CAAC,CAAC,EACpB,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,OAAO,CAAC,CAAC,CAAC,CAAA;AAUb,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AACpE,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAK/E,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AACrE,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAKhF,eAAO,MAAM,MAAM,GAAI,KAAK,CAAC,EAAE,SAAS,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,cACzE,EAAE,KACb,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAsC,CAAA;AAEjE,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC/C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAA;AAKtE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CACtB;AAgBD,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IACvE,CAAC,IAAI,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAG5E,CAAA;AAED,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,IAAI,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7F,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,IAAI,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAGlG,CAAA;AAED,MAAM,WAAW,gBAAgB,CAAC,CAAC,EAAE,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAED,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IACpE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAGjE,CAAA;AAED,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;IAC/E,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,SAAS,CAAA;CAClD;AAED,eAAO,MAAM,QAAQ,GAClB,CAAC,UAAU,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,MACrD,CAAC,KAAK,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,aACpB,OAAO,CAAC,CAAC,CAAC,eAGjB,CAAA;AAEH,eAAO,MAAM,EAAE,EAAE;IACf,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAClD,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAQ/C,CAAA;AAED,eAAO,MAAM,IAAI,MAAO,MAAM,GAAG,MAAM,qBAAqD,CAAA;AAE5F,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;IAC9C,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,CAAA;CAG3C,CAAA;AAED,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IACpD,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CACyC,CAAA;AAE3F,eAAO,MAAM,OAAO,GAAI,CAAC,SAAS,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,MAAM,KAAG,OAAO,CAAC,CAAC,CACrC,CAAA;AAKxC,eAAO,MAAM,UAAU,QAAuB,CAAA;AAE9C,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC7C,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAKxD,eAAO,MAAM,MAAM,MAAO,MAAM,WAAuB,CAAA;AAEvD,eAAO,MAAM,OAAO,EAAE,OAAO,CAAC,MAAM,CAEnC,CAAA"}
+{"version":3,"file":"combinators.d.ts","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmC,MAAM,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAExE,OAAO,EAEL,KAAK,OAAO,EACZ,KAAK,eAAe,EACpB,KAAK,YAAY,EAIjB,KAAK,QAAQ,EAEb,KAAK,GAAG,EAER,KAAK,MAAM,EAEX,KAAK,IAAI,EACV,MAAM,WAAW,CAAA;AAKlB,OAAO,EAAE,GAAG,EAAE,KAAK,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,UAAU,CAAA;AAEzD,eAAO,MAAM,OAAO,UAAW,MAAM,KAAG,MAA4C,CAAA;AAEpF,eAAO,MAAM,KAAK,QAAc,CAAA;AAEhC,eAAO,MAAM,KAAK,eAAgB,MAAM,QAAQ,MAAM,KAAG,OAAO,CAAC,MAAM,CAGtE,CAAA;AAUD,KAAK,eAAe,CAAC,CAAC,SAAS,eAAe,IAAI,CAAC,SAAS,MAAM,GAC9D,MAAM,GACN,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,CAAC,GACxB,OAAO,CAAC,CAAC,CAAC,GACV,KAAK,CAAA;AAEX,KAAK,eAAe,CAAC,CAAC,SAAS,eAAe,IAAI,CAAC,SAAS,MAAM,GAC9D,MAAM,GACN,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,CAAC,GACxB,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,GACtB,KAAK,CAAA;AAEX,wBAAgB,OAAO,CACrB,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AAC7F,wBAAgB,OAAO,CAAC,CAAC,EACvB,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,OAAO,CAAC,CAAC,CAAC,CAAA;AAqBb,eAAO,MAAM,IAAI,gBAAU,CAAA;AAE3B,wBAAgB,MAAM,CACpB,IAAI,EAAE,MAAM,GAAG,MAAM,GACpB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AACpE,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAO/E,wBAAgB,MAAM,CACpB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AACrE,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAUhF,eAAO,MAAM,MAAM,GACjB,KAAK,CAAC,QAAQ,SAAS,SAAS,CAAC,eAAe,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,cAEhE,QAAQ,KACnB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAsC,CAAA;AAEvE,wBAAgB,QAAQ,IAAI,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AACvF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC/C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAA;AAMtE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CACtB;AAsBD,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAG/E,CAAA;AAED,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,CAAC,EACA,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,SAAS,EAAE,MAAM,GAAG,MAAM,EAC1B,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5B,CACE,SAAS,EAAE,MAAM,GAAG,MAAM,EAC1B,OAAO,CAAC,EAAE,aAAa,GACtB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAGvD,CAAA;AAED,KAAK,YAAY,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAAG,KAAK,GAAG,CAAC,CAAA;AAElE,KAAK,UAAU,CAAC,KAAK,IACnB,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG,KAAK,CAAA;AAEjG,eAAO,MAAM,KAAK,GAAI,CAAC,SAAS,MAAM,EAAE,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,aACnF,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SACxB,KAAK,KACX,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAMxB,CAAA;AAEJ,KAAK,WAAW,CAAC,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,IAAI,IAAI,CAC1F,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACnB,CAAA;AAED,KAAK,eAAe,CAClB,CAAC,SAAS,QAAQ,EAClB,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,IACjE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,CAAA;AAElE,eAAO,MAAM,UAAU,GACrB,CAAC,SAAS,QAAQ,EAClB,KAAK,CAAC,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,aAEvD,GAAG,CAAC,CAAC,CAAC,WACR,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC,KACnC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAK3B,CAAA;AAEJ,eAAO,MAAM,IAAI,UAAW,GAAG,CAAC,MAAM,CAAC,KAAG,OAAO,CAAC,MAAM,CACK,CAAA;AAE7D,eAAO,MAAM,MAAM,EAAE;IACnB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IACrE,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAG1E,CAAA;AAED,MAAM,WAAW,gBAAgB,CAAC,CAAC,EAAE,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAYD,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAUvE,CAAA;AAED,MAAM,WAAW,sBAAsB,CAAC,CAAC,EAAE,CAAC;IAC1C,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAA;IACzD,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAA;IACzD,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAED,eAAO,MAAM,eAAe,EAAE;IAC5B,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAChF,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAG7E,CAAA;AAED,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;IAC/E,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,SAAS,CAAA;CAClD;AAED,eAAO,MAAM,QAAQ,GAClB,CAAC,UAAU,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,MACrD,CAAC,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,aAC1B,OAAO,CAAC,CAAC,CAAC,KAAG,OAAO,CAAC,CAAC,CAM7B,CAAA;AAEH,eAAO,MAAM,EAAE,EAAE;IACf,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAClD,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAQ/C,CAAA;AAED,eAAO,MAAM,IAAI,UAAW,MAAM,GAAG,MAAM,KAAG,OAAO,CAAC,OAAO,CACR,CAAA;AAErD,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;IAC9C,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,CAAA;CAG3C,CAAA;AAED,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IACpD,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CACyC,CAAA;AAE3F,eAAO,MAAM,OAAO,GAAI,CAAC,SAAS,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,MAAM,KAAG,OAAO,CAAC,CAAC,CACrC,CAAA;AAExC,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAC5D,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAMzD,CAAA;AAED,KAAK,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAA;AAE7D,KAAK,WAAW,CAAC,MAAM,SAAS,YAAY,IAAI;IAC9C,QAAQ,EAAE,CAAC,IAAI,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;CAC9C,CAAA;AAED,eAAO,MAAM,MAAM,GAAI,KAAK,CAAC,MAAM,SAAS,YAAY,UAC9C,MAAM,KACb,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAa7B,CAAA;AAED,KAAK,UAAU,CAAC,QAAQ,SAAS,aAAa,CAAC,eAAe,CAAC,IAAI;IACjE,QAAQ,EAAE,CAAC,IAAI,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;CAClD,CAAA;AAED,eAAO,MAAM,KAAK,GAAI,KAAK,CAAC,QAAQ,SAAS,aAAa,CAAC,eAAe,CAAC,eAC5D,QAAQ,KACpB,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAY9B,CAAA;AAED,KAAK,WAAW,CAAC,GAAG,SAAS,MAAM,EAAE,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,IAAI;IAC9F,QAAQ,EAAE,CAAC,IAAI,MAAM,KAAK,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG;QAC/D,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;KAC/B;CACF,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAA;AAEvB,eAAO,MAAM,YAAY,GACvB,KAAK,CAAC,GAAG,SAAS,MAAM,EACxB,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,OAExD,GAAG,SACD,KAAK,KACX,OAAO,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAgBjC,CAAA;AAKD,eAAO,MAAM,MAAM,QAAwC,CAAA;AAC3D,eAAO,MAAM,KAAK,QAAe,CAAA;AACjC,eAAO,MAAM,MAAM,QAA6C,CAAA;AAEhE,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC7C,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAKxD,eAAO,MAAM,MAAM,UAAW,MAAM,KAAG,MAAgC,CAAA;AAEvE,eAAO,MAAM,OAAO,iBAUnB,CAAA"}