object combinator extends Combinator
- Alphabetic
- By Inheritance
- combinator
- Combinator
- Combinator0
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
advance(n: Int): Parser[Unit]
- Definition Classes
- Combinator0
-
def
andThen[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[(A, B)]
- Definition Classes
- Combinator0
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
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
-
def
choice[F[_], A](fpa: F[Parser[A]])(implicit arg0: Foldable[F]): Parser[A]
- Definition Classes
- Combinator
- Annotations
- @SuppressWarnings()
-
def
choice[A](xs: Parser[A]*): Parser[A]
- Definition Classes
- Combinator
- Annotations
- @SuppressWarnings()
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
collect[A, B](m: Parser[A], f: PartialFunction[A, B]): Parser[B]
- Definition Classes
- Combinator
-
def
cons[A, B >: A](m: Parser[A], n: ⇒ Parser[List[B]]): Parser[NonEmptyList[B]]
- Definition Classes
- Combinator
-
def
count[A](n: Int, p: Parser[A]): Parser[List[A]]
- Definition Classes
- Combinator
-
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
-
def
demandInput: Parser[Unit]
- Definition Classes
- Combinator0
-
def
discardLeft[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[B]
- Definition Classes
- Combinator0
-
def
discardRight[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[A]
- Definition Classes
- Combinator0
-
def
either[A, B](m: Parser[A], b: ⇒ Parser[B]): Parser[Either[A, B]]
- Definition Classes
- Combinator0
-
def
endOfChunk: Parser[Boolean]
- Definition Classes
- Combinator0
-
val
endOfInput: Parser[Unit]
Parser that matches end of input.
Parser that matches end of input.
- Definition Classes
- Combinator0
-
def
ensure(n: Int): Parser[String]
- Definition Classes
- Combinator0
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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
-
def
filter[A](m: Parser[A])(p: (A) ⇒ Boolean): Parser[A]
- Definition Classes
- Combinator
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
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
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
many[A](p: ⇒ Parser[A]): Parser[List[A]]
Parser that matches zero or more
p
.Parser that matches zero or more
p
.- Definition Classes
- Combinator
-
def
many1[A](p: ⇒ Parser[A]): Parser[NonEmptyList[A]]
Parser that matches one or more
p
.Parser that matches one or more
p
.- Definition Classes
- Combinator
-
def
manyN[A](n: Int, a: Parser[A]): Parser[List[A]]
- Definition Classes
- Combinator
-
def
manyUntil[A](p: Parser[A], q: Parser[_]): Parser[List[A]]
- Definition Classes
- Combinator
-
def
modifyName[A](m: Parser[A], f: (String) ⇒ String): Parser[A]
- Definition Classes
- Combinator0
-
def
named[A](m: Parser[A], s: ⇒ String): Parser[A]
- Definition Classes
- Combinator0
-
def
namedOpaque[A](m: Parser[A], s: ⇒ String): Parser[A]
- Definition Classes
- Combinator0
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
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
- Annotations
- @SuppressWarnings()
-
def
opt[A](m: Parser[A]): Parser[Option[A]]
- Definition Classes
- Combinator
-
def
orElse[A, B >: A](m: Parser[A], b: ⇒ Parser[B]): Parser[B]
- Definition Classes
- Combinator0
-
def
pairBy[A, B](a: Parser[A], delim: Parser[_], b: Parser[B]): Parser[(A, B)]
- Definition Classes
- Combinator
-
def
phrase[A](p: Parser[A]): Parser[A]
Parser that matches
p
only if there is no remaining inputParser that matches
p
only if there is no remaining input- Definition Classes
- Combinator
-
val
pos: Parser[Int]
- Definition Classes
- Combinator0
-
def
sepBy[A](p: Parser[A], s: Parser[_]): Parser[List[A]]
- Definition Classes
- Combinator
-
def
sepBy1[A](p: Parser[A], s: Parser[_]): Parser[NonEmptyList[A]]
- Definition Classes
- Combinator
-
def
skipMany(p: Parser[_]): Parser[Unit]
- Definition Classes
- Combinator
-
def
skipMany1(p: Parser[_]): Parser[Unit]
- Definition Classes
- Combinator
-
def
skipManyN(n: Int, p: Parser[_]): Parser[Unit]
- Definition Classes
- Combinator
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
val
wantInput: Parser[Boolean]
- Definition Classes
- Combinator0