Class TreeHashSet<V>
A HashSet implementation using balanced binary search tree (log(n) operations in worst case)
This may be better than regular HashSet implementation which can give o(K) in worst case (but O(1) when collisions K is avoided )
Inheritance
TreeHashSet<V>
Assembly: Advanced.Algorithms.dll
Syntax
public class TreeHashSet<V>
where V : IComparable
Type Parameters
Constructors
TreeHashSet()
Declaration
Properties
Count
Declaration
public int Count { get; }
Property Value
Methods
Add(V)
Declaration
Parameters
Type |
Name |
Description |
V |
value |
|
Contains(V)
Declaration
public bool Contains(V value)
Parameters
Type |
Name |
Description |
V |
value |
|
Returns
Remove(V)
Declaration
public void Remove(V value)
Parameters
Type |
Name |
Description |
V |
value |
|