object combinator
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- combinator
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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 allOf[A](values: A*)(implicit arg0: Order[A]): RegexM[A, Chain[A]]
- def allOfF[F[_], A](values: F[A])(implicit arg0: Traverse[F], arg1: Order[A]): RegexM[A, F[A]]
- def allOfFR[F[_], In, M, Out](values: F[Regex[In, M, Out]])(implicit traverseF: Traverse[F]): Regex[In, M, F[Out]]
- def allOfR[In, M, Out](values: Regex[In, M, Out]*): Regex[In, M, Chain[Out]]
- def andThen[In, M, Out1, Out2](rOut: Regex[In, M, (Out1) => Out2], rIn: Regex[In, M, Out1]): Regex[In, M, Out2]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def count[In, M, Out](n: Int, r: Regex[In, M, Out]): Regex[In, M, Chain[Out]]
- def either[In, M, Out1, Out2](l: Regex[In, M, Out1], r: Regex[In, M, Out2]): Regex[In, M, Either[Out1, Out2]]
- def elem[In, M, Out](f: (In) => Option[Out], metadata: M = "elem"): Regex[In, M, Out]
A match on a single input element.
- def empty[In, M]: Regex[In, M, Unit]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def fail[A]: Regex[Any, Nothing, A]
- def few[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, Chain[Out]]
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def inSet[A](allowed: Diet[A])(implicit arg0: Order[A]): RegexM[A, A]
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def lit[A](value: A)(implicit arg0: Order[A]): RegexM[A, A]
alias for literal
- def literal[A](value: A)(implicit arg0: Order[A]): RegexM[A, A]
- def many[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, Chain[Out]]
- def map[In, M, Out, Out2](r: Regex[In, M, Out])(f: (Out) => Out2): Regex[In, M, Out2]
- def mapMatch[In, Out](m: Match[In], f: (In) => Out)(implicit arg0: Order[In]): RegexM[In, Out]
- def matched[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, Chain[In]]
- def matching[A](m: Match[A])(implicit arg0: Order[A]): RegexM[A, A]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def noneOf[A](a1: A, as: A*)(implicit discreteA: Discrete[A], orderA: Order[A]): RegexM[A, A]
- def notInSet[A](forbidden: Diet[A])(implicit arg0: Order[A]): RegexM[A, A]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def oneOf[A](a1: A, as: A*)(implicit arg0: Order[A]): RegexM[A, A]
- def oneOfF[F[_], A](values: F[A])(implicit arg0: Order[A], reducibleF: Reducible[F]): RegexM[A, A]
- def oneOfFR[F[_], In, M, Out](values: F[Regex[In, M, Out]])(implicit reducibleF: Reducible[F]): Regex[In, M, Out]
- def oneOfR[In, M, Out](r1: Regex[In, M, Out], rs: Regex[In, M, Out]*): Regex[In, M, Out]
- def oneOrMore[In, M, Out](r: Regex[In, M, Out], greediness: Greediness): Regex[In, M, NonEmptyChain[Out]]
- def optional[In, M, Out](r: Regex[In, M, Out], greediness: Greediness): Regex[In, M, Option[Out]]
- def or[In, M, Out](l: Regex[In, M, Out], r: Regex[In, M, Out]): Regex[In, M, Out]
- def pred[In, M, Out](f: (In) => Boolean, metadata: M = "pred"): Regex[In, M, In]
A predicate to run on a single input element.
A predicate to run on a single input element.
- f
the predicate - should return true if the element matches and false otherwise
- def quantifyFold[In, M, Out1, Out2](r: Regex[In, M, Out1], q: Quantifier, z: Out2)(fold: (Out2, Out1) => Out2): Regex[In, M, Out2]
- def range[A](l: A, r: A)(implicit arg0: Order[A]): RegexM[A, A]
- def repeat[In, M, Out](r: Regex[In, M, Out], minInclusive: Int, maxInclusive: Option[Int], greediness: Greediness): Regex[In, M, Chain[Out]]
- def seq[A](values: Seq[A])(implicit arg0: Order[A]): RegexM[A, Chain[A]]
- def star[In, M, Out](r: Regex[In, M, Out], g: Greediness): Regex[In, M, Chain[Out]]
- def starFold[In, M, Out1, Out2](r: Regex[In, M, Out1], g: Greediness, z: Out2)(fold: (Out2, Out1) => Out2): Regex[In, M, Out2]
- 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(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def wildcard[A](implicit arg0: Order[A]): RegexM[A, A]
- def withMatched[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, (Chain[In], Out)]