Object

parsecat.parsers

numeric

Related Doc: package parsers

Permalink

object numeric extends NumericParsers

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. numeric
  2. NumericParsers
  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 asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. 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
  9. lazy val bigDecimal: TextParser[BigDecimal]

    Permalink
    Definition Classes
    NumericParsers
  10. lazy val bigInt: TextParser[BigInt]

    Permalink
    Definition Classes
    NumericParsers
  11. 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
  12. lazy val byte: TextParser[Byte]

    Permalink
    Definition Classes
    NumericParsers
  13. final def char(expected: Char): TextParser[Char]

    Permalink

    Parses and returns the specified character.

    Parses and returns the specified character.

    Definition Classes
    CharacterParsers
  14. 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
  15. 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
  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. 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
  18. 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
  19. 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
    CharacterParsers
  20. lazy val digit: TextParser[Char]

    Permalink

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

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

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

    Permalink
    Definition Classes
    NumericParsers
  22. 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
  23. final def eq(arg0: AnyRef): Boolean

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

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

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

    Permalink
    Definition Classes
    NumericParsers
  27. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  28. final def getNextPos(char: Char, pos: TextPosition): TextPosition

    Permalink
    Attributes
    protected
    Definition Classes
    CharacterParsers
  29. final def getNextPos(str: String, pos: TextPosition): TextPosition

    Permalink
    Attributes
    protected
    Definition Classes
    CharacterParsers
  30. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  31. 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
  32. 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
  33. lazy val integer: TextParser[Int]

    Permalink
    Definition Classes
    NumericParsers
  34. final def isInstanceOf[T0]: Boolean

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

    Permalink

    Parses and returns a letter.

    Parses and returns a letter.

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

    Permalink
    Definition Classes
    NumericParsers
  37. lazy val lower: TextParser[Char]

    Permalink

    Parses and returns a lower case letter.

    Parses and returns a lower case letter.

    Definition Classes
    CharacterParsers
  38. 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
  39. 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
  40. 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
  41. final def ne(arg0: AnyRef): Boolean

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

    Permalink

    Parses and returns a newline character.

    Parses and returns a newline character.

    Definition Classes
    CharacterParsers
  43. 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
  44. 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
  45. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  47. 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
  48. 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
  49. 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
  50. 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
  51. 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
  52. 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
  53. final def parseText[A](parser: TextParser[A], text: String): Either[ParseError[TextPosition], A]

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

    Permalink
    Definition Classes
    CharacterParsers
  55. 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
  56. 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
  57. 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
  58. final def regex(r: Regex): TextParser[String]

    Permalink

    The parser which succeeds for a string that matches the given regular expression.

    The parser which succeeds for a string that matches the given regular expression. Returns a string that matched the regular expression.

    Definition Classes
    CharacterParsers
  59. 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
  60. 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
  61. 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
  62. lazy val short: TextParser[Short]

    Permalink
    Definition Classes
    NumericParsers
  63. 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
  64. 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
  65. lazy val space: TextParser[Char]

    Permalink

    Parses and returns a whitespace character.

    Parses and returns a whitespace character.

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

    Permalink

    Skips zero or more whitespace characters.

    Skips zero or more whitespace characters.

    Definition Classes
    CharacterParsers
  67. 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
    CharacterParsers
  68. final def stringify(p: TextParser[List[Char]]): TextParser[String]

    Permalink

    Transforms the given parser which produces a list of characters into the parser which returns a string instance instead.

    Transforms the given parser which produces a list of characters into the parser which returns a string instance instead.

    Definition Classes
    CharacterParsers
  69. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink

    Parses and returns a tab character.

    Parses and returns a tab character.

    Definition Classes
    CharacterParsers
  71. 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
  72. def toString(): String

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

    Permalink

    Parses and returns an upper case letter.

    Parses and returns an upper case letter.

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

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

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

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

Inherited from NumericParsers

Inherited from CharacterParsers

Inherited from Combinators

Inherited from AnyRef

Inherited from Any

Ungrouped