rdfp
NestedMapSetMatcher
class
NestedMapSetMatcher[S, K1, K2, V] extends AbstractMatcher[S, (K1, K2, V)]
Instance Constructors
-
new
NestedMapSetMatcher(m: (S) ⇒ Boolean, put: (S) ⇒ Option[(K1, K2, V)], t: (S) ⇒ Option[Set[S]])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
ensuring(cond: Boolean, msg: ⇒ Any): NestedMapSetMatcher[S, K1, K2, V]
-
def
ensuring(cond: Boolean): NestedMapSetMatcher[S, K1, K2, V]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
handle: (S) ⇒ Option[(K1, K2, V)]
-
def
hashCode(): Int
-
def
implOp: ((K1, K2, V)) ⇒ Set[V]
-
final
def
isInstanceOf[T0]: Boolean
-
val
map: Map[K1, Map[K2, Set[V]]]
-
def
matches: (S) ⇒ Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
transform: (S) ⇒ Option[Set[S]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
Inherited from AnyRef
Inherited from Any