Aardvark.Base.Incremental


WeakSet<'a>

represents a set of elements while not introducing a "garbage-collector-edge". This is desirable in scenarios where one needs to enumerate a set of things which shall be allowed to be garbage-collected.

Constructors

ConstructorDescription
new()
Signature: unit -> WeakSet<'a>

Instance members

Instance memberDescription
Add(value)
Signature: value:'a -> bool
Clear()
Signature: unit -> unit
Contains(value)
Signature: value:'a -> bool
CopyTo(arr, index)
Signature: (arr:'a [] * index:int) -> unit
Count
Signature: int
ExceptWith(elements)
Signature: elements:'?8401 -> unit
IntersectWith(other)
Signature: other:seq<'a> -> unit
IsEmpty
Signature: bool
IsProperSubsetOf(other)
Signature: other:seq<'a> -> bool
IsProperSupersetOf(other)
Signature: other:seq<'a> -> bool
IsSubsetOf(other)
Signature: other:seq<'a> -> bool
IsSupersetOf(other)
Signature: other:seq<'a> -> bool
Overlaps(other)
Signature: other:seq<'a> -> bool
Remove(value)
Signature: value:'a -> bool
SetEquals(other)
Signature: other:seq<'a> -> bool
SymmetricExceptWith(other)
Signature: other:seq<'a> -> unit
ToWeakArray()
Signature: unit -> Weak<'a> []
UnionWith(elements)
Signature: elements:'?8398 -> unit
Fork me on GitHub