object DenseSet
Contains implementation traits for DenseSet and typeconstructor aliases that make usage more pleasant.
Author:
Harshad Deo
- Since
0.1
- Grouped
- Alphabetic
- By Inheritance
- DenseSet
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
Contains[A <: DenseSet, X <: Dense] = DenseSet.Contains.A.Contains[X]
Alias to check if a key is present in the set
Alias to check if a key is present in the set
Author:
Harshad Deo
- Since
0.1
-
class
DenseSetRep
[DS] extends AnyRef
Builds a value level scala.collection.immutable.Set representation of a dense set type
Builds a value level scala.collection.immutable.Set representation of a dense set type
Author:
Harshad Deo
- DS
Type of the dense set for which the representation is being constructed
- Since
0.3.3
-
type
Eq[A <: DenseSet, B <: DenseSet] = Comparison.Match.If[===[DenseSet.Union.Size, DenseSet.Eq.B.Size], False, Bool]
Typeconstructor to check whether two sets have the same elements
Typeconstructor to check whether two sets have the same elements
Author:
Harshad Deo
- Since
0.1
-
type
Include[A <: DenseSet, X <: Dense] = DenseSet.Include.A.Include[X]
Alias to add a key to the set
Alias to add a key to the set
Author:
Harshad Deo
- Since
0.1
-
trait
NonEmptyDenseSet
[V <: Dense, L <: DenseSet, R <: DenseSet] extends DenseSet
Non empty set of dense numbers, implemented as a binary tree
Non empty set of dense numbers, implemented as a binary tree
Author:
Harshad Deo
- V
Type at the node
- L
DenseSet in which all values are less than V
- R
DenseSet in which all values are greater than V
- Since
0.1
-
type
Remove[A <: DenseSet, X <: Dense] = DenseSet.Remove.A.Remove[X]
Alias to remove a key from the set
Alias to remove a key from the set
Author:
Harshad Deo
- Since
0.1
-
type
Union[A <: DenseSet, B <: DenseSet] = DenseSet.Union.A.Union[B]
Alias to build the union of two sets
Alias to build the union of two sets
Author:
Harshad Deo
- Since
0.1
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toSet[DS <: DenseSet](implicit ev: DenseSetRep[DS]): Set[Long]
Method to convert a DenseSet type to a value-level set
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
object
DenseSetRep
Contains implicit definitions to build a DenseSetRep
-
object
EmptyDenseSet
extends DenseSet
Empty set, base case for constructing all dense sets
Empty set, base case for constructing all dense sets
Author:
Harshad Deo
- Since
0.1