@thomasfosterau/effect-parse 0.1.0 → 0.3.0

package/dist/Token.js.map

@@ -1 +1 @@
-{"version":3,"file":"Token.js","sourceRoot":"","sources":["../src/Token.ts"],"names":[],"mappings":"AAuBA,OAAO,EACL,OAAO,EACP,UAAU,EACV,WAAW,EACX,aAAa,EACb,GAAG,EACH,OAAO,EACP,YAAY,EACZ,MAAM,EACN,OAAO,EACP,IAAI,EACJ,cAAc,EACf,MAAM,sBAAsB,CAAA;AAE7B,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAA;AAE3C,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAsBvC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAA4B,IAAO,EAAE,EAAK,EAAiB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;AA0CrH,MAAM,WAAW,GAAG,CAAC,WAAW,CAAC,CAAA;AAEjC,MAAM,OAAO,GAAG,CAAC,KAAmB,EAAW,EAAE;IAC/C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;IACrB,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC,CAAA;IAC/D,QAAQ,KAAK,CAAC,SAAS,EAAE,CAAC;QACxB,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,GAAG,KAAK,CAAC,KAAe,CAAA;YAC/B,IAAI,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,WAAW,CAAC,CAAA;YACvE,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;YAC3B,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,EAAE,CAAC;gBACpG,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAA;gBACnB,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAA;YAC9B,CAAC;YACD,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAA;YACnB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAA;QACf,CAAC;QACD,KAAK,CAAC;YACJ,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAA;YACnB,OAAQ,KAAK,CAAC,KAAoB,CAAC,GAAG,CAAC,CAAA;QACzC;YACE,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAA;YACnB,OAAQ,KAAK,CAAC,KAAgC,CAAC,GAAG,CAAC,CAAA;IACvD,CAAC;AACH,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,GAAG,GAAmB,SAAS,CAAC,OAAc,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AAEzG;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,GAAkF,EAAE,CAAC,GAAU,CAAA;AAEvH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,OAAO,GAIhB,CAAC,GAAU,EAAkC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;AAE3E,gBAAgB;AAChB,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,GAAU,EAAE,QAAiB,EAAkC,EAAE;IAC3F,MAAM,WAAW,GAAG,OAAO,GAAG,KAAK,QAAQ;QACzC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;QACrB,CAAC,CAAC,GAAG,YAAY,UAAU;YAC3B,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC;YACpB,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;IACvD,MAAM,QAAQ,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,qBAAqB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAA;IAC/E,qEAAqE;IACrE,IAAI,OAA+B,CAAA;IACnC,MAAM,WAAW,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACnF,OAAO,SAAS,CAAC,CAAC,KAAmB,EAAE,EAAE;QACvC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;QACrB,MAAM,CAAC,GAAG,WAAW,KAAK,CAAC,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,GAAa,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;QAClH,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAA;QACpB,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;QAC1C,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,SAAS,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;QACzD,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACb,IAAI,KAAK,CAAC,OAAO;gBAAE,OAAO,KAAK,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAA;YAC7E,OAAO,KAAK,CAAC,SAAS,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;QAC7C,CAAC;QACD,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;QACrB,OAAO,QAAQ,IAAI,KAAK,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;IACxF,CAAC,EAAE,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AACnF,CAAC,CAAA;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAA2B,GAAgB,EAAuD,EAAE;IACvH,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAA;IACzB,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAA;IAChC,OAAO,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;QACjC,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAA;QACrD,IAAI,CAAC,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;QAC5D,OAAO,CAAa,CAAA;IACtB,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AAC/E,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAA2B,GAAgB,EAAuD,EAAE;IACxH,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAA;IACzB,MAAM,QAAQ,GAAG,CAAC,gBAAgB,CAAC,CAAC,WAAW,EAAE,CAAC,CAAA;IAClD,OAAO,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;QAChC,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAA;QACtD,IAAI,CAAC,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;QAC7D,OAAO,CAAa,CAAA;IACtB,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AAC5E,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAA2B,KAAa,EAAuD,EAAE;IACnH,MAAM,QAAQ,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAA;IAC9D,OAAO,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAA;QACvB,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;QAC3D,IAAI,GAAG,GAAG,KAAK;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,GAAG,GAAG,CAAC,CAAA;QAChE,KAAK,CAAC,GAAG,GAAG,MAAM,CAAA;QAClB,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IACnC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AAC1D,CAAC,CAAA;AAED,MAAM,SAAS,GAAG,CAAC,CAAoB,EAAoB,EAAE;IAC3D,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACzC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACxC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAA;AACxC,CAAC,CAAA;AAED,gBAAgB;AAChB,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,GAAY,EACZ,CAAoB,EACpB,MAAe,EACf,IAAY,EACZ,WAAoB,EACpB,IAAI,GAAc,WAAW,EAC7B,IAAI,GAAG,KAAK,EACyC,EAAE;IACvD,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAA;IACzB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IAC/B,MAAM,QAAQ,GAAG,CAAC,WAAW,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAA;IAC5F,OAAO,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAA;QACvB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAA;QAC7D,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;QACjE,IAAI,KAAK,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAC/D,iEAAiE;QACjE,IAAI,IAAI,IAAI,KAAK,GAAG,GAAG;YAAE,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QACxD,KAAK,CAAC,GAAG,GAAG,MAAM,CAAA;QAClB,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IACnC,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AAC7E,CAAC,CAAA;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,GAAgB,EAChB,KAAa,EACwC,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,CAAA;AAEvG;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,GAAgB,EAChB,KAAa,EACwC,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAA;AAErG;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,SAAS,GAIlB,CAAC,GAAU,EAAE,CAAS,EAAkC,EAAE;IAC5D,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IAC/B,MAAM,WAAW,GAAG,OAAO,GAAG,KAAK,QAAQ;QACzC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;QACrB,CAAC,CAAC,GAAG,YAAY,UAAU;YAC3B,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC;YACpB,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;IACvD,MAAM,QAAQ,GAAG,CAAC,WAAW,CAAC,CAAA;IAC9B,OAAO,SAAS,CAAC,CAAC,KAAmB,EAAE,EAAE;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAA;QACvB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QACtC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,IAAI,KAAK,CAAC,OAAO;gBAAE,OAAO,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;YACvD,OAAO,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;QAC1D,CAAC;QACD,+DAA+D;QAC/D,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAA;YAC5C,IAAI,KAAK,GAAG,GAAG;gBAAE,OAAO,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAA;YACnE,IAAI,KAAK,GAAG,GAAG;gBAAE,OAAO,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAA;QAChE,CAAC;QACD,KAAK,CAAC,GAAG,GAAG,GAAG,CAAA;QACf,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAChC,CAAC,EAAE,WAAW,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AACzF,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAmB,SAAS,CAAC,CAAC,KAAiB,EAAE,EAAE;IAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAA;IACvB,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;IACrB,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAW,CAAA;AAChD,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;AAEjD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,GAAkF,EAAE,CAAC,IAAW,CAAA;AAEtH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,OAAO,GAAwC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE;IACjH,IAAI,EAAE,SAAS;CAChB,CAAC,CAAA;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,SAAuC,EACc,EAAE,CAAC,KAAK,CAAI,SAAgB,CAAC,CAAA"}
+{"version":3,"file":"Token.js","names":[],"sources":["../src/Token.ts"],"sourcesContent":["/**\n * Parsers for individual tokens and slices of tokens (winnow's `token`\n * module, nom's `bytes` module).\n *\n * Parsers here work on every input kind: `string` (tokens are code points),\n * `Uint8Array` (tokens are bytes) and arrays (tokens are elements). Parsers\n * whose input type cannot be inferred from their arguments take a type\n * parameter that defaults to `string`:\n *\n * ```ts\n * import { Token } from \"@thomasfosterau/effect-parse\"\n *\n * Token.take(4)              // Parser<string, never, never, string>\n * Token.take<Uint8Array>(4)  // Parser<Uint8Array, never, never, Uint8Array>\n * ```\n *\n * On partial input (see `Parser.parsePartial`), parsers that reach the end\n * of the available data report `Incomplete` rather than succeeding early or\n * failing.\n *\n * @since 0.1.0\n */\nimport * as Predicate from \"effect/Predicate\"\nimport type { Input, Slice, State, Token } from \"./Input.js\"\nimport {\n  advance,\n  codePointPredicate,\n  compileAny,\n  countTokens,\n  describeLiteral,\n  End,\n  indexOf,\n  matchLiteral,\n  nextIf,\n  NoMatch,\n  scan,\n  splitSurrogate\n} from \"./internal/tokens.js\"\nimport type { ErrorKind } from \"./ParseError.js\"\nimport { bounds } from \"./internal/node.js\"\nimport type { Parser, Range } from \"./Parser.js\"\nimport { described } from \"./Parser.js\"\n\nexport type {\n  /**\n   * @since 0.1.0\n   * @category models\n   */\n  Token\n}\n\n/**\n * An inclusive range of tokens, e.g. `Token.range(\"a\", \"z\")`.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface TokenRange<T> {\n  readonly _tag: \"TokenRange\"\n  readonly from: T\n  readonly to: T\n}\n\n/**\n * Creates an inclusive token range (winnow's `'a'..='z'`).\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const range = <T extends string | number>(from: T, to: T): TokenRange<T> => ({ _tag: \"TokenRange\", from, to })\n\ndeclare const CodePointsBrand: unique symbol\n\n/**\n * A predicate over code points, made with {@link codePoints}. In a token set\n * it receives each character as a number, so testing a character allocates\n * nothing.\n *\n * @since 0.2.0\n * @category models\n */\nexport interface CodePoints {\n  (codePoint: number): boolean\n  readonly [CodePointsBrand]: true\n}\n\n/**\n * Declares a character class as a predicate over code points, for token sets\n * on string, `Text` and byte inputs. `name` describes it in error messages.\n *\n * A plain `(char: string) => boolean` predicate receives each character as a\n * string, which costs an allocation per character tested; a `codePoints`\n * predicate receives the code point itself (a byte, on byte input).\n *\n * `ranges` optionally lists the code points the predicate accepts, as\n * inclusive `[from, to]` pairs. Compiled parsers then test the ranges\n * instead of calling the predicate, so they must agree with it exactly.\n *\n * @example\n * ```ts\n * import { Parser, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const isNameStart = Token.codePoints(\n *   \"name start\",\n *   (c) => (c >= 0x61 && c <= 0x7a) || c === 0x5f || c >= 0xc0,\n *   [[0x5f, 0x5f], [0x61, 0x7a], [0xc0, 0x10ffff]]\n * )\n * const name = Token.takeWhile([isNameStart, Token.range(\"0\", \"9\")], { min: 1 })\n * ```\n *\n * @since 0.2.0\n * @category constructors\n */\nexport const codePoints = (\n  name: string,\n  predicate: (codePoint: number) => boolean,\n  ranges?: ReadonlyArray<readonly [number, number]>\n): CodePoints =>\n  // Wrapped, so the caller's function is left unmarked\n  codePointPredicate(\n    name,\n    (c: number): boolean => predicate(c),\n    ranges?.map(([from, to]) => [from, to] as const)\n  ) as unknown as CodePoints\n\n/**\n * A set of string tokens: the characters of a string, a range, a predicate,\n * or an array of these. Strings, ranges, {@link codePoints} predicates and\n * the `Ascii` and `Text` predicates test characters without allocating; a\n * `(char: string) => boolean` predicate allocates a string per character.\n *\n * @since 0.1.0\n * @category models\n */\nexport type StringTokenSet =\n  | string\n  | TokenRange<string>\n  | CodePoints\n  | ((char: string) => boolean)\n  | ReadonlyArray<StringTokenSet>\n\n/**\n * A set of byte tokens: a byte, the (ASCII) characters of a string, a\n * `Uint8Array` of bytes, a range, a predicate, or an array of these.\n *\n * @since 0.1.0\n * @category models\n */\nexport type ByteTokenSet =\n  | number\n  | string\n  | Uint8Array\n  | TokenRange<number>\n  | CodePoints\n  | ((byte: number) => boolean)\n  | ReadonlyArray<ByteTokenSet>\n\n/**\n * A set of tokens (winnow's `ContainsToken`). For array inputs, a set is a\n * predicate or an array of allowed elements (compared with `===`).\n *\n * @since 0.1.0\n * @category models\n */\nexport type TokenSet<I> = I extends string\n  ? StringTokenSet\n  : I extends Uint8Array\n    ? ByteTokenSet\n    : I extends ReadonlyArray<infer T>\n      ? ((token: T) => boolean) | ReadonlyArray<T>\n      : never\n\nconst expectedAny = [\"any token\"]\n\nconst anyStep = (state: State<Input>): unknown => {\n  const pos = state.pos\n  if (pos >= state.end) return state.eoi(\"Token\", expectedAny, 1)\n  switch (state.inputKind) {\n    case 0: {\n      const s = state.input as string\n      if (splitSurrogate(state, pos)) return state.incomplete(1, expectedAny)\n      const c = s.charCodeAt(pos)\n      if (c >= 0xd800 && c <= 0xdbff && pos + 1 < s.length && (s.charCodeAt(pos + 1) & 0xfc00) === 0xdc00) {\n        state.pos = pos + 2\n        return s.slice(pos, pos + 2)\n      }\n      state.pos = pos + 1\n      return s[pos]\n    }\n    case 1:\n      state.pos = pos + 1\n      return (state.input as Uint8Array)[pos]\n    default:\n      state.pos = pos + 1\n      return (state.input as ReadonlyArray<unknown>)[pos]\n  }\n}\n\n/**\n * Matches any single token: a character of a string (winnow's `any`, nom's\n * `anychar`).\n *\n * @since 0.1.0\n * @category tokens\n */\nexport const any: Parser<string> = /*#__PURE__*/ described(anyStep as any, \"any\", { _tag: \"Any\", encoding: undefined })\n\n/**\n * Matches any single token of an input of type `I`.\n *\n * @example\n * ```ts\n * import { Parser, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const byte = Token.anyToken<Uint8Array>()\n * Parser.parse(byte, new Uint8Array([7])) // Result.succeed(7)\n * ```\n *\n * @since 0.1.0\n * @category tokens\n */\nexport const anyToken = <I extends Input = string>(): Parser<Token<NoInfer<I>>, never, never, NoInfer<I>> => any as any\n\n/**\n * Matches a literal sequence of tokens (winnow's `literal`, nom's `tag`).\n * Strings are matched against string input, `Uint8Array`s against byte\n * input, and arrays element-wise (with `===`) against array input.\n *\n * @example\n * ```ts\n * import { Parser, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const keyword = Parser.alt(Token.literal(\"true\"), Token.literal(\"false\"))\n * //    ^? Parser<\"true\" | \"false\">\n * ```\n *\n * @since 0.1.0\n * @category tokens\n */\nexport const literal: {\n  <const L extends string>(literal: L): Parser<L, never, never, string>\n  (literal: Uint8Array): Parser<Uint8Array, never, never, Uint8Array>\n  <const T>(literal: ReadonlyArray<T>): Parser<ReadonlyArray<T>, never, never, ReadonlyArray<T>>\n} = (lit: Input): Parser<any, never, never, any> => literalImpl(lit, false)\n\n/** @internal */\nexport const literalImpl = (lit: Input, caseless: boolean): Parser<any, never, never, any> => {\n  const description = describeLiteral(lit)\n  const expected = [caseless ? `${description} (case insensitive)` : description]\n  // A string literal may also be matched against byte input (as UTF-8)\n  let asBytes: Uint8Array | undefined\n  const literalKind = Predicate.isString(lit) ? 0 : lit instanceof Uint8Array ? 1 : 2\n  return described(\n    (state: State<Input>) => {\n      const pos = state.pos\n      const l = literalKind === 0 && state.inputKind === 1 ? (asBytes ??= new TextEncoder().encode(lit as string)) : lit\n      const len = l.length\n      const r = matchLiteral(state, l, caseless)\n      if (r === -1) return state.backtrack(\"Literal\", expected)\n      if (r === -2) {\n        if (state.partial) return state.incomplete(len - (state.end - pos), expected)\n        return state.backtrack(\"Literal\", expected)\n      }\n      state.pos = pos + len\n      return caseless || state.inputKind !== literalKind ? state.slice(pos, pos + len) : lit\n    },\n    description,\n    { _tag: \"Literal\", literal: lit, caseless, encoding: undefined }\n  )\n}\n\n/**\n * Matches one token belonging to a set, returning it (winnow's and nom's\n * `one_of`).\n *\n * @example\n * ```ts\n * import { Parser, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const sign = Token.oneOf(\"+-\")\n * const lower = Token.oneOf(Token.range(\"a\", \"z\"))\n * const hexByte = Token.oneOf<Uint8Array>([Token.range(0x30, 0x39), Token.range(0x61, 0x66)])\n * ```\n *\n * @since 0.1.0\n * @category tokens\n */\nexport const oneOf = <I extends Input = string>(\n  set: TokenSet<I>\n): Parser<Token<NoInfer<I>>, never, never, NoInfer<I>> => {\n  const m = compileAny(set)\n  const expected = [m.description]\n  return described(\n    (state) => {\n      const t = nextIf(state, m, false)\n      if (t === End) return state.eoi(\"OneOf\", expected, 1)\n      if (t === NoMatch) return state.backtrack(\"OneOf\", expected)\n      return t as Token<I>\n    },\n    m.description,\n    { _tag: \"OneOf\", set, negate: false, encoding: undefined }\n  )\n}\n\n/**\n * Matches one token *not* belonging to a set, returning it (winnow's and\n * nom's `none_of`).\n *\n * @since 0.1.0\n * @category tokens\n */\nexport const noneOf = <I extends Input = string>(\n  set: TokenSet<I>\n): Parser<Token<NoInfer<I>>, never, never, NoInfer<I>> => {\n  const m = compileAny(set)\n  const expected = [`anything but ${m.description}`]\n  return described(\n    (state) => {\n      const t = nextIf(state, m, true)\n      if (t === End) return state.eoi(\"NoneOf\", expected, 1)\n      if (t === NoMatch) return state.backtrack(\"NoneOf\", expected)\n      return t as Token<I>\n    },\n    expected[0],\n    { _tag: \"OneOf\", set, negate: true, encoding: undefined }\n  )\n}\n\n/**\n * Takes exactly `count` tokens (winnow's and nom's `take`).\n *\n * @since 0.1.0\n * @category slices\n */\nexport const take = <I extends Input = string>(count: number): Parser<Slice<NoInfer<I>>, never, never, NoInfer<I>> => {\n  const expected = [count === 1 ? \"1 token\" : `${count} tokens`]\n  return described(\n    (state) => {\n      const start = state.pos\n      const { count: got, offset } = advance(state, start, count)\n      if (got < count) return state.eoi(\"Take\", expected, count - got)\n      state.pos = offset\n      return state.slice(start, offset)\n    },\n    \"take\",\n    { _tag: \"Take\", count, encoding: undefined }\n  )\n}\n\nconst normalize = (r: Range | undefined): [number, number] => {\n  if (r === undefined) return [0, Infinity]\n  if (Predicate.isNumber(r)) return [r, r]\n  return [r.min ?? 0, r.max ?? Infinity]\n}\n\n/** @internal */\nexport const takeWhileImpl = <I extends Input>(\n  set: unknown,\n  r: Range | undefined,\n  negate: boolean,\n  name: string,\n  description?: string,\n  kind: ErrorKind = \"TakeWhile\",\n  hint = false\n): Parser<Slice<NoInfer<I>>, never, never, NoInfer<I>> => {\n  const m = compileAny(set)\n  const [min, max] = normalize(r)\n  const expected = [description ?? (negate ? `anything but ${m.description}` : m.description)]\n  return described(\n    (state) => {\n      const start = state.pos\n      const { count, hitEnd, offset } = scan(state, m, negate, max)\n      if (hitEnd && state.partial) return state.incomplete(1, expected)\n      if (count < min) return state.backtrack(kind, expected, offset)\n      // More matching tokens would have been accepted where we stopped\n      if (hint && count < max) state.setHint(offset, expected)\n      state.pos = offset\n      return state.slice(start, offset)\n    },\n    name,\n    { _tag: \"TakeWhile\", set, negate, min, max, encoding: undefined }\n  )\n}\n\n/**\n * Takes the longest run of tokens belonging to a set, with the number of\n * tokens constrained by `range` (default: zero or more). This is winnow's\n * `take_while(range, set)`, and nom's `take_while`, `take_while1` and\n * `take_while_m_n`.\n *\n * @example\n * ```ts\n * import { Parser, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const identifier = Token.takeWhile(\n *   [Token.range(\"a\", \"z\"), Token.range(\"A\", \"Z\"), \"_\"],\n *   { min: 1 }\n * )\n * ```\n *\n * @since 0.1.0\n * @category slices\n */\nexport const takeWhile = <I extends Input = string>(\n  set: TokenSet<I>,\n  range?: Range\n): Parser<Slice<NoInfer<I>>, never, never, NoInfer<I>> => takeWhileImpl(set, range, false, \"takeWhile\")\n\n/**\n * Takes the longest run of tokens *not* belonging to a set (winnow's\n * `take_till`, nom's `take_till` and `take_till1`).\n *\n * @since 0.1.0\n * @category slices\n */\nexport const takeTill = <I extends Input = string>(\n  set: TokenSet<I>,\n  range?: Range\n): Parser<Slice<NoInfer<I>>, never, never, NoInfer<I>> => takeWhileImpl(set, range, true, \"takeTill\")\n\n/**\n * Takes tokens up to (not including) the first occurrence of a literal\n * (winnow's `take_until`, nom's `take_until`). The literal is not\n * consumed. `range` constrains the number of tokens taken.\n *\n * @since 0.1.0\n * @category slices\n */\nexport const takeUntil: {\n  (literal: string, range?: Range): Parser<string, never, never, string>\n  (literal: Uint8Array, range?: Range): Parser<Uint8Array, never, never, Uint8Array>\n  <T>(literal: ReadonlyArray<T>, range?: Range): Parser<ReadonlyArray<T>, never, never, ReadonlyArray<T>>\n} = (lit: Input, r?: Range): Parser<any, never, never, any> => {\n  const [min, max] = normalize(r)\n  const description = describeLiteral(lit)\n  const expected = [description]\n  return described(\n    (state: State<Input>) => {\n      const start = state.pos\n      const idx = indexOf(state, lit, start)\n      if (idx < 0) {\n        if (state.partial) return state.incomplete(0, expected)\n        return state.backtrack(\"TakeUntil\", expected, state.end)\n      }\n      // The literal was read but is not consumed (a string literal is up to three bytes per unit of UTF-8)\n      state.syntax?.read(idx + lit.length * (Predicate.isString(lit) && state.inputKind === 1 ? 3 : 1))\n      // As in winnow, the first occurrence must lie within the range\n      if (min > 0 || max !== Infinity) {\n        const count = countTokens(state, start, idx)\n        if (count < min) return state.backtrack(\"TakeUntil\", expected, idx)\n        if (count > max) return state.backtrack(\"TakeUntil\", expected)\n      }\n      state.pos = idx\n      return state.slice(start, idx)\n    },\n    \"takeUntil\",\n    { _tag: \"TakeUntil\", literal: lit, ...bounds(r), encoding: undefined }\n  )\n}\n\n/**\n * Takes the rest of the input (winnow's and nom's `rest`).\n *\n * @since 0.1.0\n * @category slices\n */\nexport const rest: Parser<string> = /*#__PURE__*/ described(\n  (state: State<any>) => {\n    const start = state.pos\n    state.pos = state.end\n    return state.slice(start, state.end) as string\n  },\n  \"rest\",\n  { _tag: \"Rest\", encoding: undefined }\n)\n\n/**\n * Takes the rest of an input of type `I`.\n *\n * @since 0.1.0\n * @category slices\n */\nexport const restOf = <I extends Input = string>(): Parser<Slice<NoInfer<I>>, never, never, NoInfer<I>> => rest as any\n\n/**\n * Returns the length of the remaining input without consuming it (winnow's\n * and nom's `rest_len`).\n *\n * @since 0.1.0\n * @category slices\n */\nexport const restLen: Parser<number, never, never, Input> = /*#__PURE__*/ described(\n  (state) => state.end - state.pos,\n  \"restLen\",\n  {\n    _tag: \"RestLen\"\n  }\n)\n\n/**\n * Matches a token satisfying a predicate (nom's `satisfy`). Equivalent to\n * `Token.oneOf(predicate)`.\n *\n * @since 0.1.0\n * @category tokens\n */\nexport const satisfy = <I extends Input = string>(\n  predicate: (token: Token<I>) => boolean\n): Parser<Token<NoInfer<I>>, never, never, NoInfer<I>> => oneOf<I>(predicate as any)\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqEA,MAAa,SAAoC,MAAS,QAA0B;CAAE,MAAM;CAAc;CAAM;AAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CnH,MAAa,cACX,MACA,WACA,WAGA,mBACE,OACC,MAAuB,UAAU,CAAC,GACnC,QAAQ,KAAK,CAAC,MAAM,QAAQ,CAAC,MAAM,EAAE,CAAU,CACjD;AAiDF,MAAM,cAAc,CAAC,WAAW;AAEhC,MAAM,WAAW,UAAiC;CAChD,MAAM,MAAM,MAAM;CAClB,IAAI,OAAO,MAAM,KAAK,OAAO,MAAM,IAAI,SAAS,aAAa,CAAC;CAC9D,QAAQ,MAAM,WAAd;EACE,KAAK,GAAG;GACN,MAAM,IAAI,MAAM;GAChB,IAAI,eAAe,OAAO,GAAG,GAAG,OAAO,MAAM,WAAW,GAAG,WAAW;GACtE,MAAM,IAAI,EAAE,WAAW,GAAG;GAC1B,IAAI,KAAK,SAAU,KAAK,SAAU,MAAM,IAAI,EAAE,WAAW,EAAE,WAAW,MAAM,CAAC,IAAI,WAAY,OAAQ;IACnG,MAAM,MAAM,MAAM;IAClB,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC;GAC7B;GACA,MAAM,MAAM,MAAM;GAClB,OAAO,EAAE;EACX;EACA,KAAK;GACH,MAAM,MAAM,MAAM;GAClB,OAAQ,MAAM,MAAqB;EACrC;GACE,MAAM,MAAM,MAAM;GAClB,OAAQ,MAAM,MAAiC;CACnD;AACF;;;;;;;;AASA,MAAa,MAAoC,wBAAU,SAAgB,OAAO;CAAE,MAAM;CAAO,UAAU,KAAA;AAAU,CAAC;;;;;;;;;;;;;;;AAgBtH,MAAa,iBAAgG;;;;;;;;;;;;;;;;;AAkB7G,MAAa,WAIR,QAA+C,YAAY,KAAK,KAAK;;AAG1E,MAAa,eAAe,KAAY,aAAsD;CAC5F,MAAM,cAAc,gBAAgB,GAAG;CACvC,MAAM,WAAW,CAAC,WAAW,GAAG,YAAY,uBAAuB,WAAW;CAE9E,IAAI;CACJ,MAAM,cAAc,UAAU,SAAS,GAAG,IAAI,IAAI,eAAe,aAAa,IAAI;CAClF,OAAO,WACJ,UAAwB;EACvB,MAAM,MAAM,MAAM;EAClB,MAAM,IAAI,gBAAgB,KAAK,MAAM,cAAc,IAAK,YAAY,IAAI,YAAY,CAAC,CAAC,OAAO,GAAa,IAAK;EAC/G,MAAM,MAAM,EAAE;EACd,MAAM,IAAI,aAAa,OAAO,GAAG,QAAQ;EACzC,IAAI,MAAM,IAAI,OAAO,MAAM,UAAU,WAAW,QAAQ;EACxD,IAAI,MAAM,IAAI;GACZ,IAAI,MAAM,SAAS,OAAO,MAAM,WAAW,OAAO,MAAM,MAAM,MAAM,QAAQ;GAC5E,OAAO,MAAM,UAAU,WAAW,QAAQ;EAC5C;EACA,MAAM,MAAM,MAAM;EAClB,OAAO,YAAY,MAAM,cAAc,cAAc,MAAM,MAAM,KAAK,MAAM,GAAG,IAAI;CACrF,GACA,aACA;EAAE,MAAM;EAAW,SAAS;EAAK;EAAU,UAAU,KAAA;CAAU,CACjE;AACF;;;;;;;;;;;;;;;;;AAkBA,MAAa,SACX,QACwD;CACxD,MAAM,IAAI,WAAW,GAAG;CACxB,MAAM,WAAW,CAAC,EAAE,WAAW;CAC/B,OAAO,WACJ,UAAU;EACT,MAAM,IAAI,OAAO,OAAO,GAAG,KAAK;EAChC,IAAI,MAAM,KAAK,OAAO,MAAM,IAAI,SAAS,UAAU,CAAC;EACpD,IAAI,MAAM,SAAS,OAAO,MAAM,UAAU,SAAS,QAAQ;EAC3D,OAAO;CACT,GACA,EAAE,aACF;EAAE,MAAM;EAAS;EAAK,QAAQ;EAAO,UAAU,KAAA;CAAU,CAC3D;AACF;;;;;;;;AASA,MAAa,UACX,QACwD;CACxD,MAAM,IAAI,WAAW,GAAG;CACxB,MAAM,WAAW,CAAC,gBAAgB,EAAE,aAAa;CACjD,OAAO,WACJ,UAAU;EACT,MAAM,IAAI,OAAO,OAAO,GAAG,IAAI;EAC/B,IAAI,MAAM,KAAK,OAAO,MAAM,IAAI,UAAU,UAAU,CAAC;EACrD,IAAI,MAAM,SAAS,OAAO,MAAM,UAAU,UAAU,QAAQ;EAC5D,OAAO;CACT,GACA,SAAS,IACT;EAAE,MAAM;EAAS;EAAK,QAAQ;EAAM,UAAU,KAAA;CAAU,CAC1D;AACF;;;;;;;AAQA,MAAa,QAAkC,UAAuE;CACpH,MAAM,WAAW,CAAC,UAAU,IAAI,YAAY,GAAG,MAAM,QAAQ;CAC7D,OAAO,WACJ,UAAU;EACT,MAAM,QAAQ,MAAM;EACpB,MAAM,EAAE,OAAO,KAAK,WAAW,QAAQ,OAAO,OAAO,KAAK;EAC1D,IAAI,MAAM,OAAO,OAAO,MAAM,IAAI,QAAQ,UAAU,QAAQ,GAAG;EAC/D,MAAM,MAAM;EACZ,OAAO,MAAM,MAAM,OAAO,MAAM;CAClC,GACA,QACA;EAAE,MAAM;EAAQ;EAAO,UAAU,KAAA;CAAU,CAC7C;AACF;AAEA,MAAM,aAAa,MAA2C;CAC5D,IAAI,MAAM,KAAA,GAAW,OAAO,CAAC,GAAG,QAAQ;CACxC,IAAI,UAAU,SAAS,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC;CACvC,OAAO,CAAC,EAAE,OAAO,GAAG,EAAE,OAAO,QAAQ;AACvC;;AAGA,MAAa,iBACX,KACA,GACA,QACA,MACA,aACA,OAAkB,aAClB,OAAO,UACiD;CACxD,MAAM,IAAI,WAAW,GAAG;CACxB,MAAM,CAAC,KAAK,OAAO,UAAU,CAAC;CAC9B,MAAM,WAAW,CAAC,gBAAgB,SAAS,gBAAgB,EAAE,gBAAgB,EAAE,YAAY;CAC3F,OAAO,WACJ,UAAU;EACT,MAAM,QAAQ,MAAM;EACpB,MAAM,EAAE,OAAO,QAAQ,WAAW,KAAK,OAAO,GAAG,QAAQ,GAAG;EAC5D,IAAI,UAAU,MAAM,SAAS,OAAO,MAAM,WAAW,GAAG,QAAQ;EAChE,IAAI,QAAQ,KAAK,OAAO,MAAM,UAAU,MAAM,UAAU,MAAM;EAE9D,IAAI,QAAQ,QAAQ,KAAK,MAAM,QAAQ,QAAQ,QAAQ;EACvD,MAAM,MAAM;EACZ,OAAO,MAAM,MAAM,OAAO,MAAM;CAClC,GACA,MACA;EAAE,MAAM;EAAa;EAAK;EAAQ;EAAK;EAAK,UAAU,KAAA;CAAU,CAClE;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,MAAa,aACX,KACA,UACwD,cAAc,KAAK,OAAO,OAAO,WAAW;;;;;;;;AAStG,MAAa,YACX,KACA,UACwD,cAAc,KAAK,OAAO,MAAM,UAAU;;;;;;;;;AAUpG,MAAa,aAIR,KAAY,MAA8C;CAC7D,MAAM,CAAC,KAAK,OAAO,UAAU,CAAC;CAE9B,MAAM,WAAW,CADG,gBAAgB,GACR,CAAC;CAC7B,OAAO,WACJ,UAAwB;EACvB,MAAM,QAAQ,MAAM;EACpB,MAAM,MAAM,QAAQ,OAAO,KAAK,KAAK;EACrC,IAAI,MAAM,GAAG;GACX,IAAI,MAAM,SAAS,OAAO,MAAM,WAAW,GAAG,QAAQ;GACtD,OAAO,MAAM,UAAU,aAAa,UAAU,MAAM,GAAG;EACzD;EAEA,MAAM,QAAQ,KAAK,MAAM,IAAI,UAAU,UAAU,SAAS,GAAG,KAAK,MAAM,cAAc,IAAI,IAAI,EAAE;EAEhG,IAAI,MAAM,KAAK,QAAQ,UAAU;GAC/B,MAAM,QAAQ,YAAY,OAAO,OAAO,GAAG;GAC3C,IAAI,QAAQ,KAAK,OAAO,MAAM,UAAU,aAAa,UAAU,GAAG;GAClE,IAAI,QAAQ,KAAK,OAAO,MAAM,UAAU,aAAa,QAAQ;EAC/D;EACA,MAAM,MAAM;EACZ,OAAO,MAAM,MAAM,OAAO,GAAG;CAC/B,GACA,aACA;EAAE,MAAM;EAAa,SAAS;EAAK,GAAG,OAAO,CAAC;EAAG,UAAU,KAAA;CAAU,CACvE;AACF;;;;;;;AAQA,MAAa,OAAqC,yBAC/C,UAAsB;CACrB,MAAM,QAAQ,MAAM;CACpB,MAAM,MAAM,MAAM;CAClB,OAAO,MAAM,MAAM,OAAO,MAAM,GAAG;AACrC,GACA,QACA;CAAE,MAAM;CAAQ,UAAU,KAAA;AAAU,CACtC;;;;;;;AAQA,MAAa,eAA8F;;;;;;;;AAS3G,MAAa,UAA6D,yBACvE,UAAU,MAAM,MAAM,MAAM,KAC7B,WACA,EACE,MAAM,UACR,CACF;;;;;;;;AASA,MAAa,WACX,cACwD,MAAS,SAAgB"}

package/dist/index.d.ts

@@ -1,17 +1,16 @@
-/**
- * @since 0.1.0
- */
-export * as Input from "./Input.js";
-export * as Parser from "./Parser.js";
-export * as ParseError from "./ParseError.js";
-export * as Token from "./Token.js";
-export * as Ascii from "./Ascii.js";
-export * as Text from "./Text.js";
-export * as Encoding from "./Encoding.js";
-export * as Binary from "./Binary.js";
-export * as Bits from "./Bits.js";
-export * as Expression from "./Expression.js";
-export * as Nom from "./Nom.js";
-export * as ParserSchema from "./ParserSchema.js";
-export * as ParserStream from "./ParserStream.js";
-//# sourceMappingURL=index.d.ts.map
+import * as Input from "./Input.js";
+import * as Parser from "./Parser.js";
+import * as Token from "./Token.js";
+import * as Bits from "./Bits.js";
+import * as Ascii from "./Ascii.js";
+import * as Binary from "./Binary.js";
+import * as ParseError from "./ParseError.js";
+import * as Encoding from "./Encoding.js";
+import * as Compiler from "./Compiler.js";
+import * as Text from "./Text.js";
+import * as Expression from "./Expression.js";
+import * as Nom from "./Nom.js";
+import * as ParserSchema from "./ParserSchema.js";
+import * as ParserStream from "./ParserStream.js";
+import * as Syntax from "./Syntax.js";
+export { Ascii, Binary, Bits, Compiler, Encoding, Expression, Input, Nom, ParseError, Parser, ParserSchema, ParserStream, Syntax, Text, Token };

package/dist/index.js

@@ -1,17 +1,16 @@
-/**
- * @since 0.1.0
- */
-export * as Input from "./Input.js";
-export * as Parser from "./Parser.js";
-export * as ParseError from "./ParseError.js";
-export * as Token from "./Token.js";
-export * as Ascii from "./Ascii.js";
-export * as Text from "./Text.js";
-export * as Encoding from "./Encoding.js";
-export * as Binary from "./Binary.js";
-export * as Bits from "./Bits.js";
-export * as Expression from "./Expression.js";
-export * as Nom from "./Nom.js";
-export * as ParserSchema from "./ParserSchema.js";
-export * as ParserStream from "./ParserStream.js";
-//# sourceMappingURL=index.js.map
+import * as Input from "./Input.js";
+import * as Parser from "./Parser.js";
+import * as Token from "./Token.js";
+import * as Bits from "./Bits.js";
+import * as Ascii from "./Ascii.js";
+import * as Binary from "./Binary.js";
+import * as ParseError from "./ParseError.js";
+import * as Encoding from "./Encoding.js";
+import * as Compiler from "./Compiler.js";
+import * as Text from "./Text.js";
+import * as Expression from "./Expression.js";
+import * as Nom from "./Nom.js";
+import * as ParserSchema from "./ParserSchema.js";
+import * as ParserStream from "./ParserStream.js";
+import * as Syntax from "./Syntax.js";
+export { Ascii, Binary, Bits, Compiler, Encoding, Expression, Input, Nom, ParseError, Parser, ParserSchema, ParserStream, Syntax, Text, Token };

package/dist/internal/compiler/closure.d.ts

@@ -1,25 +1,23 @@
-import type { State } from "../../Input.js";
-import type { Node, ParserLike } from "../node.js";
+import { State } from "../../Input.js";
+import { Backend } from "./registry.js";
+import { Node, ParserLike } from "../node.js";
 import { FirstSets } from "./first.js";
+//#region src/internal/compiler/closure.d.ts
 export type Step = (state: State<any>) => any;
 /** A parser that the compiler left to its interpreted step. */
 export interface Fallback {
-    readonly name: string | undefined;
-    readonly tag: Node["_tag"];
-    readonly reason: string;
+  readonly name: string | undefined;
+  readonly tag: Node["_tag"];
+  readonly reason: string;
 }
-/** The maximum number of distinct parsers compiled for one root. */
-export declare const maxNodes = 2048;
 export interface ClosureCompiler {
-    readonly compile: (p: ParserLike, used: boolean) => Step;
-    readonly note: (p: ParserLike, node: Node, reason: string) => void;
-    readonly firsts: FirstSets;
-    readonly fallbacks: ReadonlyArray<Fallback>;
+  readonly compile: (p: ParserLike, used: boolean) => Step;
+  readonly note: (p: ParserLike, node: Node, reason: string) => void;
+  readonly firsts: FirstSets;
+  readonly fallbacks: ReadonlyArray<Fallback>;
 }
 export declare const createClosureCompiler: (kind: 0 | 1 | 2, resumable?: boolean) => ClosureCompiler;
-/** Compiles a root parser for one input kind. */
-export declare const compileClosure: (root: ParserLike, kind: 0 | 1 | 2, resumable?: boolean) => {
-    readonly step: Step;
-    readonly fallbacks: ReadonlyArray<Fallback>;
-};
+/** The closure compiler as a backend. */
+export declare const backend: Backend;
+//#endregion
 //# sourceMappingURL=closure.d.ts.map

package/dist/internal/compiler/closure.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"closure.d.ts","sourceRoot":"","sources":["../../../src/internal/compiler/closure.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAW,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAGpD,OAAO,KAAK,EAAE,IAAI,EAAU,UAAU,EAAE,MAAM,YAAY,CAAA;AAS1D,OAAO,EAAE,SAAS,EAAW,MAAM,YAAY,CAAA;AAI/C,MAAM,MAAM,IAAI,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,CAAA;AAE7C,+DAA+D;AAC/D,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAA;IACjC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB;AAED,oEAAoE;AACpE,eAAO,MAAM,QAAQ,OAAO,CAAA;AAg/C5B,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,KAAK,IAAI,CAAA;IACxD,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,KAAK,IAAI,CAAA;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAA;IAC1B,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAA;CAC5C;AAED,eAAO,MAAM,qBAAqB,SAAU,CAAC,GAAG,CAAC,GAAG,CAAC,0BAAsB,eAQ1E,CAAA;AAED,iDAAiD;AACjD,eAAO,MAAM,cAAc,SACnB,UAAU,QACV,CAAC,GAAG,CAAC,GAAG,CAAC,0BAEd;IAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAA;CAIpE,CAAA"}
+{"version":3,"file":"closure.d.ts","names":[],"sources":["../../../src/internal/compiler/closure.ts"],"mappings":";;;;;YA6BY,QAAQ,OAAO;;iBAGV;WACN;WACA,KAAK;WACL;;iBAsgDM;WACN,UAAU,GAAG,YAAY,kBAAkB;WAC3C,OAAO,GAAG,YAAY,MAAM,MAAM;WAClC,QAAQ;WACR,WAAW,cAAc;;qBAGvB,wBAAyB,iBAAiB,wBAAoB;;qBAsB9D,SAAS"}