Alias to check if a key is present in the set
Alias to check if a key is present in the set
Harshad Deo
0.1
Typeconstructor to check whether two sets have the same elements
Typeconstructor to check whether two sets have the same elements
Harshad Deo
0.1
Alias to add a key to the set
Alias to add a key to the set
Harshad Deo
0.1
Non empty set of dense numbers, implemented as a binary tree
Non empty set of dense numbers, implemented as a binary tree
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
Alias to remove a key from the set
Alias to remove a key from the set
Harshad Deo
0.1
Alias to build the union of two sets
Alias to build the union of two sets
Harshad Deo
0.1
Empty set, base case for constructing all dense sets
Empty set, base case for constructing all dense sets
Harshad Deo
0.1
Contains implementation traits for DenseSet and typeconstructor aliases that make usage more pleasant.
Author:
Harshad Deo
0.1