object
PairMapSpec
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
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
insert_commu_lemma[K, V](m: PList[K, V], p1: Pair[K, V], p2: Pair[K, V]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
merge[K, V](m1: PList[K, V], m2: PList[K, V]): PList[K, V]
-
def
merge_assoc_lemma[K, V](m1: PList[K, V], m2: PList[K, V], m3: PList[K, V]): Boolean
-
def
merge_commu_lemma[K, V](m1: PList[K, V], m2: PList[K, V]): Boolean
-
def
merge_commu_lemma2[K, V](m1: PList[K, V], m2: PList[K, V]): Boolean
-
def
merge_invariant[K, V](m1: PList[K, V], m2: PList[K, V], m3: PList[K, V], m4: PList[K, V]): 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
update_invariant[K, V](m1: PList[K, V], m2: PList[K, V], e: Pair[K, V]): Boolean
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Pair Map A key-value-pair map. Each key corresponds to at most one value in the map. Upon each insertion, the value with the same key, if any, is overwritten by the new value.