effect-grammar 0.0.1 → 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Sai Ashirwad
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -1,42 +1,92 @@
 # effect-grammar
 
-Effect Schema, but for text formats. One definition yields a parser, a printer,
-a rendered grammar, and a `Schema<A, string>`.
+Invertible grammar combinators and parser-printers for Effect.
+
+Schema models your structured data. `effect-grammar` models the text formats inside your strings: connection strings, duration strings (`1h30m`), cron 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 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 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.
+
+This is for format strings, not documents. The parser backtracks with no memoization and no left recursion. Printing is canonical, not pretty.
 
 ## Install
 
 ```bash
-pnpm add effect-grammar effect
+pnpm add effect-grammar
 ```
 
-Depends on Effect v4.
-
-## Grammar
+Depends on Effect v4. The package pins `effect` to `4.0.0-beta.102` for now.
 
-Define an HTTPS endpoint once, then parse it, print it, or derive a validated
-Schema.
+## A grammar
 
 ```ts
 import { Schema } from "effect"
-import { Grammar } from "effect-grammar"
-
-const endpoint = Grammar.map(
-  Grammar.struct({
-    scheme: Grammar.literal("https://"),
-    host: Grammar.label("host", Grammar.regex(/[^:/?#]+/, "host")),
-    portPart: Grammar.optional(
-      Grammar.struct({ sep: Grammar.literal(":"), port: Grammar.integer }),
-    ),
-  }),
-  {
-    to: ({ host, portPart }) => ({ host, port: portPart?.port ?? 443 }),
-    from: ({ host, port }) => ({
-      scheme: "https://" as const,
-      host,
-      portPart: { sep: ":" as const, port },
-    }),
-  },
+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 }
+})
+
+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)`.
+
+`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.
+
+`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.
+
+`seq` is the same field object without generator control flow. It renders every
+part:
+
+```ts
+const member = Grammar.seq(
+  Grammar.field("key", jsonString),
+  Grammar.symbol(":"),
+  Grammar.field("value", jsonValue),
 )
+// Grammar<{ key: string; value: Json }>
+```
+
+## The Schema
+
+`toSchema` takes the grammar and the Schema it should decode to. Parsing happens
+first, then the target's refinements. Encoding prints.
+
+```ts
 const Endpoint = Grammar.toSchema(
   endpoint,
   Schema.Struct({
@@ -45,52 +95,64 @@ const Endpoint = Grammar.toSchema(
   }),
   { identifier: "Endpoint" },
 )
-Schema.decodeUnknownSync(Endpoint)("https://effect.website:443") // { host: "effect.website", port: 443 }
-Schema.encodeSync(Endpoint)({ host: "effect.website", port: 443 }) // "https://effect.website:443"
+
+Schema.decodeUnknownSync(Endpoint)("https://effect.website:443")
+// { host: "effect.website", port: 443 }
+Schema.encodeSync(Endpoint)({ host: "effect.website", port: 443 })
+// "https://effect.website:443"
 ```
 
-## Parse-only with `Effect.gen`
+## Values and alternatives
 
-Write plain Effect programs over the input. Custom errors are yielded failures.
+`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.
 
 ```ts
-import { Effect, Schema } from "effect"
-import { char, digit, endOfInput, many, parse } from "effect-grammar/parser"
-
-class OutOfRange extends Schema.TaggedErrorClass<OutOfRange>()("OutOfRange", {
-  n: Schema.Finite,
-}) {}
-
-const byte = Effect.gen(function* () {
-  const digits = yield* many(digit, { atLeast: 1 })
-  const n = Number(digits.join(""))
-  if (n > 255) return yield* new OutOfRange({ n })
-  return n
-})
+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 ip = Effect.gen(function* () {
-  const a = yield* byte
-  yield* char(".")
-  const b = yield* byte
-  yield* char(".")
-  const c = yield* byte
-  yield* char(".")
-  const d = yield* byte
-  yield* endOfInput
-  return [a, b, c, d] as const
-})
+`as` turns a silent grammar into a constant. `flag` turns presence into a
+boolean:
 
-Effect.runSync(parse("192.168.1.1", ip))
-// { _tag: "Success", value: [192, 168, 1, 1] }
+```ts
+const jsonNull = Grammar.symbol("null").pipe(Grammar.as(null))
+const negate = Grammar.flag("-")
 ```
 
-## Releasing
+Recursion uses `suspend`:
 
-Add a changeset for a user-facing change:
+```ts
+const jsonValue: Grammar.Grammar<Json> = Grammar.suspend(
+  () =>
+    Grammar.choice(
+      jsonNull,
+      jsonBool,
+      jsonNumber,
+      jsonString,
+      jsonArray,
+      jsonObject,
+    ),
+  "value",
+)
+```
 
-```bash
-pnpm changeset
+See `examples/` for JSON, Scheme, a Postgres DSN, netstrings, and GitHub's
+search syntax.
+
+## Errors
+
+`choice` backtracks. Errors report the furthest position the parser reached and
+everything that could have matched there:
+
+```
+line 1, column 7: expected one of "null", "true", "false", number, string, "[", "{", found end of input
 ```
 
-After the change lands on `main`, the release workflow opens a version pull
-request. Merging that pull request publishes the package to npm.
+`label(name)` names a grammar for these messages.

package/dist/combinators.d.ts

@@ -1,28 +1,65 @@
-import { Effect } from "effect";
-import { ParseError } from "./error.ts";
-export declare const satisfy: (pred: (c: string) => boolean, expected: string) => Effect.Effect<string, ParseError | import("./error.ts").UpstreamError, import("./state.ts").ParseState>;
-export declare const char: (c: string) => Effect.Effect<string, ParseError | import("./error.ts").UpstreamError, import("./state.ts").ParseState>;
-export declare const digit: Effect.Effect<string, ParseError | import("./error.ts").UpstreamError, import("./state.ts").ParseState>;
-export declare const regex: (re: RegExp, expected: string) => Effect.Effect<string, ParseError | import("./error.ts").UpstreamError, import("./state.ts").ParseState>;
-export declare const endOfInput: Effect.Effect<undefined, ParseError | import("./error.ts").UpstreamError, import("./state.ts").ParseState>;
-/**
- * Ordered choice. Commits to `p` once it has consumed input — if `p` fails
- * after consuming, `q` is not tried. Wrap `p` in {@link attempt} to opt back
- * into backtracking.
- */
-export declare const or_: <A, E, R, B, E2, R2>(p: Effect.Effect<A, E, R>, q: Effect.Effect<B, E2, R2>) => Effect.Effect<A | B, E | E2, R | R2 | import("./state.ts").ParseState>;
-/**
- * Rewind on failure: run `p`, and if it fails, restore the input position so
- * an enclosing {@link or_} will try its next option. Errors keep their
- * original position for messages.
- */
-export declare const attempt: <A, E, R>(p: Effect.Effect<A, E, R>) => Effect.Effect<A, E, R | import("./state.ts").ParseState>;
-/**
- * Run `p` zero or more times (`atLeast` sets a minimum). If `p` fails after
- * consuming input, `many` fails too — wrap `p` in {@link attempt} to keep
- * collecting instead.
- */
-export declare const many: <A, E, R>(p: Effect.Effect<A, E, R>, opts?: {
-    atLeast?: number;
-}) => Effect.Effect<A[], E, R | import("./state.ts").ParseState>;
+import { Schema } from "effect";
+import { type Field, type Fields, type Grammar, type Silent, type Type } from "./core.ts";
+export { field } from "./core.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 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(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 function optional(inner: Silent): Silent;
+export declare function optional<A>(inner: Grammar<A>): Grammar<A | undefined>;
+export interface RepeatOptions {
+    readonly min?: number;
+    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>>;
+};
+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>>;
+};
+export interface TransformOptions<A, B> {
+    readonly decode: (a: A) => B;
+    readonly encode: (b: B) => A;
+    readonly is?: (value: B) => boolean;
+    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>;
+};
+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 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 skip: {
+    <A>(printAs: A): (inner: Grammar<A>) => Silent;
+    <A>(inner: Grammar<A>, printAs: A): Silent;
+};
+export declare const label: {
+    (name: string): <A>(inner: Grammar<A>) => Grammar<A>;
+    <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 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 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,EAAE,MAAM,EAAkB,MAAM,QAAQ,CAAA;AAE/C,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AAGvC,eAAO,MAAM,OAAO,SAAU,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,YAAY,MAAM,4GAMlE,CAAA;AAEJ,eAAO,MAAM,IAAI,MAAO,MAAM,4GAA+C,CAAA;AAE7E,eAAO,MAAM,KAAK,yGAAgD,CAAA;AAElE,eAAO,MAAM,KAAK,OAAQ,MAAM,YAAY,MAAM,4GAUjD,CAAA;AAED,eAAO,MAAM,UAAU,4GAGrB,CAAA;AAEF;;;;GAIG;AACH,eAAO,MAAM,GAAG,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,2EAc1F,CAAA;AAEJ;;;;GAIG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,6DAOtD,CAAA;AAEJ;;;;GAIG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,SAAS;IAAE,OAAO,CAAC,EAAE,MAAM,CAAA;CAAE,+DAmBhF,CAAA"}
+{"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"}

package/dist/combinators.js

@@ -1,95 +1,77 @@
-import { Effect, Option, Schema } from "effect";
-import { ParseError } from "./error.js";
-import { failHere, getPos, matchRegex, peek, seek } from "./state.js";
-export const satisfy = (pred, expected) => Effect.gen(function* () {
-    const c = yield* peek;
-    if (c === undefined || !pred(c))
-        return yield* failHere(expected);
-    yield* seek((yield* getPos) + 1);
-    return c;
-});
-export const char = (c) => satisfy((x) => x === c, JSON.stringify(c));
-export const digit = satisfy((c) => c >= "0" && c <= "9", "digit");
-export const regex = (re, expected) => {
-    // Drop g/y so sticky/global lastIndex cannot break sequential matches.
-    const normalized = new RegExp(re.source, re.flags.replace(/[gy]/g, ""));
-    return Effect.gen(function* () {
-        const pos = yield* getPos;
-        const m = yield* matchRegex(normalized);
-        if (Option.isNone(m))
-            return yield* failHere(expected);
-        yield* seek(pos + m.value.length);
-        return m.value;
+import { Equal, Function as F, Schema } from "effect";
+import { isField, isGrammar, isSilent, make, silent, } from "./core.js";
+import { preview } from "./errors.js";
+export { field } from "./core.js";
+export const literal = (value) => silent({ _tag: "Literal", value });
+export const empty = literal("");
+/** The regex is made sticky so the parser can match at a position without slicing. */
+export const regex = (re, name) => {
+    const flags = re.flags.replace(/[gy]/g, "");
+    return make({
+        _tag: "Regex",
+        re: new RegExp(re.source, `${flags}y`),
+        whole: new RegExp(`^(?:${re.source})$`, flags),
+        name,
     });
 };
-export const endOfInput = Effect.gen(function* () {
-    const c = yield* peek;
-    if (c !== undefined)
-        return yield* failHere("end of input");
-});
-/**
- * Ordered choice. Commits to `p` once it has consumed input — if `p` fails
- * after consuming, `q` is not tried. Wrap `p` in {@link attempt} to opt back
- * into backtracking.
- */
-export const or_ = (p, q) => Effect.gen(function* () {
-    const mark = yield* getPos;
-    const r1 = yield* Effect.result(p);
-    if (r1._tag === "Success")
-        return r1.success;
-    const e1 = r1.failure;
-    if (!Schema.is(ParseError)(e1))
-        return yield* Effect.fail(e1);
-    if ((yield* getPos) > mark)
-        return yield* e1;
-    yield* seek(mark);
-    const r2 = yield* Effect.result(q);
-    if (r2._tag === "Success")
-        return r2.success;
-    const e2 = r2.failure;
-    if (!Schema.is(ParseError)(e2))
-        return yield* Effect.fail(e2);
-    return yield* e2.pos >= e1.pos ? e2 : e1;
-});
-/**
- * Rewind on failure: run `p`, and if it fails, restore the input position so
- * an enclosing {@link or_} will try its next option. Errors keep their
- * original position for messages.
- */
-export const attempt = (p) => Effect.gen(function* () {
-    const mark = yield* getPos;
-    const r = yield* Effect.result(p);
-    if (r._tag === "Success")
-        return r.success;
-    if (Schema.is(ParseError)(r.failure))
-        yield* seek(mark);
-    return yield* Effect.fail(r.failure);
-});
-/**
- * Run `p` zero or more times (`atLeast` sets a minimum). If `p` fails after
- * consuming input, `many` fails too — wrap `p` in {@link attempt} to keep
- * collecting instead.
- */
-export const many = (p, opts) => Effect.gen(function* () {
-    const out = [];
-    const atLeast = opts?.atLeast ?? 0;
-    for (let i = 0; i < atLeast; i++)
-        out.push(yield* p);
-    while (true) {
-        const mark = yield* getPos;
-        const r = yield* Effect.result(p);
-        if (r._tag === "Failure") {
-            if (!Schema.is(ParseError)(r.failure))
-                return yield* Effect.fail(r.failure);
-            if ((yield* getPos) > mark)
-                return yield* r.failure;
-            yield* seek(mark);
-            return out;
-        }
-        if ((yield* getPos) === mark) {
-            return yield* Effect.die(new Error("many: parser succeeded without consuming input"));
-        }
-        out.push(r.success);
+const _toSilent = (s) => (isGrammar(s) ? s : literal(s));
+const _silentIf = (cond, node) => (cond ? silent(node) : make(node));
+export function seq(...parts) {
+    return _silentIf(!parts.some(isField), { _tag: "Seq", parts });
+}
+export const gen = (run) => make({ _tag: "Gen", run });
+export function wrap(open, inner, close) {
+    return _silentIf(isSilent(inner), {
+        _tag: "Wrap",
+        open: _toSilent(open),
+        inner,
+        close: _toSilent(close),
+    });
+}
+export function prefix(open, inner) {
+    return wrap(open, inner, empty);
+}
+export function suffix(inner, close) {
+    return wrap(empty, inner, close);
+}
+export const choice = (...options) => make({ _tag: "Choice", options });
+export function optional(inner) {
+    return _silentIf(isSilent(inner), { _tag: "Optional", inner });
+}
+const bounds = (name, opts) => {
+    const min = opts?.min ?? 0;
+    const max = opts?.max ?? Number.POSITIVE_INFINITY;
+    if (!Number.isSafeInteger(min) || min < 0) {
+        throw new RangeError(`${name}: min must be a non-negative safe integer`);
+    }
+    if (max !== Number.POSITIVE_INFINITY && !(Number.isSafeInteger(max) && max >= min)) {
+        throw new RangeError(`${name}: max must be a safe integer >= min`);
     }
-});
+    return { min, max };
+};
+const _dataFirst = (args) => isGrammar(args[0]);
+export const many = F.dual(_dataFirst, (inner, opts) => make({ _tag: "Many", inner, sep: empty, ...bounds("many", opts) }));
+export const sepBy = F.dual(_dataFirst, (inner, sep, opts) => make({ _tag: "Many", inner, sep: _toSilent(sep), ...bounds("sepBy", opts) }));
+export const transform = F.dual(2, (inner, f) => make({ _tag: "Transform", inner, ...f }));
+export const decodeTo = (schema) => (f) => (inner) => {
+    let is;
+    return transform(inner, { ...f, is: f.is ?? ((value) => (is ??= Schema.is(schema))(value)) });
+};
+export const as = F.dual(2, (inner, value) => transform(inner, {
+    decode: () => value,
+    encode: () => undefined,
+    is: (u) => Equal.equals(u, value),
+    name: preview(value),
+}));
+export const flag = (s) => choice(as(_toSilent(s), true), as(empty, false));
+export const skip = F.dual(2, (inner, printAs) => silent({ _tag: "Skip", inner, printAs, show: true }));
+export const label = F.dual(2, (inner, name) => make({ _tag: "Label", inner, name }));
+export const suspend = (thunk, name) => make({ _tag: "Suspend", thunk, name });
+const hiddenWhitespace = (printAs) => silent({ _tag: "Skip", inner: regex(/\s*/, "whitespace"), printAs, show: false });
+export const whitespace = hiddenWhitespace("");
+export function lexeme(inner) {
+    return suffix(inner, hiddenWhitespace(" "));
+}
+export const symbol = (s) => lexeme(literal(s));
+export const integer = regex(/-?\d+/, "integer").pipe(transform({ decode: Number, encode: String, is: Number.isSafeInteger, name: "integer" }));
 //# sourceMappingURL=combinators.js.map

package/dist/combinators.js.map

@@ -1 +1 @@
-{"version":3,"file":"combinators.js","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAE/C,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AACvC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAErE,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAA4B,EAAE,QAAgB,EAAE,EAAE,CACxE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAA;IACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;IACjE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAA;IAChC,OAAO,CAAC,CAAA;AACV,CAAC,CAAC,CAAA;AAEJ,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;AAE7E,MAAM,CAAC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,OAAO,CAAC,CAAA;AAElE,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,QAAgB,EAAE,EAAE;IACpD,uEAAuE;IACvE,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAA;IACvE,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,MAAM,CAAA;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;QACvC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;QACtD,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QACjC,OAAO,CAAC,CAAC,KAAK,CAAA;IAChB,CAAC,CAAC,CAAA;AACJ,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAA;IACrB,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAA;AAC7D,CAAC,CAAC,CAAA;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAqB,CAAyB,EAAE,CAA2B,EAAE,EAAE,CAChG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,MAAM,CAAA;IAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IAClC,IAAI,EAAE,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC,OAAO,CAAA;IAC5C,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAA;IACrB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC7D,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI;QAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAA;IAC5C,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACjB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IAClC,IAAI,EAAE,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC,OAAO,CAAA;IAC5C,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAA;IACrB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC7D,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;AAC1C,CAAC,CAAC,CAAA;AAEJ;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAU,CAAyB,EAAE,EAAE,CAC5D,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,MAAM,CAAA;IAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACjC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,OAAO,CAAA;IAC1C,IAAI,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACvD,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;AACtC,CAAC,CAAC,CAAA;AAEJ;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAU,CAAyB,EAAE,IAA2B,EAAE,EAAE,CACtF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,IAAI,CAAC,CAAA;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IACpD,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,MAAM,CAAA;QAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;YAC3E,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI;gBAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAA;YACnD,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACjB,OAAO,GAAG,CAAA;QACZ,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC,CAAA;QACvF,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;IACrB,CAAC;AACH,CAAC,CAAC,CAAA"}
+{"version":3,"file":"combinators.js","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,QAAQ,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAErD,OAAO,EAKL,OAAO,EACP,SAAS,EACT,QAAQ,EACR,IAAI,EAIJ,MAAM,GAEP,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAA;AAErC,OAAO,EAAE,KAAK,EAAE,MAAM,WAAW,CAAA;AAEjC,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAA;AAE5E,MAAM,CAAC,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;AAEhC,sFAAsF;AACtF,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,IAAY,EAAmB,EAAE;IACjE,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAA;IAC3C,OAAO,IAAI,CAAC;QACV,IAAI,EAAE,OAAO;QACb,EAAE,EAAE,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC;QACtC,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC,MAAM,IAAI,EAAE,KAAK,CAAC;QAC9C,IAAI;KACL,CAAC,CAAA;AACJ,CAAC,CAAA;AAED,MAAM,SAAS,GAAG,CAAC,CAAkB,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;AAEzE,MAAM,SAAS,GAAG,CAAC,IAAa,EAAE,IAAU,EAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;AAMxF,MAAM,UAAU,GAAG,CAAC,GAAG,KAA0B;IAC/C,OAAO,SAAS,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;AAChE,CAAC;AAED,MAAM,CAAC,MAAM,GAAG,GAAG,CACjB,GAA+B,EACc,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;AAQ5E,MAAM,UAAU,IAAI,CAAC,IAAqB,EAAE,KAAmB,EAAE,KAAsB;IACrF,OAAO,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;QAChC,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC;QACrB,KAAK;QACL,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC;KACxB,CAAC,CAAA;AACJ,CAAC;AAID,MAAM,UAAU,MAAM,CAAC,IAAqB,EAAE,KAAmB;IAC/D,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;AACjC,CAAC;AAID,MAAM,UAAU,MAAM,CAAC,KAAmB,EAAE,KAAsB;IAChE,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;AAClC,CAAC;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CACpB,GAAG,OAAW,EACa,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAA;AAIjE,MAAM,UAAU,QAAQ,CAAC,KAAmB;IAC1C,OAAO,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAA;AAChE,CAAC;AAOD,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,IAA+B,EAAU,EAAE;IACvE,MAAM,GAAG,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAA;IAC1B,MAAM,GAAG,GAAG,IAAI,EAAE,GAAG,IAAI,MAAM,CAAC,iBAAiB,CAAA;IACjD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,2CAA2C,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,GAAG,KAAK,MAAM,CAAC,iBAAiB,IAAI,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;QACnF,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,qCAAqC,CAAC,CAAA;IACpE,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;AACrB,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CAAC,IAAgB,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AAE3D,MAAM,CAAC,MAAM,IAAI,GAGb,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,CAAI,KAAiB,EAAE,IAAoB,EAAE,EAAE,CACpE,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CACnE,CAAA;AAED,MAAM,CAAC,MAAM,KAAK,GAGd,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,CAAI,KAAiB,EAAE,GAAoB,EAAE,IAAoB,EAAE,EAAE,CAC1F,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAC7E,CAAA;AASD,MAAM,CAAC,MAAM,SAAS,GAGlB,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAO,KAAiB,EAAE,CAAyB,EAAE,EAAE,CACnE,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CACzC,CAAA;AAMD,MAAM,CAAC,MAAM,QAAQ,GACnB,CAAI,MAAkD,EAAE,EAAE,CAC1D,CAAI,CAAwB,EAAE,EAAE,CAChC,CAAC,KAAiB,EAAE,EAAE;IACpB,IAAI,EAAuC,CAAA;IAC3C,OAAO,SAAS,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;AAC/F,CAAC,CAAA;AAEH,MAAM,CAAC,MAAM,EAAE,GAGX,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAU,KAAa,EAAE,KAAQ,EAAE,EAAE,CACjD,SAAS,CAAC,KAAK,EAAE;IACf,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK;IACnB,MAAM,EAAE,GAAG,EAAE,CAAC,SAAS;IACvB,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC;IACjC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC;CACrB,CAAC,CACH,CAAA;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAkB,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;AAE5F,MAAM,CAAC,MAAM,IAAI,GAGb,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAI,KAAiB,EAAE,OAAU,EAAE,EAAE,CACjD,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CACrD,CAAA;AAED,MAAM,CAAC,MAAM,KAAK,GAGd,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAI,KAAiB,EAAE,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;AAE3F,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,KAAuB,EAAE,IAAa,EAAc,EAAE,CAC/E,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;AAExC,MAAM,gBAAgB,GAAG,CAAC,OAAe,EAAU,EAAE,CACnD,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;AAEnF,MAAM,CAAC,MAAM,UAAU,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAA;AAI9C,MAAM,UAAU,MAAM,CAAC,KAAmB;IACxC,OAAO,MAAM,CAAC,KAAK,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA;AAC7C,CAAC;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;AAEvD,MAAM,CAAC,MAAM,OAAO,GAAoB,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,IAAI,CACpE,SAAS,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,aAAa,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CACzF,CAAA"}