@optique/core 0.3.0-dev.41 → 0.3.0-dev.42
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/parser.d.cts +4 -0
- package/dist/parser.d.ts +4 -0
- package/package.json +1 -1
package/dist/parser.d.cts
CHANGED
|
@@ -661,6 +661,7 @@ declare function or<TA, TB, TC, TD, TE, TF, TG, TH, TI, TJ, TStateA, TStateB, TS
|
|
|
661
661
|
* @param b The second {@link Parser} to try.
|
|
662
662
|
* @returns A {@link Parser} that tries to parse using both parsers
|
|
663
663
|
* and returns the result of the parser that consumed more tokens.
|
|
664
|
+
* @since 0.3.0
|
|
664
665
|
*/
|
|
665
666
|
declare function longestMatch<TA, TB, TStateA, TStateB>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>): Parser<TA | TB, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>]>;
|
|
666
667
|
/**
|
|
@@ -679,6 +680,7 @@ declare function longestMatch<TA, TB, TStateA, TStateB>(a: Parser<TA, TStateA>,
|
|
|
679
680
|
* @param c The third {@link Parser} to try.
|
|
680
681
|
* @returns A {@link Parser} that tries to parse using all parsers
|
|
681
682
|
* and returns the result of the parser that consumed the most tokens.
|
|
683
|
+
* @since 0.3.0
|
|
682
684
|
*/
|
|
683
685
|
declare function longestMatch<TA, TB, TC, TStateA, TStateB, TStateC>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>, c: Parser<TC, TStateC>): Parser<TA | TB | TC, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>] | [2, ParserResult<TStateC>]>;
|
|
684
686
|
/**
|
|
@@ -700,6 +702,7 @@ declare function longestMatch<TA, TB, TC, TStateA, TStateB, TStateC>(a: Parser<T
|
|
|
700
702
|
* @param d The fourth {@link Parser} to try.
|
|
701
703
|
* @returns A {@link Parser} that tries to parse using all parsers
|
|
702
704
|
* and returns the result of the parser that consumed the most tokens.
|
|
705
|
+
* @since 0.3.0
|
|
703
706
|
*/
|
|
704
707
|
declare function longestMatch<TA, TB, TC, TD, TStateA, TStateB, TStateC, TStateD>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>, c: Parser<TC, TStateC>, d: Parser<TD, TStateD>): Parser<TA | TB | TC | TD, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>] | [2, ParserResult<TStateC>] | [3, ParserResult<TStateD>]>;
|
|
705
708
|
/**
|
|
@@ -724,6 +727,7 @@ declare function longestMatch<TA, TB, TC, TD, TStateA, TStateB, TStateC, TStateD
|
|
|
724
727
|
* @param e The fifth {@link Parser} to try.
|
|
725
728
|
* @returns A {@link Parser} that tries to parse using all parsers
|
|
726
729
|
* and returns the result of the parser that consumed the most tokens.
|
|
730
|
+
* @since 0.3.0
|
|
727
731
|
*/
|
|
728
732
|
declare function longestMatch<TA, TB, TC, TD, TE, TStateA, TStateB, TStateC, TStateD, TStateE>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>, c: Parser<TC, TStateC>, d: Parser<TD, TStateD>, e: Parser<TE, TStateE>): Parser<TA | TB | TC | TD | TE, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>] | [2, ParserResult<TStateC>] | [3, ParserResult<TStateD>] | [4, ParserResult<TStateE>]>;
|
|
729
733
|
/**
|
package/dist/parser.d.ts
CHANGED
|
@@ -661,6 +661,7 @@ declare function or<TA, TB, TC, TD, TE, TF, TG, TH, TI, TJ, TStateA, TStateB, TS
|
|
|
661
661
|
* @param b The second {@link Parser} to try.
|
|
662
662
|
* @returns A {@link Parser} that tries to parse using both parsers
|
|
663
663
|
* and returns the result of the parser that consumed more tokens.
|
|
664
|
+
* @since 0.3.0
|
|
664
665
|
*/
|
|
665
666
|
declare function longestMatch<TA, TB, TStateA, TStateB>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>): Parser<TA | TB, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>]>;
|
|
666
667
|
/**
|
|
@@ -679,6 +680,7 @@ declare function longestMatch<TA, TB, TStateA, TStateB>(a: Parser<TA, TStateA>,
|
|
|
679
680
|
* @param c The third {@link Parser} to try.
|
|
680
681
|
* @returns A {@link Parser} that tries to parse using all parsers
|
|
681
682
|
* and returns the result of the parser that consumed the most tokens.
|
|
683
|
+
* @since 0.3.0
|
|
682
684
|
*/
|
|
683
685
|
declare function longestMatch<TA, TB, TC, TStateA, TStateB, TStateC>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>, c: Parser<TC, TStateC>): Parser<TA | TB | TC, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>] | [2, ParserResult<TStateC>]>;
|
|
684
686
|
/**
|
|
@@ -700,6 +702,7 @@ declare function longestMatch<TA, TB, TC, TStateA, TStateB, TStateC>(a: Parser<T
|
|
|
700
702
|
* @param d The fourth {@link Parser} to try.
|
|
701
703
|
* @returns A {@link Parser} that tries to parse using all parsers
|
|
702
704
|
* and returns the result of the parser that consumed the most tokens.
|
|
705
|
+
* @since 0.3.0
|
|
703
706
|
*/
|
|
704
707
|
declare function longestMatch<TA, TB, TC, TD, TStateA, TStateB, TStateC, TStateD>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>, c: Parser<TC, TStateC>, d: Parser<TD, TStateD>): Parser<TA | TB | TC | TD, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>] | [2, ParserResult<TStateC>] | [3, ParserResult<TStateD>]>;
|
|
705
708
|
/**
|
|
@@ -724,6 +727,7 @@ declare function longestMatch<TA, TB, TC, TD, TStateA, TStateB, TStateC, TStateD
|
|
|
724
727
|
* @param e The fifth {@link Parser} to try.
|
|
725
728
|
* @returns A {@link Parser} that tries to parse using all parsers
|
|
726
729
|
* and returns the result of the parser that consumed the most tokens.
|
|
730
|
+
* @since 0.3.0
|
|
727
731
|
*/
|
|
728
732
|
declare function longestMatch<TA, TB, TC, TD, TE, TStateA, TStateB, TStateC, TStateD, TStateE>(a: Parser<TA, TStateA>, b: Parser<TB, TStateB>, c: Parser<TC, TStateC>, d: Parser<TD, TStateD>, e: Parser<TE, TStateE>): Parser<TA | TB | TC | TD | TE, undefined | [0, ParserResult<TStateA>] | [1, ParserResult<TStateB>] | [2, ParserResult<TStateC>] | [3, ParserResult<TStateD>] | [4, ParserResult<TStateE>]>;
|
|
729
733
|
/**
|