Aardvark.Base


SortedSetExt<'T>

Constructors

ConstructorDescription
new()
Signature: unit -> unit
new(comparer)
Signature: comparer:IComparer<'T> -> unit
new(collection)
Signature: collection:IEnumerable<'T> -> unit
new(collection, comparer)
Signature: (collection:IEnumerable<'T> * comparer:IComparer<'T>) -> unit

Instance members

Instance memberDescription
Add(item)
Signature: item:'T -> bool
Modifiers: abstract

Add the value ITEM to the tree, returns true if added, false if duplicate

Clear()
Signature: unit -> unit
Modifiers: abstract
Comparer
Signature: IComparer<'T>
Contains(item)
Signature: item:'T -> bool
Modifiers: abstract
CopyTo(array)
Signature: (array:'T []) -> unit
CopyTo(array, index)
Signature: (array:'T [] * index:int) -> unit
Modifiers: abstract
CopyTo(array, index, count)
Signature: (array:'T [] * index:int * count:int) -> unit
Count
Signature: int
Modifiers: abstract
ExceptWith(other)
Signature: other:IEnumerable<'T> -> unit
Modifiers: abstract

Transform this set into its complement with the IEnumerable OTHER
NOTE: The caller object is important as ExceptWith uses the
comparator associated with THIS to check equality
Throws ArgumentNullException if OTHER is null

FindNeighbours(...)
Signature: (value:'T * lower:byref<Optional<'T>> * self:byref<Optional<'T>> * upper:byref<Optional<'T>>) -> unit
GetEnumerator()
Signature: unit -> Enumerator<'T>
GetViewBetween(lowerValue, upperValue)
Signature: (lowerValue:'T * upperValue:'T) -> SortedSetExt<'T>
Modifiers: abstract

Returns a subset of this tree ranging from values lBound to uBound Any changes made to the subset reflect in the actual tree

IntersectWith(other)
Signature: other:IEnumerable<'T> -> unit
Modifiers: abstract

Transform this set into its intersection with the IEnumerable OTHER
NOTE: The caller object is important as IntersectionWith uses the
comparator associated with THIS to check equality
Throws ArgumentNullException if OTHER is null

IsProperSubsetOf(other)
Signature: other:IEnumerable<'T> -> bool
Modifiers: abstract

Checks whether this Tree is a proper subset of the IEnumerable other

IsProperSupersetOf(other)
Signature: other:IEnumerable<'T> -> bool
Modifiers: abstract

Checks whether this Tree is a proper super set of the IEnumerable other

IsSubsetOf(other)
Signature: other:IEnumerable<'T> -> bool
Modifiers: abstract

Checks whether this Tree is a subset of the IEnumerable other

IsSupersetOf(other)
Signature: other:IEnumerable<'T> -> bool
Modifiers: abstract

Checks whether this Tree is a super set of the IEnumerable other

Max
Signature: 'T
Min
Signature: 'T
Overlaps(other)
Signature: other:IEnumerable<'T> -> bool
Modifiers: abstract

Checks whether this Tree has any elements in common with IEnumerable other

Remove(item)
Signature: item:'T -> bool
Modifiers: abstract

Remove the T ITEM from this SortedSet. Returns true if successfully removed.

RemoveWhere(match)
Signature: match:Predicate<'T> -> int
Reverse()
Signature: unit -> IEnumerable<'T>
SetEquals(other)
Signature: other:IEnumerable<'T> -> bool
Modifiers: abstract

Checks whether this Tree has all elements in common with IEnumerable other

SymmetricExceptWith(other)
Signature: other:IEnumerable<'T> -> unit
Modifiers: abstract

Transform this set so it contains elements in THIS or OTHER but not both NOTE: The caller object is important as SymmetricExceptWith uses the
comparator associated with THIS to check equality
Throws ArgumentNullException if OTHER is null

TryFindGreater(lowerValue, result)
Signature: (lowerValue:'T * result:byref<'T>) -> bool
TryFindSmaller(upperValue, result)
Signature: (upperValue:'T * result:byref<'T>) -> bool
UnionWith(other)
Signature: other:IEnumerable<'T> -> unit
Modifiers: abstract

Transform this set into its union with the IEnumerable OTHER
Attempts to insert each element and rejects it if it exists.
NOTE: The caller object is important as UnionWith uses the Comparator associated with THIS to check equality
Throws ArgumentNullException if OTHER is null

Fork me on GitHub