@thomasfosterau/effect-parse 0.1.0 → 0.2.0

package/dist/Nom.js

@@ -1,519 +1,489 @@
-/**
- * nom-flavoured names for effect-parse's parsers and combinators.
- *
- * effect-parse's main API follows winnow's naming (in camelCase). This module
- * offers the names, and argument orders, that nom users know, so grammars
- * can be ported with minimal changes:
- *
- * | nom | effect-parse |
- * |---|---|
- * | `tag("abc")` | `Token.literal("abc")` |
- * | `many0(p)` | `Parser.repeat(p)` |
- * | `separated_list1(sep, p)` | `Parser.separated(p, sep, { min: 1 })` |
- * | `map_res(p, f)` | `Parser.tryMap(p, f)` |
- * | `recognize(p)` | `Parser.taken(p)` |
- * | `value(v, p)` | `Parser.as(p, v)` |
- *
- * nom's `streaming` and `complete` variants are not separate functions here.
- * Whether input is partial is decided by the runner (`Parser.parsePartial`
- * vs `Parser.parse`).
- *
- * @example
- * ```ts
- * import { Result } from "effect"
- * import { Nom, Parser } from "@thomasfosterau/effect-parse"
- *
- * const hexPrimary = Nom.mapRes(
- *   Nom.takeWhileMN(2, 2, (c: string) => /[0-9a-fA-F]/.test(c)),
- *   (s) => Result.succeed(parseInt(s, 16))
- * )
- * const hexColor = Nom.preceded(
- *   Nom.tag("#"),
- *   Nom.tuple(hexPrimary, hexPrimary, hexPrimary)
- * )
- *
- * Parser.parse(hexColor, "#2F14DF") // Result.succeed([47, 20, 223])
- * ```
- *
- * @since 0.1.0
- */
-import * as Option from "effect/Option";
-import * as Result from "effect/Result";
-import * as Ascii from "./Ascii.js";
-import * as Binary from "./Binary.js";
+import "effect/Result";
 import * as P from "./Parser.js";
 import * as Token from "./Token.js";
-// -----------------------------------------------------------------------------
-// bytes / character
-// -----------------------------------------------------------------------------
-/**
- * Matches a literal (nom's `tag`).
- *
- * @since 0.1.0
- * @category bytes
- */
-export const tag = Token.literal;
-/**
- * Matches a literal, ignoring ASCII case (nom's `tag_no_case`).
- *
- * @since 0.1.0
- * @category bytes
- */
-export const tagNoCase = Ascii.caseless;
-/**
- * Matches a single character (nom's `char`).
- *
- * @since 0.1.0
- * @category character
- */
-export const char = (c) => Token.literal(c);
-/**
- * Matches any character (nom's `anychar`).
- *
- * @since 0.1.0
- * @category character
- */
-export const anychar = Token.any;
-/**
- * @since 0.1.0
- * @category character
- */
-export const oneOf = Token.oneOf;
-/**
- * @since 0.1.0
- * @category character
- */
-export const noneOf = Token.noneOf;
-/**
- * @since 0.1.0
- * @category character
- */
-export const satisfy = Token.satisfy;
-/**
- * The longest non-empty run of tokens from a set (nom's `is_a`).
- *
- * @since 0.1.0
- * @category bytes
- */
-export const isA = (set) => Token.takeWhile(set, { min: 1 });
-/**
- * The longest non-empty run of tokens *not* from a set (nom's `is_not`).
- *
- * @since 0.1.0
- * @category bytes
- */
-export const isNot = (set) => Token.takeTill(set, { min: 1 });
-/**
- * @since 0.1.0
- * @category bytes
- */
-export const take = Token.take;
-/**
- * @since 0.1.0
- * @category bytes
- */
-export const takeWhile = (predicate) => Token.takeWhile(predicate);
-/**
- * @since 0.1.0
- * @category bytes
- */
-export const takeWhile1 = (predicate) => Token.takeWhile(predicate, { min: 1 });
-/**
- * @since 0.1.0
- * @category bytes
- */
-export const takeWhileMN = (m, n, predicate) => Token.takeWhile(predicate, { min: m, max: n });
-/**
- * @since 0.1.0
- * @category bytes
- */
-export const takeTill = (predicate) => Token.takeTill(predicate);
-/**
- * @since 0.1.0
- * @category bytes
- */
-export const takeTill1 = (predicate) => Token.takeTill(predicate, { min: 1 });
-/**
- * @since 0.1.0
- * @category bytes
- */
-export const takeUntil = Token.takeUntil;
-/**
- * Recognizes an escaped string (nom's `escaped`).
- *
- * @since 0.1.0
- * @category bytes
- */
-export const escaped = Ascii.takeEscaped;
-/**
- * Unescapes an escaped string (nom's `escaped_transform`).
- *
- * @since 0.1.0
- * @category bytes
- */
-export const escapedTransform = Ascii.escaped;
+import "effect/Option";
+import * as Ascii from "./Ascii.js";
+import * as Binary from "./Binary.js";
+//#region src/Nom.ts
+/**
+* Matches a literal (nom's `tag`).
+*
+* @since 0.1.0
+* @category bytes
+*/
+const tag = Token.literal;
+/**
+* Matches a literal, ignoring ASCII case (nom's `tag_no_case`).
+*
+* @since 0.1.0
+* @category bytes
+*/
+const tagNoCase = Ascii.caseless;
+/**
+* Matches a single character (nom's `char`).
+*
+* @since 0.1.0
+* @category character
+*/
+const char = (c) => Token.literal(c);
+/**
+* Matches any character (nom's `anychar`).
+*
+* @since 0.1.0
+* @category character
+*/
+const anychar = Token.any;
+/**
+* @since 0.1.0
+* @category character
+*/
+const oneOf = Token.oneOf;
+/**
+* @since 0.1.0
+* @category character
+*/
+const noneOf = Token.noneOf;
+/**
+* @since 0.1.0
+* @category character
+*/
+const satisfy = Token.satisfy;
+/**
+* The longest non-empty run of tokens from a set (nom's `is_a`).
+*
+* @since 0.1.0
+* @category bytes
+*/
+const isA = (set) => Token.takeWhile(set, { min: 1 });
+/**
+* The longest non-empty run of tokens *not* from a set (nom's `is_not`).
+*
+* @since 0.1.0
+* @category bytes
+*/
+const isNot = (set) => Token.takeTill(set, { min: 1 });
+/**
+* @since 0.1.0
+* @category bytes
+*/
+const take = Token.take;
+/**
+* @since 0.1.0
+* @category bytes
+*/
+const takeWhile = (predicate) => Token.takeWhile(predicate);
+/**
+* @since 0.1.0
+* @category bytes
+*/
+const takeWhile1 = (predicate) => Token.takeWhile(predicate, { min: 1 });
+/**
+* @since 0.1.0
+* @category bytes
+*/
+const takeWhileMN = (m, n, predicate) => Token.takeWhile(predicate, {
+	min: m,
+	max: n
+});
+/**
+* @since 0.1.0
+* @category bytes
+*/
+const takeTill = (predicate) => Token.takeTill(predicate);
+/**
+* @since 0.1.0
+* @category bytes
+*/
+const takeTill1 = (predicate) => Token.takeTill(predicate, { min: 1 });
+/**
+* @since 0.1.0
+* @category bytes
+*/
+const takeUntil = Token.takeUntil;
+/**
+* Recognizes an escaped string (nom's `escaped`).
+*
+* @since 0.1.0
+* @category bytes
+*/
+const escaped = Ascii.takeEscaped;
+/**
+* Unescapes an escaped string (nom's `escaped_transform`).
+*
+* @since 0.1.0
+* @category bytes
+*/
+const escapedTransform = Ascii.escaped;
 /** @since 0.1.0 @category character */
-export const alpha0 = Ascii.alpha0;
+const alpha0 = Ascii.alpha0;
 /** @since 0.1.0 @category character */
-export const alpha1 = Ascii.alpha1;
+const alpha1 = Ascii.alpha1;
 /** @since 0.1.0 @category character */
-export const digit0 = Ascii.digit0;
+const digit0 = Ascii.digit0;
 /** @since 0.1.0 @category character */
-export const digit1 = Ascii.digit1;
+const digit1 = Ascii.digit1;
 /** @since 0.1.0 @category character */
-export const hexDigit0 = Ascii.hexDigit0;
+const hexDigit0 = Ascii.hexDigit0;
 /** @since 0.1.0 @category character */
-export const hexDigit1 = Ascii.hexDigit1;
+const hexDigit1 = Ascii.hexDigit1;
 /** @since 0.1.0 @category character */
-export const octDigit0 = Ascii.octDigit0;
+const octDigit0 = Ascii.octDigit0;
 /** @since 0.1.0 @category character */
-export const octDigit1 = Ascii.octDigit1;
+const octDigit1 = Ascii.octDigit1;
 /** @since 0.1.0 @category character */
-export const alphanumeric0 = Ascii.alphanumeric0;
+const alphanumeric0 = Ascii.alphanumeric0;
 /** @since 0.1.0 @category character */
-export const alphanumeric1 = Ascii.alphanumeric1;
+const alphanumeric1 = Ascii.alphanumeric1;
 /** @since 0.1.0 @category character */
-export const space0 = Ascii.space0;
+const space0 = Ascii.space0;
 /** @since 0.1.0 @category character */
-export const space1 = Ascii.space1;
+const space1 = Ascii.space1;
 /** @since 0.1.0 @category character */
-export const multispace0 = Ascii.multispace0;
+const multispace0 = Ascii.multispace0;
 /** @since 0.1.0 @category character */
-export const multispace1 = Ascii.multispace1;
+const multispace1 = Ascii.multispace1;
 /** @since 0.1.0 @category character */
-export const lineEnding = Ascii.lineEnding;
+const lineEnding = Ascii.lineEnding;
 /** @since 0.1.0 @category character */
-export const newline = Ascii.newline;
+const newline = Ascii.newline;
 /** @since 0.1.0 @category character */
-export const tab = Ascii.tab;
+const tab = Ascii.tab;
 /** @since 0.1.0 @category character */
-export const crlf = Ascii.crlf;
-/**
- * nom's `not_line_ending`.
- *
- * @since 0.1.0
- * @category character
- */
-export const notLineEnding = Ascii.tillLineEnding;
-/**
- * A decimal unsigned integer (nom's `character::complete::u64` and friends).
- *
- * @since 0.1.0
- * @category character
- */
-export const u64 = Ascii.decUint;
-/**
- * A decimal signed integer (nom's `character::complete::i64` and friends).
- *
- * @since 0.1.0
- * @category character
- */
-export const i64 = Ascii.decInt;
-// -----------------------------------------------------------------------------
-// number
-// -----------------------------------------------------------------------------
-/**
- * nom's `double` (and `float`).
- *
- * @since 0.1.0
- * @category number
- */
-export const double = Ascii.float;
-/**
- * nom's `recognize_float`.
- *
- * @since 0.1.0
- * @category number
- */
-export const recognizeFloat = P.taken(Ascii.float);
-/**
- * nom's `hex_u32`.
- *
- * @since 0.1.0
- * @category number
- */
-export const hexU32 = Ascii.hexUint;
+const crlf = Ascii.crlf;
+/**
+* nom's `not_line_ending`.
+*
+* @since 0.1.0
+* @category character
+*/
+const notLineEnding = Ascii.tillLineEnding;
+/**
+* A decimal unsigned integer (nom's `character::complete::u64` and friends).
+*
+* @since 0.1.0
+* @category character
+*/
+const u64 = Ascii.decUint;
+/**
+* A decimal signed integer (nom's `character::complete::i64` and friends).
+*
+* @since 0.1.0
+* @category character
+*/
+const i64 = Ascii.decInt;
+/**
+* nom's `double` (and `float`).
+*
+* @since 0.1.0
+* @category number
+*/
+const double = Ascii.float;
+/**
+* nom's `recognize_float`.
+*
+* @since 0.1.0
+* @category number
+*/
+const recognizeFloat = /*#__PURE__*/ P.taken(Ascii.float);
+/**
+* nom's `hex_u32`.
+*
+* @since 0.1.0
+* @category number
+*/
+const hexU32 = Ascii.hexUint;
 /** @since 0.1.0 @category number */
-export const beU8 = Binary.u8;
+const beU8 = Binary.u8;
 /** @since 0.1.0 @category number */
-export const beI8 = Binary.i8;
+const beI8 = Binary.i8;
 /** @since 0.1.0 @category number */
-export const leU8 = Binary.u8;
+const leU8 = Binary.u8;
 /** @since 0.1.0 @category number */
-export const leI8 = Binary.i8;
+const leI8 = Binary.i8;
 /** @since 0.1.0 @category number */
-export const beU16 = Binary.beU16;
+const beU16 = Binary.beU16;
 /** @since 0.1.0 @category number */
-export const leU16 = Binary.leU16;
+const leU16 = Binary.leU16;
 /** @since 0.1.0 @category number */
-export const beI16 = Binary.beI16;
+const beI16 = Binary.beI16;
 /** @since 0.1.0 @category number */
-export const leI16 = Binary.leI16;
+const leI16 = Binary.leI16;
 /** @since 0.1.0 @category number */
-export const beU24 = Binary.beU24;
+const beU24 = Binary.beU24;
 /** @since 0.1.0 @category number */
-export const leU24 = Binary.leU24;
+const leU24 = Binary.leU24;
 /** @since 0.1.0 @category number */
-export const beI24 = Binary.beI24;
+const beI24 = Binary.beI24;
 /** @since 0.1.0 @category number */
-export const leI24 = Binary.leI24;
+const leI24 = Binary.leI24;
 /** @since 0.1.0 @category number */
-export const beU32 = Binary.beU32;
+const beU32 = Binary.beU32;
 /** @since 0.1.0 @category number */
-export const leU32 = Binary.leU32;
+const leU32 = Binary.leU32;
 /** @since 0.1.0 @category number */
-export const beI32 = Binary.beI32;
+const beI32 = Binary.beI32;
 /** @since 0.1.0 @category number */
-export const leI32 = Binary.leI32;
+const leI32 = Binary.leI32;
 /** @since 0.1.0 @category number */
-export const beU64 = Binary.beU64;
+const beU64 = Binary.beU64;
 /** @since 0.1.0 @category number */
-export const leU64 = Binary.leU64;
+const leU64 = Binary.leU64;
 /** @since 0.1.0 @category number */
-export const beI64 = Binary.beI64;
+const beI64 = Binary.beI64;
 /** @since 0.1.0 @category number */
-export const leI64 = Binary.leI64;
+const leI64 = Binary.leI64;
 /** @since 0.1.0 @category number */
-export const beU128 = Binary.beU128;
+const beU128 = Binary.beU128;
 /** @since 0.1.0 @category number */
-export const leU128 = Binary.leU128;
+const leU128 = Binary.leU128;
 /** @since 0.1.0 @category number */
-export const beI128 = Binary.beI128;
+const beI128 = Binary.beI128;
 /** @since 0.1.0 @category number */
-export const leI128 = Binary.leI128;
+const leI128 = Binary.leI128;
 /** @since 0.1.0 @category number */
-export const beF32 = Binary.beF32;
+const beF32 = Binary.beF32;
 /** @since 0.1.0 @category number */
-export const leF32 = Binary.leF32;
+const leF32 = Binary.leF32;
 /** @since 0.1.0 @category number */
-export const beF64 = Binary.beF64;
+const beF64 = Binary.beF64;
 /** @since 0.1.0 @category number */
-export const leF64 = Binary.leF64;
-// -----------------------------------------------------------------------------
-// multi
-// -----------------------------------------------------------------------------
-/**
- * Zero or more (nom's `many0`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const many0 = (parser) => P.repeat(parser);
-/**
- * One or more (nom's `many1`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const many1 = (parser) => P.repeat(parser, { min: 1 });
-/**
- * Between `m` and `n` times (nom's `many_m_n`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const manyMN = (m, n, parser) => P.repeat(parser, { min: m, max: n });
-/**
- * Exactly `count` times (nom's `count`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const count = (parser, count) => P.repeat(parser, count);
-/**
- * Repeats `parser` until `end` succeeds (nom's `many_till`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const manyTill = (parser, end) => P.repeatTill(parser, end);
-/**
- * Zero or more `parser` separated by `separator` (nom's `separated_list0`;
- * note the separator comes first).
- *
- * @since 0.1.0
- * @category multi
- */
-export const separatedList0 = (separator, parser) => P.separated(parser, separator);
-/**
- * One or more `parser` separated by `separator` (nom's `separated_list1`;
- * note the separator comes first).
- *
- * @since 0.1.0
- * @category multi
- */
-export const separatedList1 = (separator, parser) => P.separated(parser, separator, { min: 1 });
-/**
- * Folds zero or more (nom's `fold_many0`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const foldMany0 = (parser, init, f) => P.fold(parser, { init, f });
-/**
- * Folds one or more (nom's `fold_many1`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const foldMany1 = (parser, init, f) => P.fold(parser, { init, f, range: { min: 1 } });
-/**
- * Folds between `m` and `n` times (nom's `fold_many_m_n`).
- *
- * @since 0.1.0
- * @category multi
- */
-export const foldManyMN = (m, n, parser, init, f) => P.fold(parser, { init, f, range: { min: m, max: n } });
-/**
- * nom's `length_data`.
- *
- * @since 0.1.0
- * @category multi
- */
-export const lengthData = Binary.lengthTake;
-/**
- * nom's `length_value`.
- *
- * @since 0.1.0
- * @category multi
- */
-export const lengthValue = Binary.lengthAndThen;
-/**
- * nom's `length_count`.
- *
- * @since 0.1.0
- * @category multi
- */
-export const lengthCount = Binary.lengthRepeat;
-// -----------------------------------------------------------------------------
-// sequence / branch
-// -----------------------------------------------------------------------------
-/**
- * nom's `pair`.
- *
- * @since 0.1.0
- * @category sequence
- */
-export const pair = (first, second) => P.zip(first, second);
-/**
- * nom's tuples of parsers (`(a, b, c)`, formerly `tuple`).
- *
- * @since 0.1.0
- * @category sequence
- */
-export const tuple = P.seq;
+const leF64 = Binary.leF64;
+/**
+* Zero or more (nom's `many0`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const many0 = (parser) => P.repeat(parser);
+/**
+* One or more (nom's `many1`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const many1 = (parser) => P.repeat(parser, { min: 1 });
+/**
+* Between `m` and `n` times (nom's `many_m_n`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const manyMN = (m, n, parser) => P.repeat(parser, {
+	min: m,
+	max: n
+});
+/**
+* Exactly `count` times (nom's `count`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const count = (parser, count) => P.repeat(parser, count);
+/**
+* Repeats `parser` until `end` succeeds (nom's `many_till`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const manyTill = (parser, end) => P.repeatTill(parser, end);
+/**
+* Zero or more `parser` separated by `separator` (nom's `separated_list0`;
+* note the separator comes first).
+*
+* @since 0.1.0
+* @category multi
+*/
+const separatedList0 = (separator, parser) => P.separated(parser, separator);
+/**
+* One or more `parser` separated by `separator` (nom's `separated_list1`;
+* note the separator comes first).
+*
+* @since 0.1.0
+* @category multi
+*/
+const separatedList1 = (separator, parser) => P.separated(parser, separator, { min: 1 });
+/**
+* Folds zero or more (nom's `fold_many0`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const foldMany0 = (parser, init, f) => P.fold(parser, {
+	init,
+	f
+});
+/**
+* Folds one or more (nom's `fold_many1`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const foldMany1 = (parser, init, f) => P.fold(parser, {
+	init,
+	f,
+	range: { min: 1 }
+});
+/**
+* Folds between `m` and `n` times (nom's `fold_many_m_n`).
+*
+* @since 0.1.0
+* @category multi
+*/
+const foldManyMN = (m, n, parser, init, f) => P.fold(parser, {
+	init,
+	f,
+	range: {
+		min: m,
+		max: n
+	}
+});
+/**
+* nom's `length_data`.
+*
+* @since 0.1.0
+* @category multi
+*/
+const lengthData = Binary.lengthTake;
+/**
+* nom's `length_value`.
+*
+* @since 0.1.0
+* @category multi
+*/
+const lengthValue = Binary.lengthAndThen;
+/**
+* nom's `length_count`.
+*
+* @since 0.1.0
+* @category multi
+*/
+const lengthCount = Binary.lengthRepeat;
+/**
+* nom's `pair`.
+*
+* @since 0.1.0
+* @category sequence
+*/
+const pair = (first, second) => P.zip(first, second);
+/**
+* nom's tuples of parsers (`(a, b, c)`, formerly `tuple`).
+*
+* @since 0.1.0
+* @category sequence
+*/
+const tuple = P.seq;
 /** @since 0.1.0 @category sequence */
-export const preceded = P.preceded;
+const preceded = P.preceded;
 /** @since 0.1.0 @category sequence */
-export const terminated = P.terminated;
+const terminated = P.terminated;
 /** @since 0.1.0 @category sequence */
-export const delimited = P.delimited;
+const delimited = P.delimited;
 /** @since 0.1.0 @category sequence */
-export const separatedPair = P.separatedPair;
+const separatedPair = P.separatedPair;
 /** @since 0.1.0 @category branch */
-export const alt = P.alt;
+const alt = P.alt;
 /** @since 0.1.0 @category branch */
-export const permutation = P.permutation;
-// -----------------------------------------------------------------------------
-// combinator
-// -----------------------------------------------------------------------------
-/**
- * nom's `map`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const map = (parser, f) => P.map(parser, f);
-/**
- * nom's `map_res`: the function returns a `Result`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const mapRes = (parser, f) => P.tryMap(parser, f);
-/**
- * nom's `map_opt`: the function returns an `Option`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const mapOpt = (parser, f) => P.filterMap(parser, f);
-/**
- * nom's `map_parser`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const mapParser = (parser, applied) => P.mapParser(parser, applied);
-/**
- * nom's `flat_map`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const flatMap = (parser, f) => P.flatMap(parser, f);
-/**
- * nom's `value` (note the value comes first).
- *
- * @since 0.1.0
- * @category combinator
- */
-export const value = (val, parser) => P.as(parser, val);
-/**
- * nom's `verify`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const verify = (parser, predicate) => P.filter(parser, predicate);
-/**
- * nom's `recognize`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const recognize = P.taken;
-/**
- * nom's `consumed`: returns `[consumed, output]`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const consumed = (parser) => P.map(P.withTaken(parser), ([a, s]) => [s, a]);
+const permutation = P.permutation;
+/**
+* nom's `map`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const map = (parser, f) => P.map(parser, f);
+/**
+* nom's `map_res`: the function returns a `Result`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const mapRes = (parser, f) => P.tryMap(parser, f);
+/**
+* nom's `map_opt`: the function returns an `Option`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const mapOpt = (parser, f) => P.filterMap(parser, f);
+/**
+* nom's `map_parser`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const mapParser = (parser, applied) => P.mapParser(parser, applied);
+/**
+* nom's `flat_map`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const flatMap = (parser, f) => P.flatMap(parser, f);
+/**
+* nom's `value` (note the value comes first).
+*
+* @since 0.1.0
+* @category combinator
+*/
+const value = (val, parser) => P.as(parser, val);
+/**
+* nom's `verify`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const verify = (parser, predicate) => P.filter(parser, predicate);
+/**
+* nom's `recognize`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const recognize = P.taken;
+/**
+* nom's `consumed`: returns `[consumed, output]`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const consumed = (parser) => P.map(P.withTaken(parser), ([a, s]) => [s, a]);
 /** @since 0.1.0 @category combinator */
-export const opt = P.opt;
+const opt = P.opt;
 /** @since 0.1.0 @category combinator */
-export const cond = P.cond;
+const cond = P.cond;
 /** @since 0.1.0 @category combinator */
-export const peek = P.peek;
+const peek = P.peek;
 /** @since 0.1.0 @category combinator */
-export const not = P.not;
+const not = P.not;
 /** @since 0.1.0 @category combinator */
-export const eof = P.eof;
+const eof = P.eof;
 /** @since 0.1.0 @category combinator */
-export const allConsuming = P.allConsuming;
+const allConsuming = P.allConsuming;
 /** @since 0.1.0 @category combinator */
-export const complete = P.complete;
+const complete = P.complete;
 /** @since 0.1.0 @category combinator */
-export const cut = P.cut;
+const cut = P.cut;
 /** @since 0.1.0 @category combinator */
-export const success = P.succeed;
-/**
- * nom's `fail()`.
- *
- * @since 0.1.0
- * @category combinator
- */
-export const fail = P.reject;
+const success = P.succeed;
+/**
+* nom's `fail()`.
+*
+* @since 0.1.0
+* @category combinator
+*/
+const fail = P.reject;
 /** @since 0.1.0 @category combinator */
-export const rest = Token.rest;
+const rest = Token.rest;
 /** @since 0.1.0 @category combinator */
-export const restLen = Token.restLen;
-/**
- * nom's `context` (note the label comes first).
- *
- * @since 0.1.0
- * @category error
- */
-export const context = (label, parser) => P.context(parser, label);
+const restLen = Token.restLen;
+/**
+* nom's `context` (note the label comes first).
+*
+* @since 0.1.0
+* @category error
+*/
+const context = (label, parser) => P.context(parser, label);
+//#endregion
+export { allConsuming, alpha0, alpha1, alphanumeric0, alphanumeric1, alt, anychar, beF32, beF64, beI128, beI16, beI24, beI32, beI64, beI8, beU128, beU16, beU24, beU32, beU64, beU8, char, complete, cond, consumed, context, count, crlf, cut, delimited, digit0, digit1, double, eof, escaped, escapedTransform, fail, flatMap, foldMany0, foldMany1, foldManyMN, hexDigit0, hexDigit1, hexU32, i64, isA, isNot, leF32, leF64, leI128, leI16, leI24, leI32, leI64, leI8, leU128, leU16, leU24, leU32, leU64, leU8, lengthCount, lengthData, lengthValue, lineEnding, many0, many1, manyMN, manyTill, map, mapOpt, mapParser, mapRes, multispace0, multispace1, newline, noneOf, not, notLineEnding, octDigit0, octDigit1, oneOf, opt, pair, peek, permutation, preceded, recognize, recognizeFloat, rest, restLen, satisfy, separatedList0, separatedList1, separatedPair, space0, space1, success, tab, tag, tagNoCase, take, takeTill, takeTill1, takeUntil, takeWhile, takeWhile1, takeWhileMN, terminated, tuple, u64, value, verify };
+
 //# sourceMappingURL=Nom.js.map