Show / Hide Table of Contents

    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
    Object
    TreeHashSet<V>
    Inherited Members
    Object.ToString()
    Object.Equals(Object)
    Object.Equals(Object, Object)
    Object.ReferenceEquals(Object, Object)
    Object.GetHashCode()
    Object.GetType()
    Object.MemberwiseClone()
    Namespace: Advanced.Algorithms.DataStructures
    Assembly: Advanced.Algorithms.dll
    Syntax
    public class TreeHashSet<V>
        where V : IComparable
    Type Parameters
    Name Description
    V

    Constructors

    TreeHashSet()

    Declaration
    public TreeHashSet()

    Properties

    Count

    Declaration
    public int Count { get; }
    Property Value
    Type Description
    Int32

    Methods

    Add(V)

    Declaration
    public void Add(V value)
    Parameters
    Type Name Description
    V value

    Contains(V)

    Declaration
    public bool Contains(V value)
    Parameters
    Type Name Description
    V value
    Returns
    Type Description
    Boolean

    Remove(V)

    Declaration
    public void Remove(V value)
    Parameters
    Type Name Description
    V value
    Back to top Generated by DocFX