OrderedSet

Description

sealed class Tinman.Core.Collections.OrderedSet → <T>

A IBag implementation with set semantics that retains the order in which elements have been added.

_3 overloads

public constructor OrderedSet¹ → (1)

capacity ^opt : int32 = 12: [>=0]
The initial capacity of the list set, in elements.

Creates a new instance of OrderedSet.

The equality delegate is SystemUtil.EqualsDefault.
The hash code delegate is SystemUtil.HashCodeDefault.

public constructor OrderedSet² → (2)

equals ⁱⁿ : EqualsDelegate<T>: Optional equality comparer. If null, SystemUtil.EqualsDefault will be used.
capacity ^opt : int32 = 12: [>=0]
The initial capacity of the ordered set, in elements.

Creates a new instance of OrderedSet.

The hash code delegate is SystemUtil.HashCodeDefault.

public constructor OrderedSet³ → (3)

equals ⁱⁿ : EqualsDelegate<T>: Optional equality comparer. If null, SystemUtil.EqualsDefault will be used.
hashCode ⁱⁿ : HashCodeDelegate<T>: Optional hash code delegate. If null, SystemUtil.HashCodeDefault will be used.
capacity ^opt : int32 = 12: [>=0]
The initial capacity of the ordered set, in elements.

Creates a new instance of OrderedSet.