Object/Class

ceedubs.irrec.regex

Regex

Related Docs: class Regex | package regex

Permalink

object Regex extends Serializable

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Regex
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. final case class AndThen[-In, +M, I, Out](l: Regex[In, M, (I) ⇒ Out], r: Regex[In, M, I]) extends Regex[In, M, Out] with Product with Serializable

    Permalink
  2. abstract class Elem[-In, +M, Out] extends Regex[In, M, Out]

    Permalink
  3. final case class FMap[-In, +M, I, Out](r: Regex[In, M, I], f: (I) ⇒ Out) extends Regex[In, M, Out] with Product with Serializable

    Permalink
  4. final case class Fail[A]() extends Regex[Any, Nothing, A] with Product with Serializable

    Permalink
  5. final case class MapFilter[-In, +M, I, Out](r: Regex[In, M, I], f: (I) ⇒ Option[Out]) extends Regex[In, M, Out] with Product with Serializable

    Permalink
  6. final case class Or[-In, +M, Out](alternatives: NonEmptyList[Regex[In, M, Out]]) extends Regex[In, M, Out] with Product with Serializable

    Permalink
  7. final case class Repeat[-In, +M, I, Out](r: Regex[In, M, I], quantifier: Quantifier, z: Out, fold: (Out, I) ⇒ Out) extends Regex[In, M, Out] with Product with Serializable

    Permalink
  8. final case class Star[-In, +M, I, Out](r: Regex[In, M, I], greediness: Greediness, z: Out, fold: (Out, I) ⇒ Out) extends Regex[In, M, Out] with Product with Serializable

    Permalink
  9. final case class Void[-In, +M, I](r: Regex[In, M, I]) extends Regex[In, M, Unit] with Product with Serializable

    Permalink

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. object Elem extends Serializable

    Permalink
  5. object Eps extends Regex[Any, Nothing, Unit] with Product with Serializable

    Permalink
  6. implicit def alternativeRegex[In, M]: Alternative[[γ$1$]Regex[In, M, γ$1$]]

    Permalink
  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def assignThreadIds[In, M, A](re: Regex[In, M, A]): Regex[In, (ThreadId, M), A]

    Permalink
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def compile[In, M, Out](r: Regex[In, M, Out]): ParseState[In, Out]

    Permalink
  11. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. def fold[In, M, Out, R](eps: (Is[Unit, Out]) ⇒ R, fail: () ⇒ R, elem: (M, (In) ⇒ Option[Out]) ⇒ R, andThen: ~>[[i](Regex[In, M, (i) ⇒ Out], Regex[In, M, i]), [a]R], star: ~>[[i](Regex[In, M, i], Greediness, Out, (Out, i) ⇒ Out), [a]R], repeat: ~>[[i](Regex[In, M, i], Quantifier, Out, (Out, i) ⇒ Out), [a]R], mapped: ~>[[a](Regex[In, M, a], (a) ⇒ Out), [a]R], mapFilter: ~>[[a](Regex[In, M, a], (a) ⇒ Option[Out]), [a]R], or: (NonEmptyList[Regex[In, M, Out]]) ⇒ R, void: (Is[Unit, Out]) ⇒ ~>[[γ$0$]Regex[In, M, γ$0$], [a]R])(r: Regex[In, M, Out]): R

    Permalink
  15. implicit def functorFilterRegex[In, M]: FunctorFilter[[γ$3$]Regex[In, M, γ$3$]]

    Permalink
  16. final def getClass(): Class[_]

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

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

    Permalink
    Definition Classes
    Any
  19. def matcher[F[_], In, M, Out](r: Regex[In, M, Out])(implicit arg0: Foldable[F]): (F[In]) ⇒ Boolean

    Permalink
  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. implicit def nonCapturingRegexKleene[In, M]: Rig[Regex[In, M, Unit]]

    Permalink

    At the moment this is just a Rig, but a Kleene algebra type class may be introduced in the future.

  22. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  24. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  25. implicit def toRegexCOps[Out](r: Regex[Char, Match[Char], Out]): RegexCOps[Out]

    Permalink
  26. implicit def toRegexOps[In, M, Out](r: Regex[In, M, Out]): RegexOps[In, M, Out]

    Permalink
  27. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  28. def transformRecursive[In, M](f: ~>[[γ$12$]Regex[In, M, γ$12$], [γ$13$]Regex[In, M, γ$13$]]): ~>[[γ$14$]Regex[In, M, γ$14$], [γ$15$]Regex[In, M, γ$15$]]

    Permalink
  29. def traverseM[F[_], In, M, M2, Out](re: Regex[In, M, Out])(f: (M) ⇒ F[M2])(implicit F: Applicative[F]): F[Regex[In, M2, Out]]

    Permalink
  30. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped