- Preparing search index...
- The search index is not available
Kombo - v3.0.0
- number<A, PROBLEM>(args: {
binary: Result<((n: number) => A), PROBLEM>;
expecting: PROBLEM;
float: Result<((n: number) => A), PROBLEM>;
hex: Result<((n: number) => A), PROBLEM>;
int: Result<((n: number) => A), PROBLEM>;
invalid: PROBLEM;
octal: Result<((n: number) => A), PROBLEM>;
}): Parser.Parser<A, never, PROBLEM>
-
Parameters
-
args: {
binary: Result<((n: number) => A), PROBLEM>;
expecting: PROBLEM;
float: Result<((n: number) => A), PROBLEM>;
hex: Result<((n: number) => A), PROBLEM>;
int: Result<((n: number) => A), PROBLEM>;
invalid: PROBLEM;
octal: Result<((n: number) => A), PROBLEM>;
}
-
binary: Result<((n: number) => A), PROBLEM>
-
expecting: PROBLEM
-
float: Result<((n: number) => A), PROBLEM>
-
hex: Result<((n: number) => A), PROBLEM>
-
int: Result<((n: number) => A), PROBLEM>
-
invalid: PROBLEM
-
octal: Result<((n: number) => A), PROBLEM>
Returns Parser.Parser<A, never, PROBLEM>
Just like Simple.number where you have to handle negation yourself. The only difference is that you provide all the potential problems.
See