M42.Collections by Daniel Pelsmaeker

<PackageReference Include="M42.Collections" Version="0.6.5056.5071" />


A set that maintains insertion order.
public int Count { get; }

public bool IsEmpty { get; }

public T this[int index] { get; set; }

public OrderedHashSet()

Initializes a new instance of the OrderedHashSet<T> class.

public OrderedHashSet(IEqualityComparer<T> comparer)

Initializes a new instance of the OrderedHashSet<T> class.

public bool Add(T value)

public bool AddOrUpdate(T value)

public void Clear()

public bool Contains(object value)

public void ExceptWith(IEnumerable<T> other)

public T GetMember(object value, out bool isPresent)

public T GetMember(object value)

public int? IndexOf(object value)

public bool Insert(int index, T value)

public void IntersectWith(IEnumerable<T> other)

public bool IsProperSubsetOf(IEnumerable other)

public bool IsProperSupersetOf(IEnumerable other)

public bool IsSubsetOf(IEnumerable other)

public bool IsSupersetOf(IEnumerable other)

public virtual bool IsValidMember(object value)

public bool Overlaps(IEnumerable other)

public bool Remove(object value)

public bool RemoveAt(int index)

public bool SetEquals(IEnumerable other)

public void SymmetricExceptWith(IEnumerable<T> other)

public void UnionWith(IEnumerable<T> other)

public bool Update(T value)