Reference version for use in pattern-matching

Empty collection     = null
Singleton collection = A
More                 = (A, Seq<A>)   -- head and tail

var res = set.Case switch
{

   (var x, var xs) => ...,
   A value         => ...,
   _               => ...
}

Is the set empty

Number of items in the set

Alias of Count

Find the lowest ordered item in the set

Find the highest ordered item in the set

Ctor from an enumerable

Ctor from an enumerable

Ctor that takes an initial (distinct) set of items

Ctor that takes an initial (distinct) set of items

Item at index lens

Lens map

Stream as an enumerable

Add an item to the set

Attempt to add an item to the set. If an item already exists then return the Set as-is.

Add an item to the set. If an item already exists then replace it.

Atomically adds a range of items to the set.

Null is not allowed for a Key

Atomically adds a range of items to the set. If an item already exists, it's ignored.

Null is not allowed for a Key

Atomically adds a range of items to the set. If an item already exists then replace it.

Null is not allowed for a Key

Attempts to find an item in the set.

Retrieve a range of values

Retrieve the value from previous item to specified key

Retrieve the value from exact key, or if not found, the previous item

Retrieve the value from next item to specified key

Retrieve the value from exact key, or if not found, the next item

Returns the elements that are in both this and other

Returns this - other. Only the items in this that are not in other will be returned.

Returns this - other. Only the items in this that are not in other will be returned.

Only items that are in one set or the other will be returned. If an item is in both, it is dropped.

Only items that are in one set or the other will be returned. If an item is in both, it is dropped.

Finds the union of two sets and produces a new set with the results

Clears the set

Get enumerator

Removes an item from the set (if it exists)

Removes a range of items from the set (if they exist)

Impure iteration of the bound value in the structure

Maps the values of this set into a new set of values using the mapper function to tranform the source values.

Map each element of a structure to an action, evaluate these actions from left to right, and collect the results.

Map each element of a structure to an action, evaluate these actions from left to right, and collect the results.

Filters items from the set using the predicate. If the predicate returns True for any item then it remains in the set, otherwise it's dropped.

Check the existence of an item in the set using a predicate.

Note this scans the entire set.

Returns True if the value is in the set

Returns true if both sets contain the same elements

Returns True if 'other' is a proper subset of this set

Returns True if 'other' is a proper superset of this set

Returns True if 'other' is a superset of this set

Returns True if 'other' is a superset of this set

Returns True if other overlaps this set

Copy the items from the set into the specified array

Copy the items from the set into the specified array

Append performs a union of the two sets

Subtract operator - performs a subtract of the two sets

Equality test

Equality override

Get the hash code. Calculated from all items in the set.

The hash-code is cached after the first read.

Format the collection as [a, b, c, ...] The ellipsis is used for collections over 50 items To get a formatted string with all the items, use ToFullString or ToFullArrayString.

Format the collection as a, b, c, ...

Format the collection as [a, b, c, ...]

Creates a new map from a range/slice of this map

Add operator + performs a union of the two sets

Choice operator

Choice operator

Subtract operator - performs a subtract of the two sets

Equality operator

Non-equality operator

Convert to a queryable

Functor map operation

Unwraps the value within the functor, passes it to the map function f provided, and then takes the mapped value and wraps it back up into a new functor.

Functor map operation

Unwraps the value within the functor, passes it to the map function f provided, and then takes the mapped value and wraps it back up into a new functor.

Applicative action: runs the first applicative, ignores the result, and returns the second applicative

Applicative action: runs the first applicative, ignores the result, and returns the second applicative

Applicative functor apply operation

Unwraps the value within the ma applicative-functor, passes it to the unwrapped function(s) within mf, and then takes the resulting value and wraps it back up into a new applicative-functor.

Applicative functor apply operation

Unwraps the value within the ma applicative-functor, passes it to the unwrapped function(s) within mf, and then takes the resulting value and wraps it back up into a new applicative-functor.

True if the set has no elements

Singleton set

Create a new empty set

Create a new set pre-populated with the items in range

Create a new set pre-populated with the items in range

Create a new empty set

Add an item to the set

Attempt to add an item to the set. If an item already exists then return the Set as-is.

Add an item to the set. If an item already exists then replace it.

Atomically adds a range of items to the set.

Null is not allowed for a Key

Atomically adds a range of items to the set. If an item already exists, it's ignored.

Null is not allowed for a Key

Atomically adds a range of items to the set. If an item already exists then replace it.

Null is not allowed for a Key

Attempts to find an item in the set.

Check the existence of an item in the set using a predicate.

Note this scans the entire set.

Returns true if both sets contain the same elements

Get the number of elements in the set

Returns setA - setB. Only the items in setA that are not in setB will be returned.

Finds the union of two sets and produces a new set with the results

Filters items from the set using the predicate. If the predicate returns True for any item then it remains in the set, otherwise it's dropped.

Applies a function 'folder' to each element of the collection, threading an accumulator argument through the computation. The fold function takes the state argument, and applies the function 'folder' to it and the first element of the set. Then, it feeds this result into the function 'folder' along with the second element, and so on. It returns the final result. (Aggregate in LINQ)

Applies a function 'folder' to each element of the collection (from last element to first), threading an aggregate state through the computation. The fold function takes the state argument, and applies the function 'folder' to it and the first element of the set. Then, it feeds this result into the function 'folder' along with the second element, and so on. It returns the final result.

Returns the elements that are in both setA and setB

Returns this - other. Only the items in this that are not in other will be returned.

Only items that are in one set or the other will be returned. If an item is in both, it is dropped.

Maps the values of this set into a new set of values using the mapper function to tranform the source values.

Returns True if the value is in the set

Removes an item from the set (if it exists)

Returns True if setB is a subset of setA

Returns True if setB is a superset of setA

Returns True if setB is a proper subset of setA

Returns True if setB is a proper superset of setA

Returns True if setA overlaps setB

Reference version for use in pattern-matching

Empty collection     = null
Singleton collection = A
More                 = (A, Seq<A>)   -- head and tail

var res = set.Case switch
{

   (var x, var xs) => ...,
   A value         => ...,
   _               => ...
}

Is the set empty

Number of items in the set

Alias of Count

Find the lowest ordered item in the set

Find the highest ordered item in the set

Ctor from an enumerable

Ctor from an enumerable

Ctor that takes an initial (distinct) set of items

Ctor that takes an initial (distinct) set of items

Add an item to the set

Attempt to add an item to the set. If an item already exists then return the Set as-is.

Add an item to the set. If an item already exists then replace it.

Atomically adds a range of items to the set.

Null is not allowed for a Key

Atomically adds a range of items to the set. If an item already exists, it's ignored.

Null is not allowed for a Key

Atomically adds a range of items to the set. If an item already exists then replace it.

Null is not allowed for a Key

Attempts to find an item in the set.

Retrieve the value from previous item to specified key

Retrieve the value from exact key, or if not found, the previous item

Retrieve the value from next item to specified key

Retrieve the value from exact key, or if not found, the next item

Retrieve a range of values

Returns the elements that are in both this and other

Returns this - other. Only the items in this that are not in other will be returned.

Returns this - other. Only the items in this that are not in other will be returned.

Only items that are in one set or the other will be returned. If an item is in both, it is dropped.

Only items that are in one set or the other will be returned. If an item is in both, it is dropped.

Finds the union of two sets and produces a new set with the results

Clears the set

Get enumerator

Removes an item from the set (if it exists)

Applies a function 'folder' to each element of the collection, threading an accumulator argument through the computation. The fold function takes the state argument, and applies the function 'folder' to it and the first element of the set. Then, it feeds this result into the function 'folder' along with the second element, and so on. It returns the final result. (Aggregate in LINQ)

Applies a function 'folder' to each element of the collection (from last element to first), threading an aggregate state through the computation. The fold function takes the state argument, and applies the function 'folder' to it and the first element of the set. Then, it feeds this result into the function 'folder' along with the second element, and so on. It returns the final result.

Impure iteration of the bound values in the structure

Maps the values of this set into a new set of values using the mapper function to tranform the source values.

Maps the values of this set into a new set of values using the mapper function to tranform the source values.

Filters items from the set using the predicate. If the predicate returns True for any item then it remains in the set, otherwise it's dropped.

Check the existence of an item in the set using a predicate.

Note this scans the entire set.

Returns True if the value is in the set

Returns true if both sets contain the same elements

Returns True if 'other' is a proper subset of this set

Returns True if 'other' is a proper superset of this set

Returns True if 'other' is a superset of this set

Returns True if 'other' is a superset of this set

Returns True if other overlaps this set