Member | Description |
member Add : 'a -> Set<'a> |
A useful shortcut for Set.add. Note this operation prodcues a new set
and does not mutate the original set. The new set will share many storage
nodes with the original. See the Set module for further operations on sets.
|
member Choose : 'a |
Returns the lowest element in the set according to the ordering being used for the set
|
member Contains : 'a -> bool |
A useful shortcut for Set.mem. See the Set module for further operations on sets.
|
member Count : int |
The number of elements in the set
|
override Equals : obj -> bool | |
member Exists : ('a -> bool) -> bool |
Test if any element of the collection satisfies the given predicate.
If the elements are "i0...iN" then computes "p i0 or ... or p iN".
|
member Filter : ('a -> bool) -> Set<'a> |
Return a new collection containing only the elements of the collection
for which the given predicate returns "true"
|
member Fold : ('a -> 'b -> 'b) -> ('b -> 'b) |
Apply the given accumulating function to all the elements of the set
|
member ForAll : ('a -> bool) -> bool |
Test if all elements of the collection satisfy the given predicate.
If the elements are "i0...iN" and "j0...jN" then computes
"p i0 && ... && p iN".
|
member GetNextElement : 'a -> 'a option |
Returns the least element in the set that is greater than the given key
according to the ordering being used for the set
|
member GetPreviousElement : 'a -> 'a option |
Returns the greatest element in the set that is less than the given key
according to the ordering being used for the set
|
member IsEmpty : bool |
A useful shortcut for Set.is_empty. See the Set module for further operations on sets.
|
member IsSubsetOf : Set<'a> -> bool |
Evaluates to "true" if all elements of the second set are in the first
|
member IsSupersetOf : Set<'a> -> bool |
Evaluates to "true" if all elements of the first set are in the second
|
member Iterate : ('a -> unit) -> unit |
Apply the given function to each binding in the collection
|
member Map : ('a -> 'b) -> Set<'b> |
Return a new collection containing the results of applying the
given function to each element of the input set
|
member MaximumElement : 'a |
Returns the highest element in the set according to the ordering being used for the set
|
member MinimumElement : 'a |
Returns the lowest element in the set according to the ordering being used for the set
|
member Partition : ('a -> bool) -> Set<'a> * Set<'a> |
Build two new sets, one containing the elements for which the given predicate returns 'true',
and the other the remaining elements.
|
member Remove : 'a -> Set<'a> |
A useful shortcut for Set.remove. Note this operation prodcues a new set
and does not mutate the original set. The new set will share many storage
nodes with the original. See the Set module for further operations on sets.
|
member ToArray : unit -> 'a array |
The elements of the set as an array.
|
member ToList : unit -> 'a list |
The elements of the set as a list.
|