CountingHashSet (FSharp.Data.Adaptive)

CountingHashSet Module

Namespace: FSharp.Data.Traceable
Assembly: FSharp.Data.Adaptive.dll

Functional operators for CountingHashSet.

Functions and values

Function or value	Description
`add value set` Full Usage: `add value set` Parameters: value : `'T` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Adds the given value to the set. (one reference) value : `'T` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`
`addAll src` Full Usage: `addAll src` Parameters: src : `CountingHashSet<'T>` Returns: `HashSetDelta<'T>` Modifiers: inline Type parameters: 'T	Same as computeDelta empty src. src : `CountingHashSet<'T>` Returns: `HashSetDelta<'T>`
`alter value f set` Full Usage: `alter value f set` Parameters: value : `'T` f : `int -> int` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Changes the reference-count for the given element. value : `'T` f : `int -> int` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`
`applyDelta set delta` Full Usage: `applyDelta set delta` Parameters: set : `CountingHashSet<'T>` delta : `HashSetDelta<'T>` Returns: `CountingHashSet<'T> * HashSetDelta<'T>` Modifiers: inline Type parameters: 'T	Integrates the given delta into the set, returns a new set and the effective deltas. set : `CountingHashSet<'T>` delta : `HashSetDelta<'T>` Returns: `CountingHashSet<'T> * HashSetDelta<'T>`
`applyDeltaNoRefCount set delta` Full Usage: `applyDeltaNoRefCount set delta` Parameters: set : `CountingHashSet<'T>` delta : `HashSetDelta<'T>` Returns: `CountingHashSet<'T> * HashSetDelta<'T>` Modifiers: inline Type parameters: 'T	Integrates the given delta into the set without ref-counting, returns a new set and the effective deltas. set : `CountingHashSet<'T>` delta : `HashSetDelta<'T>` Returns: `CountingHashSet<'T> * HashSetDelta<'T>`
`choose mapping set` Full Usage: `choose mapping set` Parameters: mapping : `'A -> 'B option` set : `CountingHashSet<'A>` Returns: `CountingHashSet<'B>` Modifiers: inline Type parameters: 'A, 'B	Creates a new set by applying the given function to all elements. mapping : `'A -> 'B option` set : `CountingHashSet<'A>` Returns: `CountingHashSet<'B>`
`collect mapping set` Full Usage: `collect mapping set` Parameters: mapping : `'A -> CountingHashSet<'B>` set : `CountingHashSet<'A>` Returns: `HashMap<'B, int>` Modifiers: inline Type parameters: 'A, 'B	Creates a new set with all elements from all created sets. (respecting ref-counts) mapping : `'A -> CountingHashSet<'B>` set : `CountingHashSet<'A>` Returns: `HashMap<'B, int>`
`computeDelta src dst` Full Usage: `computeDelta src dst` Parameters: src : `CountingHashSet<'T>` dst : `CountingHashSet<'T>` Returns: `HashSetDelta<'T>` Modifiers: inline Type parameters: 'T	Differentiates two sets returning a HashSetDelta. src : `CountingHashSet<'T>` dst : `CountingHashSet<'T>` Returns: `HashSetDelta<'T>`
`contains value set` Full Usage: `contains value set` Parameters: value : `'T` set : `CountingHashSet<'T>` Returns: `bool` Modifiers: inline Type parameters: 'T	Checks whether the given value is contained in the set. value : `'T` set : `CountingHashSet<'T>` Returns: `bool`
`count set` Full Usage: `count set` Parameters: set : `CountingHashSet<'T>` Returns: `int` Modifiers: inline Type parameters: 'T	The number of entries in the set (excluding ref-counts). set : `CountingHashSet<'T>` Returns: `int`
`difference l r` Full Usage: `difference l r` Parameters: l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Computes the set difference for both sets. (l - r) l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`
`empty` Full Usage: `empty` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	The empty set. Returns: `CountingHashSet<'T>`
`exists predicate set` Full Usage: `exists predicate set` Parameters: predicate : `'T -> bool` set : `CountingHashSet<'T>` Returns: `bool` Modifiers: inline Type parameters: 'T	Checks whether an element fulfilling the predicate exists. predicate : `'T -> bool` set : `CountingHashSet<'T>` Returns: `bool`
`filter predicate set` Full Usage: `filter predicate set` Parameters: predicate : `'T -> bool` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Creates a new set filtered by the given predicate. predicate : `'T -> bool` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`
`fold folder seed set` Full Usage: `fold folder seed set` Parameters: folder : `'S -> 'T -> 'S` seed : `'S` set : `CountingHashSet<'T>` Returns: `'S` Modifiers: inline Type parameters: 'S, 'T	Folds over all elements in the set. folder : `'S -> 'T -> 'S` seed : `'S` set : `CountingHashSet<'T>` Returns: `'S`
`forall predicate set` Full Usage: `forall predicate set` Parameters: predicate : `'T -> bool` set : `CountingHashSet<'T>` Returns: `bool` Modifiers: inline Type parameters: 'T	Checks whether all elements fulfill the predicate. predicate : `'T -> bool` set : `CountingHashSet<'T>` Returns: `bool`
`intersect l r` Full Usage: `intersect l r` Parameters: l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Computes the intersection of both sets. l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`
`isEmpty set` Full Usage: `isEmpty set` Parameters: set : `CountingHashSet<'T>` Returns: `bool` Modifiers: inline Type parameters: 'T	Is the set empty? set : `CountingHashSet<'T>` Returns: `bool`
`iter iterator set` Full Usage: `iter iterator set` Parameters: iterator : `'T -> unit` set : `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Iterates over all set elements. (once) iterator : `'T -> unit` set : `CountingHashSet<'T>`
`map mapping set` Full Usage: `map mapping set` Parameters: mapping : `'A -> 'B` set : `CountingHashSet<'A>` Returns: `CountingHashSet<'B>` Modifiers: inline Type parameters: 'A, 'B	Creates a new set by applying the given function to all elements. mapping : `'A -> 'B` set : `CountingHashSet<'A>` Returns: `CountingHashSet<'B>`
`ofArray arr` Full Usage: `ofArray arr` Parameters: arr : `'T[]` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Creates a set holding all the given values. arr : `'T[]` Returns: `CountingHashSet<'T>`
`ofHashMap map` Full Usage: `ofHashMap map` Parameters: map : `HashMap<'T, int>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Creates a set from the given HashMap containing ref-counts. map : `HashMap<'T, int>` Returns: `CountingHashSet<'T>`
`ofHashSet set` Full Usage: `ofHashSet set` Parameters: set : `HashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Creates a set holding all the given values. set : `HashSet<'T>` Returns: `CountingHashSet<'T>`
`ofList list` Full Usage: `ofList list` Parameters: list : `'T list` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Creates a set holding all the given values. list : `'T list` Returns: `CountingHashSet<'T>`
`ofSeq seq` Full Usage: `ofSeq seq` Parameters: seq : `'T seq` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Creates a set holding all the given values. seq : `'T seq` Returns: `CountingHashSet<'T>`
`refcount value set` Full Usage: `refcount value set` Parameters: value : `'T` set : `CountingHashSet<'T>` Returns: `int` Modifiers: inline Type parameters: 'T	Gets the reference-count for the given value (0 if not contained) value : `'T` set : `CountingHashSet<'T>` Returns: `int`
`remove value set` Full Usage: `remove value set` Parameters: value : `'T` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Removes the given value from the set. (one reference) value : `'T` set : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`
`removeAll src` Full Usage: `removeAll src` Parameters: src : `CountingHashSet<'T>` Returns: `HashSetDelta<'T>` Modifiers: inline Type parameters: 'T	Same as computeDelta src empty. src : `CountingHashSet<'T>` Returns: `HashSetDelta<'T>`
`single v` Full Usage: `single v` Parameters: v : `'a` Returns: `CountingHashSet<'a>`	A set holding a single value. v : `'a` Returns: `CountingHashSet<'a>`
`toArray set` Full Usage: `toArray set` Parameters: set : `CountingHashSet<'T>` Returns: `'T[]` Modifiers: inline Type parameters: 'T	An array containing all elements from the set. (once) set : `CountingHashSet<'T>` Returns: `'T[]`
`toHashMap set` Full Usage: `toHashMap set` Parameters: set : `CountingHashSet<'T>` Returns: `HashMap<'T, int>` Modifiers: inline Type parameters: 'T	Creates a HashMap with all the contained values and ref-counts. set : `CountingHashSet<'T>` Returns: `HashMap<'T, int>`
`toHashSet set` Full Usage: `toHashSet set` Parameters: set : `CountingHashSet<'T>` Returns: `HashSet<'T>` Modifiers: inline Type parameters: 'T	A HashSet containing all elements from the set. set : `CountingHashSet<'T>` Returns: `HashSet<'T>`
`toList set` Full Usage: `toList set` Parameters: set : `CountingHashSet<'T>` Returns: `'T list` Modifiers: inline Type parameters: 'T	A list containing all elements from the set. (once) set : `CountingHashSet<'T>` Returns: `'T list`
`toSeq set` Full Usage: `toSeq set` Parameters: set : `CountingHashSet<'T>` Returns: `'T seq` Modifiers: inline Type parameters: 'T	A seq containing all elements from the set. (once) set : `CountingHashSet<'T>` Returns: `'T seq`
`trace` Full Usage: `trace` Returns: `Traceable<CountingHashSet<'T>, HashSetDelta<'T>>` Modifiers: inline Type parameters: 'T	Traceable instance. Returns: `Traceable<CountingHashSet<'T>, HashSetDelta<'T>>`
`traceNoRefCount` Full Usage: `traceNoRefCount` Returns: `Traceable<CountingHashSet<'T>, HashSetDelta<'T>>` Modifiers: inline Type parameters: 'T	Traceable instance without ref-counting. Returns: `Traceable<CountingHashSet<'T>, HashSetDelta<'T>>`
`union l r` Full Usage: `union l r` Parameters: l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Unions the two sets. l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`
`xor l r` Full Usage: `xor l r` Parameters: l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>` Modifiers: inline Type parameters: 'T	Computes the exclusive or for both sets. l : `CountingHashSet<'T>` r : `CountingHashSet<'T>` Returns: `CountingHashSet<'T>`