Trait

parsecat.parsers

NumericParsers

Related Doc: package parsers

Permalink

trait NumericParsers extends StringParsers

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NumericParsers
  2. StringParsers
  3. CharacterParsers
  4. Combinators
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. lazy val alphaNum: TextParser[Char]

    Permalink

    Parses and returns a letter or digit ('0' - '9').

    Parses and returns a letter or digit ('0' - '9').

    Definition Classes
    CharacterParsers
  5. final def andThen[F[_], S, C, P, A, B](p1: ParserT[F, S, C, P, A], p2: ParserT[F, S, C, P, B])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, (A, B)]

    Permalink

    A parser which returns a tuple of results produced by parsers p1 and p2.

    A parser which returns a tuple of results produced by parsers p1 and p2.

    Definition Classes
    Combinators
  6. lazy val anyChar: TextParser[Char]

    Permalink

    Parses and returns any character.

    Parses and returns any character.

    Definition Classes
    CharacterParsers
  7. final def anyCharTill(end: (Char) ⇒ Boolean): TextParser[CharSequence]

    Permalink

    Parses zero or more characters as long as the given predicate is NOT satisfied.

    Parses zero or more characters as long as the given predicate is NOT satisfied. The first character that satisfies the predicate will interrupt this parser and won't be included into the result.

    Definition Classes
    StringParsers
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. final def between[F[_], S, C, P, A, OP, CL](open: ParserT[F, S, C, P, OP], close: ParserT[F, S, C, P, CL], p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink

    Parses open then applies p followed by close.

    Parses open then applies p followed by close. Returns result of the p parser.

    Definition Classes
    Combinators
  10. lazy val bigDecimal: TextParser[BigDecimal]

    Permalink
  11. lazy val bigInt: TextParser[BigInt]

    Permalink
  12. final def bindCons[F[_], S, C, P, A](p: ParserT[F, S, C, P, A], tail: ⇒ ParserT[F, S, C, P, List[A]])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, List[A]]

    Permalink
    Definition Classes
    Combinators
  13. lazy val byte: TextParser[Byte]

    Permalink
  14. final def char(expected: Char): TextParser[Char]

    Permalink

    Parses and returns the specified character.

    Parses and returns the specified character.

    Definition Classes
    CharacterParsers
  15. final def choice[F[_], S, C, P, A](ps: List[ParserT[F, S, C, P, A]])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink

    Applies the parsers in the given list in order until one of them succeeds.

    Applies the parsers in the given list in order until one of them succeeds. Returns the result of a parser which succeeded.

    Definition Classes
    Combinators
  16. final def choice[F[_], S, C, P, A](ps: ParserT[F, S, C, P, A]*)(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink

    Applies the given parsers in order until one of them succeeds.

    Applies the given parsers in order until one of them succeeds. Returns the result of a parser which succeeded.

    Definition Classes
    Combinators
  17. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. final def count[F[_], S, C, P, A](n: Int, p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, List[A]]

    Permalink

    Applies parser p exactly n times.

    Applies parser p exactly n times. Returns empty list if the n is less than or equals to zero, otherwise returns a list of n values produced by parser p.

    Definition Classes
    Combinators
  19. lazy val crlf: TextParser[Char]

    Permalink

    Parses a '\r' character followed by a newline character.

    Parses a '\r' character followed by a newline character. Returns a newline character.

    Definition Classes
    CharacterParsers
  20. lazy val delimiters: TextParser[Unit]

    Permalink

    Skip zero or more spaces, tabs and end of lines in any combination.

    Skip zero or more spaces, tabs and end of lines in any combination.

    Definition Classes
    StringParsers
  21. lazy val digit: TextParser[Char]

    Permalink

    Parses and returns a digit ('0' - '9').

    Parses and returns a digit ('0' - '9').

    Definition Classes
    CharacterParsers
  22. lazy val double: TextParser[Double]

    Permalink
  23. lazy val eol: TextParser[Char]

    Permalink

    The parser which succeeds if the end of line occurs.

    The parser which succeeds if the end of line occurs. Returns a newline character.

    Definition Classes
    CharacterParsers
  24. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  25. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  26. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  27. lazy val float: TextParser[Float]

    Permalink
  28. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  29. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  30. final def ifThen[F[_], S, C, P, A, B](if: ParserT[F, S, C, P, A], then: ⇒ ParserT[F, S, C, P, B])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, B]

    Permalink

    Applies parser then and returns its result only if the parser if succeeds, otherwise the result of the parser if is returned.

    Applies parser then and returns its result only if the parser if succeeds, otherwise the result of the parser if is returned.

    Definition Classes
    Combinators
  31. final def ifThenElse[F[_], S, C, P, A, B](if: ParserT[F, S, C, P, A], then: ⇒ ParserT[F, S, C, P, B], else: ⇒ ParserT[F, S, C, P, B])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, B]

    Permalink

    Applies parser then and returns its result only if the parser if succeeds, otherwise the result of the parser else is returned.

    Applies parser then and returns its result only if the parser if succeeds, otherwise the result of the parser else is returned.

    Definition Classes
    Combinators
  32. lazy val integer: TextParser[Int]

    Permalink
  33. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  34. lazy val letter: TextParser[Char]

    Permalink

    Parses and returns a letter.

    Parses and returns a letter.

    Definition Classes
    CharacterParsers
  35. lazy val long: TextParser[Long]

    Permalink
  36. lazy val lower: TextParser[Char]

    Permalink

    Parses and returns a lower case letter.

    Parses and returns a lower case letter.

    Definition Classes
    CharacterParsers
  37. final def many[F[_], S, C, P, A](p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, List[A]]

    Permalink

    Applies the given parser zero or more times.

    Applies the given parser zero or more times.

    Definition Classes
    Combinators
  38. final def many1[F[_], S, C, P, A](p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, List[A]]

    Permalink

    Applies the given parser one or more times.

    Applies the given parser one or more times.

    Definition Classes
    Combinators
  39. final def manyTill[F[_], S, C, P, A, E](p: ParserT[F, S, C, P, A], end: ParserT[F, S, C, P, E])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, List[A]]

    Permalink

    Applies parser p zero or more times until parser end succeeds.

    Applies parser p zero or more times until parser end succeeds. Returns the list of values produced by p.

    Definition Classes
    Combinators
  40. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  41. lazy val newline: TextParser[Char]

    Permalink

    Parses and returns a newline character.

    Parses and returns a newline character.

    Definition Classes
    CharacterParsers
  42. final def noneOf(str: List[Char]): TextParser[Char]

    Permalink

    Parses and returns any character that is NOT present in the given list.

    Parses and returns any character that is NOT present in the given list.

    Definition Classes
    CharacterParsers
  43. final def noneOf(str: String): TextParser[Char]

    Permalink

    Parses and returns any character that is NOT present in the given string.

    Parses and returns any character that is NOT present in the given string.

    Definition Classes
    CharacterParsers
  44. final def noneOfMany(str: List[Char]): TextParser[CharSequence]

    Permalink

    Similar to noneOf() but returns zero or more characters.

    Similar to noneOf() but returns zero or more characters.

    Definition Classes
    StringParsers
  45. final def noneOfMany(str: String): TextParser[CharSequence]

    Permalink

    Similar to noneOf() but returns zero or more characters.

    Similar to noneOf() but returns zero or more characters.

    Definition Classes
    StringParsers
  46. final def noneOfMany1(str: List[Char]): TextParser[CharSequence]

    Permalink

    Similar to noneOf() but returns one or more characters.

    Similar to noneOf() but returns one or more characters.

    Definition Classes
    StringParsers
  47. final def noneOfMany1(str: String): TextParser[CharSequence]

    Permalink

    Similar to noneOf() but returns one or more characters.

    Similar to noneOf() but returns one or more characters.

    Definition Classes
    StringParsers
  48. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  49. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  50. final def oneOf(str: List[Char]): TextParser[Char]

    Permalink

    Parses and returns any character that is present in the given list.

    Parses and returns any character that is present in the given list.

    Definition Classes
    CharacterParsers
  51. final def oneOf(str: String): TextParser[Char]

    Permalink

    Parses and returns any character that is present in the given string.

    Parses and returns any character that is present in the given string.

    Definition Classes
    CharacterParsers
  52. final def oneOfMany(str: List[Char]): TextParser[CharSequence]

    Permalink

    Similar to oneOf() but returns zero or more characters.

    Similar to oneOf() but returns zero or more characters.

    Definition Classes
    StringParsers
  53. final def oneOfMany(str: String): TextParser[CharSequence]

    Permalink

    Similar to oneOf() but returns zero or more characters.

    Similar to oneOf() but returns zero or more characters.

    Definition Classes
    StringParsers
  54. final def oneOfMany1(str: List[Char]): TextParser[CharSequence]

    Permalink

    Similar to oneOf() but returns one or more characters.

    Similar to oneOf() but returns one or more characters.

    Definition Classes
    StringParsers
  55. final def oneOfMany1(str: String): TextParser[CharSequence]

    Permalink

    Similar to oneOf() but returns one or more characters.

    Similar to oneOf() but returns one or more characters.

    Definition Classes
    StringParsers
  56. final def option[F[_], S, C, P, A](a: A, p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink

    Tries to apply parser p and returns the value a if the operation was unsuccessful.

    Tries to apply parser p and returns the value a if the operation was unsuccessful.

    Definition Classes
    Combinators
  57. final def optionMaybe[F[_], S, C, P, A](p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, Option[A]]

    Permalink

    Tries to apply parser p.

    Tries to apply parser p. Returns Some containing a result or None if the parsing failed.

    Definition Classes
    Combinators
  58. final def optional[F[_], S, C, P, A](p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, Unit]

    Permalink

    Applies the given parser once and ignores its result regardless of whether it was a success or not.

    Applies the given parser once and ignores its result regardless of whether it was a success or not.

    Definition Classes
    Combinators
  59. final def orElse[F[_], S, C, P, A, B >: A](p1: ParserT[F, S, C, P, A], p2: ⇒ ParserT[F, S, C, P, B])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, B]

    Permalink

    Returns the result produced by the parser p1 if it succeeds, otherwise returns the result of the parser p2 instead.

    Returns the result produced by the parser p1 if it succeeds, otherwise returns the result of the parser p2 instead.

    Definition Classes
    Combinators
  60. final def parseText[A](parser: TextParser[A], text: PagedStream[Char]): Either[ParseError[TextPosition], A]

    Permalink
    Definition Classes
    CharacterParsers
  61. final def parseText[A](parser: TextParser[A], text: PagedStream[Char], info: String): Either[ParseError[TextPosition], A]

    Permalink
    Definition Classes
    CharacterParsers
  62. final def parserTEmpty[F[_], S, C, P, A](implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink
    Attributes
    protected
    Definition Classes
    Combinators
  63. final def parserTFoldR[F[_], S, C, P, A](ps: Seq[ParserT[F, S, C, P, A]])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink
    Attributes
    protected
    Definition Classes
    Combinators
  64. final def parserTPure[F[_], S, C, P, A](a: A)(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink
    Attributes
    protected
    Definition Classes
    Combinators
  65. final def satisfy(p: (Char) ⇒ Boolean): TextParser[Char]

    Permalink

    The parser which succeeds for any character that satisfies the given predicate.

    The parser which succeeds for any character that satisfies the given predicate. Returns the parsed character.

    Definition Classes
    CharacterParsers
  66. def satisfyMany(p: (Char) ⇒ Boolean): TextParser[CharSequence]

    Permalink

    Parses zero or more characters that satisfies the given predicate.

    Parses zero or more characters that satisfies the given predicate. Similar to many() combinator but for chars only. Unlike many which relies on the properties of monadic binding, this parser doesn't introduce an overhead of any sort.

    Definition Classes
    StringParsers
  67. def satisfyMany1(p: (Char) ⇒ Boolean): TextParser[CharSequence]

    Permalink

    Parses one or more characters that satisfies the given predicate.

    Parses one or more characters that satisfies the given predicate. This is similar to many1() combinator but for chars only. Unlike many1 which relies on the properties of monadic binding, this parser doesn't introduce an overhead of any sort.

    Definition Classes
    StringParsers
  68. final def sepBy[F[_], S, C, A, P, B](p: ParserT[F, S, C, P, A], sep: ParserT[F, S, C, P, B])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, List[A]]

    Permalink

    Parses zero or more occurrences of parser p separated by sep.

    Parses zero or more occurrences of parser p separated by sep. Returns a list of values produced by parser p.

    Definition Classes
    Combinators
  69. final def sepBy1[F[_], S, C, A, P, B](p: ParserT[F, S, C, P, A], sep: ParserT[F, S, C, P, B])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, List[A]]

    Permalink

    Parses one or more occurrences of parser p separated by sep.

    Parses one or more occurrences of parser p separated by sep. Returns a list of values produced by parser p.

    Definition Classes
    Combinators
  70. lazy val short: TextParser[Short]

    Permalink
  71. final def skipMany[F[_], S, C, P, A](p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, Unit]

    Permalink

    Applies the given parser zero or more times ignoring its result.

    Applies the given parser zero or more times ignoring its result.

    Definition Classes
    Combinators
  72. final def skipMany1[F[_], S, C, P, A](p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, Unit]

    Permalink

    Applies the given parser one or more times ignoring its result.

    Applies the given parser one or more times ignoring its result.

    Definition Classes
    Combinators
  73. lazy val space: TextParser[Char]

    Permalink

    Parses and returns a whitespace character.

    Parses and returns a whitespace character.

    Definition Classes
    CharacterParsers
  74. lazy val spaces: TextParser[Unit]

    Permalink

    Skips zero or more whitespace characters.

    Skips zero or more whitespace characters.

    Definition Classes
    CharacterParsers
  75. final def string(s: String): TextParser[String]

    Permalink

    The parser which succeeds for a string that equals to the given string.

    The parser which succeeds for a string that equals to the given string. Returns the parsed string.

    Definition Classes
    StringParsers
  76. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  77. lazy val tab: TextParser[Char]

    Permalink

    Parses and returns a tab character.

    Parses and returns a tab character.

    Definition Classes
    CharacterParsers
  78. final def test[F[_], S, C, P, A](p: ParserT[F, S, C, P, A])(implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    Permalink

    Applies the given parser and returns its result while preserving the initial position, input and context.

    Applies the given parser and returns its result while preserving the initial position, input and context.

    Definition Classes
    Combinators
  79. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  80. lazy val upper: TextParser[Char]

    Permalink

    Parses and returns an upper case letter.

    Parses and returns an upper case letter.

    Definition Classes
    CharacterParsers
  81. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  82. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  83. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from StringParsers

Inherited from CharacterParsers

Inherited from Combinators

Inherited from AnyRef

Inherited from Any

Ungrouped