Object

atto.parser

combinator

Related Doc: package parser

Permalink

object combinator extends Combinator

Linear Supertypes
Combinator, Combinator0, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. combinator
  2. Combinator
  3. Combinator0
  4. AnyRef
  5. 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. def advance(n: Int): Parser[Unit]

    Permalink
    Definition Classes
    Combinator0
  5. def andThen[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[(A, B)]

    Permalink
    Definition Classes
    Combinator0
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def attempt[T](p: Parser[T]): Parser[T]

    Permalink

    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
  8. def choice[F[_], A](fpa: F[Parser[A]])(implicit arg0: Foldable[F]): Parser[A]

    Permalink
    Definition Classes
    Combinator
    Annotations
    @SuppressWarnings()
  9. def choice[A](xs: Parser[A]*): Parser[A]

    Permalink
    Definition Classes
    Combinator
    Annotations
    @SuppressWarnings()
  10. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def collect[A, B](m: Parser[A], f: PartialFunction[A, B]): Parser[B]

    Permalink
    Definition Classes
    Combinator
  12. def cons[A, B >: A](m: Parser[A], n: ⇒ Parser[List[B]]): Parser[NonEmptyList[B]]

    Permalink
    Definition Classes
    Combinator
  13. def count[A](n: Int, p: Parser[A]): Parser[List[A]]

    Permalink
    Definition Classes
    Combinator
  14. def delay[A](p: ⇒ Parser[A]): Parser[A]

    Permalink

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

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

    Definition Classes
    Combinator0
  15. def demandInput: Parser[Unit]

    Permalink
    Definition Classes
    Combinator0
  16. def discardLeft[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[B]

    Permalink
    Definition Classes
    Combinator0
  17. def discardRight[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[A]

    Permalink
    Definition Classes
    Combinator0
  18. def either[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[Either[A, B]]

    Permalink
    Definition Classes
    Combinator0
  19. def endOfChunk: Parser[Boolean]

    Permalink
    Definition Classes
    Combinator0
  20. val endOfInput: Parser[Unit]

    Permalink

    Parser that matches end of input.

    Parser that matches end of input.

    Definition Classes
    Combinator0
  21. def ensure(n: Int): Parser[String]

    Permalink
    Definition Classes
    Combinator0
  22. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  24. def err[A](what: String): Parser[A]

    Permalink

    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
  25. def filter[A](m: Parser[A])(p: (A) ⇒ Boolean): Parser[A]

    Permalink
    Definition Classes
    Combinator
  26. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  27. val get: Parser[String]

    Permalink

    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
  28. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    AnyRef → Any
  30. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  31. def many[A](p: ⇒ Parser[A]): Parser[List[A]]

    Permalink

    Parser that matches zero or more p.

    Parser that matches zero or more p.

    Definition Classes
    Combinator
  32. def many1[A](p: ⇒ Parser[A]): Parser[NonEmptyList[A]]

    Permalink

    Parser that matches one or more p.

    Parser that matches one or more p.

    Definition Classes
    Combinator
  33. def manyN[A](n: Int, a: Parser[A]): Parser[List[A]]

    Permalink
    Definition Classes
    Combinator
  34. def manyUntil[A](p: Parser[A], q: Parser[_]): Parser[List[A]]

    Permalink
    Definition Classes
    Combinator
  35. def modifyName[A](m: Parser[A], f: (String) ⇒ String): Parser[A]

    Permalink
    Definition Classes
    Combinator0
  36. def named[A](m: Parser[A], s: ⇒ String): Parser[A]

    Permalink
    Definition Classes
    Combinator0
  37. def namedOpaque[A](m: Parser[A], s: ⇒ String): Parser[A]

    Permalink
    Definition Classes
    Combinator0
  38. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  39. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  41. def ok[A](a: A): Parser[A]

    Permalink

    Parser that consumes no data and produces the specified value.

    Parser that consumes no data and produces the specified value.

    Definition Classes
    Combinator0
    Annotations
    @SuppressWarnings()
  42. def opt[A](m: Parser[A]): Parser[Option[A]]

    Permalink
    Definition Classes
    Combinator
  43. def orElse[A, B >: A](m: Parser[A], b: ⇒ Parser[B]): Parser[B]

    Permalink
    Definition Classes
    Combinator0
  44. def pairBy[A, B](a: Parser[A], delim: Parser[_], b: Parser[B]): Parser[(A, B)]

    Permalink
    Definition Classes
    Combinator
  45. def phrase[A](p: Parser[A]): Parser[A]

    Permalink

    Parser that matches p only if there is no remaining input

    Parser that matches p only if there is no remaining input

    Definition Classes
    Combinator
  46. val pos: Parser[Int]

    Permalink
    Definition Classes
    Combinator0
  47. def sepBy[A](p: Parser[A], s: Parser[_]): Parser[List[A]]

    Permalink
    Definition Classes
    Combinator
  48. def sepBy1[A](p: Parser[A], s: Parser[_]): Parser[NonEmptyList[A]]

    Permalink
    Definition Classes
    Combinator
  49. def skipMany(p: Parser[_]): Parser[Unit]

    Permalink
    Definition Classes
    Combinator
  50. def skipMany1(p: Parser[_]): Parser[Unit]

    Permalink
    Definition Classes
    Combinator
  51. def skipManyN(n: Int, p: Parser[_]): Parser[Unit]

    Permalink
    Definition Classes
    Combinator
  52. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  53. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  54. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  57. val wantInput: Parser[Boolean]

    Permalink
    Definition Classes
    Combinator0

Inherited from Combinator

Inherited from Combinator0

Inherited from AnyRef

Inherited from Any

Ungrouped