@thomasfosterau/effect-parse 0.2.0 → 0.3.0

package/README.md

@@ -54,6 +54,7 @@ The package was developed as `effect-nom`. Releases and the changelog are manage
 - [Errors](#errors)
 - [Streaming and partial input](#streaming-and-partial-input)
 - [Services](#services)
+- [Parsers from schemas](#parsers-from-schemas)
 - [Unicode text and encodings](#unicode-text-and-encodings)
 - [Syntax trees and incremental parsing](#syntax-trees-and-incremental-parsing)
 - [Modules](#modules)
@@ -212,6 +213,7 @@ Repetition ranges follow winnow: `Parser.repeat(p)` matches zero or more times,
 | `Parser.parseRecoverable(p, input)` | `{ value: Option<A>, errors }` with error recovery enabled |
 | `ParserStream.parseMany(p)` | `Stream<I> => Stream<A>` (see [Streaming](#streaming-and-partial-input)) |
 | `ParserSchema.make(p)` | a `Schema` decoding strings with the parser |
+| `ParserSchema.fromSchema(s)` | a `Schema` decoding strings with the parser derived from `s`, and encoding with the derived printer (see [Parsers from schemas](#parsers-from-schemas)) |
 | `Syntax.parse(p, input)` | a `Syntax.Tree`: a syntax tree, the value and the errors (see [Syntax trees](#syntax-trees-and-incremental-parsing)) |
 
 Every `Parser` runner takes an `offset` option, to start parsing part-way into the input. The result is that of parsing `input.slice(offset)`, without the copy, and offsets (`Done`'s `offset`, spans, `ParseError` offsets, lines and columns) are positions in the whole input. A lexer can read one token at a time from a buffer, compiled parsers included:
@@ -378,6 +380,47 @@ Parser.parse(Parser.provideService(number, Radix, 16), "ff") // 255
 Parser.parseEffect(number, "777").pipe(Effect.provideService(Radix, 8)) // Effect<511>
 ```
 
+## Parsers from schemas
+
+`ParserSchema.toParser` derives a parser from an Effect `Schema`, and `ParserSchema.toPrinter` the printer that writes the same text, so a text format can be declared once, as the schema of the values it holds. Annotations, set with `ParserSchema.annotate` (under the key `ParserSchema.annotationKey`), say how each part is written: a `prefix` and `suffix`, the `separator` between fields, elements or entries, the `keySeparator` of `key=value` entries, whether `whitespace` may surround that text, or a `parser` and `print` that replace the derived ones.
+
+```ts
+import { Schema } from "effect"
+
+const Point = Schema.Struct({ x: Schema.Int, y: Schema.Int }).pipe(
+  ParserSchema.annotate({ prefix: "(", separator: ",", suffix: ")", whitespace: true })
+)
+
+const Config = Schema.Struct({
+  name: Schema.String,
+  origin: Point,
+  color: Schema.optionalKey(
+    Schema.Int.pipe(ParserSchema.annotate({ parser: Ascii.hexUint, print: (n) => n.toString(16), prefix: "#" }))
+  )
+}).pipe(ParserSchema.annotate({ separator: ";", keySeparator: "=" }))
+
+const config = ParserSchema.toParser(Config)
+Parser.parse(config, "origin=( 1, -2 );name=main;color=#ff")
+// Result.succeed({ name: "main", origin: { x: 1, y: -2 }, color: 255 })
+
+Parser.parse(config, "name=main;origin=(1,x)")
+// Result.fail(ParseError):
+//   Parse error at line 1, column 21:
+//   1 | name=main;origin=(1,x)
+//     |                     ^
+//   expected one of "+-" or digit, found "x"
+
+const print = ParserSchema.toPrinter(Config)
+print({ name: "main", origin: { x: 1, y: -2 }, color: 255 })
+// Result.succeed("name=main;origin=(1,-2);color=#ff")
+```
+
+Without annotations, a struct or tuple is its fields in order, an array its elements, a union its first member that parses, and a `suspend`ed schema recursion. A string runs to the next separator or suffix; a number is decimal, and an integer when the schema checks `isInt`. A record, or a struct with a `keySeparator`, is `key=value` entries in any order. A schema's checks and transformations (a `Class`, `NumberFromString`, a brand) run as `Schema.decode` runs them, and their failures are parse errors whose `cause` is the `SchemaError`. The doc comment of `toParser` lists every rule.
+
+A printer writes the text its parser reads, without optional whitespace, and fails with a `SchemaError` on a value it cannot write so that it reads back: a string holding the separator that would end it, or a part with a `parser` but no `print`.
+
+A derived parser is an ordinary parser: it composes with the combinators, and the [compilers](#compiled-parsers) compile it. `ParserSchema.fromSchema(schema)` wraps the parser and the printer as a `Schema` from `string`. Encoding parses the printed text back, and fails if that gives a different value, so decoding what it encoded always gives the value back, even where the grammar is ambiguous.
+
 ## Unicode text and encodings
 
 `Token` reads strings by code point, but the `Ascii` character classes and numbers only cover ASCII, and they treat bytes as ASCII. The `Text` module adds Unicode parsers that work with any encoding. `Text.make(encoding)` builds a set of parsers (`Text.TextParsers<I>`), and sets are provided for the common encodings:
@@ -480,7 +523,7 @@ On a 0.58 M-character JSON document (`vp run bench:syntax`), building the tree t
 | `Compiler` | `jit`, `closure`: [compiled parsers](#compiled-parsers) | — |
 | `ParseError` | the error type, `lineColumn`, `formatExpected` | `error` |
 | `ParserStream` | `parseMany`, `parseAll` over Effect `Stream`s | `Partial` / `streaming` |
-| `ParserSchema` | `make`: a `Schema` from a parser | — |
+| `ParserSchema` | `make`: a `Schema` from a parser; `toParser`, `toPrinter`, `fromSchema`, `annotate`: a parser and printer from an annotated `Schema` | — |
 | `Syntax` | syntax trees: `node`, `token`, `field`, `parse`, incremental `reparse` and `replace`, `Tree`, `SyntaxNode`, `TreeCursor` | — (Tree-sitter) |
 | `Nom` | nom names and argument orders (`tag`, `many0`, `separatedList1`, `mapRes`, …) | nom |
 | `Input` | input types and the `State` cursor for `Parser.make` | `stream` |

package/dist/Expression.js

@@ -1,5 +1,6 @@
-import { Fail, mergeFailures } from "./Input.js";
+import { Fail } from "./Input.js";
 import { make as make$1 } from "./Parser.js";
+import { TiedFailures } from "./internal/ties.js";
 //#region src/Expression.ts
 /**
 * A prefix operator, e.g. unary minus.
@@ -70,7 +71,7 @@ const make = (options) => {
 	const postfixes = options.operators.filter((o) => o._tag === "Postfix");
 	const infixes = options.operators.filter((o) => o._tag === "Infix");
 	let matched;
-	let failure;
+	const failures = new TiedFailures();
 	const tryOps = (state, ops, mustConsume) => {
 		const start = state.pos;
 		for (let i = 0; i < ops.length; i++) {
@@ -84,14 +85,14 @@ const make = (options) => {
 				return i;
 			}
 			if (state.mode !== "Backtrack") return -2;
-			failure = failure === void 0 ? state.failure : mergeFailures(failure, state.failure);
 			state.pos = start;
+			failures.add(state);
 		}
 		return -1;
 	};
 	const expr = (state, minPower) => {
 		let lhs;
-		failure = void 0;
+		failures.clear();
 		const p = tryOps(state, prefixes, true);
 		if (p === -2) return Fail;
 		if (p >= 0) {
@@ -101,16 +102,24 @@ const make = (options) => {
 			if (operandValue === Fail) return Fail;
 			lhs = op.fold(opOut, operandValue);
 		} else {
-			const prefixFailure = failure;
+			const prefixFailure = failures.failure;
+			const prefixTie1 = failures.tie1;
+			const prefixTie2 = failures.tie2;
 			lhs = operand(state);
 			if (lhs === Fail) {
-				if (prefixFailure !== void 0 && state.mode === "Backtrack") state.failWith("Backtrack", mergeFailures(prefixFailure, state.failure));
+				if (prefixFailure !== void 0 && state.mode === "Backtrack") {
+					failures.failure = prefixFailure;
+					failures.tie1 = prefixTie1;
+					failures.tie2 = prefixTie2;
+					failures.add(state);
+					failures.fail(state);
+				}
 				return Fail;
 			}
 		}
 		while (true) {
 			const start = state.pos;
-			failure = void 0;
+			failures.clear();
 			const q = tryOps(state, postfixes, true);
 			if (q === -2) return Fail;
 			if (q >= 0) {
@@ -122,12 +131,10 @@ const make = (options) => {
 				lhs = op.fold(lhs, matched);
 				continue;
 			}
-			const postfixFailure = failure;
 			const i = tryOps(state, infixes, false);
 			if (i === -2) return Fail;
 			if (i < 0) {
-				const f = postfixFailure === void 0 ? failure : failure === void 0 ? postfixFailure : mergeFailures(postfixFailure, failure);
-				if (f !== void 0 && f.offset === state.pos) state.setHint(f.offset, f.expected);
+				failures.hint(state);
 				break;
 			}
 			const op = infixes[i];

package/dist/Expression.js.map

@@ -1 +1 @@
-{"version":3,"file":"Expression.js","names":["makeParser"],"sources":["../src/Expression.ts"],"sourcesContent":["/**\n * Operator-precedence expression parsing with a Pratt parser (from\n * `nom-language`'s `precedence`, and winnow's expression parser).\n *\n * Describe the operand parser and a table of prefix, postfix and infix\n * operators with their precedence (higher binds tighter) and associativity.\n * Each operator carries a function that folds its operands into a result.\n *\n * @example\n * ```ts\n * import { Ascii, Expression, Parser, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const op = (s: string) => Parser.delimited(Ascii.space0, Token.literal(s), Ascii.space0)\n *\n * const arithmetic: Parser.Parser<number, string> = Expression.make({\n *   operand: Parser.alt(\n *     Ascii.decInt,\n *     Parser.delimited(op(\"(\"), Parser.suspend(() => arithmetic), op(\")\"))\n *   ),\n *   operators: [\n *     Expression.prefix(op(\"-\"), 4, (_, x) => -x),\n *     Expression.postfix(op(\"!\"), 5, (x) => factorial(x)),\n *     Expression.infixRight(op(\"^\"), 3, (l, _, r) => l ** r),\n *     Expression.infixLeft(op(\"*\"), 2, (l, _, r) => l * r),\n *     Expression.infixLeft(op(\"/\"), 2, (l, _, r) => l / r),\n *     Expression.infixLeft(op(\"+\"), 1, (l, _, r) => l + r),\n *     Expression.infixLeft(op(\"-\"), 1, (l, _, r) => l - r)\n *   ]\n * })\n *\n * declare const factorial: (n: number) => number\n * Parser.parse(arithmetic, \"1 + 2 * 3 ^ 2\") // Result.succeed(19)\n * ```\n *\n * @since 0.1.0\n */\nimport type { Input, State } from \"./Input.js\"\nimport { Fail, mergeFailures } from \"./Input.js\"\nimport type { Failure } from \"./Input.js\"\nimport type { Parser } from \"./Parser.js\"\nimport { make as makeParser } from \"./Parser.js\"\n\n/**\n * An operator in an expression grammar.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Operator<A, E = never, R = never, I extends Input = string> =\n  | Prefix<A, E, R, I>\n  | Postfix<A, E, R, I>\n  | Infix<A, E, R, I>\n\ninterface OperatorBase<E, R, I extends Input> {\n  readonly parser: Parser<unknown, E, R, I>\n  readonly precedence: number\n}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Prefix<A, E = never, R = never, I extends Input = string> extends OperatorBase<E, R, I> {\n  readonly _tag: \"Prefix\"\n  readonly fold: (op: any, operand: A) => A\n}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Postfix<A, E = never, R = never, I extends Input = string> extends OperatorBase<E, R, I> {\n  readonly _tag: \"Postfix\"\n  readonly fold: (operand: A, op: any) => A\n}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Infix<A, E = never, R = never, I extends Input = string> extends OperatorBase<E, R, I> {\n  readonly _tag: \"Infix\"\n  readonly associativity: \"left\" | \"right\"\n  readonly fold: (left: A, op: any, right: A) => A\n}\n\n/**\n * A prefix operator, e.g. unary minus.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const prefix = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (op: O, operand: A) => A\n): Prefix<A, E, R, I> => ({ _tag: \"Prefix\", parser, precedence, fold })\n\n/**\n * A postfix operator, e.g. factorial or a function call suffix.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const postfix = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (operand: A, op: O) => A\n): Postfix<A, E, R, I> => ({ _tag: \"Postfix\", parser, precedence, fold })\n\n/**\n * A left-associative infix operator: `a - b - c` is `(a - b) - c`.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const infixLeft = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (left: A, op: O, right: A) => A\n): Infix<A, E, R, I> => ({ _tag: \"Infix\", associativity: \"left\", parser, precedence, fold })\n\n/**\n * A right-associative infix operator: `a ^ b ^ c` is `a ^ (b ^ c)`.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const infixRight = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (left: A, op: O, right: A) => A\n): Infix<A, E, R, I> => ({ _tag: \"Infix\", associativity: \"right\", parser, precedence, fold })\n\ntype OpError<Op> = Op extends OperatorBase<infer E, infer _R, infer _I> ? E : never\ntype OpServices<Op> = Op extends OperatorBase<infer _E, infer R, infer _I> ? R : never\ntype OpInput<Op> = [Op] extends [never] ? Input : [Op] extends [OperatorBase<infer _E, infer _R, infer I>] ? I : never\n\n/**\n * Builds an expression parser from an operand parser and an operator table.\n *\n * Precedences are compared numerically: higher binds tighter. A prefix\n * operator applies to everything that binds tighter than it, so with `-`\n * at precedence 4 and `^` at 3, `-2 ^ 2` parses as `(-2) ^ 2`.\n *\n * When several operators of the same kind match, the first one in the\n * table wins, so list longer operators (`<=`) before their prefixes (`<`).\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const make = <A, E, R, I extends Input, const Ops extends ReadonlyArray<Operator<A, any, any, any>>>(options: {\n  readonly operand: Parser<A, E, R, I>\n  readonly operators: Ops\n}): Parser<A, E | OpError<Ops[number]>, R | OpServices<Ops[number]>, I & OpInput<Ops[number]>> => {\n  const operand = options.operand.step\n  const prefixes = options.operators.filter((o): o is Prefix<A, any, any, any> => o._tag === \"Prefix\")\n  const postfixes = options.operators.filter((o): o is Postfix<A, any, any, any> => o._tag === \"Postfix\")\n  const infixes = options.operators.filter((o): o is Infix<A, any, any, any> => o._tag === \"Infix\")\n\n  // Attempts each operator in turn. Returns the index of the first match\n  // (with its output in `matched`), -1 if none matched, or -2 on a fatal\n  // failure. Expectations of failed attempts are accumulated in `failure`.\n  let matched: unknown\n  let failure: Failure | undefined\n  const tryOps = (state: State<any>, ops: ReadonlyArray<OperatorBase<any, any, any>>, mustConsume: boolean): number => {\n    const start = state.pos\n    for (let i = 0; i < ops.length; i++) {\n      const out = ops[i].parser.step(state)\n      if (out !== Fail) {\n        // A prefix or postfix operator matching nothing would apply forever\n        if (mustConsume && state.pos === start) {\n          state.failMessage(\"Cut\", \"Assert\", \"prefix and postfix operators must always consume\")\n          return -2\n        }\n        matched = out\n        return i\n      }\n      if (state.mode !== \"Backtrack\") return -2\n      failure = failure === undefined ? state.failure : mergeFailures(failure, state.failure)\n      state.pos = start\n    }\n    return -1\n  }\n\n  const expr = (state: State<any>, minPower: number): A | Fail => {\n    let lhs: A | Fail\n    failure = undefined\n    const p = tryOps(state, prefixes, true)\n    if (p === -2) return Fail\n    if (p >= 0) {\n      const op = prefixes[p]\n      const opOut = matched\n      const operandValue = expr(state, op.precedence * 2)\n      if (operandValue === Fail) return Fail\n      lhs = op.fold(opOut, operandValue)\n    } else {\n      const prefixFailure = failure\n      lhs = operand(state)\n      if (lhs === Fail) {\n        if (prefixFailure !== undefined && state.mode === \"Backtrack\") {\n          state.failWith(\"Backtrack\", mergeFailures(prefixFailure, state.failure))\n        }\n        return Fail\n      }\n    }\n\n    while (true) {\n      const start = state.pos\n      failure = undefined\n      const q = tryOps(state, postfixes, true)\n      if (q === -2) return Fail\n      if (q >= 0) {\n        const op = postfixes[q]\n        if (op.precedence * 2 < minPower) {\n          state.pos = start\n          break\n        }\n        lhs = op.fold(lhs, matched)\n        continue\n      }\n      const postfixFailure = failure\n      const i = tryOps(state, infixes, false)\n      if (i === -2) return Fail\n      if (i < 0) {\n        const f =\n          postfixFailure === undefined\n            ? failure\n            : failure === undefined\n              ? postfixFailure\n              : mergeFailures(postfixFailure, failure)\n        if (f !== undefined && f.offset === state.pos) state.setHint(f.offset, f.expected)\n        break\n      }\n      const op = infixes[i]\n      const leftPower = op.precedence * 2\n      if (leftPower < minPower) {\n        state.pos = start\n        break\n      }\n      const opOut = matched\n      const rhs = expr(state, op.associativity === \"left\" ? leftPower + 1 : leftPower)\n      if (rhs === Fail) return Fail\n      lhs = op.fold(lhs, opOut, rhs)\n    }\n    return lhs\n  }\n\n  return makeParser((state: State<any>) => expr(state, 0), \"expression\")\n}\n"],"mappings":";;;;;;;;;AA4FA,MAAa,UACX,QACA,YACA,UACwB;CAAE,MAAM;CAAU;CAAQ;CAAY;AAAK;;;;;;;AAQrE,MAAa,WACX,QACA,YACA,UACyB;CAAE,MAAM;CAAW;CAAQ;CAAY;AAAK;;;;;;;AAQvE,MAAa,aACX,QACA,YACA,UACuB;CAAE,MAAM;CAAS,eAAe;CAAQ;CAAQ;CAAY;AAAK;;;;;;;AAQ1F,MAAa,cACX,QACA,YACA,UACuB;CAAE,MAAM;CAAS,eAAe;CAAS;CAAQ;CAAY;AAAK;;;;;;;;;;;;;;AAmB3F,MAAa,QAA+F,YAGV;CAChG,MAAM,UAAU,QAAQ,QAAQ;CAChC,MAAM,WAAW,QAAQ,UAAU,QAAQ,MAAqC,EAAE,SAAS,QAAQ;CACnG,MAAM,YAAY,QAAQ,UAAU,QAAQ,MAAsC,EAAE,SAAS,SAAS;CACtG,MAAM,UAAU,QAAQ,UAAU,QAAQ,MAAoC,EAAE,SAAS,OAAO;CAKhG,IAAI;CACJ,IAAI;CACJ,MAAM,UAAU,OAAmB,KAAiD,gBAAiC;EACnH,MAAM,QAAQ,MAAM;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACnC,MAAM,MAAM,IAAI,EAAE,CAAC,OAAO,KAAK,KAAK;GACpC,IAAI,QAAQ,MAAM;IAEhB,IAAI,eAAe,MAAM,QAAQ,OAAO;KACtC,MAAM,YAAY,OAAO,UAAU,kDAAkD;KACrF,OAAO;IACT;IACA,UAAU;IACV,OAAO;GACT;GACA,IAAI,MAAM,SAAS,aAAa,OAAO;GACvC,UAAU,YAAY,KAAA,IAAY,MAAM,UAAU,cAAc,SAAS,MAAM,OAAO;GACtF,MAAM,MAAM;EACd;EACA,OAAO;CACT;CAEA,MAAM,QAAQ,OAAmB,aAA+B;EAC9D,IAAI;EACJ,UAAU,KAAA;EACV,MAAM,IAAI,OAAO,OAAO,UAAU,IAAI;EACtC,IAAI,MAAM,IAAI,OAAO;EACrB,IAAI,KAAK,GAAG;GACV,MAAM,KAAK,SAAS;GACpB,MAAM,QAAQ;GACd,MAAM,eAAe,KAAK,OAAO,GAAG,aAAa,CAAC;GAClD,IAAI,iBAAiB,MAAM,OAAO;GAClC,MAAM,GAAG,KAAK,OAAO,YAAY;EACnC,OAAO;GACL,MAAM,gBAAgB;GACtB,MAAM,QAAQ,KAAK;GACnB,IAAI,QAAQ,MAAM;IAChB,IAAI,kBAAkB,KAAA,KAAa,MAAM,SAAS,aAChD,MAAM,SAAS,aAAa,cAAc,eAAe,MAAM,OAAO,CAAC;IAEzE,OAAO;GACT;EACF;EAEA,OAAO,MAAM;GACX,MAAM,QAAQ,MAAM;GACpB,UAAU,KAAA;GACV,MAAM,IAAI,OAAO,OAAO,WAAW,IAAI;GACvC,IAAI,MAAM,IAAI,OAAO;GACrB,IAAI,KAAK,GAAG;IACV,MAAM,KAAK,UAAU;IACrB,IAAI,GAAG,aAAa,IAAI,UAAU;KAChC,MAAM,MAAM;KACZ;IACF;IACA,MAAM,GAAG,KAAK,KAAK,OAAO;IAC1B;GACF;GACA,MAAM,iBAAiB;GACvB,MAAM,IAAI,OAAO,OAAO,SAAS,KAAK;GACtC,IAAI,MAAM,IAAI,OAAO;GACrB,IAAI,IAAI,GAAG;IACT,MAAM,IACJ,mBAAmB,KAAA,IACf,UACA,YAAY,KAAA,IACV,iBACA,cAAc,gBAAgB,OAAO;IAC7C,IAAI,MAAM,KAAA,KAAa,EAAE,WAAW,MAAM,KAAK,MAAM,QAAQ,EAAE,QAAQ,EAAE,QAAQ;IACjF;GACF;GACA,MAAM,KAAK,QAAQ;GACnB,MAAM,YAAY,GAAG,aAAa;GAClC,IAAI,YAAY,UAAU;IACxB,MAAM,MAAM;IACZ;GACF;GACA,MAAM,QAAQ;GACd,MAAM,MAAM,KAAK,OAAO,GAAG,kBAAkB,SAAS,YAAY,IAAI,SAAS;GAC/E,IAAI,QAAQ,MAAM,OAAO;GACzB,MAAM,GAAG,KAAK,KAAK,OAAO,GAAG;EAC/B;EACA,OAAO;CACT;CAEA,OAAOA,QAAY,UAAsB,KAAK,OAAO,CAAC,GAAG,YAAY;AACvE"}
+{"version":3,"file":"Expression.js","names":["makeParser"],"sources":["../src/Expression.ts"],"sourcesContent":["/**\n * Operator-precedence expression parsing with a Pratt parser (from\n * `nom-language`'s `precedence`, and winnow's expression parser).\n *\n * Describe the operand parser and a table of prefix, postfix and infix\n * operators with their precedence (higher binds tighter) and associativity.\n * Each operator carries a function that folds its operands into a result.\n *\n * @example\n * ```ts\n * import { Ascii, Expression, Parser, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const op = (s: string) => Parser.delimited(Ascii.space0, Token.literal(s), Ascii.space0)\n *\n * const arithmetic: Parser.Parser<number, string> = Expression.make({\n *   operand: Parser.alt(\n *     Ascii.decInt,\n *     Parser.delimited(op(\"(\"), Parser.suspend(() => arithmetic), op(\")\"))\n *   ),\n *   operators: [\n *     Expression.prefix(op(\"-\"), 4, (_, x) => -x),\n *     Expression.postfix(op(\"!\"), 5, (x) => factorial(x)),\n *     Expression.infixRight(op(\"^\"), 3, (l, _, r) => l ** r),\n *     Expression.infixLeft(op(\"*\"), 2, (l, _, r) => l * r),\n *     Expression.infixLeft(op(\"/\"), 2, (l, _, r) => l / r),\n *     Expression.infixLeft(op(\"+\"), 1, (l, _, r) => l + r),\n *     Expression.infixLeft(op(\"-\"), 1, (l, _, r) => l - r)\n *   ]\n * })\n *\n * declare const factorial: (n: number) => number\n * Parser.parse(arithmetic, \"1 + 2 * 3 ^ 2\") // Result.succeed(19)\n * ```\n *\n * @since 0.1.0\n */\nimport type { Input, State } from \"./Input.js\"\nimport { Fail } from \"./Input.js\"\nimport type { Parser } from \"./Parser.js\"\nimport { make as makeParser } from \"./Parser.js\"\nimport { TiedFailures } from \"./internal/ties.js\"\n\n/**\n * An operator in an expression grammar.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Operator<A, E = never, R = never, I extends Input = string> =\n  | Prefix<A, E, R, I>\n  | Postfix<A, E, R, I>\n  | Infix<A, E, R, I>\n\ninterface OperatorBase<E, R, I extends Input> {\n  readonly parser: Parser<unknown, E, R, I>\n  readonly precedence: number\n}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Prefix<A, E = never, R = never, I extends Input = string> extends OperatorBase<E, R, I> {\n  readonly _tag: \"Prefix\"\n  readonly fold: (op: any, operand: A) => A\n}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Postfix<A, E = never, R = never, I extends Input = string> extends OperatorBase<E, R, I> {\n  readonly _tag: \"Postfix\"\n  readonly fold: (operand: A, op: any) => A\n}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Infix<A, E = never, R = never, I extends Input = string> extends OperatorBase<E, R, I> {\n  readonly _tag: \"Infix\"\n  readonly associativity: \"left\" | \"right\"\n  readonly fold: (left: A, op: any, right: A) => A\n}\n\n/**\n * A prefix operator, e.g. unary minus.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const prefix = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (op: O, operand: A) => A\n): Prefix<A, E, R, I> => ({ _tag: \"Prefix\", parser, precedence, fold })\n\n/**\n * A postfix operator, e.g. factorial or a function call suffix.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const postfix = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (operand: A, op: O) => A\n): Postfix<A, E, R, I> => ({ _tag: \"Postfix\", parser, precedence, fold })\n\n/**\n * A left-associative infix operator: `a - b - c` is `(a - b) - c`.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const infixLeft = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (left: A, op: O, right: A) => A\n): Infix<A, E, R, I> => ({ _tag: \"Infix\", associativity: \"left\", parser, precedence, fold })\n\n/**\n * A right-associative infix operator: `a ^ b ^ c` is `a ^ (b ^ c)`.\n *\n * @since 0.1.0\n * @category operators\n */\nexport const infixRight = <O, E, R, I extends Input, A>(\n  parser: Parser<O, E, R, I>,\n  precedence: number,\n  fold: (left: A, op: O, right: A) => A\n): Infix<A, E, R, I> => ({ _tag: \"Infix\", associativity: \"right\", parser, precedence, fold })\n\ntype OpError<Op> = Op extends OperatorBase<infer E, infer _R, infer _I> ? E : never\ntype OpServices<Op> = Op extends OperatorBase<infer _E, infer R, infer _I> ? R : never\ntype OpInput<Op> = [Op] extends [never] ? Input : [Op] extends [OperatorBase<infer _E, infer _R, infer I>] ? I : never\n\n/**\n * Builds an expression parser from an operand parser and an operator table.\n *\n * Precedences are compared numerically: higher binds tighter. A prefix\n * operator applies to everything that binds tighter than it, so with `-`\n * at precedence 4 and `^` at 3, `-2 ^ 2` parses as `(-2) ^ 2`.\n *\n * When several operators of the same kind match, the first one in the\n * table wins, so list longer operators (`<=`) before their prefixes (`<`).\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const make = <A, E, R, I extends Input, const Ops extends ReadonlyArray<Operator<A, any, any, any>>>(options: {\n  readonly operand: Parser<A, E, R, I>\n  readonly operators: Ops\n}): Parser<A, E | OpError<Ops[number]>, R | OpServices<Ops[number]>, I & OpInput<Ops[number]>> => {\n  const operand = options.operand.step\n  const prefixes = options.operators.filter((o): o is Prefix<A, any, any, any> => o._tag === \"Prefix\")\n  const postfixes = options.operators.filter((o): o is Postfix<A, any, any, any> => o._tag === \"Postfix\")\n  const infixes = options.operators.filter((o): o is Infix<A, any, any, any> => o._tag === \"Infix\")\n\n  // Attempts each operator in turn. Returns the index of the first match\n  // (with its output in `matched`), -1 if none matched, or -2 on a fatal\n  // failure. Failed attempts are folded into `failures`, merged only when\n  // read (#44): a round in which an operator matches discards them unmerged.\n  // Like `matched`, it is shared by nested expressions, which clear it.\n  let matched: unknown\n  const failures = new TiedFailures()\n  const tryOps = (state: State<any>, ops: ReadonlyArray<OperatorBase<any, any, any>>, mustConsume: boolean): number => {\n    const start = state.pos\n    for (let i = 0; i < ops.length; i++) {\n      const out = ops[i].parser.step(state)\n      if (out !== Fail) {\n        // A prefix or postfix operator matching nothing would apply forever\n        if (mustConsume && state.pos === start) {\n          state.failMessage(\"Cut\", \"Assert\", \"prefix and postfix operators must always consume\")\n          return -2\n        }\n        matched = out\n        return i\n      }\n      if (state.mode !== \"Backtrack\") return -2\n      state.pos = start\n      failures.add(state)\n    }\n    return -1\n  }\n\n  const expr = (state: State<any>, minPower: number): A | Fail => {\n    let lhs: A | Fail\n    failures.clear()\n    const p = tryOps(state, prefixes, true)\n    if (p === -2) return Fail\n    if (p >= 0) {\n      const op = prefixes[p]\n      const opOut = matched\n      const operandValue = expr(state, op.precedence * 2)\n      if (operandValue === Fail) return Fail\n      lhs = op.fold(opOut, operandValue)\n    } else {\n      const prefixFailure = failures.failure\n      const prefixTie1 = failures.tie1\n      const prefixTie2 = failures.tie2\n      lhs = operand(state)\n      if (lhs === Fail) {\n        if (prefixFailure !== undefined && state.mode === \"Backtrack\") {\n          // The operand may have parsed nested expressions, which reuse `failures`\n          failures.failure = prefixFailure\n          failures.tie1 = prefixTie1\n          failures.tie2 = prefixTie2\n          failures.add(state)\n          failures.fail(state)\n        }\n        return Fail\n      }\n    }\n\n    while (true) {\n      const start = state.pos\n      failures.clear()\n      const q = tryOps(state, postfixes, true)\n      if (q === -2) return Fail\n      if (q >= 0) {\n        const op = postfixes[q]\n        if (op.precedence * 2 < minPower) {\n          state.pos = start\n          break\n        }\n        lhs = op.fold(lhs, matched)\n        continue\n      }\n      // The infix attempts are folded on top of the postfix ones\n      const i = tryOps(state, infixes, false)\n      if (i === -2) return Fail\n      if (i < 0) {\n        failures.hint(state)\n        break\n      }\n      const op = infixes[i]\n      const leftPower = op.precedence * 2\n      if (leftPower < minPower) {\n        state.pos = start\n        break\n      }\n      const opOut = matched\n      const rhs = expr(state, op.associativity === \"left\" ? leftPower + 1 : leftPower)\n      if (rhs === Fail) return Fail\n      lhs = op.fold(lhs, opOut, rhs)\n    }\n    return lhs\n  }\n\n  return makeParser((state: State<any>) => expr(state, 0), \"expression\")\n}\n"],"mappings":";;;;;;;;;;AA4FA,MAAa,UACX,QACA,YACA,UACwB;CAAE,MAAM;CAAU;CAAQ;CAAY;AAAK;;;;;;;AAQrE,MAAa,WACX,QACA,YACA,UACyB;CAAE,MAAM;CAAW;CAAQ;CAAY;AAAK;;;;;;;AAQvE,MAAa,aACX,QACA,YACA,UACuB;CAAE,MAAM;CAAS,eAAe;CAAQ;CAAQ;CAAY;AAAK;;;;;;;AAQ1F,MAAa,cACX,QACA,YACA,UACuB;CAAE,MAAM;CAAS,eAAe;CAAS;CAAQ;CAAY;AAAK;;;;;;;;;;;;;;AAmB3F,MAAa,QAA+F,YAGV;CAChG,MAAM,UAAU,QAAQ,QAAQ;CAChC,MAAM,WAAW,QAAQ,UAAU,QAAQ,MAAqC,EAAE,SAAS,QAAQ;CACnG,MAAM,YAAY,QAAQ,UAAU,QAAQ,MAAsC,EAAE,SAAS,SAAS;CACtG,MAAM,UAAU,QAAQ,UAAU,QAAQ,MAAoC,EAAE,SAAS,OAAO;CAOhG,IAAI;CACJ,MAAM,WAAW,IAAI,aAAa;CAClC,MAAM,UAAU,OAAmB,KAAiD,gBAAiC;EACnH,MAAM,QAAQ,MAAM;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACnC,MAAM,MAAM,IAAI,EAAE,CAAC,OAAO,KAAK,KAAK;GACpC,IAAI,QAAQ,MAAM;IAEhB,IAAI,eAAe,MAAM,QAAQ,OAAO;KACtC,MAAM,YAAY,OAAO,UAAU,kDAAkD;KACrF,OAAO;IACT;IACA,UAAU;IACV,OAAO;GACT;GACA,IAAI,MAAM,SAAS,aAAa,OAAO;GACvC,MAAM,MAAM;GACZ,SAAS,IAAI,KAAK;EACpB;EACA,OAAO;CACT;CAEA,MAAM,QAAQ,OAAmB,aAA+B;EAC9D,IAAI;EACJ,SAAS,MAAM;EACf,MAAM,IAAI,OAAO,OAAO,UAAU,IAAI;EACtC,IAAI,MAAM,IAAI,OAAO;EACrB,IAAI,KAAK,GAAG;GACV,MAAM,KAAK,SAAS;GACpB,MAAM,QAAQ;GACd,MAAM,eAAe,KAAK,OAAO,GAAG,aAAa,CAAC;GAClD,IAAI,iBAAiB,MAAM,OAAO;GAClC,MAAM,GAAG,KAAK,OAAO,YAAY;EACnC,OAAO;GACL,MAAM,gBAAgB,SAAS;GAC/B,MAAM,aAAa,SAAS;GAC5B,MAAM,aAAa,SAAS;GAC5B,MAAM,QAAQ,KAAK;GACnB,IAAI,QAAQ,MAAM;IAChB,IAAI,kBAAkB,KAAA,KAAa,MAAM,SAAS,aAAa;KAE7D,SAAS,UAAU;KACnB,SAAS,OAAO;KAChB,SAAS,OAAO;KAChB,SAAS,IAAI,KAAK;KAClB,SAAS,KAAK,KAAK;IACrB;IACA,OAAO;GACT;EACF;EAEA,OAAO,MAAM;GACX,MAAM,QAAQ,MAAM;GACpB,SAAS,MAAM;GACf,MAAM,IAAI,OAAO,OAAO,WAAW,IAAI;GACvC,IAAI,MAAM,IAAI,OAAO;GACrB,IAAI,KAAK,GAAG;IACV,MAAM,KAAK,UAAU;IACrB,IAAI,GAAG,aAAa,IAAI,UAAU;KAChC,MAAM,MAAM;KACZ;IACF;IACA,MAAM,GAAG,KAAK,KAAK,OAAO;IAC1B;GACF;GAEA,MAAM,IAAI,OAAO,OAAO,SAAS,KAAK;GACtC,IAAI,MAAM,IAAI,OAAO;GACrB,IAAI,IAAI,GAAG;IACT,SAAS,KAAK,KAAK;IACnB;GACF;GACA,MAAM,KAAK,QAAQ;GACnB,MAAM,YAAY,GAAG,aAAa;GAClC,IAAI,YAAY,UAAU;IACxB,MAAM,MAAM;IACZ;GACF;GACA,MAAM,QAAQ;GACd,MAAM,MAAM,KAAK,OAAO,GAAG,kBAAkB,SAAS,YAAY,IAAI,SAAS;GAC/E,IAAI,QAAQ,MAAM,OAAO;GACzB,MAAM,GAAG,KAAK,KAAK,OAAO,GAAG;EAC/B;EACA,OAAO;CACT;CAEA,OAAOA,QAAY,UAAsB,KAAK,OAAO,CAAC,GAAG,YAAY;AACvE"}

package/dist/Input.d.ts

@@ -173,8 +173,31 @@ export declare class State<I extends Input = Input> {
   context: Context.Context<never>;
   /** Mode of the latest failure. Only meaningful after a step returned {@link Fail}. */
   mode: ErrMode;
-  /** Details of the latest failure. Only meaningful after a step returned {@link Fail}. */
-  failure: Failure;
+  /**
+   * The latest failure, kept unmerged: the failure is `failureHead` merged
+   * (as `mergeFailures` does) with `failureTie1` and then `failureTie2`, all
+   * at the same offset. `Parser.alt` records its tied branch failures here
+   * with {@link failTies} instead of merging them, so that an enclosing `alt`
+   * whose next branch succeeds never pays for the merge. Reading
+   * {@link failure} performs the merge, once.
+   *
+   * @internal
+   */
+  failureHead: Failure;
+  /** @internal */
+  failureTie1: Failure | undefined;
+  /** @internal */
+  failureTie2: Failure | undefined;
+  /** Backs {@link deepest}. @internal */
+  deepestFailure: Failure | undefined;
+  /**
+   * Whether the furthest failure is the latest failure, still unmerged, so
+   * that {@link deepest} is that failure once merged. Only set while
+   * `failureTie1` is.
+   *
+   * @internal
+   */
+  deepestIsLatest: boolean;
   /**
    * The offset of a recoverable failure that occurred without consuming
    * input (for example the last attempt of a `repeat`). Its
@@ -193,7 +216,8 @@ export declare class State<I extends Input = Input> {
    * recorded inside it when it commits, and `Parser.peek` and `Parser.not`
    * forget the failures of a lookahead that succeeded.
    */
-  deepest: Failure | undefined;
+  get deepest(): Failure | undefined;
+  set deepest(failure: Failure | undefined);
   /** When defined, `Parser.resumeAfter`/`retryAfter` record failures here. */
   recovered: Array<Failure> | undefined;
   /** When defined, `Parser.trace` reports events here. */
@@ -223,6 +247,11 @@ export declare class State<I extends Input = Input> {
     readonly context?: Context.Context<never> | undefined;
     readonly offset?: number | undefined;
   });
+  /** Details of the latest failure. Only meaningful after a step returned {@link Fail}. */
+  get failure(): Failure;
+  set failure(failure: Failure);
+  /** Merges the latest failure's ties into it (see {@link failureHead}). */
+  private settleFailure;
   /**
    * Prepares the state for another run over the same input, starting at
    * `offset`: afterwards it behaves exactly like
@@ -297,6 +326,14 @@ export declare class State<I extends Input = Input> {
    * Records the given failure and returns {@link Fail}.
    */
   failWith(mode: ErrMode, failure: Failure): Fail;
+  /**
+   * Records a recoverable failure made of tied failures, merged only when
+   * read: `failWith("Backtrack", f)` where `f` merges `head` with `tie1`
+   * and then `tie2` (all at the same offset), as `mergeFailures` would.
+   *
+   * @internal
+   */
+  failTies(head: Failure, tie1: Failure, tie2: Failure | undefined): Fail;
   /**
    * Replaces the details of the current failure (for example to add context),
    * keeping the record of the furthest failure consistent.
@@ -326,5 +363,13 @@ export declare const mergeExpected: (a: ReadonlyArray<string>, b: ReadonlyArray<
  * @internal
  */
 export declare const mergeFailures: (a: Failure, b: Failure) => Failure;
+/**
+ * {@link mergeFailures} for two failures at the same offset, given their
+ * merged expectations (`mergeExpected(a.expected, b.expected)`, possibly
+ * memoised by the caller).
+ *
+ * @internal
+ */
+export declare const mergeTiedFailures: (a: Failure, b: Failure, expected: ReadonlyArray<string>) => Failure;
 //#endregion
 //# sourceMappingURL=Input.d.ts.map

package/dist/Input.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Input.d.ts","names":["SyntaxBuilder"],"sources":["../src/Input.ts"],"mappings":";;;;;;;;;;;;;;;;YAgCY,iBAAiB,aAAa;;;;;;;;;;;;;YAc9B,cAAc,kBAAkB;;;;;;;;YAShC,OAAO,KAAK,MAAM,YAAY,cAAc;;;;;;;;;;;;;;;qBAgB3C;GACV,QAAQ,cAAc;GACtB,UAAU,OAAO,QAAQ,OAAO,KAAK;;;;;;;;YAkB5B,MAAM,KAAK,4BAEnB,UAAU,sBAER,UAAU,oBAAoB,KAC5B;;;;;;;YASI,MAAM,KAAK,4BAEnB,UAAU,aACR,aACA,UAAU,oBAAoB,KAC5B,cAAc;;;;;;;;qBAUT;;;;;YAMD,cAAc;;;;;;;;;;;YAYd;;;;;;;qBAQC;;WAGA;;WAEA,MAAM;;WAEN,UAAU;;WAEV,SAAS;;WAET;;WAEA;;WAEA;;WAEA;;;EAdA;;EAEA,MAAM;;EAEN,UAAU;;EAEV,SAAS;;EAET;;EAEA;;EAEA;;EAEA;;;qBAUA;;;;;;;iBAQI;WACN;WACA;WACA;WACA;;WAEA,gBAAgB;;WAEhB;WACA,OAAO;;;;;;;;qBASL,MAAM,UAAU,QAAQ;;WAE1B,OAAO;;EAGR;;EAER;;WAES;;EAET;;EAEA,SAAS,QAAQ;;EAEjB,MAAM;;EAEN,SAAS;;;;;;;EAOT;;EAEA,cAAc;;;;;;;;;;EAUd,SAAS;;EAET,WAAW,MAAM;;EAEjB,UAAU,OAAO;;EAEjB;;;;;EAKA,UAAU;;;;;;;EAOV,QAAQ,YAAY;;;;;;EAMpB,QAAQA;EAGN,YAAA,QAAQ,IAAI,OAAO,IACnB;aACW;aACA,UAAU,QAAQ;aAClB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAyCb,MACE,iBACA;aACW;aACA,UAAU,QAAQ;;;;;EAuB/B;;;;EAOA;;;;EAOA,MAAM,eAAe,cAAc,MAAM;;;;EAezC,UAAU,MAAM,WAAW,WAAU,uBAA+B,kBAA4B;;;;EAOhG,IAAI,MAAM,WAAW,WAAU,uBAA+B,kBAA4B;;;;;EAQ1F,WAAW,gBAAgB,WAAU,wBAAgC;;;;;EAWrE,IAAI,MAAM,WAAW,UAAU,uBAAuB,iBAAiB;;;;EAOvE,UAAU,MAAM,SAAS,MAAM,WAAW,gBAAgB,kBAA4B;;;;EAOtF,YAAY,MAAM,SAAS,MAAM,WAAW,iBAAiB,kBAA4B;;;;EAOzF,SAAS,MAAM,SAAS,SAAS,UAAU;;;;;EAa3C,eAAe,SAAS;;;;;;EAUxB,mBAAmB;;;;;;EAuBnB,QAAQ,gBAAgB,UAAU;;EAUlC,YAAY,gBAAgB,MAAM,WAAW,UAAU,wBAAwB;;;qBASpE,gBAAiB,GAAG,uBAAuB,GAAG,0BAAwB;;;;;;;qBAgBtE,gBAAiB,GAAG,SAAS,GAAG,YAAU"}
+{"version":3,"file":"Input.d.ts","names":["SyntaxBuilder"],"sources":["../src/Input.ts"],"mappings":";;;;;;;;;;;;;;;;YAgCY,iBAAiB,aAAa;;;;;;;;;;;;;YAc9B,cAAc,kBAAkB;;;;;;;;YAShC,OAAO,KAAK,MAAM,YAAY,cAAc;;;;;;;;;;;;;;;qBAgB3C;GACV,QAAQ,cAAc;GACtB,UAAU,OAAO,QAAQ,OAAO,KAAK;;;;;;;;YAkB5B,MAAM,KAAK,4BAEnB,UAAU,sBAER,UAAU,oBAAoB,KAC5B;;;;;;;YASI,MAAM,KAAK,4BAEnB,UAAU,aACR,aACA,UAAU,oBAAoB,KAC5B,cAAc;;;;;;;;qBAUT;;;;;YAMD,cAAc;;;;;;;;;;;YAYd;;;;;;;qBAQC;;WAGA;;WAEA,MAAM;;WAEN,UAAU;;WAEV,SAAS;;WAET;;WAEA;;WAEA;;WAEA;;;EAdA;;EAEA,MAAM;;EAEN,UAAU;;EAEV,SAAS;;EAET;;EAEA;;EAEA;;EAEA;;;qBAUA;;;;;;;iBAQI;WACN;WACA;WACA;WACA;;WAEA,gBAAgB;;WAEhB;WACA,OAAO;;;;;;;;qBASL,MAAM,UAAU,QAAQ;;WAE1B,OAAO;;EAGR;;EAER;;WAES;;EAET;;EAEA,SAAS,QAAQ;;EAEjB,MAAM;;;;;;;;;;;EAWN,aAAa;;EAEb,aAAa;;EAEb,aAAa;;EAEb,gBAAgB;;;;;;;;EAQhB;;;;;;;EAOA;;EAEA,cAAc;;;;;;;;;;MAUV,WAAW;MAIX,QAAQ,SAAS;;EAKrB,WAAW,MAAM;;EAEjB,UAAU,OAAO;;EAEjB;;;;;EAKA,UAAU;;;;;;;EAOV,QAAQ,YAAY;;;;;;EAMpB,QAAQA;EAGN,YAAA,QAAQ,IAAI,OAAO,IACnB;aACW;aACA,UAAU,QAAQ;aAClB;;;MAcT,WAAW;MAIX,QAAQ,SAAS;;UAQb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA6CR,MACE,iBACA;aACW;aACA,UAAU,QAAQ;;;;;EA0B/B;;;;EAOA;;;;EAOA,MAAM,eAAe,cAAc,MAAM;;;;EAezC,UAAU,MAAM,WAAW,WAAU,uBAA+B,kBAA4B;;;;EAOhG,IAAI,MAAM,WAAW,WAAU,uBAA+B,kBAA4B;;;;;EAQ1F,WAAW,gBAAgB,WAAU,wBAAgC;;;;;EAWrE,IAAI,MAAM,WAAW,UAAU,uBAAuB,iBAAiB;;;;EAOvE,UAAU,MAAM,SAAS,MAAM,WAAW,gBAAgB,kBAA4B;;;;EAOtF,YAAY,MAAM,SAAS,MAAM,WAAW,iBAAiB,kBAA4B;;;;EAOzF,SAAS,MAAM,SAAS,SAAS,UAAU;;;;;;;;EAuB3C,SAAS,MAAM,SAAS,MAAM,SAAS,MAAM,sBAAsB;;;;;EAcnE,eAAe,SAAS;;;;;;EAUxB,mBAAmB;;;;;;EAuBnB,QAAQ,gBAAgB,UAAU;;EAUlC,YAAY,gBAAgB,MAAM,WAAW,UAAU,wBAAwB;;;qBASpE,gBAAiB,GAAG,uBAAuB,GAAG,0BAAwB;;;;;;;qBAgBtE,gBAAiB,GAAG,SAAS,GAAG,YAAU;;;;;;;;qBAa1C,oBAAqB,GAAG,SAAS,GAAG,SAAS,UAAU,0BAAwB"}

package/dist/Input.js

@@ -95,8 +95,31 @@ var State = class {
 	context;
 	/** Mode of the latest failure. Only meaningful after a step returned {@link Fail}. */
 	mode = "Backtrack";
-	/** Details of the latest failure. Only meaningful after a step returned {@link Fail}. */
-	failure;
+	/**
+	* The latest failure, kept unmerged: the failure is `failureHead` merged
+	* (as `mergeFailures` does) with `failureTie1` and then `failureTie2`, all
+	* at the same offset. `Parser.alt` records its tied branch failures here
+	* with {@link failTies} instead of merging them, so that an enclosing `alt`
+	* whose next branch succeeds never pays for the merge. Reading
+	* {@link failure} performs the merge, once.
+	*
+	* @internal
+	*/
+	failureHead;
+	/** @internal */
+	failureTie1 = void 0;
+	/** @internal */
+	failureTie2 = void 0;
+	/** Backs {@link deepest}. @internal */
+	deepestFailure = void 0;
+	/**
+	* Whether the furthest failure is the latest failure, still unmerged, so
+	* that {@link deepest} is that failure once merged. Only set while
+	* `failureTie1` is.
+	*
+	* @internal
+	*/
+	deepestIsLatest = false;
 	/**
 	* The offset of a recoverable failure that occurred without consuming
 	* input (for example the last attempt of a `repeat`). Its
@@ -115,7 +138,14 @@ var State = class {
 	* recorded inside it when it commits, and `Parser.peek` and `Parser.not`
 	* forget the failures of a lookahead that succeeded.
 	*/
-	deepest = void 0;
+	get deepest() {
+		if (this.deepestIsLatest) this.settleFailure();
+		return this.deepestFailure;
+	}
+	set deepest(failure) {
+		this.deepestIsLatest = false;
+		this.deepestFailure = failure;
+	}
 	/** When defined, `Parser.resumeAfter`/`retryAfter` record failures here. */
 	recovered = void 0;
 	/** When defined, `Parser.trace` reports events here. */
@@ -148,7 +178,35 @@ var State = class {
 		this.partial = options?.partial ?? false;
 		this.context = options?.context ?? Context.empty();
 		this.inputKind = Predicate.isString(input) ? 0 : input instanceof Uint8Array ? 1 : 2;
-		this.failure = initialFailure;
+		this.failureHead = initialFailure;
+	}
+	/** Details of the latest failure. Only meaningful after a step returned {@link Fail}. */
+	get failure() {
+		if (this.failureTie1 !== void 0) this.settleFailure();
+		return this.failureHead;
+	}
+	set failure(failure) {
+		if (this.deepestIsLatest) this.settleFailure();
+		this.failureHead = failure;
+		this.failureTie1 = void 0;
+		this.failureTie2 = void 0;
+	}
+	/** Merges the latest failure's ties into it (see {@link failureHead}). */
+	settleFailure() {
+		let failure = this.failureHead;
+		const tie1 = this.failureTie1;
+		if (tie1 !== void 0) {
+			failure = mergeTiedFailures(failure, tie1, mergeExpected(failure.expected, tie1.expected));
+			const tie2 = this.failureTie2;
+			if (tie2 !== void 0) failure = mergeTiedFailures(failure, tie2, mergeExpected(failure.expected, tie2.expected));
+			this.failureHead = failure;
+			this.failureTie1 = void 0;
+			this.failureTie2 = void 0;
+		}
+		if (this.deepestIsLatest) {
+			this.deepestFailure = failure;
+			this.deepestIsLatest = false;
+		}
 	}
 	/**
 	* Prepares the state for another run over the same input, starting at
@@ -184,10 +242,13 @@ var State = class {
 		this.partial = options?.partial ?? false;
 		this.context = options?.context ?? Context.empty();
 		this.mode = "Backtrack";
-		this.failure = initialFailure;
+		this.failureHead = initialFailure;
+		this.failureTie1 = void 0;
+		this.failureTie2 = void 0;
 		this.hintOffset = -1;
 		this.hintExpected = empty;
-		this.deepest = void 0;
+		this.deepestFailure = void 0;
+		this.deepestIsLatest = false;
 		this.recovered = void 0;
 		this.tracer = void 0;
 		this.depth = 0;
@@ -261,8 +322,30 @@ var State = class {
 	*/
 	failWith(mode, failure) {
 		this.mode = mode;
-		this.failure = failure;
-		if (mode === "Backtrack" && (this.deepest === void 0 || failure.offset >= this.deepest.offset)) this.deepest = failure;
+		if (this.deepestIsLatest) {
+			if (mode === "Backtrack" && failure.offset >= this.failureHead.offset) this.deepestIsLatest = false;
+			else this.settleFailure();
+		}
+		this.failureHead = failure;
+		this.failureTie1 = void 0;
+		this.failureTie2 = void 0;
+		if (mode === "Backtrack" && (this.deepestFailure === void 0 || failure.offset >= this.deepestFailure.offset)) this.deepestFailure = failure;
+		return Fail;
+	}
+	/**
+	* Records a recoverable failure made of tied failures, merged only when
+	* read: `failWith("Backtrack", f)` where `f` merges `head` with `tie1`
+	* and then `tie2` (all at the same offset), as `mergeFailures` would.
+	*
+	* @internal
+	*/
+	failTies(head, tie1, tie2) {
+		this.mode = "Backtrack";
+		if (this.deepestIsLatest && head.offset < this.failureHead.offset) this.settleFailure();
+		this.failureHead = head;
+		this.failureTie1 = tie1;
+		this.failureTie2 = tie2;
+		this.deepestIsLatest = this.deepestFailure === void 0 || head.offset >= this.deepestFailure.offset;
 		return Fail;
 	}
 	/**
@@ -320,11 +403,20 @@ const mergeExpected = (a, b) => {
 const mergeFailures = (a, b) => {
 	if (a.offset > b.offset) return a;
 	if (b.offset > a.offset) return b;
-	const expected = mergeExpected(a.expected, b.expected);
+	return mergeTiedFailures(a, b, mergeExpected(a.expected, b.expected));
+};
+/**
+* {@link mergeFailures} for two failures at the same offset, given their
+* merged expectations (`mergeExpected(a.expected, b.expected)`, possibly
+* memoised by the caller).
+*
+* @internal
+*/
+const mergeTiedFailures = (a, b, expected) => {
 	if (expected === b.expected) return b;
 	return new Failure(b.offset, b.kind, expected, b.context.length > 0 ? b.context : a.context, b.hasCause || a.hasCause, b.hasCause ? b.cause : a.cause, b.message ?? a.message, b.needed);
 };
 //#endregion
-export { Fail, Failure, State, emptyStrings, fromSource, mergeExpected, mergeFailures };
+export { Fail, Failure, State, emptyStrings, fromSource, mergeExpected, mergeFailures, mergeTiedFailures };
 
 //# sourceMappingURL=Input.js.map

package/dist/Input.js.map

@@ -1 +1 @@
-{"version":3,"file":"Input.js","names":[],"sources":["../src/Input.ts"],"sourcesContent":["/**\n * Input types and the mutable parse {@link State} cursor.\n *\n * Like winnow, effect-parse parsers advance a mutable cursor rather than\n * returning the remaining input. A {@link State} wraps the original input\n * together with the current offset, the streaming (partial) flag, the\n * services available to the parser, and the details of the most recent\n * failure.\n *\n * Most users never touch `State` directly. It is exposed for writing custom\n * low-level parsers with `Parser.make`, and for drivers that run a parser's\n * `step` many times over one input, reusing a state with {@link State.reset}.\n *\n * @since 0.1.0\n */\nimport * as Predicate from \"effect/Predicate\"\nimport * as Context from \"effect/Context\"\nimport type { Encoding } from \"./Encoding.js\"\nimport type { ErrorKind } from \"./ParseError.js\"\nimport type { Builder as SyntaxBuilder } from \"./internal/syntax.js\"\n\n/**\n * The kinds of input a parser can consume.\n *\n * - `string`: tokens are Unicode code points (returned as strings), offsets\n *   are UTF-16 code-unit indices.\n * - `Uint8Array`: tokens are bytes (numbers), slices are `subarray` views.\n * - `ReadonlyArray<T>`: tokens are elements, e.g. the output of a lexer.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Input = string | Uint8Array | ReadonlyArray<unknown>\n\n/**\n * Binary data that can be passed wherever a `Uint8Array` input is expected:\n * an `ArrayBuffer`, a `SharedArrayBuffer`, a `DataView` or any typed array.\n *\n * It is viewed, not copied, as a `Uint8Array` of its bytes. A typed array\n * with wider elements is viewed in the platform's byte order, which is\n * little endian on all common platforms, so a `Uint16Array` of UTF-16 code\n * units can be parsed with `Text.utf16le`.\n *\n * @since 0.1.0\n * @category models\n */\nexport type BinaryInput = ArrayBufferLike | ArrayBufferView\n\n/**\n * What the runners accept for a parser over `I`: the input itself, or, for\n * byte parsers, any {@link BinaryInput}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Source<I> = I | ([I] extends [Uint8Array] ? BinaryInput : never)\n\n/**\n * Converts a {@link Source} to the input parsers read: binary data becomes a\n * `Uint8Array` view of the same memory, everything else is returned as is.\n *\n * @example\n * ```ts\n * import { Input } from \"@thomasfosterau/effect-parse\"\n *\n * Input.fromSource(new Uint16Array([0x41]).buffer) // Uint8Array [0x41, 0x00]\n * ```\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const fromSource: {\n  (source: BinaryInput): Uint8Array\n  <I extends Input>(source: Source<I>): I\n} = (source: Input | BinaryInput): any => {\n  if (Predicate.isString(source) || source instanceof Uint8Array || Array.isArray(source)) return source\n  if (ArrayBuffer.isView(source)) return new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n  // An explicit length fixes the view's size even for a resizable buffer\n  if (isArrayBufferLike(source)) return new Uint8Array(source, 0, source.byteLength)\n  return source\n}\n\nconst isArrayBufferLike = (u: unknown): u is ArrayBufferLike =>\n  u instanceof ArrayBuffer || (globalThis.SharedArrayBuffer !== undefined && u instanceof SharedArrayBuffer)\n\n/**\n * The type of a single token of an input.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Token<I> = I extends string\n  ? string\n  : I extends Uint8Array\n    ? number\n    : I extends ReadonlyArray<infer T>\n      ? T\n      : never\n\n/**\n * The type of a contiguous slice of an input.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Slice<I> = I extends string\n  ? string\n  : I extends Uint8Array\n    ? Uint8Array\n    : I extends ReadonlyArray<infer T>\n      ? ReadonlyArray<T>\n      : never\n\n/**\n * Sentinel returned by a parser step to signal failure. The failure details\n * are stored on the {@link State}.\n *\n * @since 0.1.0\n * @category failure\n */\nexport const Fail: unique symbol = /*#__PURE__*/ Symbol.for(\"effect-parse/Fail\")\n\n/**\n * @since 0.1.0\n * @category failure\n */\nexport type Fail = typeof Fail\n\n/**\n * How a failure propagates (winnow's `ErrMode`, nom's `Err`).\n *\n * - `Backtrack`: recoverable; `alt`, `opt`, `repeat`, ... try something else.\n * - `Cut`: unrecoverable; alternatives are not attempted.\n * - `Incomplete`: a partial (streaming) input ran out; more data is needed.\n *\n * @since 0.1.0\n * @category failure\n */\nexport type ErrMode = \"Backtrack\" | \"Cut\" | \"Incomplete\"\n\n/**\n * The details of a parse failure.\n *\n * @since 0.1.0\n * @category failure\n */\nexport class Failure {\n  constructor(\n    /** Offset into the input where the failure occurred. */\n    readonly offset: number,\n    /** The kind of parser that failed. */\n    readonly kind: ErrorKind,\n    /** Rendered descriptions of what was expected at `offset`. */\n    readonly expected: ReadonlyArray<string>,\n    /** Context labels added by `Parser.context`, innermost first. */\n    readonly context: ReadonlyArray<string>,\n    /** Whether a user supplied cause is present. */\n    readonly hasCause: boolean,\n    /** A user supplied (typed) cause. */\n    readonly cause: unknown,\n    /** An optional free-form message. */\n    readonly message: string | undefined,\n    /** For `Incomplete` failures, how many more tokens are needed (0 if unknown). */\n    readonly needed: number\n  ) {}\n}\n\nconst empty: ReadonlyArray<string> = []\n\n/** The failure a {@link State} starts with, before any step has failed. */\nconst initialFailure = /*#__PURE__*/ new Failure(0, \"Fail\", empty, empty, false, undefined, undefined, 0)\n\n/** @internal */\nexport const emptyStrings = empty\n\n/**\n * A tracing event emitted by `Parser.trace`.\n *\n * @since 0.1.0\n * @category tracing\n */\nexport interface TraceEvent {\n  readonly _tag: \"Enter\" | \"Exit\"\n  readonly name: string\n  readonly depth: number\n  readonly offset: number\n  /** For `Exit` events: the outcome. */\n  readonly result?: \"Ok\" | ErrMode\n  /** For `Exit` events: the offset reached. */\n  readonly endOffset?: number\n  readonly state: State\n}\n\n/**\n * The mutable parsing cursor.\n *\n * @since 0.1.0\n * @category models\n */\nexport class State<I extends Input = Input> {\n  /** The full input being parsed. */\n  readonly input: I\n  /** The current offset. Advanced by parsers, rewound on backtracking. */\n  // Declared, not defined, so that a subclass can make it an accessor\n  declare pos: number\n  /** The end offset (the input's length; in bits inside `Bits.bits`). */\n  end: number\n  /** 0 = string, 1 = Uint8Array, 2 = array. */\n  readonly inputKind: 0 | 1 | 2\n  /** Whether the input is partial (streaming): running out yields `Incomplete`. */\n  partial: boolean\n  /** Services available to `Parser.service`. */\n  context: Context.Context<never>\n  /** Mode of the latest failure. Only meaningful after a step returned {@link Fail}. */\n  mode: ErrMode = \"Backtrack\"\n  /** Details of the latest failure. Only meaningful after a step returned {@link Fail}. */\n  failure: Failure\n  /**\n   * The offset of a recoverable failure that occurred without consuming\n   * input (for example the last attempt of a `repeat`). Its\n   * expectations are merged into new failures at the same offset, producing\n   * messages like `expected digit or \")\"`.\n   */\n  hintOffset = -1\n  /** The expectations of the hint at {@link hintOffset}. */\n  hintExpected: ReadonlyArray<string> = empty\n  /**\n   * The furthest recoverable failure seen so far, including failures that\n   * were later swallowed by backtracking (for example a trailing separator\n   * followed by an invalid element). It is reported instead of the final\n   * failure when it lies further into the input. This is the classic PEG\n   * \"farthest failure\" heuristic. `Parser.cut` keeps only the failures\n   * recorded inside it when it commits, and `Parser.peek` and `Parser.not`\n   * forget the failures of a lookahead that succeeded.\n   */\n  deepest: Failure | undefined = undefined\n  /** When defined, `Parser.resumeAfter`/`retryAfter` record failures here. */\n  recovered: Array<Failure> | undefined = undefined\n  /** When defined, `Parser.trace` reports events here. */\n  tracer: ((event: TraceEvent) => void) | undefined = undefined\n  /** Current tracing depth. */\n  depth = 0\n  /**\n   * The text encoding of a byte input, recorded by `Text` parsers when they\n   * fail so that errors can show the input as text.\n   */\n  encoding: Encoding<any> | undefined = undefined\n  /**\n   * The checkpoints of a resumable streaming parse (see\n   * `ParserStream.parseAll`); `undefined` otherwise.\n   *\n   * @internal\n   */\n  resume: Map<object, Map<number, unknown>> | undefined = undefined\n  /**\n   * The tree builder of a `Syntax` parse; `undefined` otherwise.\n   *\n   * @internal\n   */\n  syntax: SyntaxBuilder | undefined = undefined\n\n  constructor(\n    source: I | Source<I>,\n    options?: {\n      readonly partial?: boolean | undefined\n      readonly context?: Context.Context<never> | undefined\n      readonly offset?: number | undefined\n    }\n  ) {\n    const input = fromSource(source as Input) as I\n    this.input = input\n    this.end = input.length\n    this.pos = options?.offset ?? 0\n    this.partial = options?.partial ?? false\n    this.context = options?.context ?? Context.empty()\n    this.inputKind = Predicate.isString(input) ? 0 : input instanceof Uint8Array ? 1 : 2\n    this.failure = initialFailure\n  }\n\n  /**\n   * Prepares the state for another run over the same input, starting at\n   * `offset`: afterwards it behaves exactly like\n   * `new State(state.input, { ...options, offset })`, without allocating a\n   * new state.\n   *\n   * Every per-run field is reset: the cursor and end, the latest failure,\n   * hints and furthest failure, recorded recoveries, the tracer and tracing\n   * depth, the recorded encoding and streaming checkpoints. Like the\n   * constructor, `partial` defaults to `false` and `context` to the empty\n   * context, so pass them again on every reset.\n   *\n   * Use it to run many small parses over one buffer, for example one per\n   * token, with `parser.step`. A state can be reused after any run,\n   * including one that failed, returned `Incomplete` or threw.\n   *\n   * @example\n   * ```ts\n   * import { Ascii, Input } from \"@thomasfosterau/effect-parse\"\n   *\n   * const state = new Input.State(\"12 34\")\n   * Ascii.decUint.step(state) // 12\n   * state.reset(3)\n   * Ascii.decUint.step(state) // 34\n   * ```\n   *\n   * @since 0.2.0\n   */\n  reset(\n    offset: number = 0,\n    options?: {\n      readonly partial?: boolean | undefined\n      readonly context?: Context.Context<never> | undefined\n    }\n  ): this {\n    this.pos = offset\n    this.end = this.input.length\n    this.partial = options?.partial ?? false\n    this.context = options?.context ?? Context.empty()\n    this.mode = \"Backtrack\"\n    this.failure = initialFailure\n    this.hintOffset = -1\n    this.hintExpected = empty\n    this.deepest = undefined\n    this.recovered = undefined\n    this.tracer = undefined\n    this.depth = 0\n    this.encoding = undefined\n    this.resume = undefined\n    return this\n  }\n\n  /**\n   * The number of input units (code units, bytes or elements) remaining.\n   */\n  remaining(): number {\n    return this.end - this.pos\n  }\n\n  /**\n   * Whether the cursor is at the end of the input.\n   */\n  atEnd(): boolean {\n    return this.pos >= this.end\n  }\n\n  /**\n   * Extracts the slice `[start, end)` of the input.\n   */\n  slice(start: number, end: number): Slice<I> {\n    const input = this.input as any\n    switch (this.inputKind) {\n      case 0:\n        return input.slice(start, end)\n      case 1:\n        return input.subarray(start, end)\n      default:\n        return input.slice(start, end)\n    }\n  }\n\n  /**\n   * Records a recoverable failure at the current offset and returns {@link Fail}.\n   */\n  backtrack(kind: ErrorKind, expected: ReadonlyArray<string> = empty, offset: number = this.pos): Fail {\n    return this.failWith(\"Backtrack\", this.makeFailure(offset, kind, expected))\n  }\n\n  /**\n   * Records an unrecoverable failure at the current offset and returns {@link Fail}.\n   */\n  cut(kind: ErrorKind, expected: ReadonlyArray<string> = empty, offset: number = this.pos): Fail {\n    return this.failWith(\"Cut\", this.makeFailure(offset, kind, expected))\n  }\n\n  /**\n   * Records an `Incomplete` failure (only meaningful for partial input) and\n   * returns {@link Fail}.\n   */\n  incomplete(needed: number, expected: ReadonlyArray<string> = empty): Fail {\n    return this.failWith(\n      \"Incomplete\",\n      new Failure(this.pos, \"Incomplete\", expected, empty, false, undefined, undefined, needed)\n    )\n  }\n\n  /**\n   * Fails because the input ended: `Incomplete` for partial input, otherwise\n   * a `Backtrack` failure of the given kind.\n   */\n  eoi(kind: ErrorKind, expected: ReadonlyArray<string>, needed: number): Fail {\n    return this.partial ? this.incomplete(needed, expected) : this.backtrack(kind, expected)\n  }\n\n  /**\n   * Records a failure carrying a user supplied cause.\n   */\n  failCause(mode: ErrMode, kind: ErrorKind, cause: unknown, offset: number = this.pos): Fail {\n    return this.failWith(mode, new Failure(offset, kind, empty, empty, true, cause, undefined, 0))\n  }\n\n  /**\n   * Records a failure carrying a message.\n   */\n  failMessage(mode: ErrMode, kind: ErrorKind, message: string, offset: number = this.pos): Fail {\n    return this.failWith(mode, new Failure(offset, kind, empty, empty, false, undefined, message, 0))\n  }\n\n  /**\n   * Records the given failure and returns {@link Fail}.\n   */\n  failWith(mode: ErrMode, failure: Failure): Fail {\n    this.mode = mode\n    this.failure = failure\n    if (mode === \"Backtrack\" && (this.deepest === undefined || failure.offset >= this.deepest.offset)) {\n      this.deepest = failure\n    }\n    return Fail\n  }\n\n  /**\n   * Replaces the details of the current failure (for example to add context),\n   * keeping the record of the furthest failure consistent.\n   */\n  replaceFailure(failure: Failure): void {\n    if (this.deepest === this.failure) this.deepest = failure\n    this.failure = failure\n  }\n\n  /**\n   * The failure to report to the user: the current failure, or the furthest\n   * failure if it lies beyond the current one and the current failure is a\n   * plain syntax error (no user cause or message).\n   */\n  reportedFailure(): Failure {\n    const f = this.failure\n    const d = this.deepest\n    if (\n      d === undefined ||\n      d === f ||\n      d.offset <= f.offset ||\n      this.mode === \"Incomplete\" ||\n      f.hasCause ||\n      f.message !== undefined\n    ) {\n      return f\n    }\n    const context =\n      d.context.length === 0 ? f.context : [...d.context, ...f.context.filter((l) => !d.context.includes(l))]\n    return new Failure(d.offset, d.kind, d.expected, context, d.hasCause, d.cause, d.message, d.needed)\n  }\n\n  /**\n   * Records that, at `offset`, any of `expected` could also have been\n   * accepted. Used by parsers that stop without failing, such as `opt`,\n   * `repeat` and `Ascii.digit1`.\n   */\n  setHint(offset: number, expected: ReadonlyArray<string>): void {\n    if (this.hintOffset === offset) {\n      this.hintExpected = mergeExpected(this.hintExpected, expected)\n    } else {\n      this.hintOffset = offset\n      this.hintExpected = expected\n    }\n  }\n\n  /** @internal */\n  makeFailure(offset: number, kind: ErrorKind, expected: ReadonlyArray<string>): Failure {\n    if (this.hintOffset === offset && this.hintExpected.length > 0) {\n      expected = mergeExpected(this.hintExpected, expected)\n    }\n    return new Failure(offset, kind, expected, empty, false, undefined, undefined, 0)\n  }\n}\n\n/** @internal */\nexport const mergeExpected = (a: ReadonlyArray<string>, b: ReadonlyArray<string>): ReadonlyArray<string> => {\n  if (a.length === 0) return b\n  if (b.length === 0) return a\n  const out = a.slice()\n  for (const e of b) {\n    if (!out.includes(e)) out.push(e)\n  }\n  return out\n}\n\n/**\n * Combines the failures of two alternatives: the furthest failure wins, and\n * failures at the same offset have their expectations merged.\n *\n * @internal\n */\nexport const mergeFailures = (a: Failure, b: Failure): Failure => {\n  if (a.offset > b.offset) return a\n  if (b.offset > a.offset) return b\n  const expected = mergeExpected(a.expected, b.expected)\n  if (expected === b.expected) return b\n  return new Failure(\n    b.offset,\n    b.kind,\n    expected,\n    b.context.length > 0 ? b.context : a.context,\n    b.hasCause || a.hasCause,\n    b.hasCause ? b.cause : a.cause,\n    b.message ?? a.message,\n    b.needed\n  )\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuEA,MAAa,cAGR,WAAqC;CACxC,IAAI,UAAU,SAAS,MAAM,KAAK,kBAAkB,cAAc,MAAM,QAAQ,MAAM,GAAG,OAAO;CAChG,IAAI,YAAY,OAAO,MAAM,GAAG,OAAO,IAAI,WAAW,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;CAEzG,IAAI,kBAAkB,MAAM,GAAG,OAAO,IAAI,WAAW,QAAQ,GAAG,OAAO,UAAU;CACjF,OAAO;AACT;AAEA,MAAM,qBAAqB,MACzB,aAAa,eAAgB,WAAW,sBAAsB,KAAA,KAAa,aAAa;;;;;;;;AAqC1F,MAAa,OAAoC,qBAAO,IAAI,mBAAmB;;;;;;;AA0B/E,IAAa,UAAb,MAAqB;CAGR;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAhBX,YAEE,QAEA,MAEA,UAEA,SAEA,UAEA,OAEA,SAEA,QACA;EAfS,KAAA,SAAA;EAEA,KAAA,OAAA;EAEA,KAAA,WAAA;EAEA,KAAA,UAAA;EAEA,KAAA,WAAA;EAEA,KAAA,QAAA;EAEA,KAAA,UAAA;EAEA,KAAA,SAAA;CACR;AACL;AAEA,MAAM,QAA+B,CAAC;;AAGtC,MAAM,+BAA+B,IAAI,QAAQ,GAAG,QAAQ,OAAO,OAAO,OAAO,KAAA,GAAW,KAAA,GAAW,CAAC;;AAGxG,MAAa,eAAe;;;;;;;AA0B5B,IAAa,QAAb,MAA4C;;CAE1C;;CAKA;;CAEA;;CAEA;;CAEA;;CAEA,OAAgB;;CAEhB;;;;;;;CAOA,aAAa;;CAEb,eAAsC;;;;;;;;;;CAUtC,UAA+B,KAAA;;CAE/B,YAAwC,KAAA;;CAExC,SAAoD,KAAA;;CAEpD,QAAQ;;;;;CAKR,WAAsC,KAAA;;;;;;;CAOtC,SAAwD,KAAA;;;;;;CAMxD,SAAoC,KAAA;CAEpC,YACE,QACA,SAKA;EACA,MAAM,QAAQ,WAAW,MAAe;EACxC,KAAK,QAAQ;EACb,KAAK,MAAM,MAAM;EACjB,KAAK,MAAM,SAAS,UAAU;EAC9B,KAAK,UAAU,SAAS,WAAW;EACnC,KAAK,UAAU,SAAS,WAAW,QAAQ,MAAM;EACjD,KAAK,YAAY,UAAU,SAAS,KAAK,IAAI,IAAI,iBAAiB,aAAa,IAAI;EACnF,KAAK,UAAU;CACjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BA,MACE,SAAiB,GACjB,SAIM;EACN,KAAK,MAAM;EACX,KAAK,MAAM,KAAK,MAAM;EACtB,KAAK,UAAU,SAAS,WAAW;EACnC,KAAK,UAAU,SAAS,WAAW,QAAQ,MAAM;EACjD,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,KAAK,aAAa;EAClB,KAAK,eAAe;EACpB,KAAK,UAAU,KAAA;EACf,KAAK,YAAY,KAAA;EACjB,KAAK,SAAS,KAAA;EACd,KAAK,QAAQ;EACb,KAAK,WAAW,KAAA;EAChB,KAAK,SAAS,KAAA;EACd,OAAO;CACT;;;;CAKA,YAAoB;EAClB,OAAO,KAAK,MAAM,KAAK;CACzB;;;;CAKA,QAAiB;EACf,OAAO,KAAK,OAAO,KAAK;CAC1B;;;;CAKA,MAAM,OAAe,KAAuB;EAC1C,MAAM,QAAQ,KAAK;EACnB,QAAQ,KAAK,WAAb;GACE,KAAK,GACH,OAAO,MAAM,MAAM,OAAO,GAAG;GAC/B,KAAK,GACH,OAAO,MAAM,SAAS,OAAO,GAAG;GAClC,SACE,OAAO,MAAM,MAAM,OAAO,GAAG;EACjC;CACF;;;;CAKA,UAAU,MAAiB,WAAkC,OAAO,SAAiB,KAAK,KAAW;EACnG,OAAO,KAAK,SAAS,aAAa,KAAK,YAAY,QAAQ,MAAM,QAAQ,CAAC;CAC5E;;;;CAKA,IAAI,MAAiB,WAAkC,OAAO,SAAiB,KAAK,KAAW;EAC7F,OAAO,KAAK,SAAS,OAAO,KAAK,YAAY,QAAQ,MAAM,QAAQ,CAAC;CACtE;;;;;CAMA,WAAW,QAAgB,WAAkC,OAAa;EACxE,OAAO,KAAK,SACV,cACA,IAAI,QAAQ,KAAK,KAAK,cAAc,UAAU,OAAO,OAAO,KAAA,GAAW,KAAA,GAAW,MAAM,CAC1F;CACF;;;;;CAMA,IAAI,MAAiB,UAAiC,QAAsB;EAC1E,OAAO,KAAK,UAAU,KAAK,WAAW,QAAQ,QAAQ,IAAI,KAAK,UAAU,MAAM,QAAQ;CACzF;;;;CAKA,UAAU,MAAe,MAAiB,OAAgB,SAAiB,KAAK,KAAW;EACzF,OAAO,KAAK,SAAS,MAAM,IAAI,QAAQ,QAAQ,MAAM,OAAO,OAAO,MAAM,OAAO,KAAA,GAAW,CAAC,CAAC;CAC/F;;;;CAKA,YAAY,MAAe,MAAiB,SAAiB,SAAiB,KAAK,KAAW;EAC5F,OAAO,KAAK,SAAS,MAAM,IAAI,QAAQ,QAAQ,MAAM,OAAO,OAAO,OAAO,KAAA,GAAW,SAAS,CAAC,CAAC;CAClG;;;;CAKA,SAAS,MAAe,SAAwB;EAC9C,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,IAAI,SAAS,gBAAgB,KAAK,YAAY,KAAA,KAAa,QAAQ,UAAU,KAAK,QAAQ,SACxF,KAAK,UAAU;EAEjB,OAAO;CACT;;;;;CAMA,eAAe,SAAwB;EACrC,IAAI,KAAK,YAAY,KAAK,SAAS,KAAK,UAAU;EAClD,KAAK,UAAU;CACjB;;;;;;CAOA,kBAA2B;EACzB,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,KAAK;EACf,IACE,MAAM,KAAA,KACN,MAAM,KACN,EAAE,UAAU,EAAE,UACd,KAAK,SAAS,gBACd,EAAE,YACF,EAAE,YAAY,KAAA,GAEd,OAAO;EAET,MAAM,UACJ,EAAE,QAAQ,WAAW,IAAI,EAAE,UAAU,CAAC,GAAG,EAAE,SAAS,GAAG,EAAE,QAAQ,QAAQ,MAAM,CAAC,EAAE,QAAQ,SAAS,CAAC,CAAC,CAAC;EACxG,OAAO,IAAI,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;CACpG;;;;;;CAOA,QAAQ,QAAgB,UAAuC;EAC7D,IAAI,KAAK,eAAe,QACtB,KAAK,eAAe,cAAc,KAAK,cAAc,QAAQ;OACxD;GACL,KAAK,aAAa;GAClB,KAAK,eAAe;EACtB;CACF;;CAGA,YAAY,QAAgB,MAAiB,UAA0C;EACrF,IAAI,KAAK,eAAe,UAAU,KAAK,aAAa,SAAS,GAC3D,WAAW,cAAc,KAAK,cAAc,QAAQ;EAEtD,OAAO,IAAI,QAAQ,QAAQ,MAAM,UAAU,OAAO,OAAO,KAAA,GAAW,KAAA,GAAW,CAAC;CAClF;AACF;;AAGA,MAAa,iBAAiB,GAA0B,MAAoD;CAC1G,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,MAAM,MAAM,EAAE,MAAM;CACpB,KAAK,MAAM,KAAK,GACd,IAAI,CAAC,IAAI,SAAS,CAAC,GAAG,IAAI,KAAK,CAAC;CAElC,OAAO;AACT;;;;;;;AAQA,MAAa,iBAAiB,GAAY,MAAwB;CAChE,IAAI,EAAE,SAAS,EAAE,QAAQ,OAAO;CAChC,IAAI,EAAE,SAAS,EAAE,QAAQ,OAAO;CAChC,MAAM,WAAW,cAAc,EAAE,UAAU,EAAE,QAAQ;CACrD,IAAI,aAAa,EAAE,UAAU,OAAO;CACpC,OAAO,IAAI,QACT,EAAE,QACF,EAAE,MACF,UACA,EAAE,QAAQ,SAAS,IAAI,EAAE,UAAU,EAAE,SACrC,EAAE,YAAY,EAAE,UAChB,EAAE,WAAW,EAAE,QAAQ,EAAE,OACzB,EAAE,WAAW,EAAE,SACf,EAAE,MACJ;AACF"}
+{"version":3,"file":"Input.js","names":[],"sources":["../src/Input.ts"],"sourcesContent":["/**\n * Input types and the mutable parse {@link State} cursor.\n *\n * Like winnow, effect-parse parsers advance a mutable cursor rather than\n * returning the remaining input. A {@link State} wraps the original input\n * together with the current offset, the streaming (partial) flag, the\n * services available to the parser, and the details of the most recent\n * failure.\n *\n * Most users never touch `State` directly. It is exposed for writing custom\n * low-level parsers with `Parser.make`, and for drivers that run a parser's\n * `step` many times over one input, reusing a state with {@link State.reset}.\n *\n * @since 0.1.0\n */\nimport * as Predicate from \"effect/Predicate\"\nimport * as Context from \"effect/Context\"\nimport type { Encoding } from \"./Encoding.js\"\nimport type { ErrorKind } from \"./ParseError.js\"\nimport type { Builder as SyntaxBuilder } from \"./internal/syntax.js\"\n\n/**\n * The kinds of input a parser can consume.\n *\n * - `string`: tokens are Unicode code points (returned as strings), offsets\n *   are UTF-16 code-unit indices.\n * - `Uint8Array`: tokens are bytes (numbers), slices are `subarray` views.\n * - `ReadonlyArray<T>`: tokens are elements, e.g. the output of a lexer.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Input = string | Uint8Array | ReadonlyArray<unknown>\n\n/**\n * Binary data that can be passed wherever a `Uint8Array` input is expected:\n * an `ArrayBuffer`, a `SharedArrayBuffer`, a `DataView` or any typed array.\n *\n * It is viewed, not copied, as a `Uint8Array` of its bytes. A typed array\n * with wider elements is viewed in the platform's byte order, which is\n * little endian on all common platforms, so a `Uint16Array` of UTF-16 code\n * units can be parsed with `Text.utf16le`.\n *\n * @since 0.1.0\n * @category models\n */\nexport type BinaryInput = ArrayBufferLike | ArrayBufferView\n\n/**\n * What the runners accept for a parser over `I`: the input itself, or, for\n * byte parsers, any {@link BinaryInput}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Source<I> = I | ([I] extends [Uint8Array] ? BinaryInput : never)\n\n/**\n * Converts a {@link Source} to the input parsers read: binary data becomes a\n * `Uint8Array` view of the same memory, everything else is returned as is.\n *\n * @example\n * ```ts\n * import { Input } from \"@thomasfosterau/effect-parse\"\n *\n * Input.fromSource(new Uint16Array([0x41]).buffer) // Uint8Array [0x41, 0x00]\n * ```\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const fromSource: {\n  (source: BinaryInput): Uint8Array\n  <I extends Input>(source: Source<I>): I\n} = (source: Input | BinaryInput): any => {\n  if (Predicate.isString(source) || source instanceof Uint8Array || Array.isArray(source)) return source\n  if (ArrayBuffer.isView(source)) return new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n  // An explicit length fixes the view's size even for a resizable buffer\n  if (isArrayBufferLike(source)) return new Uint8Array(source, 0, source.byteLength)\n  return source\n}\n\nconst isArrayBufferLike = (u: unknown): u is ArrayBufferLike =>\n  u instanceof ArrayBuffer || (globalThis.SharedArrayBuffer !== undefined && u instanceof SharedArrayBuffer)\n\n/**\n * The type of a single token of an input.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Token<I> = I extends string\n  ? string\n  : I extends Uint8Array\n    ? number\n    : I extends ReadonlyArray<infer T>\n      ? T\n      : never\n\n/**\n * The type of a contiguous slice of an input.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Slice<I> = I extends string\n  ? string\n  : I extends Uint8Array\n    ? Uint8Array\n    : I extends ReadonlyArray<infer T>\n      ? ReadonlyArray<T>\n      : never\n\n/**\n * Sentinel returned by a parser step to signal failure. The failure details\n * are stored on the {@link State}.\n *\n * @since 0.1.0\n * @category failure\n */\nexport const Fail: unique symbol = /*#__PURE__*/ Symbol.for(\"effect-parse/Fail\")\n\n/**\n * @since 0.1.0\n * @category failure\n */\nexport type Fail = typeof Fail\n\n/**\n * How a failure propagates (winnow's `ErrMode`, nom's `Err`).\n *\n * - `Backtrack`: recoverable; `alt`, `opt`, `repeat`, ... try something else.\n * - `Cut`: unrecoverable; alternatives are not attempted.\n * - `Incomplete`: a partial (streaming) input ran out; more data is needed.\n *\n * @since 0.1.0\n * @category failure\n */\nexport type ErrMode = \"Backtrack\" | \"Cut\" | \"Incomplete\"\n\n/**\n * The details of a parse failure.\n *\n * @since 0.1.0\n * @category failure\n */\nexport class Failure {\n  constructor(\n    /** Offset into the input where the failure occurred. */\n    readonly offset: number,\n    /** The kind of parser that failed. */\n    readonly kind: ErrorKind,\n    /** Rendered descriptions of what was expected at `offset`. */\n    readonly expected: ReadonlyArray<string>,\n    /** Context labels added by `Parser.context`, innermost first. */\n    readonly context: ReadonlyArray<string>,\n    /** Whether a user supplied cause is present. */\n    readonly hasCause: boolean,\n    /** A user supplied (typed) cause. */\n    readonly cause: unknown,\n    /** An optional free-form message. */\n    readonly message: string | undefined,\n    /** For `Incomplete` failures, how many more tokens are needed (0 if unknown). */\n    readonly needed: number\n  ) {}\n}\n\nconst empty: ReadonlyArray<string> = []\n\n/** The failure a {@link State} starts with, before any step has failed. */\nconst initialFailure = /*#__PURE__*/ new Failure(0, \"Fail\", empty, empty, false, undefined, undefined, 0)\n\n/** @internal */\nexport const emptyStrings = empty\n\n/**\n * A tracing event emitted by `Parser.trace`.\n *\n * @since 0.1.0\n * @category tracing\n */\nexport interface TraceEvent {\n  readonly _tag: \"Enter\" | \"Exit\"\n  readonly name: string\n  readonly depth: number\n  readonly offset: number\n  /** For `Exit` events: the outcome. */\n  readonly result?: \"Ok\" | ErrMode\n  /** For `Exit` events: the offset reached. */\n  readonly endOffset?: number\n  readonly state: State\n}\n\n/**\n * The mutable parsing cursor.\n *\n * @since 0.1.0\n * @category models\n */\nexport class State<I extends Input = Input> {\n  /** The full input being parsed. */\n  readonly input: I\n  /** The current offset. Advanced by parsers, rewound on backtracking. */\n  // Declared, not defined, so that a subclass can make it an accessor\n  declare pos: number\n  /** The end offset (the input's length; in bits inside `Bits.bits`). */\n  end: number\n  /** 0 = string, 1 = Uint8Array, 2 = array. */\n  readonly inputKind: 0 | 1 | 2\n  /** Whether the input is partial (streaming): running out yields `Incomplete`. */\n  partial: boolean\n  /** Services available to `Parser.service`. */\n  context: Context.Context<never>\n  /** Mode of the latest failure. Only meaningful after a step returned {@link Fail}. */\n  mode: ErrMode = \"Backtrack\"\n  /**\n   * The latest failure, kept unmerged: the failure is `failureHead` merged\n   * (as `mergeFailures` does) with `failureTie1` and then `failureTie2`, all\n   * at the same offset. `Parser.alt` records its tied branch failures here\n   * with {@link failTies} instead of merging them, so that an enclosing `alt`\n   * whose next branch succeeds never pays for the merge. Reading\n   * {@link failure} performs the merge, once.\n   *\n   * @internal\n   */\n  failureHead: Failure\n  /** @internal */\n  failureTie1: Failure | undefined = undefined\n  /** @internal */\n  failureTie2: Failure | undefined = undefined\n  /** Backs {@link deepest}. @internal */\n  deepestFailure: Failure | undefined = undefined\n  /**\n   * Whether the furthest failure is the latest failure, still unmerged, so\n   * that {@link deepest} is that failure once merged. Only set while\n   * `failureTie1` is.\n   *\n   * @internal\n   */\n  deepestIsLatest = false\n  /**\n   * The offset of a recoverable failure that occurred without consuming\n   * input (for example the last attempt of a `repeat`). Its\n   * expectations are merged into new failures at the same offset, producing\n   * messages like `expected digit or \")\"`.\n   */\n  hintOffset = -1\n  /** The expectations of the hint at {@link hintOffset}. */\n  hintExpected: ReadonlyArray<string> = empty\n  /**\n   * The furthest recoverable failure seen so far, including failures that\n   * were later swallowed by backtracking (for example a trailing separator\n   * followed by an invalid element). It is reported instead of the final\n   * failure when it lies further into the input. This is the classic PEG\n   * \"farthest failure\" heuristic. `Parser.cut` keeps only the failures\n   * recorded inside it when it commits, and `Parser.peek` and `Parser.not`\n   * forget the failures of a lookahead that succeeded.\n   */\n  get deepest(): Failure | undefined {\n    if (this.deepestIsLatest) this.settleFailure()\n    return this.deepestFailure\n  }\n  set deepest(failure: Failure | undefined) {\n    this.deepestIsLatest = false\n    this.deepestFailure = failure\n  }\n  /** When defined, `Parser.resumeAfter`/`retryAfter` record failures here. */\n  recovered: Array<Failure> | undefined = undefined\n  /** When defined, `Parser.trace` reports events here. */\n  tracer: ((event: TraceEvent) => void) | undefined = undefined\n  /** Current tracing depth. */\n  depth = 0\n  /**\n   * The text encoding of a byte input, recorded by `Text` parsers when they\n   * fail so that errors can show the input as text.\n   */\n  encoding: Encoding<any> | undefined = undefined\n  /**\n   * The checkpoints of a resumable streaming parse (see\n   * `ParserStream.parseAll`); `undefined` otherwise.\n   *\n   * @internal\n   */\n  resume: Map<object, Map<number, unknown>> | undefined = undefined\n  /**\n   * The tree builder of a `Syntax` parse; `undefined` otherwise.\n   *\n   * @internal\n   */\n  syntax: SyntaxBuilder | undefined = undefined\n\n  constructor(\n    source: I | Source<I>,\n    options?: {\n      readonly partial?: boolean | undefined\n      readonly context?: Context.Context<never> | undefined\n      readonly offset?: number | undefined\n    }\n  ) {\n    const input = fromSource(source as Input) as I\n    this.input = input\n    this.end = input.length\n    this.pos = options?.offset ?? 0\n    this.partial = options?.partial ?? false\n    this.context = options?.context ?? Context.empty()\n    this.inputKind = Predicate.isString(input) ? 0 : input instanceof Uint8Array ? 1 : 2\n    this.failureHead = initialFailure\n  }\n\n  /** Details of the latest failure. Only meaningful after a step returned {@link Fail}. */\n  get failure(): Failure {\n    if (this.failureTie1 !== undefined) this.settleFailure()\n    return this.failureHead\n  }\n  set failure(failure: Failure) {\n    if (this.deepestIsLatest) this.settleFailure()\n    this.failureHead = failure\n    this.failureTie1 = undefined\n    this.failureTie2 = undefined\n  }\n\n  /** Merges the latest failure's ties into it (see {@link failureHead}). */\n  private settleFailure(): void {\n    let failure = this.failureHead\n    const tie1 = this.failureTie1\n    if (tie1 !== undefined) {\n      failure = mergeTiedFailures(failure, tie1, mergeExpected(failure.expected, tie1.expected))\n      const tie2 = this.failureTie2\n      if (tie2 !== undefined) failure = mergeTiedFailures(failure, tie2, mergeExpected(failure.expected, tie2.expected))\n      this.failureHead = failure\n      this.failureTie1 = undefined\n      this.failureTie2 = undefined\n    }\n    if (this.deepestIsLatest) {\n      this.deepestFailure = failure\n      this.deepestIsLatest = false\n    }\n  }\n\n  /**\n   * Prepares the state for another run over the same input, starting at\n   * `offset`: afterwards it behaves exactly like\n   * `new State(state.input, { ...options, offset })`, without allocating a\n   * new state.\n   *\n   * Every per-run field is reset: the cursor and end, the latest failure,\n   * hints and furthest failure, recorded recoveries, the tracer and tracing\n   * depth, the recorded encoding and streaming checkpoints. Like the\n   * constructor, `partial` defaults to `false` and `context` to the empty\n   * context, so pass them again on every reset.\n   *\n   * Use it to run many small parses over one buffer, for example one per\n   * token, with `parser.step`. A state can be reused after any run,\n   * including one that failed, returned `Incomplete` or threw.\n   *\n   * @example\n   * ```ts\n   * import { Ascii, Input } from \"@thomasfosterau/effect-parse\"\n   *\n   * const state = new Input.State(\"12 34\")\n   * Ascii.decUint.step(state) // 12\n   * state.reset(3)\n   * Ascii.decUint.step(state) // 34\n   * ```\n   *\n   * @since 0.2.0\n   */\n  reset(\n    offset: number = 0,\n    options?: {\n      readonly partial?: boolean | undefined\n      readonly context?: Context.Context<never> | undefined\n    }\n  ): this {\n    this.pos = offset\n    this.end = this.input.length\n    this.partial = options?.partial ?? false\n    this.context = options?.context ?? Context.empty()\n    this.mode = \"Backtrack\"\n    this.failureHead = initialFailure\n    this.failureTie1 = undefined\n    this.failureTie2 = undefined\n    this.hintOffset = -1\n    this.hintExpected = empty\n    this.deepestFailure = undefined\n    this.deepestIsLatest = false\n    this.recovered = undefined\n    this.tracer = undefined\n    this.depth = 0\n    this.encoding = undefined\n    this.resume = undefined\n    return this\n  }\n\n  /**\n   * The number of input units (code units, bytes or elements) remaining.\n   */\n  remaining(): number {\n    return this.end - this.pos\n  }\n\n  /**\n   * Whether the cursor is at the end of the input.\n   */\n  atEnd(): boolean {\n    return this.pos >= this.end\n  }\n\n  /**\n   * Extracts the slice `[start, end)` of the input.\n   */\n  slice(start: number, end: number): Slice<I> {\n    const input = this.input as any\n    switch (this.inputKind) {\n      case 0:\n        return input.slice(start, end)\n      case 1:\n        return input.subarray(start, end)\n      default:\n        return input.slice(start, end)\n    }\n  }\n\n  /**\n   * Records a recoverable failure at the current offset and returns {@link Fail}.\n   */\n  backtrack(kind: ErrorKind, expected: ReadonlyArray<string> = empty, offset: number = this.pos): Fail {\n    return this.failWith(\"Backtrack\", this.makeFailure(offset, kind, expected))\n  }\n\n  /**\n   * Records an unrecoverable failure at the current offset and returns {@link Fail}.\n   */\n  cut(kind: ErrorKind, expected: ReadonlyArray<string> = empty, offset: number = this.pos): Fail {\n    return this.failWith(\"Cut\", this.makeFailure(offset, kind, expected))\n  }\n\n  /**\n   * Records an `Incomplete` failure (only meaningful for partial input) and\n   * returns {@link Fail}.\n   */\n  incomplete(needed: number, expected: ReadonlyArray<string> = empty): Fail {\n    return this.failWith(\n      \"Incomplete\",\n      new Failure(this.pos, \"Incomplete\", expected, empty, false, undefined, undefined, needed)\n    )\n  }\n\n  /**\n   * Fails because the input ended: `Incomplete` for partial input, otherwise\n   * a `Backtrack` failure of the given kind.\n   */\n  eoi(kind: ErrorKind, expected: ReadonlyArray<string>, needed: number): Fail {\n    return this.partial ? this.incomplete(needed, expected) : this.backtrack(kind, expected)\n  }\n\n  /**\n   * Records a failure carrying a user supplied cause.\n   */\n  failCause(mode: ErrMode, kind: ErrorKind, cause: unknown, offset: number = this.pos): Fail {\n    return this.failWith(mode, new Failure(offset, kind, empty, empty, true, cause, undefined, 0))\n  }\n\n  /**\n   * Records a failure carrying a message.\n   */\n  failMessage(mode: ErrMode, kind: ErrorKind, message: string, offset: number = this.pos): Fail {\n    return this.failWith(mode, new Failure(offset, kind, empty, empty, false, undefined, message, 0))\n  }\n\n  /**\n   * Records the given failure and returns {@link Fail}.\n   */\n  failWith(mode: ErrMode, failure: Failure): Fail {\n    this.mode = mode\n    if (this.deepestIsLatest) {\n      // The furthest failure is the latest one: it is replaced below, unmerged, if `failure` is as far\n      if (mode === \"Backtrack\" && failure.offset >= this.failureHead.offset) this.deepestIsLatest = false\n      else this.settleFailure()\n    }\n    this.failureHead = failure\n    this.failureTie1 = undefined\n    this.failureTie2 = undefined\n    if (mode === \"Backtrack\" && (this.deepestFailure === undefined || failure.offset >= this.deepestFailure.offset)) {\n      this.deepestFailure = failure\n    }\n    return Fail\n  }\n\n  /**\n   * Records a recoverable failure made of tied failures, merged only when\n   * read: `failWith(\"Backtrack\", f)` where `f` merges `head` with `tie1`\n   * and then `tie2` (all at the same offset), as `mergeFailures` would.\n   *\n   * @internal\n   */\n  failTies(head: Failure, tie1: Failure, tie2: Failure | undefined): Fail {\n    this.mode = \"Backtrack\"\n    if (this.deepestIsLatest && head.offset < this.failureHead.offset) this.settleFailure()\n    this.failureHead = head\n    this.failureTie1 = tie1\n    this.failureTie2 = tie2\n    this.deepestIsLatest = this.deepestFailure === undefined || head.offset >= this.deepestFailure.offset\n    return Fail\n  }\n\n  /**\n   * Replaces the details of the current failure (for example to add context),\n   * keeping the record of the furthest failure consistent.\n   */\n  replaceFailure(failure: Failure): void {\n    if (this.deepest === this.failure) this.deepest = failure\n    this.failure = failure\n  }\n\n  /**\n   * The failure to report to the user: the current failure, or the furthest\n   * failure if it lies beyond the current one and the current failure is a\n   * plain syntax error (no user cause or message).\n   */\n  reportedFailure(): Failure {\n    const f = this.failure\n    const d = this.deepest\n    if (\n      d === undefined ||\n      d === f ||\n      d.offset <= f.offset ||\n      this.mode === \"Incomplete\" ||\n      f.hasCause ||\n      f.message !== undefined\n    ) {\n      return f\n    }\n    const context =\n      d.context.length === 0 ? f.context : [...d.context, ...f.context.filter((l) => !d.context.includes(l))]\n    return new Failure(d.offset, d.kind, d.expected, context, d.hasCause, d.cause, d.message, d.needed)\n  }\n\n  /**\n   * Records that, at `offset`, any of `expected` could also have been\n   * accepted. Used by parsers that stop without failing, such as `opt`,\n   * `repeat` and `Ascii.digit1`.\n   */\n  setHint(offset: number, expected: ReadonlyArray<string>): void {\n    if (this.hintOffset === offset) {\n      this.hintExpected = mergeExpected(this.hintExpected, expected)\n    } else {\n      this.hintOffset = offset\n      this.hintExpected = expected\n    }\n  }\n\n  /** @internal */\n  makeFailure(offset: number, kind: ErrorKind, expected: ReadonlyArray<string>): Failure {\n    if (this.hintOffset === offset && this.hintExpected.length > 0) {\n      expected = mergeExpected(this.hintExpected, expected)\n    }\n    return new Failure(offset, kind, expected, empty, false, undefined, undefined, 0)\n  }\n}\n\n/** @internal */\nexport const mergeExpected = (a: ReadonlyArray<string>, b: ReadonlyArray<string>): ReadonlyArray<string> => {\n  if (a.length === 0) return b\n  if (b.length === 0) return a\n  const out = a.slice()\n  for (const e of b) {\n    if (!out.includes(e)) out.push(e)\n  }\n  return out\n}\n\n/**\n * Combines the failures of two alternatives: the furthest failure wins, and\n * failures at the same offset have their expectations merged.\n *\n * @internal\n */\nexport const mergeFailures = (a: Failure, b: Failure): Failure => {\n  if (a.offset > b.offset) return a\n  if (b.offset > a.offset) return b\n  return mergeTiedFailures(a, b, mergeExpected(a.expected, b.expected))\n}\n\n/**\n * {@link mergeFailures} for two failures at the same offset, given their\n * merged expectations (`mergeExpected(a.expected, b.expected)`, possibly\n * memoised by the caller).\n *\n * @internal\n */\nexport const mergeTiedFailures = (a: Failure, b: Failure, expected: ReadonlyArray<string>): Failure => {\n  if (expected === b.expected) return b\n  return new Failure(\n    b.offset,\n    b.kind,\n    expected,\n    b.context.length > 0 ? b.context : a.context,\n    b.hasCause || a.hasCause,\n    b.hasCause ? b.cause : a.cause,\n    b.message ?? a.message,\n    b.needed\n  )\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuEA,MAAa,cAGR,WAAqC;CACxC,IAAI,UAAU,SAAS,MAAM,KAAK,kBAAkB,cAAc,MAAM,QAAQ,MAAM,GAAG,OAAO;CAChG,IAAI,YAAY,OAAO,MAAM,GAAG,OAAO,IAAI,WAAW,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;CAEzG,IAAI,kBAAkB,MAAM,GAAG,OAAO,IAAI,WAAW,QAAQ,GAAG,OAAO,UAAU;CACjF,OAAO;AACT;AAEA,MAAM,qBAAqB,MACzB,aAAa,eAAgB,WAAW,sBAAsB,KAAA,KAAa,aAAa;;;;;;;;AAqC1F,MAAa,OAAoC,qBAAO,IAAI,mBAAmB;;;;;;;AA0B/E,IAAa,UAAb,MAAqB;CAGR;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAhBX,YAEE,QAEA,MAEA,UAEA,SAEA,UAEA,OAEA,SAEA,QACA;EAfS,KAAA,SAAA;EAEA,KAAA,OAAA;EAEA,KAAA,WAAA;EAEA,KAAA,UAAA;EAEA,KAAA,WAAA;EAEA,KAAA,QAAA;EAEA,KAAA,UAAA;EAEA,KAAA,SAAA;CACR;AACL;AAEA,MAAM,QAA+B,CAAC;;AAGtC,MAAM,+BAA+B,IAAI,QAAQ,GAAG,QAAQ,OAAO,OAAO,OAAO,KAAA,GAAW,KAAA,GAAW,CAAC;;AAGxG,MAAa,eAAe;;;;;;;AA0B5B,IAAa,QAAb,MAA4C;;CAE1C;;CAKA;;CAEA;;CAEA;;CAEA;;CAEA,OAAgB;;;;;;;;;;;CAWhB;;CAEA,cAAmC,KAAA;;CAEnC,cAAmC,KAAA;;CAEnC,iBAAsC,KAAA;;;;;;;;CAQtC,kBAAkB;;;;;;;CAOlB,aAAa;;CAEb,eAAsC;;;;;;;;;;CAUtC,IAAI,UAA+B;EACjC,IAAI,KAAK,iBAAiB,KAAK,cAAc;EAC7C,OAAO,KAAK;CACd;CACA,IAAI,QAAQ,SAA8B;EACxC,KAAK,kBAAkB;EACvB,KAAK,iBAAiB;CACxB;;CAEA,YAAwC,KAAA;;CAExC,SAAoD,KAAA;;CAEpD,QAAQ;;;;;CAKR,WAAsC,KAAA;;;;;;;CAOtC,SAAwD,KAAA;;;;;;CAMxD,SAAoC,KAAA;CAEpC,YACE,QACA,SAKA;EACA,MAAM,QAAQ,WAAW,MAAe;EACxC,KAAK,QAAQ;EACb,KAAK,MAAM,MAAM;EACjB,KAAK,MAAM,SAAS,UAAU;EAC9B,KAAK,UAAU,SAAS,WAAW;EACnC,KAAK,UAAU,SAAS,WAAW,QAAQ,MAAM;EACjD,KAAK,YAAY,UAAU,SAAS,KAAK,IAAI,IAAI,iBAAiB,aAAa,IAAI;EACnF,KAAK,cAAc;CACrB;;CAGA,IAAI,UAAmB;EACrB,IAAI,KAAK,gBAAgB,KAAA,GAAW,KAAK,cAAc;EACvD,OAAO,KAAK;CACd;CACA,IAAI,QAAQ,SAAkB;EAC5B,IAAI,KAAK,iBAAiB,KAAK,cAAc;EAC7C,KAAK,cAAc;EACnB,KAAK,cAAc,KAAA;EACnB,KAAK,cAAc,KAAA;CACrB;;CAGA,gBAA8B;EAC5B,IAAI,UAAU,KAAK;EACnB,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,KAAA,GAAW;GACtB,UAAU,kBAAkB,SAAS,MAAM,cAAc,QAAQ,UAAU,KAAK,QAAQ,CAAC;GACzF,MAAM,OAAO,KAAK;GAClB,IAAI,SAAS,KAAA,GAAW,UAAU,kBAAkB,SAAS,MAAM,cAAc,QAAQ,UAAU,KAAK,QAAQ,CAAC;GACjH,KAAK,cAAc;GACnB,KAAK,cAAc,KAAA;GACnB,KAAK,cAAc,KAAA;EACrB;EACA,IAAI,KAAK,iBAAiB;GACxB,KAAK,iBAAiB;GACtB,KAAK,kBAAkB;EACzB;CACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BA,MACE,SAAiB,GACjB,SAIM;EACN,KAAK,MAAM;EACX,KAAK,MAAM,KAAK,MAAM;EACtB,KAAK,UAAU,SAAS,WAAW;EACnC,KAAK,UAAU,SAAS,WAAW,QAAQ,MAAM;EACjD,KAAK,OAAO;EACZ,KAAK,cAAc;EACnB,KAAK,cAAc,KAAA;EACnB,KAAK,cAAc,KAAA;EACnB,KAAK,aAAa;EAClB,KAAK,eAAe;EACpB,KAAK,iBAAiB,KAAA;EACtB,KAAK,kBAAkB;EACvB,KAAK,YAAY,KAAA;EACjB,KAAK,SAAS,KAAA;EACd,KAAK,QAAQ;EACb,KAAK,WAAW,KAAA;EAChB,KAAK,SAAS,KAAA;EACd,OAAO;CACT;;;;CAKA,YAAoB;EAClB,OAAO,KAAK,MAAM,KAAK;CACzB;;;;CAKA,QAAiB;EACf,OAAO,KAAK,OAAO,KAAK;CAC1B;;;;CAKA,MAAM,OAAe,KAAuB;EAC1C,MAAM,QAAQ,KAAK;EACnB,QAAQ,KAAK,WAAb;GACE,KAAK,GACH,OAAO,MAAM,MAAM,OAAO,GAAG;GAC/B,KAAK,GACH,OAAO,MAAM,SAAS,OAAO,GAAG;GAClC,SACE,OAAO,MAAM,MAAM,OAAO,GAAG;EACjC;CACF;;;;CAKA,UAAU,MAAiB,WAAkC,OAAO,SAAiB,KAAK,KAAW;EACnG,OAAO,KAAK,SAAS,aAAa,KAAK,YAAY,QAAQ,MAAM,QAAQ,CAAC;CAC5E;;;;CAKA,IAAI,MAAiB,WAAkC,OAAO,SAAiB,KAAK,KAAW;EAC7F,OAAO,KAAK,SAAS,OAAO,KAAK,YAAY,QAAQ,MAAM,QAAQ,CAAC;CACtE;;;;;CAMA,WAAW,QAAgB,WAAkC,OAAa;EACxE,OAAO,KAAK,SACV,cACA,IAAI,QAAQ,KAAK,KAAK,cAAc,UAAU,OAAO,OAAO,KAAA,GAAW,KAAA,GAAW,MAAM,CAC1F;CACF;;;;;CAMA,IAAI,MAAiB,UAAiC,QAAsB;EAC1E,OAAO,KAAK,UAAU,KAAK,WAAW,QAAQ,QAAQ,IAAI,KAAK,UAAU,MAAM,QAAQ;CACzF;;;;CAKA,UAAU,MAAe,MAAiB,OAAgB,SAAiB,KAAK,KAAW;EACzF,OAAO,KAAK,SAAS,MAAM,IAAI,QAAQ,QAAQ,MAAM,OAAO,OAAO,MAAM,OAAO,KAAA,GAAW,CAAC,CAAC;CAC/F;;;;CAKA,YAAY,MAAe,MAAiB,SAAiB,SAAiB,KAAK,KAAW;EAC5F,OAAO,KAAK,SAAS,MAAM,IAAI,QAAQ,QAAQ,MAAM,OAAO,OAAO,OAAO,KAAA,GAAW,SAAS,CAAC,CAAC;CAClG;;;;CAKA,SAAS,MAAe,SAAwB;EAC9C,KAAK,OAAO;EACZ,IAAI,KAAK,iBAAiB;GAExB,IAAI,SAAS,eAAe,QAAQ,UAAU,KAAK,YAAY,QAAQ,KAAK,kBAAkB;QACzF,KAAK,cAAc;EAC1B;EACA,KAAK,cAAc;EACnB,KAAK,cAAc,KAAA;EACnB,KAAK,cAAc,KAAA;EACnB,IAAI,SAAS,gBAAgB,KAAK,mBAAmB,KAAA,KAAa,QAAQ,UAAU,KAAK,eAAe,SACtG,KAAK,iBAAiB;EAExB,OAAO;CACT;;;;;;;;CASA,SAAS,MAAe,MAAe,MAAiC;EACtE,KAAK,OAAO;EACZ,IAAI,KAAK,mBAAmB,KAAK,SAAS,KAAK,YAAY,QAAQ,KAAK,cAAc;EACtF,KAAK,cAAc;EACnB,KAAK,cAAc;EACnB,KAAK,cAAc;EACnB,KAAK,kBAAkB,KAAK,mBAAmB,KAAA,KAAa,KAAK,UAAU,KAAK,eAAe;EAC/F,OAAO;CACT;;;;;CAMA,eAAe,SAAwB;EACrC,IAAI,KAAK,YAAY,KAAK,SAAS,KAAK,UAAU;EAClD,KAAK,UAAU;CACjB;;;;;;CAOA,kBAA2B;EACzB,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,KAAK;EACf,IACE,MAAM,KAAA,KACN,MAAM,KACN,EAAE,UAAU,EAAE,UACd,KAAK,SAAS,gBACd,EAAE,YACF,EAAE,YAAY,KAAA,GAEd,OAAO;EAET,MAAM,UACJ,EAAE,QAAQ,WAAW,IAAI,EAAE,UAAU,CAAC,GAAG,EAAE,SAAS,GAAG,EAAE,QAAQ,QAAQ,MAAM,CAAC,EAAE,QAAQ,SAAS,CAAC,CAAC,CAAC;EACxG,OAAO,IAAI,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;CACpG;;;;;;CAOA,QAAQ,QAAgB,UAAuC;EAC7D,IAAI,KAAK,eAAe,QACtB,KAAK,eAAe,cAAc,KAAK,cAAc,QAAQ;OACxD;GACL,KAAK,aAAa;GAClB,KAAK,eAAe;EACtB;CACF;;CAGA,YAAY,QAAgB,MAAiB,UAA0C;EACrF,IAAI,KAAK,eAAe,UAAU,KAAK,aAAa,SAAS,GAC3D,WAAW,cAAc,KAAK,cAAc,QAAQ;EAEtD,OAAO,IAAI,QAAQ,QAAQ,MAAM,UAAU,OAAO,OAAO,KAAA,GAAW,KAAA,GAAW,CAAC;CAClF;AACF;;AAGA,MAAa,iBAAiB,GAA0B,MAAoD;CAC1G,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,MAAM,MAAM,EAAE,MAAM;CACpB,KAAK,MAAM,KAAK,GACd,IAAI,CAAC,IAAI,SAAS,CAAC,GAAG,IAAI,KAAK,CAAC;CAElC,OAAO;AACT;;;;;;;AAQA,MAAa,iBAAiB,GAAY,MAAwB;CAChE,IAAI,EAAE,SAAS,EAAE,QAAQ,OAAO;CAChC,IAAI,EAAE,SAAS,EAAE,QAAQ,OAAO;CAChC,OAAO,kBAAkB,GAAG,GAAG,cAAc,EAAE,UAAU,EAAE,QAAQ,CAAC;AACtE;;;;;;;;AASA,MAAa,qBAAqB,GAAY,GAAY,aAA6C;CACrG,IAAI,aAAa,EAAE,UAAU,OAAO;CACpC,OAAO,IAAI,QACT,EAAE,QACF,EAAE,MACF,UACA,EAAE,QAAQ,SAAS,IAAI,EAAE,UAAU,EAAE,SACrC,EAAE,YAAY,EAAE,UAChB,EAAE,WAAW,EAAE,QAAQ,EAAE,OACzB,EAAE,WAAW,EAAE,SACf,EAAE,MACJ;AACF"}

package/dist/Nom.d.ts

@@ -151,7 +151,7 @@ export declare const multispace0: Parser<string, never, never, string>;
 /** @since 0.1.0 @category character */
 export declare const multispace1: Parser<string, never, never, string>;
 /** @since 0.1.0 @category character */
-export declare const lineEnding: Parser<"\n" | "\r\n", never, never, string>;
+export declare const lineEnding: Parser<"\r\n" | "\n", never, never, string>;
 /** @since 0.1.0 @category character */
 export declare const newline: Parser<"\n", never, never, string>;
 /** @since 0.1.0 @category character */

package/dist/Nom.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Nom.d.ts","names":["TokenOf"],"sources":["../src/Nom.ts"],"mappings":";;;;;;;;;;;;;qBA2Da;;;;;;;;;;;qBAQA;;;;;;;;;;qBAQA,aAAc,kBAAkB,GAAG,MAAI,OAAO;;;;;;;qBAQ9C,SAAS;;;;;qBAMT,QAAK,UAAA,gBAAA,KAAA,SAAA,OAAA,OAAAA,MAAA,QAAA,mBAAA,QAAA;;;;;qBAML,SAAM,UAAA,gBAAA,KAAA,SAAA,OAAA,OAAAA,MAAA,QAAA,mBAAA,QAAA;;;;;qBAMN,UAAO,UAAA,gBAAA,YAAA,OAAAA,MAAA,mBAAA,OAAAA,MAAA,QAAA,mBAAA,QAAA;;;;;;;qBAQP,MAAO,UAAU,gBAAgB,KAAK,SAAS,OAAK,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;qBASpG,QAAS,UAAU,gBAC9B,KAAK,SAAS,OACb,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,OAAI,UAAA,gBAAA,kBAAA,OAAA,MAAA,QAAA,mBAAA,QAAA;;;;;qBAMJ,YAAa,UAAU,gBAClC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,aAAc,UAAU,gBACnC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,cAAe,UAAU,gBACpC,WACA,WACA,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,WAAY,UAAU,gBACjC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,YAAa,UAAU,gBAClC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC;;;;;;;;;;;qBAQA,UAAO,GAAA,GAAA,GAAA,UAAA,OAAA,GAAA,IAAA,IAAA,WAAA,OAAA,QAAA,OAAA,GAAA,GAAA,GAAA,IAAA,0BAAA,WAAA,OAAA,GAAA,IAAA,IAAA,QAAA,OAAA,MAAA,IAAA,KAAA,IAAA,IAAA,IAAA,IAAA,IAAA;;;;;;;qBAQP,mBAAgB,GAAA,GAAA,UAAA,OAAA,IAAA,IAAA,WAAA,OAAA,QAAA,eAAA,GAAA,GAAA,IAAA,0BAAA,QAAA,eAAA,IAAA,IAAA,QAAA,eAAA,IAAA,IAAA,IAAA,IAAA,IAAA;;qBAGhB,QAAM;;qBAEN,QAAM;;qBAEN,QAAM;;qBAEN,QAAM;;qBAEN,WAAS;;qBAET,WAAS;;qBAET,WAAS;;qBAET,WAAS;;qBAET,eAAa;;qBAEb,eAAa;;qBAEb,QAAM;;qBAEN,QAAM;;qBAEN,aAAW;;qBAEX,aAAW;;qBAEX,YAAU;;qBAEV,SAAO;;qBAEP,KAAG;;qBAEH,MAAI;;;;;;;qBAOJ,eAAa;;;;;;;qBAOb,KAAG;;;;;;;qBAOH,KAAG;;;;;;;qBAYH,QAAM;;;;;;;qBAQN,gBAAgB;;;;;;;qBAQhB,QAAM;;qBAGN,MAAI,6BAAA,WAAA;;qBAEJ,MAAI,6BAAA,WAAA;;qBAEJ,MAAI,6BAAA,WAAA;;qBAEJ,MAAI,6BAAA,WAAA;;qBAEJ,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,QAAM,6BAAA,WAAA;;qBAEN,QAAM,6BAAA,WAAA;;qBAEN,QAAM,6BAAA,WAAA;;qBAEN,QAAM,6BAAA,WAAA;;qBAEN,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;;;;;;qBAYL,QAAS,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,OAAO,MAAM,IAAI,GAAG,GAAG;;;;;;;qBASvF,QAAS,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,QAAQ,MAAM,MAAM,KAAK,GAAG,GAAG;;;;;;;qBAS/F,SAAU,GAAG,GAAG,GAAG,UAAU,OACxC,WACA,WACA,QAAQ,OAAO,GAAG,GAAG,GAAG,OACvB,OAAO,MAAM,IAAI,GAAG,GAAG;;;;;;;qBAQb,QAAS,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,IAAI,kBAAgB,OAAO,MAAM,IAAI,GAAG,GAAG;;;;;;;qBAStG,WAAY,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IAAI,WAAW,OACvE,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,KAAK,OAAO,GAAG,IAAI,IAAI,QACtB,QAAQ,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;;qBAShC,iBAAkB,GAAG,IAAI,IAAI,WAAW,OAAO,GAAG,GAAG,GAAG,UAAU,OAC7E,WAAW,OAAO,GAAG,IAAI,IAAI,KAC7B,QAAQ,OAAO,GAAG,GAAG,GAAG,OACvB,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;;qBAS3B,iBAAkB,GAAG,IAAI,IAAI,WAAW,OAAO,GAAG,GAAG,GAAG,UAAU,OAC7E,WAAW,OAAO,GAAG,IAAI,IAAI,KAC7B,QAAQ,OAAO,GAAG,GAAG,GAAG,OACvB,QAAQ,MAAM,MAAM,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQnC,YAAa,GAAG,GAAG,GAAG,UAAU,OAAO,GAClD,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GACZ,IAAI,KAAK,GAAG,GAAG,MAAM,MACpB,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,YAAa,GAAG,GAAG,GAAG,UAAU,OAAO,GAClD,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GACZ,IAAI,KAAK,GAAG,GAAG,MAAM,MACpB,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,aAAc,GAAG,GAAG,GAAG,UAAU,OAAO,GACnD,WACA,WACA,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GACZ,IAAI,KAAK,GAAG,GAAG,MAAM,MACpB,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,aAAU,GAAA,GAAA,UAAA,QAAA,WAAA,kBAAA,OAAA,wBAAA,GAAA,GAAA,OAAA,OAAA,MAAA,IAAA,GAAA,GAAA;;;;;;;qBAQV,cAAW,GAAA,GAAA,UAAA,OAAA,GAAA,IAAA,IAAA,OAAA,wBAAA,GAAA,GAAA,IAAA,QAAA,OAAA,GAAA,IAAA,IAAA,MAAA,KAAA,WAAA,OAAA,GAAA,IAAA,IAAA,IAAA,IAAA;;;;;;;qBAQX,cAAW,GAAA,GAAA,UAAA,OAAA,GAAA,IAAA,IAAA,WAAA,OAAA,OAAA,wBAAA,GAAA,GAAA,IAAA,QAAA,OAAA,GAAA,IAAA,IAAA,QAAA,OAAA,MAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA;;;;;;;qBAYX,OAAQ,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IAAI,WAAW,OACnE,OAAO,OAAO,GAAG,GAAG,GAAG,IACvB,QAAQ,OAAO,GAAG,IAAI,IAAI,QACzB,QAAQ,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQzB,cAAK,WAAA,cAAA,OAAA,SAAA,SAAA,OAAA,oBAmJsrvB,WAAA,KAAA,OAAA,QAAA,GAAA,QAAA,OAAA,MAAA,aAAA,OAAA,SAAA,aAAA,OAAA,QAAA;;qBAhJ3rvB,WAAQ,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,QAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,QAAA,OAAA,IAAA,KAAA,IAAA,KAAA,IAAA,KAAA;;qBAER,aAAU,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,QAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,QAAA,OAAA,IAAA,KAAA,IAAA,KAAA,IAAA,KAAA;;qBAEV,YAAS,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,MAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,KAAA,OAAA,OAAA,IAAA,IAAA,IAAA,QAAA,OAAA,IAAA,KAAA,KAAA,IAAA,KAAA,KAAA,IAAA,KAAA,KAAA;;qBAET,gBAAa,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,OAAA,OAAA,IAAA,IAAA,IAAA,KAAA,WAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,QAAA,QAAA,IAAA,KAAA,KAAA,KAAA,IAAA,KAAA,KAAA,IAAA,KAAA,KAAA;;qBAEb,YAAG,WAAA,cAAA,OAAA,SAAA,SAAA,OAAA,OAAA,OAAA,QAAA,aAAA,OAAA,MAAA,aAAA,OAAA,SAAA,aAAA,OAAA,QAAA;;qBAEH,oBAAW,WAAA,cAAA,OAAA,SAAA,SAAA,OAAA,oBAsIwqvC,WAAA,KAAA,OAAA,QAAA,GAAA,QAAA,OAAA,MAAA,aAAA,OAAA,SAAA,aAAA,OAAA,QAAA;;;;;;;qBA1HnrvC,MAAO,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,QAAQ,OAAO,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,MAAM,MAAI,OAAO,GAAG,GAAG,GAAG;;;;;;;qBASjG,SAAU,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAClD,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,IAAI,GAAG,MAAM,OAAO,OAAO,GAAG,QAC7B,OAAO,GAAG,IAAI,IAAI,GAAG;;;;;;;qBAQX,SAAU,GAAG,GAAG,GAAG,UAAU,OAAO,GAC/C,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,IAAI,GAAG,MAAM,OAAO,OAAO,OAC1B,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,YAAa,UAAU,OAAO,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IACvE,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,SAAS,OAAO,GAAG,IAAI,IAAI,OAC1B,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQhB,UAAW,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IAAI,WAAW,OACtE,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,IAAI,GAAG,MAAM,OAAO,GAAG,IAAI,IAAI,QAC9B,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQpB,QAAS,GAAG,GAAG,GAAG,GAAG,UAAU,OAAO,KAAK,GAAG,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAS3F,SAAU,GAAG,GAAG,GAAG,UAAU,OACxC,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GAAG,kBACd,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,YAAS,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,MAAA,IAAA,GAAA,GAAA;;;;;;;qBAQT,WAAY,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,QAAQ,MAAM,IAAI,IAAI,GAAG,GAAG;;qBAI/F,MAAG,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,OAAA,OAAA,IAAA,GAAA,GAAA;;qBAEH,OAAI,GAAA,GAAA,GAAA,UAAA,OAAA,oBAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,OAAA,OAAA,IAAA,GAAA,GAAA;;qBAEJ,OAAI,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAEJ,MAAG,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,aAAA,GAAA,GAAA;;qBAEH,KAAG,2BAAA;;qBAEH,eAAY,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAEZ,WAAQ,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAER,MAAG,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAEH,UAAO,GAAA,OAAA,MAAA,OAAA,iBAAA;;;;;;;qBAOP,MAAI,4BAAA;;qBAEJ,MAAI;;qBAEJ,SAAO,6BAAA;;;;;;;qBAQP,UAAW,GAAG,GAAG,GAAG,UAAU,OAAO,eAAe,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,OAAO,GAAG,GAAG,GAAG"}
+{"version":3,"file":"Nom.d.ts","names":["TokenOf"],"sources":["../src/Nom.ts"],"mappings":";;;;;;;;;;;;;qBA2Da;;;;;;;;;;;qBAQA;;;;;;;;;;qBAQA,aAAc,kBAAkB,GAAG,MAAI,OAAO;;;;;;;qBAQ9C,SAAS;;;;;qBAMT,QAAK,UAAA,gBAAA,KAAA,SAAA,OAAA,OAAAA,MAAA,QAAA,mBAAA,QAAA;;;;;qBAML,SAAM,UAAA,gBAAA,KAAA,SAAA,OAAA,OAAAA,MAAA,QAAA,mBAAA,QAAA;;;;;qBAMN,UAAO,UAAA,gBAAA,YAAA,OAAAA,MAAA,mBAAA,OAAAA,MAAA,QAAA,mBAAA,QAAA;;;;;;;qBAQP,MAAO,UAAU,gBAAgB,KAAK,SAAS,OAAK,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;qBASpG,QAAS,UAAU,gBAC9B,KAAK,SAAS,OACb,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,OAAI,UAAA,gBAAA,kBAAA,OAAA,MAAA,QAAA,mBAAA,QAAA;;;;;qBAMJ,YAAa,UAAU,gBAClC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,aAAc,UAAU,gBACnC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,cAAe,UAAU,gBACpC,WACA,WACA,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,WAAY,UAAU,gBACjC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC,YAAa,UAAU,gBAClC,YAAY,OAAOA,MAAQ,mBAC1B,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;qBAMtC;;;;;;;;;;;qBAQA,UAAO,GAAA,GAAA,GAAA,UAAA,OAAA,GAAA,IAAA,IAAA,WAAA,OAAA,QAAA,OAAA,GAAA,GAAA,GAAA,IAAA,0BAAA,WAAA,OAAA,GAAA,IAAA,IAAA,QAAA,OAAA,MAAA,IAAA,KAAA,IAAA,IAAA,IAAA,IAAA,IAAA;;;;;;;qBAQP,mBAAgB,GAAA,GAAA,UAAA,OAAA,IAAA,IAAA,WAAA,OAAA,QAAA,eAAA,GAAA,GAAA,IAAA,0BAAA,QAAA,eAAA,IAAA,IAAA,QAAA,eAAA,IAAA,IAAA,IAAA,IAAA,IAAA;;qBAGhB,QAAM;;qBAEN,QAAM;;qBAEN,QAAM;;qBAEN,QAAM;;qBAEN,WAAS;;qBAET,WAAS;;qBAET,WAAS;;qBAET,WAAS;;qBAET,eAAa;;qBAEb,eAAa;;qBAEb,QAAM;;qBAEN,QAAM;;qBAEN,aAAW;;qBAEX,aAAW;;qBAEX,YAAU;;qBAEV,SAAO;;qBAEP,KAAG;;qBAEH,MAAI;;;;;;;qBAOJ,eAAa;;;;;;;qBAOb,KAAG;;;;;;;qBAOH,KAAG;;;;;;;qBAYH,QAAM;;;;;;;qBAQN,gBAAgB;;;;;;;qBAQhB,QAAM;;qBAGN,MAAI,6BAAA,WAAA;;qBAEJ,MAAI,6BAAA,WAAA;;qBAEJ,MAAI,6BAAA,WAAA;;qBAEJ,MAAI,6BAAA,WAAA;;qBAEJ,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,QAAM,6BAAA,WAAA;;qBAEN,QAAM,6BAAA,WAAA;;qBAEN,QAAM,6BAAA,WAAA;;qBAEN,QAAM,6BAAA,WAAA;;qBAEN,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;qBAEL,OAAK,6BAAA,WAAA;;;;;;;qBAYL,QAAS,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,OAAO,MAAM,IAAI,GAAG,GAAG;;;;;;;qBASvF,QAAS,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,QAAQ,MAAM,MAAM,KAAK,GAAG,GAAG;;;;;;;qBAS/F,SAAU,GAAG,GAAG,GAAG,UAAU,OACxC,WACA,WACA,QAAQ,OAAO,GAAG,GAAG,GAAG,OACvB,OAAO,MAAM,IAAI,GAAG,GAAG;;;;;;;qBAQb,QAAS,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,IAAI,kBAAgB,OAAO,MAAM,IAAI,GAAG,GAAG;;;;;;;qBAStG,WAAY,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IAAI,WAAW,OACvE,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,KAAK,OAAO,GAAG,IAAI,IAAI,QACtB,QAAQ,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;;qBAShC,iBAAkB,GAAG,IAAI,IAAI,WAAW,OAAO,GAAG,GAAG,GAAG,UAAU,OAC7E,WAAW,OAAO,GAAG,IAAI,IAAI,KAC7B,QAAQ,OAAO,GAAG,GAAG,GAAG,OACvB,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;;qBAS3B,iBAAkB,GAAG,IAAI,IAAI,WAAW,OAAO,GAAG,GAAG,GAAG,UAAU,OAC7E,WAAW,OAAO,GAAG,IAAI,IAAI,KAC7B,QAAQ,OAAO,GAAG,GAAG,GAAG,OACvB,QAAQ,MAAM,MAAM,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQnC,YAAa,GAAG,GAAG,GAAG,UAAU,OAAO,GAClD,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GACZ,IAAI,KAAK,GAAG,GAAG,MAAM,MACpB,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,YAAa,GAAG,GAAG,GAAG,UAAU,OAAO,GAClD,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GACZ,IAAI,KAAK,GAAG,GAAG,MAAM,MACpB,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,aAAc,GAAG,GAAG,GAAG,UAAU,OAAO,GACnD,WACA,WACA,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GACZ,IAAI,KAAK,GAAG,GAAG,MAAM,MACpB,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,aAAU,GAAA,GAAA,UAAA,QAAA,WAAA,kBAAA,OAAA,wBAAA,GAAA,GAAA,OAAA,OAAA,MAAA,IAAA,GAAA,GAAA;;;;;;;qBAQV,cAAW,GAAA,GAAA,UAAA,OAAA,GAAA,IAAA,IAAA,OAAA,wBAAA,GAAA,GAAA,IAAA,QAAA,OAAA,GAAA,IAAA,IAAA,MAAA,KAAA,WAAA,OAAA,GAAA,IAAA,IAAA,IAAA,IAAA;;;;;;;qBAQX,cAAW,GAAA,GAAA,UAAA,OAAA,GAAA,IAAA,IAAA,WAAA,OAAA,OAAA,wBAAA,GAAA,GAAA,IAAA,QAAA,OAAA,GAAA,IAAA,IAAA,QAAA,OAAA,MAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA;;;;;;;qBAYX,OAAQ,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IAAI,WAAW,OACnE,OAAO,OAAO,GAAG,GAAG,GAAG,IACvB,QAAQ,OAAO,GAAG,IAAI,IAAI,QACzB,QAAQ,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQzB,cAAK,WAAA,cAAA,OAAA,SAAA,SAAA,OAAA,oBAmJ2vvB,WAAA,KAAA,OAAA,QAAA,GAAA,QAAA,OAAA,MAAA,aAAA,OAAA,SAAA,aAAA,OAAA,QAAA;;qBAhJhwvB,WAAQ,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,QAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,QAAA,OAAA,IAAA,KAAA,IAAA,KAAA,IAAA,KAAA;;qBAER,aAAU,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,QAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,QAAA,OAAA,IAAA,KAAA,IAAA,KAAA,IAAA,KAAA;;qBAEV,YAAS,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,MAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,KAAA,OAAA,OAAA,IAAA,IAAA,IAAA,QAAA,OAAA,IAAA,KAAA,KAAA,IAAA,KAAA,KAAA,IAAA,KAAA,KAAA;;qBAET,gBAAa,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,IAAA,IAAA,IAAA,WAAA,OAAA,OAAA,OAAA,IAAA,IAAA,IAAA,KAAA,WAAA,OAAA,IAAA,IAAA,IAAA,KAAA,QAAA,OAAA,IAAA,IAAA,IAAA,QAAA,QAAA,IAAA,KAAA,KAAA,KAAA,IAAA,KAAA,KAAA,IAAA,KAAA,KAAA;;qBAEb,YAAG,WAAA,cAAA,OAAA,SAAA,SAAA,OAAA,OAAA,OAAA,QAAA,aAAA,OAAA,MAAA,aAAA,OAAA,SAAA,aAAA,OAAA,QAAA;;qBAEH,oBAAW,WAAA,cAAA,OAAA,SAAA,SAAA,OAAA,oBAsI4pyC,WAAA,KAAA,OAAA,QAAA,GAAA,QAAA,OAAA,MAAA,aAAA,OAAA,SAAA,aAAA,OAAA,QAAA;;;;;;;qBA1HvqyC,MAAO,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,QAAQ,OAAO,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,MAAM,MAAI,OAAO,GAAG,GAAG,GAAG;;;;;;;qBASjG,SAAU,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAClD,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,IAAI,GAAG,MAAM,OAAO,OAAO,GAAG,QAC7B,OAAO,GAAG,IAAI,IAAI,GAAG;;;;;;;qBAQX,SAAU,GAAG,GAAG,GAAG,UAAU,OAAO,GAC/C,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,IAAI,GAAG,MAAM,OAAO,OAAO,OAC1B,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,YAAa,UAAU,OAAO,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IACvE,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,SAAS,OAAO,GAAG,IAAI,IAAI,OAC1B,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQhB,UAAW,GAAG,GAAG,GAAG,UAAU,OAAO,GAAG,IAAI,IAAI,WAAW,OACtE,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,IAAI,GAAG,MAAM,OAAO,GAAG,IAAI,IAAI,QAC9B,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;qBAQpB,QAAS,GAAG,GAAG,GAAG,GAAG,UAAU,OAAO,KAAK,GAAG,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAS3F,SAAU,GAAG,GAAG,GAAG,UAAU,OACxC,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,YAAY,GAAG,kBACd,OAAO,GAAG,GAAG,GAAG;;;;;;;qBAQN,YAAS,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,MAAA,IAAA,GAAA,GAAA;;;;;;;qBAQT,WAAY,GAAG,GAAG,GAAG,UAAU,OAAO,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,QAAQ,MAAM,IAAI,IAAI,GAAG,GAAG;;qBAI/F,MAAG,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,OAAA,OAAA,IAAA,GAAA,GAAA;;qBAEH,OAAI,GAAA,GAAA,GAAA,UAAA,OAAA,oBAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,OAAA,OAAA,IAAA,GAAA,GAAA;;qBAEJ,OAAI,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAEJ,MAAG,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,aAAA,GAAA,GAAA;;qBAEH,KAAG,2BAAA;;qBAEH,eAAY,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAEZ,WAAQ,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAER,MAAG,GAAA,GAAA,GAAA,UAAA,OAAA,MAAA,OAAA,GAAA,GAAA,GAAA,OAAA,OAAA,GAAA,GAAA,GAAA;;qBAEH,UAAO,GAAA,OAAA,MAAA,OAAA,iBAAA;;;;;;;qBAOP,MAAI,4BAAA;;qBAEJ,MAAI;;qBAEJ,SAAO,6BAAA;;;;;;;qBAQP,UAAW,GAAG,GAAG,GAAG,UAAU,OAAO,eAAe,QAAQ,OAAO,GAAG,GAAG,GAAG,OAAK,OAAO,GAAG,GAAG,GAAG"}

package/dist/ParseError.js

@@ -184,7 +184,6 @@ const inspectToken = (u) => {
 const causeMessage = (cause) => {
 	if (cause === void 0) return void 0;
 	if (Predicate.isString(cause)) return cause;
-	if (cause instanceof Error) return cause.message;
 	if (Predicate.isObjectOrArray(cause) && "message" in cause && Predicate.isString(cause.message)) return cause.message;
 	return inspectToken(cause);
 };