final
class
InsertionMap[K, V] extends AnyRef
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
@-(k: K): (Option[V], InsertionMap[K, V])
-
def
^+^(k: K, v: V): InsertionMap[K, V]
-
-
def
apply(k: K): Option[V]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
contains(k: K): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(a: Any): Boolean
-
def
exists(p: (K, V) ⇒ Boolean): Boolean
-
def
filter(p: (V) ⇒ Boolean): InsertionMap[K, V]
-
def
finalize(): Unit
-
def
forall(p: (K, V) ⇒ Boolean): Boolean
-
def
get(k: K): Option[V]
-
final
def
getClass(): Class[_]
-
def
getOr(k: K, v: ⇒ V): V
-
def
hashCode(): Int
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
keySet: Set[K]
-
def
keys: List[K]
-
def
map[W](f: (V) ⇒ W): InsertionMap[K, W]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
size: Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toList: List[(K, V)]
-
def
toMap: Map[K, V]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Returns a list in order of key insertion.
(Since version 7.1) InsertionMap is deprecated