combinator

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def allOf[A](values: A*)(implicit arg0: Order[A]): RegexM[A, Chain[A]]

   

5. def allOfF[F[_], A](values: F[A])(implicit arg0: Traverse[F], arg1: Order[A]): RegexM[A, F[A]]

   

6. def allOfFR[F[_], In, M, Out](values: F[Regex[In, M, Out]])(implicit traverseF: Traverse[F]): Regex[In, M, F[Out]]

   

7. def allOfR[In, M, Out](values: Regex[In, M, Out]*): Regex[In, M, Chain[Out]]

   

8. def andThen[In, M, Out1, Out2](rOut: Regex[In, M, (Out1) ⇒ Out2], rIn: Regex[In, M, Out1]): Regex[In, M, Out2]

   

9. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

10. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

11. def count[In, M, Out](n: Int, r: Regex[In, M, Out]): Regex[In, M, Chain[Out]]

    

12. def either[In, M, Out1, Out2](l: Regex[In, M, Out1], r: Regex[In, M, Out2]): Regex[In, M, Either[Out1, Out2]]

    

13. def elem[In, M, Out](f: (In) ⇒ Option[Out], metadata: M = "elem"): Regex[In, M, Out]

    

    A match on a single input element.

14. def empty[In, M]: Regex[In, M, Unit]

    

15. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

16. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

17. def fail[A]: Regex[Any, Nothing, A]

    

18. def few[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, Chain[Out]]

    

19. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

20. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

21. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

22. def inSet[A](allowed: Diet[A])(implicit arg0: Order[A]): RegexM[A, A]

    

23. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

24. def lit[A](value: A)(implicit arg0: Order[A]): RegexM[A, A]

    

    alias for literal

25. def literal[A](value: A)(implicit arg0: Order[A]): RegexM[A, A]

    

26. def many[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, Chain[Out]]

    

27. def map[In, M, Out, Out2](r: Regex[In, M, Out])(f: (Out) ⇒ Out2): Regex[In, M, Out2]

    

28. def mapMatch[In, Out](m: Match[In], f: (In) ⇒ Out)(implicit arg0: Order[In]): RegexM[In, Out]

    

29. def matched[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, Chain[In]]

    

30. def matching[A](m: Match[A])(implicit arg0: Order[A]): RegexM[A, A]

    

31. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

32. def noneOf[A](a1: A, as: A*)(implicit discreteA: Discrete[A], orderA: Order[A]): RegexM[A, A]

    

33. def notInSet[A](forbidden: Diet[A])(implicit arg0: Order[A]): RegexM[A, A]

    

34. final def notify(): Unit

    

    Definition Classes

    AnyRef

35. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

36. def oneOf[A](a1: A, as: A*)(implicit arg0: Order[A]): RegexM[A, A]

    

37. def oneOfF[F[_], A](values: F[A])(implicit arg0: Order[A], reducibleF: Reducible[F]): RegexM[A, A]

    

38. def oneOfFR[F[_], In, M, Out](values: F[Regex[In, M, Out]])(implicit reducibleF: Reducible[F]): Regex[In, M, Out]

    

39. def oneOfR[In, M, Out](r1: Regex[In, M, Out], rs: Regex[In, M, Out]*): Regex[In, M, Out]

    

40. def oneOrMore[In, M, Out](r: Regex[In, M, Out], greediness: Greediness): Regex[In, M, NonEmptyChain[Out]]

    

41. def optional[In, M, Out](r: Regex[In, M, Out], greediness: Greediness): Regex[In, M, Option[Out]]

    

42. def or[In, M, Out](l: Regex[In, M, Out], r: Regex[In, M, Out]): Regex[In, M, Out]

    

43. 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

44. def quantifyFold[In, M, Out1, Out2](r: Regex[In, M, Out1], q: Quantifier, z: Out2)(fold: (Out2, Out1) ⇒ Out2): Regex[In, M, Out2]

    

45. def range[A](l: A, r: A)(implicit arg0: Order[A]): RegexM[A, A]

    

46. def repeat[In, M, Out](r: Regex[In, M, Out], minInclusive: Int, maxInclusive: Option[Int], greediness: Greediness): Regex[In, M, Chain[Out]]

    

47. def seq[A](values: Seq[A])(implicit arg0: Order[A]): RegexM[A, Chain[A]]

    

48. def star[In, M, Out](r: Regex[In, M, Out], g: Greediness): Regex[In, M, Chain[Out]]

    

49. def starFold[In, M, Out1, Out2](r: Regex[In, M, Out1], g: Greediness, z: Out2)(fold: (Out2, Out1) ⇒ Out2): Regex[In, M, Out2]

    

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

    

    Definition Classes

    AnyRef

51. def toString(): String

    

    Definition Classes

    AnyRef → Any

52. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

54. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

55. def wildcard[A](implicit arg0: Order[A]): RegexM[A, A]

    

56. def withMatched[In, M, Out](r: Regex[In, M, Out]): Regex[In, M, (Chain[In], Out)]