@thomasfosterau/effect-parse 0.2.0 → 0.4.0

package/dist/internal/tokens.d.ts

@@ -1,5 +1,4 @@
 import { Input, State } from "../Input.js";
-//#region src/internal/tokens.d.ts
 /** A compiled token set. */
 export interface Matcher {
   /** Tests a code point (string input) or a byte (Uint8Array input). */
@@ -59,21 +58,24 @@ export declare const splitSurrogate: (state: State<Input>, i: number) => boolean
 export declare const NoMatch: unique symbol;
 export declare const End: unique symbol;
 export declare const nextIf: (state: State<Input>, m: AnyMatcher, negate: boolean) => unknown;
+/** How far a {@link scan} got. */
+export interface Scanned extends Advanced {
+  /** Whether the end of input was hit before `max` tokens. */
+  readonly hitEnd: boolean;
+}
 /**
  * Scans forward while tokens satisfy the matcher (xor `negate`), up to `max`
  * tokens. Returns the offset reached, the number of tokens matched, and
  * whether the end of input was hit before `max` tokens.
  */
-export declare const scan: (state: State<Input>, m: AnyMatcher, negate: boolean, max: number) => {
+export declare const scan: (state: State<Input>, m: AnyMatcher, negate: boolean, max: number) => Scanned;
+/** The offset reached and the number of tokens passed. */
+export interface Advanced {
   readonly offset: number;
   readonly count: number;
-  readonly hitEnd: boolean;
-};
+}
 /** Advances `n` tokens from `start`, returning the offset reached and the count. */
-export declare const advance: (state: State<Input>, start: number, n: number) => {
-  offset: number;
-  count: number;
-};
+export declare const advance: (state: State<Input>, start: number, n: number) => Advanced;
 /** Counts tokens between two offsets. */
 export declare const countTokens: (state: State<Input>, start: number, end: number) => number;
 /** Finds `needle` within `[from, state.end)`; returns -1 if absent. */
@@ -84,5 +86,4 @@ export declare const indexOf: (state: State<Input>, needle: Input, from: number)
  * -1 on mismatch, or -2 when the input ends while matching a prefix.
  */
 export declare const matchLiteral: (state: State<Input>, lit: Input, caseless: boolean) => number;
-//#endregion
 //# sourceMappingURL=tokens.d.ts.map

package/dist/internal/tokens.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tokens.d.ts","names":[],"sources":["../../src/internal/tokens.ts"],"mappings":";;;iBAOiB;;WAEN,OAAO;;WAEP,QAAQ;;WAER;;;iBAIM;WACN;WACA;WACA;;;qBAQE,eAAgB;;;;;;qBA2FhB;;;;;qBAMA,qBAAsB,WAAW,sBAC5C,cACA,GAAG,GACH,SAAS,6CACR;;;;;;qBAYU,UAAW,cAAc,6BAAmC;;;;;iBAgCxD;WACN,WAAW;WACX,SAAS;WACT;;;qBAuBE,kBAAmB,KAAK;qBASxB,aAAc,iBAAe;;;;;;qBAmB7B,iBAAkB,OAAO,MAAM,QAAQ;;;;;qBAoBvC;qBACA;qBAEA,SAAU,OAAO,MAAM,QAAQ,GAAG,YAAY;;;;;;qBAiC9C,OACX,OAAO,MAAM,QACb,GAAG,YACH,iBACA;WACY;WAAyB;WAAwB;;;qBAkDlD,UAAW,OAAO,MAAM,QAAQ,eAAe;EAAc;EAAgB;;;qBAkB7E,cAAe,OAAO,MAAM,QAAQ,eAAe;;qBAanD,UAAW,OAAO,MAAM,QAAQ,QAAQ,OAAO;;;;;;qBAwC/C,eAAgB,OAAO,MAAM,QAAQ,KAAK,OAAO"}
+{"version":3,"file":"tokens.d.ts","names":[],"sources":["../../src/internal/tokens.ts"],"mappings":";;iBAQiB;;WAEN,OAAO;;WAEP,QAAQ;;WAER;;;iBAIM;WACN;WACA;WACA;;;qBAQE,eAAgB;;;;;;qBA2FhB;;;;;qBAMA,qBAAsB,WAAW,sBAC5C,cACA,GAAG,GACH,SAAS,6CACR;;;;;;qBAYU,UAAW,cAAc,6BAAmC;;;;;iBA+BxD;WACN,WAAW;WACX,SAAS;WACT;;;qBAuBE,kBAAmB,KAAK;qBASxB,aAAc,iBAAe;;;;;;qBAmB7B,iBAAkB,OAAO,MAAM,QAAQ;;;;;qBAoBvC;qBACA;qBAEA,SAAU,OAAO,MAAM,QAAQ,GAAG,YAAY;;iBA6B1C,gBAAgB;;WAEtB;;;;;;;qBAQE,OAAQ,OAAO,MAAM,QAAQ,GAAG,YAAY,iBAAiB,gBAAc;;iBAkDvE;WACN;WACA;;;qBAIE,UAAW,OAAO,MAAM,QAAQ,eAAe,cAAY;;qBAkB3D,cAAe,OAAO,MAAM,QAAQ,eAAe;;qBAanD,UAAW,OAAO,MAAM,QAAQ,QAAQ,OAAO;;;;;;qBAwC/C,eAAgB,OAAO,MAAM,QAAQ,KAAK,OAAO"}

package/dist/internal/tokens.js

@@ -1,6 +1,7 @@
 import * as Predicate from "effect/Predicate";
+import * as Result from "effect/Result";
 import { charOf, firstCodePoint } from "./text.js";
-//#region src/internal/tokens.ts
+// src/internal/tokens.ts
 const isRange = (u) => Predicate.isObjectOrArray(u) && u._tag === "TokenRange";
 const toCode = (u) => Predicate.isNumber(u) ? u : firstCodePoint(u);
 /** @internal */
@@ -118,11 +119,7 @@ const compileCodeSafe = (set, kind) => {
 			return false;
 		};
 	}
-	try {
-		return compileCode(set);
-	} catch {
-		return () => false;
-	}
+	return Result.getOrElse(Result.try(() => compileCode(set)), () => () => false);
 };
 /**
 * A small cache keyed by value, for the parts of a parser that are costly to
@@ -333,7 +330,7 @@ const indexOf = (state, needle, from) => {
 		case 1: {
 			const hay = state.input;
 			const n = needle;
-			if (n.length === 0) return from;
+			if (n.byteLength === 0) return from;
 			const first = n[0];
 			let i = hay.indexOf(first, from);
 			while (i !== -1 && i <= last) {
@@ -400,7 +397,6 @@ const match = (state, lit, caseless) => {
 	}
 };
 const lowerAscii = (c) => c >= 65 && c <= 90 ? c + 32 : c;
-//#endregion
 export { End, NoMatch, PredicateRanges, advance, codePointPredicate, compile, compileAny, countTokens, describeChar, describeLiteral, indexOf, matchLiteral, nextIf, scan, splitSurrogate };
 
 //# sourceMappingURL=tokens.js.map

package/dist/internal/tokens.js.map

@@ -1 +1 @@
-{"version":3,"file":"tokens.js","names":[],"sources":["../../src/internal/tokens.ts"],"sourcesContent":["// fallow-ignore-file duplicate-export -- `End` and `scan` here are the token-set versions of the text\n// helpers in ./text.ts; both are internal modules, imported by path, never re-exported from one barrel.\nimport * as Predicate from \"effect/Predicate\"\nimport type { Input, State } from \"../Input.js\"\nimport { charOf, firstCodePoint } from \"./text.js\"\n\n/** A compiled token set. */\nexport interface Matcher {\n  /** Tests a code point (string input) or a byte (Uint8Array input). */\n  readonly code: (code: number) => boolean\n  /** Tests an element of an array input. */\n  readonly token: (token: unknown) => boolean\n  /** Human readable description, used in error messages. */\n  readonly description: string\n}\n\n/** @internal */\nexport interface TokenRangeLike {\n  readonly _tag: \"TokenRange\"\n  readonly from: string | number\n  readonly to: string | number\n}\n\nconst isRange = (u: unknown): u is TokenRangeLike => Predicate.isObjectOrArray(u) && (u as any)._tag === \"TokenRange\"\n\nconst toCode = (u: string | number): number => (Predicate.isNumber(u) ? u : firstCodePoint(u))\n\n/** @internal */\nexport const describeChar = (s: string): string => JSON.stringify(s)\n\nconst describeSet = (u: unknown): string => {\n  if (Predicate.isString(u)) {\n    const chars = Array.from(u)\n    return chars.length === 1 ? describeChar(u) : `one of ${JSON.stringify(u)}`\n  }\n  if (Predicate.isNumber(u)) return `0x${u.toString(16).padStart(2, \"0\")}`\n  if (Predicate.isFunction(u)) return u.name ? u.name : \"a matching token\"\n  if (u instanceof Uint8Array) return `one of ${describeBytes(u)}`\n  if (isRange(u)) return `${describeSet(u.from)}..=${describeSet(u.to)}`\n  if (Array.isArray(u)) return u.map(describeSet).join(\" or \")\n  return JSON.stringify(u)\n}\n\n/** Renders bytes as a Rust-style byte string literal: b\"GET\\r\\n\". */\nconst describeBytes = (bytes: Uint8Array): string => {\n  let out = 'b\"'\n  for (const b of bytes) {\n    if (b === 0x22) out += '\\\\\"'\n    else if (b === 0x5c) out += \"\\\\\\\\\"\n    else if (b === 0x0a) out += \"\\\\n\"\n    else if (b === 0x0d) out += \"\\\\r\"\n    else if (b === 0x09) out += \"\\\\t\"\n    else if (b >= 0x20 && b < 0x7f) out += String.fromCharCode(b)\n    else out += `\\\\x${b.toString(16).padStart(2, \"0\")}`\n  }\n  return out + '\"'\n}\n\nconst compileCode = (u: unknown): ((code: number) => boolean) => {\n  if (Predicate.isString(u)) {\n    const codes = Array.from(u, firstCodePoint)\n    if (codes.length === 1) {\n      const c = codes[0]\n      return (x) => x === c\n    }\n    return bitmap(codes)\n  }\n  if (Predicate.isNumber(u)) return (x) => x === u\n  if (Predicate.isFunction(u)) return u as (code: number) => boolean\n  if (u instanceof Uint8Array) return bitmap(Array.from(u))\n  if (isRange(u)) {\n    const from = toCode(u.from)\n    const to = toCode(u.to)\n    return (x) => x >= from && x <= to\n  }\n  if (Array.isArray(u)) {\n    const tests = u.map(compileCode)\n    if (tests.length === 1) return tests[0]\n    return (x) => {\n      for (let i = 0; i < tests.length; i++) if (tests[i](x)) return true\n      return false\n    }\n  }\n  throw new TypeError(`invalid token set: ${String(u)}`)\n}\n\nconst bitmap = (codes: ReadonlyArray<number>): ((code: number) => boolean) => {\n  const ascii = new Uint8Array(256)\n  let other: Set<number> | undefined\n  for (const c of codes) {\n    if (c < 256) ascii[c] = 1\n    else (other ??= new Set()).add(c)\n  }\n  if (other === undefined) return (x) => x < 256 && ascii[x] === 1\n  const set = other\n  return (x) => (x < 256 ? ascii[x] === 1 : set.has(x))\n}\n\nconst compileToken = (u: unknown): ((token: unknown) => boolean) => {\n  if (Predicate.isFunction(u)) return u as (token: unknown) => boolean\n  if (Array.isArray(u)) {\n    const set = new Set(u)\n    return (t) => set.has(t)\n  }\n  return (t) => t === u\n}\n\n/**\n * Marks a predicate over characters that also accepts a code point (a\n * number), so string inputs can call it without allocating a string per\n * character.\n */\nconst CodePointPredicate: unique symbol = /*#__PURE__*/ Symbol.for(\"effect-parse/CodePointPredicate\")\n\n/**\n * The code points accepted by a predicate, as sorted, disjoint, inclusive\n * ranges, when they are known. The compiler turns such predicates into\n * comparisons or tables.\n */\nexport const PredicateRanges: unique symbol = /*#__PURE__*/ Symbol.for(\"effect-parse/PredicateRanges\")\n\n/**\n * Marks `f` as a {@link CodePointPredicate} named `name` (used in error\n * messages), optionally recording the code point ranges it accepts.\n */\nexport const codePointPredicate = <F extends (c: never) => boolean>(\n  name: string,\n  f: F,\n  ranges?: ReadonlyArray<readonly [number, number]>\n): F => {\n  Object.defineProperty(f, \"name\", { value: name })\n  ;(f as any)[CodePointPredicate] = true\n  if (ranges !== undefined) (f as any)[PredicateRanges] = ranges\n  return f\n}\n\n/**\n * Compiles a token set. Predicates for string inputs receive the token as a\n * string, so they are wrapped here; `charOf` avoids `String.fromCodePoint`,\n * which is several times slower, for the Basic Multilingual Plane.\n */\nexport const compile = (set: unknown, kind: \"string\" | \"code\" = \"code\"): Matcher => {\n  const description = describeSet(set)\n  let code: (code: number) => boolean\n  if (Predicate.isFunction(set) && kind === \"string\" && !(CodePointPredicate in set)) {\n    const pred = set as (c: string) => boolean\n    code = (x) => pred(charOf(x))\n  } else {\n    code = compileCodeSafe(set, kind)\n  }\n  return { code, token: compileToken(set), description }\n}\n\nconst compileCodeSafe = (set: unknown, kind: \"string\" | \"code\"): ((code: number) => boolean) => {\n  if (Array.isArray(set) && kind === \"string\") {\n    // Predicates nested in arrays also take strings\n    const tests = set.map((s) => compile(s, kind).code)\n    return (x) => {\n      for (let i = 0; i < tests.length; i++) if (tests[i](x)) return true\n      return false\n    }\n  }\n  try {\n    return compileCode(set)\n  } catch {\n    return () => false\n  }\n}\n\n/**\n * A matcher that works for every input kind. String predicates receive the\n * token as a string, byte predicates receive numbers.\n */\nexport interface AnyMatcher {\n  readonly forString: Matcher\n  readonly forCode: Matcher\n  readonly description: string\n}\n\n/**\n * A small cache keyed by value, for the parts of a parser that are costly to\n * build and depend only on a string (compiled sets, descriptions). Parsers\n * built inside `Parser.gen` bodies are rebuilt on every run, usually from the\n * same few strings. Dynamic strings could grow it without bound, so it is\n * cleared when full.\n */\nconst cached = <A>(cache: Map<string, A>, key: string, build: (key: string) => A): A => {\n  let a = cache.get(key)\n  if (a === undefined) {\n    if (cache.size >= 1024) cache.clear()\n    a = build(key)\n    cache.set(key, a)\n  }\n  return a\n}\n\nconst literalDescriptions = /*#__PURE__*/ new Map<string, string>()\n\n/** Describes a literal for error messages: `\"abc\"`, `b\"abc\"` or `[\"a\", 1]`. */\nexport const describeLiteral = (lit: Input): string =>\n  Predicate.isString(lit)\n    ? cached(literalDescriptions, lit, describeChar)\n    : lit instanceof Uint8Array\n      ? describeBytes(lit)\n      : `[${lit.map((t) => JSON.stringify(t)).join(\", \")}]`\n\nconst stringMatchers = /*#__PURE__*/ new Map<string, AnyMatcher>()\n\nexport const compileAny = (set: unknown): AnyMatcher =>\n  // Matchers for strings are pure functions of the string, so they're shared\n  Predicate.isString(set) ? cached(stringMatchers, set, compileAnyImpl) : compileAnyImpl(set)\n\nconst compileAnyImpl = (set: unknown): AnyMatcher => {\n  const forCode = compile(set, \"code\")\n  const needsString = Predicate.isFunction(set) || Array.isArray(set)\n  return {\n    forString: needsString ? compile(set, \"string\") : forCode,\n    forCode,\n    description: forCode.description\n  }\n}\n\n/**\n * Whether the string token at `i` is a high surrogate at the very end of a\n * partial input, i.e. the first half of a code point whose second half has\n * not arrived yet.\n */\nexport const splitSurrogate = (state: State<Input>, i: number): boolean => {\n  if (!state.partial || i !== state.end - 1) return false\n  const c = (state.input as string).charCodeAt(i)\n  return c >= 0xd800 && c <= 0xdbff\n}\n\n/** Reads the code point at `i` of a string. */\nconst codePointAt = (s: string, i: number): number => {\n  const c = s.charCodeAt(i)\n  if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n    const d = s.charCodeAt(i + 1)\n    if (d >= 0xdc00 && d <= 0xdfff) return ((c - 0xd800) << 10) + (d - 0xdc00) + 0x10000\n  }\n  return c\n}\n\n/**\n * Tests the token at the current position. Returns the token (as the input's\n * token type) and advances, or returns `NoMatch`/`End`.\n */\nexport const NoMatch: unique symbol = /*#__PURE__*/ Symbol(\"NoMatch\")\nexport const End: unique symbol = /*#__PURE__*/ Symbol(\"End\")\n\nexport const nextIf = (state: State<Input>, m: AnyMatcher, negate: boolean): unknown => {\n  const pos = state.pos\n  if (pos >= state.end) return End\n  switch (state.inputKind) {\n    case 0: {\n      const s = state.input as string\n      if (splitSurrogate(state, pos)) return End\n      const cp = codePointAt(s, pos)\n      if (m.forString.code(cp) === negate) return NoMatch\n      const len = cp > 0xffff ? 2 : 1\n      state.pos = pos + len\n      return len === 1 ? s[pos] : s.slice(pos, pos + 2)\n    }\n    case 1: {\n      const b = (state.input as Uint8Array)[pos]\n      if (m.forCode.code(b) === negate) return NoMatch\n      state.pos = pos + 1\n      return b\n    }\n    default: {\n      const t = (state.input as ReadonlyArray<unknown>)[pos]\n      if (m.forCode.token(t) === negate) return NoMatch\n      state.pos = pos + 1\n      return t\n    }\n  }\n}\n\n/**\n * Scans forward while tokens satisfy the matcher (xor `negate`), up to `max`\n * tokens. Returns the offset reached, the number of tokens matched, and\n * whether the end of input was hit before `max` tokens.\n */\nexport const scan = (\n  state: State<Input>,\n  m: AnyMatcher,\n  negate: boolean,\n  max: number\n): { readonly offset: number; readonly count: number; readonly hitEnd: boolean } => {\n  let i = state.pos\n  const end = state.end\n  let count = 0\n  switch (state.inputKind) {\n    case 0: {\n      const s = state.input as string\n      const test = m.forString.code\n      while (count < max) {\n        if (i >= end) return { offset: i, count, hitEnd: true }\n        const c = s.charCodeAt(i)\n        if (c < 0xd800 || c > 0xdbff) {\n          if (test(c) === negate) break\n          i++\n        } else {\n          if (splitSurrogate(state, i)) return { offset: i, count, hitEnd: true }\n          const cp = codePointAt(s, i)\n          if (test(cp) === negate) break\n          i += cp > 0xffff ? 2 : 1\n        }\n        count++\n      }\n      return { offset: i, count, hitEnd: false }\n    }\n    case 1: {\n      const bytes = state.input as Uint8Array\n      const test = m.forCode.code\n      while (count < max) {\n        if (i >= end) return { offset: i, count, hitEnd: true }\n        if (test(bytes[i]) === negate) break\n        i++\n        count++\n      }\n      return { offset: i, count, hitEnd: false }\n    }\n    default: {\n      const arr = state.input as ReadonlyArray<unknown>\n      const test = m.forCode.token\n      while (count < max) {\n        if (i >= end) return { offset: i, count, hitEnd: true }\n        if (test(arr[i]) === negate) break\n        i++\n        count++\n      }\n      return { offset: i, count, hitEnd: false }\n    }\n  }\n}\n\n/** Advances `n` tokens from `start`, returning the offset reached and the count. */\nexport const advance = (state: State<Input>, start: number, n: number): { offset: number; count: number } => {\n  if (state.inputKind !== 0) {\n    const offset = Math.min(state.end, start + n)\n    return { offset, count: offset - start }\n  }\n  const s = state.input as string\n  let i = start\n  let count = 0\n  while (count < n && i < state.end) {\n    if (splitSurrogate(state, i)) break\n    const c = s.charCodeAt(i)\n    i += c >= 0xd800 && c <= 0xdbff && i + 1 < s.length && (s.charCodeAt(i + 1) & 0xfc00) === 0xdc00 ? 2 : 1\n    count++\n  }\n  return { offset: i, count }\n}\n\n/** Counts tokens between two offsets. */\nexport const countTokens = (state: State<Input>, start: number, end: number): number => {\n  if (state.inputKind !== 0) return end - start\n  const s = state.input as string\n  let count = 0\n  for (let i = start; i < end; i++) {\n    const c = s.charCodeAt(i)\n    if (c >= 0xd800 && c <= 0xdbff && i + 1 < end && (s.charCodeAt(i + 1) & 0xfc00) === 0xdc00) i++\n    count++\n  }\n  return count\n}\n\n/** Finds `needle` within `[from, state.end)`; returns -1 if absent. */\nexport const indexOf = (state: State<Input>, needle: Input, from: number): number => {\n  // The whole needle must lie before `state.end`, which may narrow the input\n  const last = state.end - needle.length\n  if (from > last) return -1\n  switch (state.inputKind) {\n    case 0: {\n      const i = (state.input as string).indexOf(needle as string, from)\n      return i <= last ? i : -1\n    }\n    case 1: {\n      const hay = state.input as Uint8Array\n      const n = needle as Uint8Array\n      if (n.length === 0) return from\n      const first = n[0]\n      let i = hay.indexOf(first, from)\n      while (i !== -1 && i <= last) {\n        let j = 1\n        while (j < n.length && hay[i + j] === n[j]) j++\n        if (j === n.length) return i\n        i = hay.indexOf(first, i + 1)\n      }\n      return -1\n    }\n    default: {\n      const hay = state.input as ReadonlyArray<unknown>\n      const n = needle as ReadonlyArray<unknown>\n      outer: for (let i = from; i <= last; i++) {\n        for (let j = 0; j < n.length; j++) if (hay[i + j] !== n[j]) continue outer\n        return i\n      }\n      return -1\n    }\n  }\n}\n\n/**\n * Compares the input at the current position with a literal. Returns the\n * number of matching units if the literal matches completely (its length),\n * -1 on mismatch, or -2 when the input ends while matching a prefix.\n */\nexport const matchLiteral = (state: State<Input>, lit: Input, caseless: boolean): number => {\n  const r = match(state, lit, caseless)\n  // A failed match may have read up to its length past where it fails (see `Syntax`)\n  if (r < 0 && state.syntax !== undefined) state.syntax.read(state.pos + Math.min(lit.length, state.end - state.pos))\n  return r\n}\n\nconst match = (state: State<Input>, lit: Input, caseless: boolean): number => {\n  const pos = state.pos\n  const len = lit.length\n  const avail = state.end - pos\n  const n = Math.min(len, avail)\n  switch (state.inputKind) {\n    case 0: {\n      const s = state.input as string\n      const l = lit as string\n      if (!caseless) {\n        if (avail >= len) return s.startsWith(l, pos) ? len : -1\n        return l.startsWith(s.slice(pos)) ? -2 : -1\n      }\n      for (let i = 0; i < n; i++) {\n        if (lowerAscii(s.charCodeAt(pos + i)) !== lowerAscii(l.charCodeAt(i))) return -1\n      }\n      return n === len ? len : -2\n    }\n    case 1: {\n      const b = state.input as Uint8Array\n      const l = lit as Uint8Array\n      for (let i = 0; i < n; i++) {\n        const x = b[pos + i]\n        const y = l[i]\n        if (caseless ? lowerAscii(x) !== lowerAscii(y) : x !== y) return -1\n      }\n      return n === len ? len : -2\n    }\n    default: {\n      const a = state.input as ReadonlyArray<unknown>\n      const l = lit as ReadonlyArray<unknown>\n      for (let i = 0; i < n; i++) if (a[pos + i] !== l[i]) return -1\n      return n === len ? len : -2\n    }\n  }\n}\n\nconst lowerAscii = (c: number): number => (c >= 65 && c <= 90 ? c + 32 : c)\n"],"mappings":";;;AAuBA,MAAM,WAAW,MAAoC,UAAU,gBAAgB,CAAC,KAAM,EAAU,SAAS;AAEzG,MAAM,UAAU,MAAgC,UAAU,SAAS,CAAC,IAAI,IAAI,eAAe,CAAC;;AAG5F,MAAa,gBAAgB,MAAsB,KAAK,UAAU,CAAC;AAEnE,MAAM,eAAe,MAAuB;CAC1C,IAAI,UAAU,SAAS,CAAC,GAEtB,OADc,MAAM,KAAK,CACd,CAAC,CAAC,WAAW,IAAI,aAAa,CAAC,IAAI,UAAU,KAAK,UAAU,CAAC;CAE1E,IAAI,UAAU,SAAS,CAAC,GAAG,OAAO,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;CACrE,IAAI,UAAU,WAAW,CAAC,GAAG,OAAO,EAAE,OAAO,EAAE,OAAO;CACtD,IAAI,aAAa,YAAY,OAAO,UAAU,cAAc,CAAC;CAC7D,IAAI,QAAQ,CAAC,GAAG,OAAO,GAAG,YAAY,EAAE,IAAI,EAAE,KAAK,YAAY,EAAE,EAAE;CACnE,IAAI,MAAM,QAAQ,CAAC,GAAG,OAAO,EAAE,IAAI,WAAW,CAAC,CAAC,KAAK,MAAM;CAC3D,OAAO,KAAK,UAAU,CAAC;AACzB;;AAGA,MAAM,iBAAiB,UAA8B;CACnD,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,OACd,IAAI,MAAM,IAAM,OAAO;MAClB,IAAI,MAAM,IAAM,OAAO;MACvB,IAAI,MAAM,IAAM,OAAO;MACvB,IAAI,MAAM,IAAM,OAAO;MACvB,IAAI,MAAM,GAAM,OAAO;MACvB,IAAI,KAAK,MAAQ,IAAI,KAAM,OAAO,OAAO,aAAa,CAAC;MACvD,OAAO,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;CAElD,OAAO,MAAM;AACf;AAEA,MAAM,eAAe,MAA4C;CAC/D,IAAI,UAAU,SAAS,CAAC,GAAG;EACzB,MAAM,QAAQ,MAAM,KAAK,GAAG,cAAc;EAC1C,IAAI,MAAM,WAAW,GAAG;GACtB,MAAM,IAAI,MAAM;GAChB,QAAQ,MAAM,MAAM;EACtB;EACA,OAAO,OAAO,KAAK;CACrB;CACA,IAAI,UAAU,SAAS,CAAC,GAAG,QAAQ,MAAM,MAAM;CAC/C,IAAI,UAAU,WAAW,CAAC,GAAG,OAAO;CACpC,IAAI,aAAa,YAAY,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC;CACxD,IAAI,QAAQ,CAAC,GAAG;EACd,MAAM,OAAO,OAAO,EAAE,IAAI;EAC1B,MAAM,KAAK,OAAO,EAAE,EAAE;EACtB,QAAQ,MAAM,KAAK,QAAQ,KAAK;CAClC;CACA,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,MAAM,QAAQ,EAAE,IAAI,WAAW;EAC/B,IAAI,MAAM,WAAW,GAAG,OAAO,MAAM;EACrC,QAAQ,MAAM;GACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC,GAAG,OAAO;GAC/D,OAAO;EACT;CACF;CACA,MAAM,IAAI,UAAU,sBAAsB,OAAO,CAAC,GAAG;AACvD;AAEA,MAAM,UAAU,UAA8D;CAC5E,MAAM,wBAAQ,IAAI,WAAW,GAAG;CAChC,IAAI;CACJ,KAAK,MAAM,KAAK,OACd,IAAI,IAAI,KAAK,MAAM,KAAK;MACnB,CAAC,0BAAU,IAAI,IAAI,EAAA,CAAG,IAAI,CAAC;CAElC,IAAI,UAAU,KAAA,GAAW,QAAQ,MAAM,IAAI,OAAO,MAAM,OAAO;CAC/D,MAAM,MAAM;CACZ,QAAQ,MAAO,IAAI,MAAM,MAAM,OAAO,IAAI,IAAI,IAAI,CAAC;AACrD;AAEA,MAAM,gBAAgB,MAA8C;CAClE,IAAI,UAAU,WAAW,CAAC,GAAG,OAAO;CACpC,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,MAAM,MAAM,IAAI,IAAI,CAAC;EACrB,QAAQ,MAAM,IAAI,IAAI,CAAC;CACzB;CACA,QAAQ,MAAM,MAAM;AACtB;;;;;;AAOA,MAAM,qBAAkD,qBAAO,IAAI,iCAAiC;;;;;;AAOpG,MAAa,kBAA+C,qBAAO,IAAI,8BAA8B;;;;;AAMrG,MAAa,sBACX,MACA,GACA,WACM;CACN,OAAO,eAAe,GAAG,QAAQ,EAAE,OAAO,KAAK,CAAC;CAC/C,EAAW,sBAAsB;CAClC,IAAI,WAAW,KAAA,GAAW,EAAW,mBAAmB;CACxD,OAAO;AACT;;;;;;AAOA,MAAa,WAAW,KAAc,OAA0B,WAAoB;CAClF,MAAM,cAAc,YAAY,GAAG;CACnC,IAAI;CACJ,IAAI,UAAU,WAAW,GAAG,KAAK,SAAS,YAAY,EAAE,sBAAsB,MAAM;EAClF,MAAM,OAAO;EACb,QAAQ,MAAM,KAAK,OAAO,CAAC,CAAC;CAC9B,OACE,OAAO,gBAAgB,KAAK,IAAI;CAElC,OAAO;EAAE;EAAM,OAAO,aAAa,GAAG;EAAG;CAAY;AACvD;AAEA,MAAM,mBAAmB,KAAc,SAAyD;CAC9F,IAAI,MAAM,QAAQ,GAAG,KAAK,SAAS,UAAU;EAE3C,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,IAAI;EAClD,QAAQ,MAAM;GACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC,GAAG,OAAO;GAC/D,OAAO;EACT;CACF;CACA,IAAI;EACF,OAAO,YAAY,GAAG;CACxB,QAAQ;EACN,aAAa;CACf;AACF;;;;;;;;AAmBA,MAAM,UAAa,OAAuB,KAAa,UAAiC;CACtF,IAAI,IAAI,MAAM,IAAI,GAAG;CACrB,IAAI,MAAM,KAAA,GAAW;EACnB,IAAI,MAAM,QAAQ,MAAM,MAAM,MAAM;EACpC,IAAI,MAAM,GAAG;EACb,MAAM,IAAI,KAAK,CAAC;CAClB;CACA,OAAO;AACT;AAEA,MAAM,oCAAoC,IAAI,IAAoB;;AAGlE,MAAa,mBAAmB,QAC9B,UAAU,SAAS,GAAG,IAClB,OAAO,qBAAqB,KAAK,YAAY,IAC7C,eAAe,aACb,cAAc,GAAG,IACjB,IAAI,IAAI,KAAK,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;AAEzD,MAAM,+BAA+B,IAAI,IAAwB;AAEjE,MAAa,cAAc,QAEzB,UAAU,SAAS,GAAG,IAAI,OAAO,gBAAgB,KAAK,cAAc,IAAI,eAAe,GAAG;AAE5F,MAAM,kBAAkB,QAA6B;CACnD,MAAM,UAAU,QAAQ,KAAK,MAAM;CAEnC,OAAO;EACL,WAFkB,UAAU,WAAW,GAAG,KAAK,MAAM,QAAQ,GAAG,IAEvC,QAAQ,KAAK,QAAQ,IAAI;EAClD;EACA,aAAa,QAAQ;CACvB;AACF;;;;;;AAOA,MAAa,kBAAkB,OAAqB,MAAuB;CACzE,IAAI,CAAC,MAAM,WAAW,MAAM,MAAM,MAAM,GAAG,OAAO;CAClD,MAAM,IAAK,MAAM,MAAiB,WAAW,CAAC;CAC9C,OAAO,KAAK,SAAU,KAAK;AAC7B;;AAGA,MAAM,eAAe,GAAW,MAAsB;CACpD,MAAM,IAAI,EAAE,WAAW,CAAC;CACxB,IAAI,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,EAAE,QAAQ;EAClD,MAAM,IAAI,EAAE,WAAW,IAAI,CAAC;EAC5B,IAAI,KAAK,SAAU,KAAK,OAAQ,QAAS,IAAI,SAAW,OAAO,IAAI,SAAU;CAC/E;CACA,OAAO;AACT;;;;;AAMA,MAAa,UAAuC,qBAAO,SAAS;AACpE,MAAa,MAAmC,qBAAO,KAAK;AAE5D,MAAa,UAAU,OAAqB,GAAe,WAA6B;CACtF,MAAM,MAAM,MAAM;CAClB,IAAI,OAAO,MAAM,KAAK,OAAO;CAC7B,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,IAAI,eAAe,OAAO,GAAG,GAAG,OAAO;GACvC,MAAM,KAAK,YAAY,GAAG,GAAG;GAC7B,IAAI,EAAE,UAAU,KAAK,EAAE,MAAM,QAAQ,OAAO;GAC5C,MAAM,MAAM,KAAK,QAAS,IAAI;GAC9B,MAAM,MAAM,MAAM;GAClB,OAAO,QAAQ,IAAI,EAAE,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC;EAClD;EACA,KAAK,GAAG;GACN,MAAM,IAAK,MAAM,MAAqB;GACtC,IAAI,EAAE,QAAQ,KAAK,CAAC,MAAM,QAAQ,OAAO;GACzC,MAAM,MAAM,MAAM;GAClB,OAAO;EACT;EACA,SAAS;GACP,MAAM,IAAK,MAAM,MAAiC;GAClD,IAAI,EAAE,QAAQ,MAAM,CAAC,MAAM,QAAQ,OAAO;GAC1C,MAAM,MAAM,MAAM;GAClB,OAAO;EACT;CACF;AACF;;;;;;AAOA,MAAa,QACX,OACA,GACA,QACA,QACkF;CAClF,IAAI,IAAI,MAAM;CACd,MAAM,MAAM,MAAM;CAClB,IAAI,QAAQ;CACZ,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,MAAM,OAAO,EAAE,UAAU;GACzB,OAAO,QAAQ,KAAK;IAClB,IAAI,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAG;KAAO,QAAQ;IAAK;IACtD,MAAM,IAAI,EAAE,WAAW,CAAC;IACxB,IAAI,IAAI,SAAU,IAAI,OAAQ;KAC5B,IAAI,KAAK,CAAC,MAAM,QAAQ;KACxB;IACF,OAAO;KACL,IAAI,eAAe,OAAO,CAAC,GAAG,OAAO;MAAE,QAAQ;MAAG;MAAO,QAAQ;KAAK;KACtE,MAAM,KAAK,YAAY,GAAG,CAAC;KAC3B,IAAI,KAAK,EAAE,MAAM,QAAQ;KACzB,KAAK,KAAK,QAAS,IAAI;IACzB;IACA;GACF;GACA,OAAO;IAAE,QAAQ;IAAG;IAAO,QAAQ;GAAM;EAC3C;EACA,KAAK,GAAG;GACN,MAAM,QAAQ,MAAM;GACpB,MAAM,OAAO,EAAE,QAAQ;GACvB,OAAO,QAAQ,KAAK;IAClB,IAAI,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAG;KAAO,QAAQ;IAAK;IACtD,IAAI,KAAK,MAAM,EAAE,MAAM,QAAQ;IAC/B;IACA;GACF;GACA,OAAO;IAAE,QAAQ;IAAG;IAAO,QAAQ;GAAM;EAC3C;EACA,SAAS;GACP,MAAM,MAAM,MAAM;GAClB,MAAM,OAAO,EAAE,QAAQ;GACvB,OAAO,QAAQ,KAAK;IAClB,IAAI,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAG;KAAO,QAAQ;IAAK;IACtD,IAAI,KAAK,IAAI,EAAE,MAAM,QAAQ;IAC7B;IACA;GACF;GACA,OAAO;IAAE,QAAQ;IAAG;IAAO,QAAQ;GAAM;EAC3C;CACF;AACF;;AAGA,MAAa,WAAW,OAAqB,OAAe,MAAiD;CAC3G,IAAI,MAAM,cAAc,GAAG;EACzB,MAAM,SAAS,KAAK,IAAI,MAAM,KAAK,QAAQ,CAAC;EAC5C,OAAO;GAAE;GAAQ,OAAO,SAAS;EAAM;CACzC;CACA,MAAM,IAAI,MAAM;CAChB,IAAI,IAAI;CACR,IAAI,QAAQ;CACZ,OAAO,QAAQ,KAAK,IAAI,MAAM,KAAK;EACjC,IAAI,eAAe,OAAO,CAAC,GAAG;EAC9B,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,KAAK,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,EAAE,WAAW,EAAE,WAAW,IAAI,CAAC,IAAI,WAAY,QAAS,IAAI;EACvG;CACF;CACA,OAAO;EAAE,QAAQ;EAAG;CAAM;AAC5B;;AAGA,MAAa,eAAe,OAAqB,OAAe,QAAwB;CACtF,IAAI,MAAM,cAAc,GAAG,OAAO,MAAM;CACxC,MAAM,IAAI,MAAM;CAChB,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK;EAChC,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,IAAI,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,WAAY,OAAQ;EAC5F;CACF;CACA,OAAO;AACT;;AAGA,MAAa,WAAW,OAAqB,QAAe,SAAyB;CAEnF,MAAM,OAAO,MAAM,MAAM,OAAO;CAChC,IAAI,OAAO,MAAM,OAAO;CACxB,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAK,MAAM,MAAiB,QAAQ,QAAkB,IAAI;GAChE,OAAO,KAAK,OAAO,IAAI;EACzB;EACA,KAAK,GAAG;GACN,MAAM,MAAM,MAAM;GAClB,MAAM,IAAI;GACV,IAAI,EAAE,WAAW,GAAG,OAAO;GAC3B,MAAM,QAAQ,EAAE;GAChB,IAAI,IAAI,IAAI,QAAQ,OAAO,IAAI;GAC/B,OAAO,MAAM,MAAM,KAAK,MAAM;IAC5B,IAAI,IAAI;IACR,OAAO,IAAI,EAAE,UAAU,IAAI,IAAI,OAAO,EAAE,IAAI;IAC5C,IAAI,MAAM,EAAE,QAAQ,OAAO;IAC3B,IAAI,IAAI,QAAQ,OAAO,IAAI,CAAC;GAC9B;GACA,OAAO;EACT;EACA,SAAS;GACP,MAAM,MAAM,MAAM;GAClB,MAAM,IAAI;GACV,OAAO,KAAK,IAAI,IAAI,MAAM,KAAK,MAAM,KAAK;IACxC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI,IAAI,IAAI,OAAO,EAAE,IAAI,SAAS;IACrE,OAAO;GACT;GACA,OAAO;EACT;CACF;AACF;;;;;;AAOA,MAAa,gBAAgB,OAAqB,KAAY,aAA8B;CAC1F,MAAM,IAAI,MAAM,OAAO,KAAK,QAAQ;CAEpC,IAAI,IAAI,KAAK,MAAM,WAAW,KAAA,GAAW,MAAM,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI,IAAI,QAAQ,MAAM,MAAM,MAAM,GAAG,CAAC;CAClH,OAAO;AACT;AAEA,MAAM,SAAS,OAAqB,KAAY,aAA8B;CAC5E,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,IAAI;CAChB,MAAM,QAAQ,MAAM,MAAM;CAC1B,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK;CAC7B,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI;GACV,IAAI,CAAC,UAAU;IACb,IAAI,SAAS,KAAK,OAAO,EAAE,WAAW,GAAG,GAAG,IAAI,MAAM;IACtD,OAAO,EAAE,WAAW,EAAE,MAAM,GAAG,CAAC,IAAI,KAAK;GAC3C;GACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,IAAI,WAAW,EAAE,WAAW,MAAM,CAAC,CAAC,MAAM,WAAW,EAAE,WAAW,CAAC,CAAC,GAAG,OAAO;GAEhF,OAAO,MAAM,MAAM,MAAM;EAC3B;EACA,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI;GACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IAC1B,MAAM,IAAI,EAAE,MAAM;IAClB,MAAM,IAAI,EAAE;IACZ,IAAI,WAAW,WAAW,CAAC,MAAM,WAAW,CAAC,IAAI,MAAM,GAAG,OAAO;GACnE;GACA,OAAO,MAAM,MAAM,MAAM;EAC3B;EACA,SAAS;GACP,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI;GACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,OAAO,EAAE,IAAI,OAAO;GAC5D,OAAO,MAAM,MAAM,MAAM;EAC3B;CACF;AACF;AAEA,MAAM,cAAc,MAAuB,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK"}
+{"version":3,"file":"tokens.js","names":[],"sources":["../../src/internal/tokens.ts"],"sourcesContent":["// fallow-ignore-file duplicate-export -- `End` and `scan` here are the token-set versions of the text\n// helpers in ./text.ts; both are internal modules, imported by path, never re-exported from one barrel.\nimport * as Predicate from \"effect/Predicate\"\nimport * as Result from \"effect/Result\"\nimport type { Input, State } from \"../Input.js\"\nimport { charOf, firstCodePoint } from \"./text.js\"\n\n/** A compiled token set. */\nexport interface Matcher {\n  /** Tests a code point (string input) or a byte (Uint8Array input). */\n  readonly code: (code: number) => boolean\n  /** Tests an element of an array input. */\n  readonly token: (token: unknown) => boolean\n  /** Human readable description, used in error messages. */\n  readonly description: string\n}\n\n/** @internal */\nexport interface TokenRangeLike {\n  readonly _tag: \"TokenRange\"\n  readonly from: string | number\n  readonly to: string | number\n}\n\nconst isRange = (u: unknown): u is TokenRangeLike => Predicate.isObjectOrArray(u) && (u as any)._tag === \"TokenRange\"\n\nconst toCode = (u: string | number): number => (Predicate.isNumber(u) ? u : firstCodePoint(u))\n\n/** @internal */\nexport const describeChar = (s: string): string => JSON.stringify(s)\n\nconst describeSet = (u: unknown): string => {\n  if (Predicate.isString(u)) {\n    const chars = Array.from(u)\n    return chars.length === 1 ? describeChar(u) : `one of ${JSON.stringify(u)}`\n  }\n  if (Predicate.isNumber(u)) return `0x${u.toString(16).padStart(2, \"0\")}`\n  if (Predicate.isFunction(u)) return u.name ? u.name : \"a matching token\"\n  if (u instanceof Uint8Array) return `one of ${describeBytes(u)}`\n  if (isRange(u)) return `${describeSet(u.from)}..=${describeSet(u.to)}`\n  if (Array.isArray(u)) return u.map(describeSet).join(\" or \")\n  return JSON.stringify(u)\n}\n\n/** Renders bytes as a Rust-style byte string literal: b\"GET\\r\\n\". */\nconst describeBytes = (bytes: Uint8Array): string => {\n  let out = 'b\"'\n  for (const b of bytes) {\n    if (b === 0x22) out += '\\\\\"'\n    else if (b === 0x5c) out += \"\\\\\\\\\"\n    else if (b === 0x0a) out += \"\\\\n\"\n    else if (b === 0x0d) out += \"\\\\r\"\n    else if (b === 0x09) out += \"\\\\t\"\n    else if (b >= 0x20 && b < 0x7f) out += String.fromCharCode(b)\n    else out += `\\\\x${b.toString(16).padStart(2, \"0\")}`\n  }\n  return out + '\"'\n}\n\nconst compileCode = (u: unknown): ((code: number) => boolean) => {\n  if (Predicate.isString(u)) {\n    const codes = Array.from(u, firstCodePoint)\n    if (codes.length === 1) {\n      const c = codes[0]\n      return (x) => x === c\n    }\n    return bitmap(codes)\n  }\n  if (Predicate.isNumber(u)) return (x) => x === u\n  if (Predicate.isFunction(u)) return u as (code: number) => boolean\n  if (u instanceof Uint8Array) return bitmap(Array.from(u))\n  if (isRange(u)) {\n    const from = toCode(u.from)\n    const to = toCode(u.to)\n    return (x) => x >= from && x <= to\n  }\n  if (Array.isArray(u)) {\n    const tests = u.map(compileCode)\n    if (tests.length === 1) return tests[0]\n    return (x) => {\n      for (let i = 0; i < tests.length; i++) if (tests[i](x)) return true\n      return false\n    }\n  }\n  throw new TypeError(`invalid token set: ${String(u)}`)\n}\n\nconst bitmap = (codes: ReadonlyArray<number>): ((code: number) => boolean) => {\n  const ascii = new Uint8Array(256)\n  let other: Set<number> | undefined\n  for (const c of codes) {\n    if (c < 256) ascii[c] = 1\n    else (other ??= new Set()).add(c)\n  }\n  if (other === undefined) return (x) => x < 256 && ascii[x] === 1\n  const set = other\n  return (x) => (x < 256 ? ascii[x] === 1 : set.has(x))\n}\n\nconst compileToken = (u: unknown): ((token: unknown) => boolean) => {\n  if (Predicate.isFunction(u)) return u as (token: unknown) => boolean\n  if (Array.isArray(u)) {\n    const set = new Set(u)\n    return (t) => set.has(t)\n  }\n  return (t) => t === u\n}\n\n/**\n * Marks a predicate over characters that also accepts a code point (a\n * number), so string inputs can call it without allocating a string per\n * character.\n */\nconst CodePointPredicate: unique symbol = /*#__PURE__*/ Symbol.for(\"effect-parse/CodePointPredicate\")\n\n/**\n * The code points accepted by a predicate, as sorted, disjoint, inclusive\n * ranges, when they are known. The compiler turns such predicates into\n * comparisons or tables.\n */\nexport const PredicateRanges: unique symbol = /*#__PURE__*/ Symbol.for(\"effect-parse/PredicateRanges\")\n\n/**\n * Marks `f` as a {@link CodePointPredicate} named `name` (used in error\n * messages), optionally recording the code point ranges it accepts.\n */\nexport const codePointPredicate = <F extends (c: never) => boolean>(\n  name: string,\n  f: F,\n  ranges?: ReadonlyArray<readonly [number, number]>\n): F => {\n  Object.defineProperty(f, \"name\", { value: name })\n  ;(f as any)[CodePointPredicate] = true\n  if (ranges !== undefined) (f as any)[PredicateRanges] = ranges\n  return f\n}\n\n/**\n * Compiles a token set. Predicates for string inputs receive the token as a\n * string, so they are wrapped here; `charOf` avoids `String.fromCodePoint`,\n * which is several times slower, for the Basic Multilingual Plane.\n */\nexport const compile = (set: unknown, kind: \"string\" | \"code\" = \"code\"): Matcher => {\n  const description = describeSet(set)\n  let code: (code: number) => boolean\n  if (Predicate.isFunction(set) && kind === \"string\" && !(CodePointPredicate in set)) {\n    const pred = set as (c: string) => boolean\n    code = (x) => pred(charOf(x))\n  } else {\n    code = compileCodeSafe(set, kind)\n  }\n  return { code, token: compileToken(set), description }\n}\n\nconst compileCodeSafe = (set: unknown, kind: \"string\" | \"code\"): ((code: number) => boolean) => {\n  if (Array.isArray(set) && kind === \"string\") {\n    // Predicates nested in arrays also take strings\n    const tests = set.map((s) => compile(s, kind).code)\n    return (x) => {\n      for (let i = 0; i < tests.length; i++) if (tests[i](x)) return true\n      return false\n    }\n  }\n  return Result.getOrElse(\n    Result.try(() => compileCode(set)),\n    (): ((code: number) => boolean) => () => false\n  )\n}\n\n/**\n * A matcher that works for every input kind. String predicates receive the\n * token as a string, byte predicates receive numbers.\n */\nexport interface AnyMatcher {\n  readonly forString: Matcher\n  readonly forCode: Matcher\n  readonly description: string\n}\n\n/**\n * A small cache keyed by value, for the parts of a parser that are costly to\n * build and depend only on a string (compiled sets, descriptions). Parsers\n * built inside `Parser.gen` bodies are rebuilt on every run, usually from the\n * same few strings. Dynamic strings could grow it without bound, so it is\n * cleared when full.\n */\nconst cached = <A>(cache: Map<string, A>, key: string, build: (key: string) => A): A => {\n  let a = cache.get(key)\n  if (a === undefined) {\n    if (cache.size >= 1024) cache.clear()\n    a = build(key)\n    cache.set(key, a)\n  }\n  return a\n}\n\nconst literalDescriptions = /*#__PURE__*/ new Map<string, string>()\n\n/** Describes a literal for error messages: `\"abc\"`, `b\"abc\"` or `[\"a\", 1]`. */\nexport const describeLiteral = (lit: Input): string =>\n  Predicate.isString(lit)\n    ? cached(literalDescriptions, lit, describeChar)\n    : lit instanceof Uint8Array\n      ? describeBytes(lit)\n      : `[${lit.map((t) => JSON.stringify(t)).join(\", \")}]`\n\nconst stringMatchers = /*#__PURE__*/ new Map<string, AnyMatcher>()\n\nexport const compileAny = (set: unknown): AnyMatcher =>\n  // Matchers for strings are pure functions of the string, so they're shared\n  Predicate.isString(set) ? cached(stringMatchers, set, compileAnyImpl) : compileAnyImpl(set)\n\nconst compileAnyImpl = (set: unknown): AnyMatcher => {\n  const forCode = compile(set, \"code\")\n  const needsString = Predicate.isFunction(set) || Array.isArray(set)\n  return {\n    forString: needsString ? compile(set, \"string\") : forCode,\n    forCode,\n    description: forCode.description\n  }\n}\n\n/**\n * Whether the string token at `i` is a high surrogate at the very end of a\n * partial input, i.e. the first half of a code point whose second half has\n * not arrived yet.\n */\nexport const splitSurrogate = (state: State<Input>, i: number): boolean => {\n  if (!state.partial || i !== state.end - 1) return false\n  const c = (state.input as string).charCodeAt(i)\n  return c >= 0xd800 && c <= 0xdbff\n}\n\n/** Reads the code point at `i` of a string. */\nconst codePointAt = (s: string, i: number): number => {\n  const c = s.charCodeAt(i)\n  if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n    const d = s.charCodeAt(i + 1)\n    if (d >= 0xdc00 && d <= 0xdfff) return ((c - 0xd800) << 10) + (d - 0xdc00) + 0x10000\n  }\n  return c\n}\n\n/**\n * Tests the token at the current position. Returns the token (as the input's\n * token type) and advances, or returns `NoMatch`/`End`.\n */\nexport const NoMatch: unique symbol = /*#__PURE__*/ Symbol(\"NoMatch\")\nexport const End: unique symbol = /*#__PURE__*/ Symbol(\"End\")\n\nexport const nextIf = (state: State<Input>, m: AnyMatcher, negate: boolean): unknown => {\n  const pos = state.pos\n  if (pos >= state.end) return End\n  switch (state.inputKind) {\n    case 0: {\n      const s = state.input as string\n      if (splitSurrogate(state, pos)) return End\n      const cp = codePointAt(s, pos)\n      if (m.forString.code(cp) === negate) return NoMatch\n      const len = cp > 0xffff ? 2 : 1\n      state.pos = pos + len\n      return len === 1 ? s[pos] : s.slice(pos, pos + 2)\n    }\n    case 1: {\n      const b = (state.input as Uint8Array)[pos]\n      if (m.forCode.code(b) === negate) return NoMatch\n      state.pos = pos + 1\n      return b\n    }\n    default: {\n      const t = (state.input as ReadonlyArray<unknown>)[pos]\n      if (m.forCode.token(t) === negate) return NoMatch\n      state.pos = pos + 1\n      return t\n    }\n  }\n}\n\n/** How far a {@link scan} got. */\nexport interface Scanned extends Advanced {\n  /** Whether the end of input was hit before `max` tokens. */\n  readonly hitEnd: boolean\n}\n\n/**\n * Scans forward while tokens satisfy the matcher (xor `negate`), up to `max`\n * tokens. Returns the offset reached, the number of tokens matched, and\n * whether the end of input was hit before `max` tokens.\n */\nexport const scan = (state: State<Input>, m: AnyMatcher, negate: boolean, max: number): Scanned => {\n  let i = state.pos\n  const end = state.end\n  let count = 0\n  switch (state.inputKind) {\n    case 0: {\n      const s = state.input as string\n      const test = m.forString.code\n      while (count < max) {\n        if (i >= end) return { offset: i, count, hitEnd: true }\n        const c = s.charCodeAt(i)\n        if (c < 0xd800 || c > 0xdbff) {\n          if (test(c) === negate) break\n          i++\n        } else {\n          if (splitSurrogate(state, i)) return { offset: i, count, hitEnd: true }\n          const cp = codePointAt(s, i)\n          if (test(cp) === negate) break\n          i += cp > 0xffff ? 2 : 1\n        }\n        count++\n      }\n      return { offset: i, count, hitEnd: false }\n    }\n    case 1: {\n      const bytes = state.input as Uint8Array\n      const test = m.forCode.code\n      while (count < max) {\n        if (i >= end) return { offset: i, count, hitEnd: true }\n        if (test(bytes[i]) === negate) break\n        i++\n        count++\n      }\n      return { offset: i, count, hitEnd: false }\n    }\n    default: {\n      const arr = state.input as ReadonlyArray<unknown>\n      const test = m.forCode.token\n      while (count < max) {\n        if (i >= end) return { offset: i, count, hitEnd: true }\n        if (test(arr[i]) === negate) break\n        i++\n        count++\n      }\n      return { offset: i, count, hitEnd: false }\n    }\n  }\n}\n\n/** The offset reached and the number of tokens passed. */\nexport interface Advanced {\n  readonly offset: number\n  readonly count: number\n}\n\n/** Advances `n` tokens from `start`, returning the offset reached and the count. */\nexport const advance = (state: State<Input>, start: number, n: number): Advanced => {\n  if (state.inputKind !== 0) {\n    const offset = Math.min(state.end, start + n)\n    return { offset, count: offset - start }\n  }\n  const s = state.input as string\n  let i = start\n  let count = 0\n  while (count < n && i < state.end) {\n    if (splitSurrogate(state, i)) break\n    const c = s.charCodeAt(i)\n    i += c >= 0xd800 && c <= 0xdbff && i + 1 < s.length && (s.charCodeAt(i + 1) & 0xfc00) === 0xdc00 ? 2 : 1\n    count++\n  }\n  return { offset: i, count }\n}\n\n/** Counts tokens between two offsets. */\nexport const countTokens = (state: State<Input>, start: number, end: number): number => {\n  if (state.inputKind !== 0) return end - start\n  const s = state.input as string\n  let count = 0\n  for (let i = start; i < end; i++) {\n    const c = s.charCodeAt(i)\n    if (c >= 0xd800 && c <= 0xdbff && i + 1 < end && (s.charCodeAt(i + 1) & 0xfc00) === 0xdc00) i++\n    count++\n  }\n  return count\n}\n\n/** Finds `needle` within `[from, state.end)`; returns -1 if absent. */\nexport const indexOf = (state: State<Input>, needle: Input, from: number): number => {\n  // The whole needle must lie before `state.end`, which may narrow the input\n  const last = state.end - needle.length\n  if (from > last) return -1\n  switch (state.inputKind) {\n    case 0: {\n      const i = (state.input as string).indexOf(needle as string, from)\n      return i <= last ? i : -1\n    }\n    case 1: {\n      const hay = state.input as Uint8Array\n      const n = needle as Uint8Array\n      if (n.byteLength === 0) return from\n      const first = n[0]\n      let i = hay.indexOf(first, from)\n      while (i !== -1 && i <= last) {\n        let j = 1\n        while (j < n.length && hay[i + j] === n[j]) j++\n        if (j === n.length) return i\n        i = hay.indexOf(first, i + 1)\n      }\n      return -1\n    }\n    default: {\n      const hay = state.input as ReadonlyArray<unknown>\n      const n = needle as ReadonlyArray<unknown>\n      outer: for (let i = from; i <= last; i++) {\n        for (let j = 0; j < n.length; j++) if (hay[i + j] !== n[j]) continue outer\n        return i\n      }\n      return -1\n    }\n  }\n}\n\n/**\n * Compares the input at the current position with a literal. Returns the\n * number of matching units if the literal matches completely (its length),\n * -1 on mismatch, or -2 when the input ends while matching a prefix.\n */\nexport const matchLiteral = (state: State<Input>, lit: Input, caseless: boolean): number => {\n  const r = match(state, lit, caseless)\n  // A failed match may have read up to its length past where it fails (see `Syntax`)\n  if (r < 0 && state.syntax !== undefined) state.syntax.read(state.pos + Math.min(lit.length, state.end - state.pos))\n  return r\n}\n\nconst match = (state: State<Input>, lit: Input, caseless: boolean): number => {\n  const pos = state.pos\n  const len = lit.length\n  const avail = state.end - pos\n  const n = Math.min(len, avail)\n  switch (state.inputKind) {\n    case 0: {\n      const s = state.input as string\n      const l = lit as string\n      if (!caseless) {\n        if (avail >= len) return s.startsWith(l, pos) ? len : -1\n        return l.startsWith(s.slice(pos)) ? -2 : -1\n      }\n      for (let i = 0; i < n; i++) {\n        if (lowerAscii(s.charCodeAt(pos + i)) !== lowerAscii(l.charCodeAt(i))) return -1\n      }\n      return n === len ? len : -2\n    }\n    case 1: {\n      const b = state.input as Uint8Array\n      const l = lit as Uint8Array\n      for (let i = 0; i < n; i++) {\n        const x = b[pos + i]\n        const y = l[i]\n        if (caseless ? lowerAscii(x) !== lowerAscii(y) : x !== y) return -1\n      }\n      return n === len ? len : -2\n    }\n    default: {\n      const a = state.input as ReadonlyArray<unknown>\n      const l = lit as ReadonlyArray<unknown>\n      for (let i = 0; i < n; i++) if (a[pos + i] !== l[i]) return -1\n      return n === len ? len : -2\n    }\n  }\n}\n\nconst lowerAscii = (c: number): number => (c >= 65 && c <= 90 ? c + 32 : c)\n"],"mappings":";;;;AAwBA,MAAM,WAAW,MAAoC,UAAU,gBAAgB,CAAC,KAAM,EAAU,SAAS;AAEzG,MAAM,UAAU,MAAgC,UAAU,SAAS,CAAC,IAAI,IAAI,eAAe,CAAC;;AAG5F,MAAa,gBAAgB,MAAsB,KAAK,UAAU,CAAC;AAEnE,MAAM,eAAe,MAAuB;CAC1C,IAAI,UAAU,SAAS,CAAC,GAEtB,OADc,MAAM,KAAK,CACd,CAAC,CAAC,WAAW,IAAI,aAAa,CAAC,IAAI,UAAU,KAAK,UAAU,CAAC;CAE1E,IAAI,UAAU,SAAS,CAAC,GAAG,OAAO,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;CACrE,IAAI,UAAU,WAAW,CAAC,GAAG,OAAO,EAAE,OAAO,EAAE,OAAO;CACtD,IAAI,aAAa,YAAY,OAAO,UAAU,cAAc,CAAC;CAC7D,IAAI,QAAQ,CAAC,GAAG,OAAO,GAAG,YAAY,EAAE,IAAI,EAAE,KAAK,YAAY,EAAE,EAAE;CACnE,IAAI,MAAM,QAAQ,CAAC,GAAG,OAAO,EAAE,IAAI,WAAW,CAAC,CAAC,KAAK,MAAM;CAC3D,OAAO,KAAK,UAAU,CAAC;AACzB;;AAGA,MAAM,iBAAiB,UAA8B;CACnD,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,OACd,IAAI,MAAM,IAAM,OAAO;MAClB,IAAI,MAAM,IAAM,OAAO;MACvB,IAAI,MAAM,IAAM,OAAO;MACvB,IAAI,MAAM,IAAM,OAAO;MACvB,IAAI,MAAM,GAAM,OAAO;MACvB,IAAI,KAAK,MAAQ,IAAI,KAAM,OAAO,OAAO,aAAa,CAAC;MACvD,OAAO,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;CAElD,OAAO,MAAM;AACf;AAEA,MAAM,eAAe,MAA4C;CAC/D,IAAI,UAAU,SAAS,CAAC,GAAG;EACzB,MAAM,QAAQ,MAAM,KAAK,GAAG,cAAc;EAC1C,IAAI,MAAM,WAAW,GAAG;GACtB,MAAM,IAAI,MAAM;GAChB,QAAQ,MAAM,MAAM;EACtB;EACA,OAAO,OAAO,KAAK;CACrB;CACA,IAAI,UAAU,SAAS,CAAC,GAAG,QAAQ,MAAM,MAAM;CAC/C,IAAI,UAAU,WAAW,CAAC,GAAG,OAAO;CACpC,IAAI,aAAa,YAAY,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC;CACxD,IAAI,QAAQ,CAAC,GAAG;EACd,MAAM,OAAO,OAAO,EAAE,IAAI;EAC1B,MAAM,KAAK,OAAO,EAAE,EAAE;EACtB,QAAQ,MAAM,KAAK,QAAQ,KAAK;CAClC;CACA,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,MAAM,QAAQ,EAAE,IAAI,WAAW;EAC/B,IAAI,MAAM,WAAW,GAAG,OAAO,MAAM;EACrC,QAAQ,MAAM;GACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC,GAAG,OAAO;GAC/D,OAAO;EACT;CACF;CACA,MAAM,IAAI,UAAU,sBAAsB,OAAO,CAAC,GAAG;AACvD;AAEA,MAAM,UAAU,UAA8D;CAC5E,MAAM,wBAAQ,IAAI,WAAW,GAAG;CAChC,IAAI;CACJ,KAAK,MAAM,KAAK,OACd,IAAI,IAAI,KAAK,MAAM,KAAK;MACnB,CAAC,0BAAU,IAAI,IAAI,EAAA,CAAG,IAAI,CAAC;CAElC,IAAI,UAAU,KAAA,GAAW,QAAQ,MAAM,IAAI,OAAO,MAAM,OAAO;CAC/D,MAAM,MAAM;CACZ,QAAQ,MAAO,IAAI,MAAM,MAAM,OAAO,IAAI,IAAI,IAAI,CAAC;AACrD;AAEA,MAAM,gBAAgB,MAA8C;CAClE,IAAI,UAAU,WAAW,CAAC,GAAG,OAAO;CACpC,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,MAAM,MAAM,IAAI,IAAI,CAAC;EACrB,QAAQ,MAAM,IAAI,IAAI,CAAC;CACzB;CACA,QAAQ,MAAM,MAAM;AACtB;;;;;;AAOA,MAAM,qBAAkD,qBAAO,IAAI,iCAAiC;;;;;;AAOpG,MAAa,kBAA+C,qBAAO,IAAI,8BAA8B;;;;;AAMrG,MAAa,sBACX,MACA,GACA,WACM;CACN,OAAO,eAAe,GAAG,QAAQ,EAAE,OAAO,KAAK,CAAC;CAC/C,EAAW,sBAAsB;CAClC,IAAI,WAAW,KAAA,GAAW,EAAW,mBAAmB;CACxD,OAAO;AACT;;;;;;AAOA,MAAa,WAAW,KAAc,OAA0B,WAAoB;CAClF,MAAM,cAAc,YAAY,GAAG;CACnC,IAAI;CACJ,IAAI,UAAU,WAAW,GAAG,KAAK,SAAS,YAAY,EAAE,sBAAsB,MAAM;EAClF,MAAM,OAAO;EACb,QAAQ,MAAM,KAAK,OAAO,CAAC,CAAC;CAC9B,OACE,OAAO,gBAAgB,KAAK,IAAI;CAElC,OAAO;EAAE;EAAM,OAAO,aAAa,GAAG;EAAG;CAAY;AACvD;AAEA,MAAM,mBAAmB,KAAc,SAAyD;CAC9F,IAAI,MAAM,QAAQ,GAAG,KAAK,SAAS,UAAU;EAE3C,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,IAAI;EAClD,QAAQ,MAAM;GACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC,GAAG,OAAO;GAC/D,OAAO;EACT;CACF;CACA,OAAO,OAAO,UACZ,OAAO,UAAU,YAAY,GAAG,CAAC,eACQ,KAC3C;AACF;;;;;;;;AAmBA,MAAM,UAAa,OAAuB,KAAa,UAAiC;CACtF,IAAI,IAAI,MAAM,IAAI,GAAG;CACrB,IAAI,MAAM,KAAA,GAAW;EACnB,IAAI,MAAM,QAAQ,MAAM,MAAM,MAAM;EACpC,IAAI,MAAM,GAAG;EACb,MAAM,IAAI,KAAK,CAAC;CAClB;CACA,OAAO;AACT;AAEA,MAAM,oCAAoC,IAAI,IAAoB;;AAGlE,MAAa,mBAAmB,QAC9B,UAAU,SAAS,GAAG,IAClB,OAAO,qBAAqB,KAAK,YAAY,IAC7C,eAAe,aACb,cAAc,GAAG,IACjB,IAAI,IAAI,KAAK,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;AAEzD,MAAM,+BAA+B,IAAI,IAAwB;AAEjE,MAAa,cAAc,QAEzB,UAAU,SAAS,GAAG,IAAI,OAAO,gBAAgB,KAAK,cAAc,IAAI,eAAe,GAAG;AAE5F,MAAM,kBAAkB,QAA6B;CACnD,MAAM,UAAU,QAAQ,KAAK,MAAM;CAEnC,OAAO;EACL,WAFkB,UAAU,WAAW,GAAG,KAAK,MAAM,QAAQ,GAAG,IAEvC,QAAQ,KAAK,QAAQ,IAAI;EAClD;EACA,aAAa,QAAQ;CACvB;AACF;;;;;;AAOA,MAAa,kBAAkB,OAAqB,MAAuB;CACzE,IAAI,CAAC,MAAM,WAAW,MAAM,MAAM,MAAM,GAAG,OAAO;CAClD,MAAM,IAAK,MAAM,MAAiB,WAAW,CAAC;CAC9C,OAAO,KAAK,SAAU,KAAK;AAC7B;;AAGA,MAAM,eAAe,GAAW,MAAsB;CACpD,MAAM,IAAI,EAAE,WAAW,CAAC;CACxB,IAAI,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,EAAE,QAAQ;EAClD,MAAM,IAAI,EAAE,WAAW,IAAI,CAAC;EAC5B,IAAI,KAAK,SAAU,KAAK,OAAQ,QAAS,IAAI,SAAW,OAAO,IAAI,SAAU;CAC/E;CACA,OAAO;AACT;;;;;AAMA,MAAa,UAAuC,qBAAO,SAAS;AACpE,MAAa,MAAmC,qBAAO,KAAK;AAE5D,MAAa,UAAU,OAAqB,GAAe,WAA6B;CACtF,MAAM,MAAM,MAAM;CAClB,IAAI,OAAO,MAAM,KAAK,OAAO;CAC7B,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,IAAI,eAAe,OAAO,GAAG,GAAG,OAAO;GACvC,MAAM,KAAK,YAAY,GAAG,GAAG;GAC7B,IAAI,EAAE,UAAU,KAAK,EAAE,MAAM,QAAQ,OAAO;GAC5C,MAAM,MAAM,KAAK,QAAS,IAAI;GAC9B,MAAM,MAAM,MAAM;GAClB,OAAO,QAAQ,IAAI,EAAE,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC;EAClD;EACA,KAAK,GAAG;GACN,MAAM,IAAK,MAAM,MAAqB;GACtC,IAAI,EAAE,QAAQ,KAAK,CAAC,MAAM,QAAQ,OAAO;GACzC,MAAM,MAAM,MAAM;GAClB,OAAO;EACT;EACA,SAAS;GACP,MAAM,IAAK,MAAM,MAAiC;GAClD,IAAI,EAAE,QAAQ,MAAM,CAAC,MAAM,QAAQ,OAAO;GAC1C,MAAM,MAAM,MAAM;GAClB,OAAO;EACT;CACF;AACF;;;;;;AAaA,MAAa,QAAQ,OAAqB,GAAe,QAAiB,QAAyB;CACjG,IAAI,IAAI,MAAM;CACd,MAAM,MAAM,MAAM;CAClB,IAAI,QAAQ;CACZ,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,MAAM,OAAO,EAAE,UAAU;GACzB,OAAO,QAAQ,KAAK;IAClB,IAAI,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAG;KAAO,QAAQ;IAAK;IACtD,MAAM,IAAI,EAAE,WAAW,CAAC;IACxB,IAAI,IAAI,SAAU,IAAI,OAAQ;KAC5B,IAAI,KAAK,CAAC,MAAM,QAAQ;KACxB;IACF,OAAO;KACL,IAAI,eAAe,OAAO,CAAC,GAAG,OAAO;MAAE,QAAQ;MAAG;MAAO,QAAQ;KAAK;KACtE,MAAM,KAAK,YAAY,GAAG,CAAC;KAC3B,IAAI,KAAK,EAAE,MAAM,QAAQ;KACzB,KAAK,KAAK,QAAS,IAAI;IACzB;IACA;GACF;GACA,OAAO;IAAE,QAAQ;IAAG;IAAO,QAAQ;GAAM;EAC3C;EACA,KAAK,GAAG;GACN,MAAM,QAAQ,MAAM;GACpB,MAAM,OAAO,EAAE,QAAQ;GACvB,OAAO,QAAQ,KAAK;IAClB,IAAI,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAG;KAAO,QAAQ;IAAK;IACtD,IAAI,KAAK,MAAM,EAAE,MAAM,QAAQ;IAC/B;IACA;GACF;GACA,OAAO;IAAE,QAAQ;IAAG;IAAO,QAAQ;GAAM;EAC3C;EACA,SAAS;GACP,MAAM,MAAM,MAAM;GAClB,MAAM,OAAO,EAAE,QAAQ;GACvB,OAAO,QAAQ,KAAK;IAClB,IAAI,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAG;KAAO,QAAQ;IAAK;IACtD,IAAI,KAAK,IAAI,EAAE,MAAM,QAAQ;IAC7B;IACA;GACF;GACA,OAAO;IAAE,QAAQ;IAAG;IAAO,QAAQ;GAAM;EAC3C;CACF;AACF;;AASA,MAAa,WAAW,OAAqB,OAAe,MAAwB;CAClF,IAAI,MAAM,cAAc,GAAG;EACzB,MAAM,SAAS,KAAK,IAAI,MAAM,KAAK,QAAQ,CAAC;EAC5C,OAAO;GAAE;GAAQ,OAAO,SAAS;EAAM;CACzC;CACA,MAAM,IAAI,MAAM;CAChB,IAAI,IAAI;CACR,IAAI,QAAQ;CACZ,OAAO,QAAQ,KAAK,IAAI,MAAM,KAAK;EACjC,IAAI,eAAe,OAAO,CAAC,GAAG;EAC9B,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,KAAK,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,EAAE,WAAW,EAAE,WAAW,IAAI,CAAC,IAAI,WAAY,QAAS,IAAI;EACvG;CACF;CACA,OAAO;EAAE,QAAQ;EAAG;CAAM;AAC5B;;AAGA,MAAa,eAAe,OAAqB,OAAe,QAAwB;CACtF,IAAI,MAAM,cAAc,GAAG,OAAO,MAAM;CACxC,MAAM,IAAI,MAAM;CAChB,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK;EAChC,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,IAAI,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,WAAY,OAAQ;EAC5F;CACF;CACA,OAAO;AACT;;AAGA,MAAa,WAAW,OAAqB,QAAe,SAAyB;CAEnF,MAAM,OAAO,MAAM,MAAM,OAAO;CAChC,IAAI,OAAO,MAAM,OAAO;CACxB,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAK,MAAM,MAAiB,QAAQ,QAAkB,IAAI;GAChE,OAAO,KAAK,OAAO,IAAI;EACzB;EACA,KAAK,GAAG;GACN,MAAM,MAAM,MAAM;GAClB,MAAM,IAAI;GACV,IAAI,EAAE,eAAe,GAAG,OAAO;GAC/B,MAAM,QAAQ,EAAE;GAChB,IAAI,IAAI,IAAI,QAAQ,OAAO,IAAI;GAC/B,OAAO,MAAM,MAAM,KAAK,MAAM;IAC5B,IAAI,IAAI;IACR,OAAO,IAAI,EAAE,UAAU,IAAI,IAAI,OAAO,EAAE,IAAI;IAC5C,IAAI,MAAM,EAAE,QAAQ,OAAO;IAC3B,IAAI,IAAI,QAAQ,OAAO,IAAI,CAAC;GAC9B;GACA,OAAO;EACT;EACA,SAAS;GACP,MAAM,MAAM,MAAM;GAClB,MAAM,IAAI;GACV,OAAO,KAAK,IAAI,IAAI,MAAM,KAAK,MAAM,KAAK;IACxC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI,IAAI,IAAI,OAAO,EAAE,IAAI,SAAS;IACrE,OAAO;GACT;GACA,OAAO;EACT;CACF;AACF;;;;;;AAOA,MAAa,gBAAgB,OAAqB,KAAY,aAA8B;CAC1F,MAAM,IAAI,MAAM,OAAO,KAAK,QAAQ;CAEpC,IAAI,IAAI,KAAK,MAAM,WAAW,KAAA,GAAW,MAAM,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI,IAAI,QAAQ,MAAM,MAAM,MAAM,GAAG,CAAC;CAClH,OAAO;AACT;AAEA,MAAM,SAAS,OAAqB,KAAY,aAA8B;CAC5E,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,IAAI;CAChB,MAAM,QAAQ,MAAM,MAAM;CAC1B,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK;CAC7B,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI;GACV,IAAI,CAAC,UAAU;IACb,IAAI,SAAS,KAAK,OAAO,EAAE,WAAW,GAAG,GAAG,IAAI,MAAM;IACtD,OAAO,EAAE,WAAW,EAAE,MAAM,GAAG,CAAC,IAAI,KAAK;GAC3C;GACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,IAAI,WAAW,EAAE,WAAW,MAAM,CAAC,CAAC,MAAM,WAAW,EAAE,WAAW,CAAC,CAAC,GAAG,OAAO;GAEhF,OAAO,MAAM,MAAM,MAAM;EAC3B;EACA,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI;GACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IAC1B,MAAM,IAAI,EAAE,MAAM;IAClB,MAAM,IAAI,EAAE;IACZ,IAAI,WAAW,WAAW,CAAC,MAAM,WAAW,CAAC,IAAI,MAAM,GAAG,OAAO;GACnE;GACA,OAAO,MAAM,MAAM,MAAM;EAC3B;EACA,SAAS;GACP,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI;GACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,OAAO,EAAE,IAAI,OAAO;GAC5D,OAAO,MAAM,MAAM,MAAM;EAC3B;CACF;AACF;AAEA,MAAM,cAAc,MAAuB,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "$schema": "https://www.schemastore.org/package",
   "name": "@thomasfosterau/effect-parse",
-  "version": "0.2.0",
+  "version": "0.4.0",
   "description": "Parser combinators for Effect, ported from Rust's nom and winnow: text, bytes, bits and token streams, streaming input, compiled parsers and Schema integration",
   "keywords": [
     "effect",
@@ -102,17 +102,17 @@
     "@changesets/changelog-github": "^1.0.1",
     "@changesets/cli": "^3.0.3",
     "@effect/language-service": "^0.87.5",
-    "@effect/tsgo": "0.55.0",
+    "@effect/tsgo": "0.63.0",
     "@mpsuesser/oxlint-plugin-effect": "^0.6.0",
     "@types/node": "^26.6.5",
     "@typescript/native": "npm:typescript@7.0.2",
     "@vitest/coverage-istanbul": "5.0.5",
-    "effect": "4.0.5",
-    "fallow": "3.34.1",
+    "effect": "4.1.0",
+    "fallow": "3.37.0",
     "rolldown": "^1.2.14",
     "typescript": "npm:@typescript/typescript6@6.0.2",
-    "vite": "npm:@voidzero-dev/vite-plus-core@1.3.0",
-    "vite-plus": "1.3.0",
+    "vite": "npm:@voidzero-dev/vite-plus-core@1.4.0",
+    "vite-plus": "1.4.0",
     "vitest": "5.0.5"
   },
   "peerDependencies": {

package/src/Ascii.ts

@@ -30,6 +30,7 @@ import type { ErrorKind } from "./ParseError.js"
 import type { Parser } from "./Parser.js"
 import * as P from "./Parser.js"
 import * as numbers from "./internal/numbers.js"
+import { Key } from "./internal/key.js"
 import * as Resume from "./internal/resume.js"
 import { codePointPredicate } from "./internal/tokens.js"
 import { literalImpl, range, takeWhileImpl } from "./Token.js"
@@ -570,7 +571,7 @@ const isIncomplete = (state: State<any>): boolean => state.mode === "Incomplete"
  * Fails with the current (`Incomplete`) failure, recording a checkpoint
  * first in a streaming parse.
  */
-const suspendAt = (state: State<any>, key: object, start: number, checkpoint: unknown): Fail => {
+const suspendAt = (state: State<any>, key: Key, start: number, checkpoint: unknown): Fail => {
   if (state.resume !== undefined) Resume.save(state, key, start, checkpoint)
   return Fail
 }
@@ -586,7 +587,7 @@ export const takeEscapedImpl = <A, E, R, I extends Input, B, E2, R2, I2 extends
 ): Parser<S, E | E2, R | R2, I & I2> => {
   const normalStep = normal.step
   const escStep = escapable.step
-  const key = {}
+  const key = new Key()
   return P.described(
     (state: State<any>) => {
       const start = state.pos
@@ -612,7 +613,7 @@ export const takeEscapedImpl = <A, E, R, I extends Input, B, E2, R2, I2 extends
         }
         if (state.mode === "Incomplete") return suspendAt(state, key, start, before)
         if (state.mode !== "Backtrack") return Fail
-        state.pos = before
+        state.rewind(before)
         if (matchControl(state)) {
           if (escStep(state) === Fail) return isIncomplete(state) ? suspendAt(state, key, start, before) : Fail
         } else {
@@ -693,7 +694,7 @@ export const escapedImpl = <E, R, I extends Input, E2, R2, I2 extends Input>(
 ): Parser<string, E | E2, R | R2, I & I2> => {
   const normalStep = normal.step
   const escStep = escape.step
-  const key = {}
+  const key = new Key()
   return P.described(
     (state: State<any>) => {
       const start = state.pos
@@ -723,7 +724,7 @@ export const escapedImpl = <E, R, I extends Input, E2, R2, I2 extends Input>(
         } else {
           if (state.mode === "Incomplete") return suspendAt(state, key, start, { out, pos: before })
           if (state.mode !== "Backtrack") return Fail
-          state.pos = before
+          state.rewind(before)
         }
         if (matchControl(state)) {
           const b = escStep(state)

package/src/Bits.ts

@@ -176,7 +176,7 @@ export const pattern = (pattern: number, count: number): Parser<number, never, n
     if (avail < count) return state.eoi("Bits", expected, count - avail)
     const value = readBits(state, count)
     if (value !== pattern) {
-      state.pos = start
+      state.rewind(start)
       return state.backtrack("Bits", expected)
     }
     return value

package/src/Expression.ts

@@ -34,11 +34,12 @@
  *
  * @since 0.1.0
  */
+import * as Predicate from "effect/Predicate"
 import type { Input, State } from "./Input.js"
-import { Fail, mergeFailures } from "./Input.js"
-import type { Failure } from "./Input.js"
+import { Fail } from "./Input.js"
 import type { Parser } from "./Parser.js"
 import { make as makeParser } from "./Parser.js"
+import { TiedFailures } from "./internal/ties.js"
 
 /**
  * An operator in an expression grammar.
@@ -154,15 +155,17 @@ export const make = <A, E, R, I extends Input, const Ops extends ReadonlyArray<O
   readonly operators: Ops
 }): Parser<A, E | OpError<Ops[number]>, R | OpServices<Ops[number]>, I & OpInput<Ops[number]>> => {
   const operand = options.operand.step
-  const prefixes = options.operators.filter((o): o is Prefix<A, any, any, any> => o._tag === "Prefix")
-  const postfixes = options.operators.filter((o): o is Postfix<A, any, any, any> => o._tag === "Postfix")
-  const infixes = options.operators.filter((o): o is Infix<A, any, any, any> => o._tag === "Infix")
+  const prefixes = options.operators.filter((o): o is Prefix<A, any, any, any> => Predicate.isTagged(o, "Prefix"))
+  const postfixes = options.operators.filter((o): o is Postfix<A, any, any, any> => Predicate.isTagged(o, "Postfix"))
+  const infixes = options.operators.filter((o): o is Infix<A, any, any, any> => Predicate.isTagged(o, "Infix"))
 
   // Attempts each operator in turn. Returns the index of the first match
   // (with its output in `matched`), -1 if none matched, or -2 on a fatal
-  // failure. Expectations of failed attempts are accumulated in `failure`.
+  // failure. Failed attempts are folded into `failures`, merged only when
+  // read (#44): a round in which an operator matches discards them unmerged.
+  // Like `matched`, it is shared by nested expressions, which clear it.
   let matched: unknown
-  let failure: Failure | undefined
+  const failures = new TiedFailures()
   const tryOps = (state: State<any>, ops: ReadonlyArray<OperatorBase<any, any, any>>, mustConsume: boolean): number => {
     const start = state.pos
     for (let i = 0; i < ops.length; i++) {
@@ -177,15 +180,15 @@ export const make = <A, E, R, I extends Input, const Ops extends ReadonlyArray<O
         return i
       }
       if (state.mode !== "Backtrack") return -2
-      failure = failure === undefined ? state.failure : mergeFailures(failure, state.failure)
-      state.pos = start
+      state.rewind(start)
+      failures.add(state)
     }
     return -1
   }
 
   const expr = (state: State<any>, minPower: number): A | Fail => {
     let lhs: A | Fail
-    failure = undefined
+    failures.clear()
     const p = tryOps(state, prefixes, true)
     if (p === -2) return Fail
     if (p >= 0) {
@@ -195,11 +198,18 @@ export const make = <A, E, R, I extends Input, const Ops extends ReadonlyArray<O
       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 !== undefined && state.mode === "Backtrack") {
-          state.failWith("Backtrack", mergeFailures(prefixFailure, state.failure))
+          // The operand may have parsed nested expressions, which reuse `failures`
+          failures.failure = prefixFailure
+          failures.tie1 = prefixTie1
+          failures.tie2 = prefixTie2
+          failures.add(state)
+          failures.fail(state)
         }
         return Fail
       }
@@ -207,35 +217,29 @@ export const make = <A, E, R, I extends Input, const Ops extends ReadonlyArray<O
 
     while (true) {
       const start = state.pos
-      failure = undefined
+      failures.clear()
       const q = tryOps(state, postfixes, true)
       if (q === -2) return Fail
       if (q >= 0) {
         const op = postfixes[q]
         if (op.precedence * 2 < minPower) {
-          state.pos = start
+          state.rewind(start)
           break
         }
         lhs = op.fold(lhs, matched)
         continue
       }
-      const postfixFailure = failure
+      // The infix attempts are folded on top of the postfix ones
       const i = tryOps(state, infixes, false)
       if (i === -2) return Fail
       if (i < 0) {
-        const f =
-          postfixFailure === undefined
-            ? failure
-            : failure === undefined
-              ? postfixFailure
-              : mergeFailures(postfixFailure, failure)
-        if (f !== undefined && f.offset === state.pos) state.setHint(f.offset, f.expected)
+        failures.hint(state)
         break
       }
       const op = infixes[i]
       const leftPower = op.precedence * 2
       if (leftPower < minPower) {
-        state.pos = start
+        state.rewind(start)
         break
       }
       const opOut = matched