fsprojects/FSharpx.Collections


Set<'T, 'ComparerTag>

Namespace: Microsoft.FSharp.Collections.Tagged

Constructors

ConstructorDescription
new(comparer, tree)
Signature: (comparer:IComparer<'T> * tree:SetTree<'T>) -> Set<'T,'ComparerTag>

CompiledName: .ctor

Instance members

Instance memberDescription
Add(x)
Signature: x:'T -> Set<'T,'ComparerTag>
Choose
Signature: 'T

CompiledName: get_Choose

Comparer
Signature: 'ComparerTag

CompiledName: get_Comparer

ComparerUntyped
Signature: IComparer<'T>

CompiledName: get_ComparerUntyped

ComputeHashCode()
Signature: unit -> int
Contains(x)
Signature: x:'T -> bool
Count
Signature: int

CompiledName: get_Count

Exists(f)
Signature: (f:('T -> bool)) -> bool
Filter(f)
Signature: (f:('T -> bool)) -> Set<'T,'ComparerTag>
Fold(f x)
Signature: (f:('T -> '?7422 -> '?7422)) -> x:'?7422 -> '?7422
ForAll(f)
Signature: (f:('T -> bool)) -> bool
IsEmpty
Signature: bool

CompiledName: get_IsEmpty

IsSubsetOf(y)
Signature: y:Set<'T,'ComparerTag> -> bool
IsSupersetOf(y)
Signature: y:Set<'T,'ComparerTag> -> bool
Iterate(x)
Signature: (x:('T -> unit)) -> unit
MaximumElement
Signature: 'T

CompiledName: get_MaximumElement

MinimumElement
Signature: 'T

CompiledName: get_MinimumElement

Partition(f)
Signature: (f:('T -> bool)) -> Set<'T,'ComparerTag> * Set<'T,'ComparerTag>
Remove(x)
Signature: x:'T -> Set<'T,'ComparerTag>
ToArray()
Signature: unit -> 'T []
ToList()
Signature: unit -> 'T list
Tree
Signature: SetTree<'T>

CompiledName: get_Tree

Static members

Static memberDescription
( - )(a, b)
Signature: (a:Set<'T,'ComparerTag> * b:Set<'T,'ComparerTag>) -> Set<'T,'ComparerTag>

CompiledName: op_Subtraction

( + )(a, b)
Signature: (a:Set<'T,'ComparerTag> * b:Set<'T,'ComparerTag>) -> Set<'T,'ComparerTag>

CompiledName: op_Addition

Compare(a, b)
Signature: (a:Set<'T,'ComparerTag> * b:Set<'T,'ComparerTag>) -> int
Create(comparer, l)
Signature: (comparer:'ComparerTag * l:seq<'T>) -> Set<'T,'ComparerTag>
Difference(a, b)
Signature: (a:Set<'T,'ComparerTag> * b:Set<'T,'ComparerTag>) -> Set<'T,'ComparerTag>
Empty(comparer)
Signature: comparer:'ComparerTag -> Set<'T,'ComparerTag>
Equality(a, b)
Signature: (a:Set<'T,'ComparerTag> * b:Set<'T,'ComparerTag>) -> bool
Intersection(a, b)
Signature: (a:Set<'T,'ComparerTag> * b:Set<'T,'ComparerTag>) -> Set<'T,'ComparerTag>
Singleton(comparer, x)
Signature: (comparer:'ComparerTag * x:'T) -> Set<'T,'ComparerTag>
Union(a, b)
Signature: (a:Set<'T,'ComparerTag> * b:Set<'T,'ComparerTag>) -> Set<'T,'ComparerTag>
Fork me on GitHub