object
ListSetLemmas
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
-
def
cons_distinct_assoc[T](list: List[T], e: T): Boolean
-
def
delete_contains_uniquate[T](list: List[T], e: T): Boolean
-
def
delete_neq_contains[T](list: List[T], x: T, y: T): Boolean
-
def
delete_neq_not_contains[T](list: List[T], x: T, y: T): Boolean
-
def
delete_uniquate_assoc[T](list: List[T], e: T): Boolean
-
def
distinct[T](list: List[T]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
perm_delete_contains[T](l1: List[T], l2: List[T], e: T): Boolean
-
def
permutation_contains[T](l1: List[T], l2: List[T], e: T): Boolean
-
def
permutation_not_contains[T](l1: List[T], l2: List[T], e: T): Boolean
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
uniquate_concat_assoc_perm[T](l1: List[T], l2: List[T], l3: List[T]): Boolean
-
def
uniquate_concat_comm_perm[T](l1: List[T], l2: List[T]): Boolean
-
def
uniquate_concat_perm_l[T](l1: List[T], l2: List[T]): Boolean
-
def
uniquate_concat_perm_r[T](l1: List[T], l2: List[T]): Boolean
-
def
uniquate_cons[T](l: List[T], e: T): Boolean
-
def
uniquate_contains[T](list: List[T], e: T): Boolean
-
def
uniquate_idempotent[T](l: List[T]): Boolean
-
def
uniquate_is_distinct[T](list: List[T]): Boolean
-
def
uniquate_not_contains[T](list: List[T], e: T): Boolean
-
def
uniquate_perm[T](l1: List[T], l2: List[T]): 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