object
Intrinsics
Type Members
-
case class
ElemIn[Elem, Repr](name: String, strings: Seq[Seq[Elem]])(implicit repr: ReprOps[Elem, Repr], ehelper: ElemSetHelper[Elem]) extends ElemSet[Elem, Repr] with Product with Serializable
-
case class
ElemPred[Elem, Repr](name: String, predicate: (Elem) ⇒ Boolean, precompute: Boolean)(implicit helper: ElemSetHelper[Elem], repr: ReprOps[Elem, Repr]) extends ElemSet[Elem, Repr] with Product with Serializable
-
-
case class
ElemsWhile[Elem, Repr](name: String, predicate: (Elem) ⇒ Boolean, min: Int = 1, precompute: Boolean)(implicit helper: ElemSetHelper[Elem], repr: ReprOps[Elem, Repr]) extends PrecomputableParser[Elem, Repr] with WhileParser[Elem, Repr] with Product with Serializable
-
case class
ElemsWhileIn[Elem, Repr](name: String, strings: Seq[Seq[Elem]], min: Int = 1)(implicit helper: ElemSetHelper[Elem], repr: ReprOps[Elem, Repr]) extends PrecomputableParser[Elem, Repr] with WhileParser[Elem, Repr] with Product with Serializable
-
type
GenOrPred[Elem] = Either[Generator[Elem], (Elem) ⇒ Boolean]
-
abstract
class
PrecomputableParser[Elem, Repr] extends Parser[Unit, Elem, Repr]
-
case class
StringIn[Elem, Repr](strings: Repr*)(implicit repr: ReprOps[Elem, Repr], helper: ElemSetHelper[Elem], ordering: Ordering[Elem]) extends StringInBase[Elem, Repr] with Product with Serializable
-
class
StringInBase[Elem, Repr] extends Parser[Unit, Elem, Repr]
-
case class
StringInIgnoreCase[Elem, Repr](strings: Repr*)(implicit repr: ReprOps[Elem, Repr], helper: ElemSetHelper[Elem], ordering: Ordering[Elem]) extends StringInBase[Elem, Repr] with Product with Serializable
-
trait
WhileParser[Elem, Repr] extends Parser[Unit, Elem, Repr]
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
flattenStringsGen[Elem](items: Seq[Seq[Elem]]): Iter[Elem]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
makeGenOrPred[Elem](predicate: (Elem) ⇒ Boolean, precompute: Boolean)(implicit helper: ElemSetHelper[Elem]): GenOrPred[Elem]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
prettyPrintStrings[Elem, Repr](name: String, strings: Seq[Seq[Elem]])(implicit repr: ReprOps[Elem, Repr]): String
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
High-performance intrinsics for parsing common patterns. All of these have equivalent to constructs that can be put together using a combination of "string"s, p1 | p2, and p.rep, but much faster or more convenient.