tarsec 0.4.5 → 0.4.6

package/dist/combinators.d.ts

@@ -7,6 +7,8 @@ import { CaptureParser, GeneralParser, InferManyReturnType, MergedCaptures, Merg
  * { captures: <array of captures> }
  * ```
  *
+ * If you're parsing characters only, prefer `takeWhile` for performance reasons.
+ *
  * @param parser - parser to run
  * @returns - parser that runs the given parser zero to many times,
  * and returns the result as an array
@@ -14,6 +16,7 @@ import { CaptureParser, GeneralParser, InferManyReturnType, MergedCaptures, Merg
 export declare function many<const T extends GeneralParser<any, any>>(parser: T): InferManyReturnType<T>;
 /**
  * Same as `many`, but fails if the parser doesn't match at least once.
+ * If you're parsing characters only, prefer `takeWhile1` for performance reasons.
  *
  * @param parser - parser to run
  * @returns a parser that runs the given parser one to many times,

package/dist/combinators.js

@@ -11,6 +11,8 @@ import { escape } from "./utils.js";
  * { captures: <array of captures> }
  * ```
  *
+ * If you're parsing characters only, prefer `takeWhile` for performance reasons.
+ *
  * @param parser - parser to run
  * @returns - parser that runs the given parser zero to many times,
  * and returns the result as an array
@@ -50,6 +52,7 @@ export function many(parser) {
 }
 /**
  * Same as `many`, but fails if the parser doesn't match at least once.
+ * If you're parsing characters only, prefer `takeWhile1` for performance reasons.
  *
  * @param parser - parser to run
  * @returns a parser that runs the given parser one to many times,

package/dist/parsers.d.ts

@@ -48,6 +48,8 @@ export declare function noneOf(chars: string): Parser<string>;
  */
 export type CharPredicate = (code: number) => boolean;
 /**
+ * A faster version of many/ manyWithJoin for character-class scanning.
+ *
  * Consume the longest prefix of `input` whose characters all satisfy
  * the predicate (or are contained in the given char-class string). Always
  * succeeds; returns "" when nothing matches.

package/dist/parsers.js

@@ -126,6 +126,8 @@ function compileCharPredicate(charsOrPred) {
     return (code) => code < 128 ? ascii[code] === 1 : set.has(code);
 }
 /**
+ * A faster version of many/ manyWithJoin for character-class scanning.
+ *
  * Consume the longest prefix of `input` whose characters all satisfy
  * the predicate (or are contained in the given char-class string). Always
  * succeeds; returns "" when nothing matches.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "tarsec",
-  "version": "0.4.5",
+  "version": "0.4.6",
   "description": "A parser combinator library for TypeScript, inspired by Parsec.",
   "homepage": "https://github.com/egonSchiele/tarsec",
   "scripts": {