combinator

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. 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)]

   

   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

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. 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]

   

   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

7. 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]]

   

   Definition Classes

   Combinators

8. 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]

   

   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

9. 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]

   

   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

10. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

11. 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]]

    

    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

12. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

14. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

15. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

17. 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]

    

    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

18. 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]

    

    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

19. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

20. 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]]

    

    Applies the given parser zero or more times.

    Applies the given parser zero or more times.

    Definition Classes

    Combinators

21. 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]]

    

    Applies the given parser one or more times.

    Applies the given parser one or more times.

    Definition Classes

    Combinators

22. 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]]

    

    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

23. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

24. final def notify(): Unit

    

    Definition Classes

    AnyRef

25. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

26. 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]

    

    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

27. 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]]

    

    Tries to apply parser p.

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

    Definition Classes

    Combinators

28. 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]

    

    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

29. 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]

    

    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

30. final def parserTEmpty[F[_], S, C, P, A](implicit F: Monad[F], P0: Order[P], P1: Show[P]): ParserT[F, S, C, P, A]

    

    Attributes

    protected

    Definition Classes

    Combinators

31. 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]

    

    Attributes

    protected

    Definition Classes

    Combinators

32. 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]

    

    Attributes

    protected

    Definition Classes

    Combinators

33. 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]]

    

    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

34. 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]]

    

    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

35. 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]

    

    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

36. 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]

    

    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

37. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

38. 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]

    

    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

39. def toString(): String

    

    Definition Classes

    AnyRef → Any

40. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

41. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

42. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )