DocParser

abstract def apply(v1: Document): ParseResult[A]

final def !=(arg0: Any): Boolean

final def ##(): Int

def <~[B](p: DocParser[B]): DocParser[A]

final def ==(arg0: Any): Boolean

def >>[B](f: (A) ⇒ DocParser[B]): DocParser[B]

def andThen[A](g: (ParseResult[A]) ⇒ A): (Document) ⇒ A

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B](otherwise: String)(f: PartialFunction[A, B]): DocParser[B]

def compose[A](g: (A) ⇒ Document): (A) ⇒ ParseResult[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatMap[B](f: (A) ⇒ DocParser[B]): DocParser[B]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[B](f: (A) ⇒ B): DocParser[B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def opt: DocParser[Option[A]]

def parse: (Document) ⇒ A

optimistic parsing, e.g.

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

def toString(): String

def unapply(doc: Document): Option[A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def |[B >: A](p: DocParser[B]): DocParser[B]

def ~[B](p: DocParser[B]): DocParser[~[A, B]]

def ~>[B](p: DocParser[B]): DocParser[B]