trait
PollDict[A, B] extends Key[A, B] with Empty with FilterMap[ReadDict, A, B] with Key[A, B]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply(key: A): B
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
exists$(f: ((A, B)) ⇒ Boolean): Boolean
-
def
filter$(f: ((A, B)) ⇒ Boolean): ReadDict[A, B]
-
def
finalize(): Unit
-
def
find$(f: ((A, B)) ⇒ Boolean): Option[(A, B)]
-
def
forall$(f: ((A, B)) ⇒ Boolean): Boolean
-
def
foreach(f: ((A, B)) ⇒ Unit): Unit
-
def
get(key: A): Option[B]
-
def
get: Map[A, B]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
isDefinedAt$(key: A): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
keys$: Set[A]
-
-
def
nonEmpty$: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
sortBy[C](f: (A, B) ⇒ C)(implicit ordering: Ordering[C]): ReadBuffer[(A, B)]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toBuffer: ReadBuffer[(A, B)]
-
def
toString(): String
-
def
value$(key: A): B
-
def
values$: Iterable[B]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Deprecated Value Members
-
def
toMap: Map[A, B]