Combinator

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. def advance(n: Int): Parser[Unit]

   Definition Classes

   Combinator0

7. def andThen[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[(A, B)]

   Definition Classes

   Combinator0

8. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

9. def attempt[T](p: Parser[T]): Parser[T]

   Attoparsec try, for compatibility reasons.

   Attoparsec try, for compatibility reasons. This is actually a no-op since atto parsers always rewind in case of failure.

   Definition Classes

   Combinator0

10. def choice[F[_], A](fpa: F[Parser[A]])(implicit F: Foldy[F]): Parser[A]

11. def choice[A](xs: Parser[A]*): Parser[A]

12. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. def collect[A, B](m: Parser[A], f: PartialFunction[A, B]): Parser[B]

14. def cons[F[_], A, B >: A](m: Parser[A], n: ⇒ Parser[List[B]])(implicit N: NonEmptyListy[F]): Parser[F[B]]

15. def count[A](n: Int, p: Parser[A]): Parser[List[A]]

16. def delay[A](p: ⇒ Parser[A]): Parser[A]

    Construct the given parser lazily; useful when defining recursive parsers.

    Construct the given parser lazily; useful when defining recursive parsers.

    Definition Classes

    Combinator0

17. def demandInput: Parser[Unit]

    Definition Classes

    Combinator0

18. def discardLeft[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[B]

    Definition Classes

    Combinator0

19. def discardRight[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[A]

    Definition Classes

    Combinator0

20. def either[E[_, _], A, B](m: Parser[A], b: ⇒ Parser[B])(implicit E: Eithery[E]): Parser[E[A, B]]

    Definition Classes

    Combinator0

21. def endOfChunk: Parser[Boolean]

    Definition Classes

    Combinator0

22. val endOfInput: Parser[Unit]

    Parser that matches end of input.

    Parser that matches end of input.

    Definition Classes

    Combinator0

23. def ensure(n: Int): Parser[String]

    Definition Classes

    Combinator0

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

    Definition Classes

    AnyRef

25. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

26. def err[A](what: String): Parser[A]

    Parser that consumes no data and fails with the specified error message.

    Parser that consumes no data and fails with the specified error message.

    Definition Classes

    Combinator0

27. def filter[A](m: Parser[A])(p: (A) ⇒ Boolean): Parser[A]

28. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

29. val get: Parser[String]

    Parser that produces the remaining input (but does not consume it).

    Parser that produces the remaining input (but does not consume it).

    Definition Classes

    Combinator0

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

    Definition Classes

    AnyRef → Any

31. def hashCode(): Int

    Definition Classes

    AnyRef → Any

32. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

33. def many[A](p: ⇒ Parser[A]): Parser[List[A]]

    Parser that matches zero or more p.

34. def many1[F[_], A](p: ⇒ Parser[A])(implicit arg0: NonEmptyListy[F]): Parser[F[A]]

    Parser that matches one or more p.

35. def manyN[A](n: Int, a: Parser[A]): Parser[List[A]]

36. def manyUntil[A](p: Parser[A], q: Parser[_]): Parser[List[A]]

37. def modifyName[A](m: Parser[A], f: (String) ⇒ String): Parser[A]

    Definition Classes

    Combinator0

38. def named[A](m: Parser[A], s: ⇒ String): Parser[A]

    Definition Classes

    Combinator0

39. def namedOpaque[A](m: Parser[A], s: ⇒ String): Parser[A]

    Definition Classes

    Combinator0

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

    Definition Classes

    AnyRef

41. final def notify(): Unit

    Definition Classes

    AnyRef

42. final def notifyAll(): Unit

    Definition Classes

    AnyRef

43. def ok[A](a: A): Parser[A]

    Parser that consumes no data and produces the specified value.

    Parser that consumes no data and produces the specified value.

    Definition Classes

    Combinator0

44. def opt[A](m: Parser[A]): Parser[Option[A]]

45. def orElse[A, B >: A](m: Parser[A], b: ⇒ Parser[B]): Parser[B]

    Definition Classes

    Combinator0

46. def pairBy[A, B](a: Parser[A], delim: Parser[_], b: Parser[B]): Parser[(A, B)]

47. def phrase[A](p: Parser[A]): Parser[A]

    Parser that matches p only if there is no remaining input

48. val pos: Parser[Int]

    Definition Classes

    Combinator0

49. def sepBy[A](p: Parser[A], s: Parser[_]): Parser[List[A]]

50. def sepBy1[F[_], A](p: Parser[A], s: Parser[_])(implicit N: NonEmptyListy[F]): Parser[F[A]]

51. def skipMany(p: Parser[_]): Parser[Unit]

52. def skipMany1(p: Parser[_]): Parser[Unit]

53. def skipManyN(n: Int, p: Parser[_]): Parser[Unit]

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

    Definition Classes

    AnyRef

55. def toString(): String

    Definition Classes

    AnyRef → Any

56. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

59. val wantInput: Parser[Boolean]

    Definition Classes

    Combinator0