Type Members
-
type
Contains[X <: Dense] = Dense.CompareC.Match[L.Contains[X], True, R.Contains[X], Bool]
-
-
type
FoldL[Init <: Type, Type, F <: Fold[Dense, Type]] = R.FoldL[FoldL.F.Apply[V, L.FoldL[Init, Type, F]], Type, F]
-
-
type
Remove[X <: Dense] = Dense.CompareC.Match[NonEmptyDenseSet[V, L.Remove[X], R], L.Union[R], NonEmptyDenseSet[V, L, R.Remove[X]], DenseSet]
-
type
Size = Dense.Match.Add[R.Size]
-
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
finalize(): Unit
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
Non empty set of dense numbers, implemented as a binary tree
Author:
Harshad Deo
Type at the node
DenseSet in which all values are less than V
DenseSet in which all values are greater than V
0.1