abstract
class
Matcher[+A] extends (T) ⇒ MatchResult[A]
Instance Constructors
-
new
Matcher()
Abstract Value Members
-
abstract
def
apply(v1: T): MatchResult[A]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+[B >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
+>[B >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
->[B](y: B): (Matcher[A], B)
-
def
<~[B](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[A]
-
final
def
==(arg0: Any): Boolean
-
def
aggregate[B >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
aggregateResults[B >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
andThen[B](m: ⇒ Matcher[B]): Matcher[B]
-
def
andThen[A](g: (MatchResult[A]) ⇒ A): (T) ⇒ A
-
def
andThenLeft[B](m: ⇒ Matcher[B]): Matcher[A]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compose[A](g: (A) ⇒ T): (A) ⇒ MatchResult[A]
-
def
either[B, C >: A](m2: Matcher[B])(implicit arg0: Monoid[B], arg1: Monoid[C]): Matcher[(C, B)]
-
def
ensuring(cond: (Matcher[A]) ⇒ Boolean, msg: ⇒ Any): Matcher[A]
-
def
ensuring(cond: (Matcher[A]) ⇒ Boolean): Matcher[A]
-
def
ensuring(cond: Boolean, msg: ⇒ Any): Matcher[A]
-
def
ensuring(cond: Boolean): Matcher[A]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
feed[B](m: ⇒ (A) ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
finalize(): Unit
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[B](f: (A) ⇒ B): Matcher[B]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orElse[B >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
orThen[B](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
tupledResultsWith[B, C >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B], arg1: Monoid[C]): Matcher[(C, B)]
-
def
tupledWith[B, C >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B], arg1: Monoid[C]): Matcher[(C, B)]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
|[B >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
|>[B](m: ⇒ Matcher[B])(implicit arg0: Monoid[B]): Matcher[B]
-
def
~[B, C >: A](m: ⇒ Matcher[B])(implicit arg0: Monoid[B], arg1: Monoid[C]): Matcher[(C, B)]
-
-
def
→[B](y: B): (Matcher[A], B)
Shadowed Implicit Value Members
-
def
+(other: String): String
Inherited from Any
Inherited by implicit conversion any2stringadd from
Matcher[A] to any2stringadd[Matcher[A]]
Inherited by implicit conversion StringFormat from
Matcher[A] to StringFormat[Matcher[A]]
Inherited by implicit conversion Ensuring from
Matcher[A] to Ensuring[Matcher[A]]
Inherited by implicit conversion ArrowAssoc from
Matcher[A] to ArrowAssoc[Matcher[A]]
A Matcher is a function or 'combinator' which takes a T and return an Option of tuple of - a transformed T (or the same) - a result of type A s.t Exists Monoid[A] so that results can be combined during the traversal A transformation/traversal has succeeded if the result of the application on the Matcher is not a None