SetTree (FSharpx.Collections)

SetTree Module

Namespace: FSharpx.Collections.Tagged
Assembly: FSharpx.Collections.dll

Types

Type	Description
SetIterator<'T>

Functions and values

Active patterns

Active pattern Description

Active pattern	Description
`SetTree.(\|MatchSetNode\|MatchSetEmpty\|) s` Full Usage: `SetTree.(\|MatchSetNode\|MatchSetEmpty\|) s` Parameters: s : `SetTree<'a>` Returns: `Choice<('a * SetTree<'a> * SetTree<'a>), unit>`	s : `SetTree<'a>` Returns: `Choice<('a * SetTree<'a> * SetTree<'a>), unit>`


                
                  
                    
                      SetTree.(|MatchSetNode|MatchSetEmpty|) s

Full Usage: SetTree.(|MatchSetNode|MatchSetEmpty|) s

Parameters:

s : SetTree<'a>

Returns: Choice<('a * SetTree<'a> * SetTree<'a>), unit>

s : SetTree<'a>

Returns: Choice<('a * SetTree<'a> * SetTree<'a>), unit>

Function or value	Description
`SetTree.SetOne x` Full Usage: `SetTree.SetOne x` Parameters: x : `'a` Returns: `SetTree<'a>`	x : `'a` Returns: `SetTree<'a>`
`SetTree.add comparer k t` Full Usage: `SetTree.add comparer k t` Parameters: comparer : `IComparer<'T>` k : `'T` t : `SetTree<'T>` Returns: `SetTree<'T>`	comparer : `IComparer<'T>` k : `'T` t : `SetTree<'T>` Returns: `SetTree<'T>`
`SetTree.balance comparer t1 k t2` Full Usage: `SetTree.balance comparer t1 k t2` Parameters: comparer : `IComparer<'a>` t1 : `SetTree<'a>` k : `'a` t2 : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` t1 : `SetTree<'a>` k : `'a` t2 : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.choose s` Full Usage: `SetTree.choose s` Parameters: s : `SetTree<'a>` Returns: `'a`	s : `SetTree<'a>` Returns: `'a`
`SetTree.compare comparer s1 s2` Full Usage: `SetTree.compare comparer s1 s2` Parameters: comparer : `IComparer<'a>` s1 : `SetTree<'a>` s2 : `SetTree<'a>` Returns: `int`	comparer : `IComparer<'a>` s1 : `SetTree<'a>` s2 : `SetTree<'a>` Returns: `int`
`SetTree.compareStacks comparer l1 l2` Full Usage: `SetTree.compareStacks comparer l1 l2` Parameters: comparer : `IComparer<'T>` l1 : `SetTree<'T> list` l2 : `SetTree<'T> list` Returns: `int`	comparer : `IComparer<'T>` l1 : `SetTree<'T> list` l2 : `SetTree<'T> list` Returns: `int`
`SetTree.contains comparer k t` Full Usage: `SetTree.contains comparer k t` Parameters: comparer : `IComparer<'T>` k : `'T` t : `SetTree<'T>` Returns: `bool`	comparer : `IComparer<'T>` k : `'T` t : `SetTree<'T>` Returns: `bool`
`SetTree.copyToArray s arr i` Full Usage: `SetTree.copyToArray s arr i` Parameters: s : `SetTree<'a>` arr : `'a[]` i : `int`	s : `SetTree<'a>` arr : `'a[]` i : `int`
`SetTree.count s` Full Usage: `SetTree.count s` Parameters: s : `SetTree<'a>` Returns: `int`	s : `SetTree<'a>` Returns: `int`
`SetTree.countAux s acc` Full Usage: `SetTree.countAux s acc` Parameters: s : `SetTree<'a>` acc : `int` Returns: `int`	s : `SetTree<'a>` acc : `int` Returns: `int`
`SetTree.diff comparer a b` Full Usage: `SetTree.diff comparer a b` Parameters: comparer : `IComparer<'a>` a : `SetTree<'a>` b : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` a : `SetTree<'a>` b : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.diffAux comparer m acc` Full Usage: `SetTree.diffAux comparer m acc` Parameters: comparer : `IComparer<'a>` m : `SetTree<'a>` acc : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` m : `SetTree<'a>` acc : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.elements a` Full Usage: `SetTree.elements a` Parameters: a : `SetTree<'a>` Returns: `'a list`	a : `SetTree<'a>` Returns: `'a list`
`SetTree.elementsAux m acc` Full Usage: `SetTree.elementsAux m acc` Parameters: m : `SetTree<'a>` acc : `'a list` Returns: `'a list`	m : `SetTree<'a>` acc : `'a list` Returns: `'a list`
`SetTree.empty` Full Usage: `SetTree.empty` Returns: `SetTree<'a>`	Returns: `SetTree<'a>`
`SetTree.exists f m` Full Usage: `SetTree.exists f m` Parameters: f : `'a -> bool` m : `SetTree<'a>` Returns: `bool`	f : `'a -> bool` m : `SetTree<'a>` Returns: `bool`
`SetTree.filter comparer f s` Full Usage: `SetTree.filter comparer f s` Parameters: comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.filterAux comparer f s acc` Full Usage: `SetTree.filterAux comparer f s acc` Parameters: comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` acc : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` acc : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.fold f m x` Full Usage: `SetTree.fold f m x` Parameters: f : `'a -> 'b -> 'b` m : `SetTree<'a>` x : `'b` Returns: `'b`	f : `'a -> 'b -> 'b` m : `SetTree<'a>` x : `'b` Returns: `'b`
`SetTree.forAll f m` Full Usage: `SetTree.forAll f m` Parameters: f : `'a -> bool` m : `SetTree<'a>` Returns: `bool`	f : `'a -> bool` m : `SetTree<'a>` Returns: `bool`
`SetTree.height t` Full Usage: `SetTree.height t` Parameters: t : `SetTree<'a>` Returns: `int`	t : `SetTree<'a>` Returns: `int`
`SetTree.intersection comparer a b` Full Usage: `SetTree.intersection comparer a b` Parameters: comparer : `IComparer<'a>` a : `SetTree<'a>` b : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` a : `SetTree<'a>` b : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.intersectionAux comparer b m acc` Full Usage: `SetTree.intersectionAux comparer b m acc` Parameters: comparer : `IComparer<'a>` b : `SetTree<'a>` m : `SetTree<'a>` acc : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` b : `SetTree<'a>` m : `SetTree<'a>` acc : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.isEmpty m` Full Usage: `SetTree.isEmpty m` Parameters: m : `SetTree<'a>` Returns: `bool`	m : `SetTree<'a>` Returns: `bool`
`SetTree.iter f t` Full Usage: `SetTree.iter f t` Parameters: f : `'a -> unit` t : `SetTree<'a>`	f : `'a -> unit` t : `SetTree<'a>`
`SetTree.maximumElement s` Full Usage: `SetTree.maximumElement s` Parameters: s : `SetTree<'a>` Returns: `'a`	s : `SetTree<'a>` Returns: `'a`
`SetTree.maximumElementAux s n` Full Usage: `SetTree.maximumElementAux s n` Parameters: s : `SetTree<'a>` n : `'a` Returns: `'a`	s : `SetTree<'a>` n : `'a` Returns: `'a`
`SetTree.maximumElementOpt s` Full Usage: `SetTree.maximumElementOpt s` Parameters: s : `SetTree<'T>` Returns: `'T option`	s : `SetTree<'T>` Returns: `'T option`
`SetTree.minimumElement s` Full Usage: `SetTree.minimumElement s` Parameters: s : `SetTree<'a>` Returns: `'a`	s : `SetTree<'a>` Returns: `'a`
`SetTree.minimumElementAux s n` Full Usage: `SetTree.minimumElementAux s n` Parameters: s : `SetTree<'a>` n : `'a` Returns: `'a`	s : `SetTree<'a>` n : `'a` Returns: `'a`
`SetTree.minimumElementOpt s` Full Usage: `SetTree.minimumElementOpt s` Parameters: s : `SetTree<'T>` Returns: `'T option`	s : `SetTree<'T>` Returns: `'T option`
`SetTree.mk l hl k r hr` Full Usage: `SetTree.mk l hl k r hr` Parameters: l : `SetTree<'a>` hl : `int` k : `'a` r : `SetTree<'a>` hr : `int` Returns: `SetTree<'a>`	l : `SetTree<'a>` hl : `int` k : `'a` r : `SetTree<'a>` hr : `int` Returns: `SetTree<'a>`
`SetTree.mkFromEnumerator comparer acc e` Full Usage: `SetTree.mkFromEnumerator comparer acc e` Parameters: comparer : `IComparer<'a>` acc : `SetTree<'a>` e : `IEnumerator<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` acc : `SetTree<'a>` e : `IEnumerator<'a>` Returns: `SetTree<'a>`
`SetTree.nextElem comparer k s` Full Usage: `SetTree.nextElem comparer k s` Parameters: comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` Returns: `'T option`	comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` Returns: `'T option`
`SetTree.nextElemCont comparer k s cont` Full Usage: `SetTree.nextElemCont comparer k s cont` Parameters: comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` cont : `'T option -> 'T option` Returns: `'T option`	comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` cont : `'T option -> 'T option` Returns: `'T option`
`SetTree.ofArray comparer l` Full Usage: `SetTree.ofArray comparer l` Parameters: comparer : `IComparer<'a>` l : `'a[]` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` l : `'a[]` Returns: `SetTree<'a>`
`SetTree.ofSeq comparer c` Full Usage: `SetTree.ofSeq comparer c` Parameters: comparer : `IComparer<'a>` c : `IEnumerable<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` c : `IEnumerable<'a>` Returns: `SetTree<'a>`
`SetTree.partition comparer f s` Full Usage: `SetTree.partition comparer f s` Parameters: comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` Returns: `SetTree<'a> * SetTree<'a>`	comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` Returns: `SetTree<'a> * SetTree<'a>`
`SetTree.partition1 comparer f k (acc1, acc2)` Full Usage: `SetTree.partition1 comparer f k (acc1, acc2)` Parameters: comparer : `IComparer<'a>` f : `'a -> bool` k : `'a` acc1 : `SetTree<'a>` acc2 : `SetTree<'a>` Returns: `SetTree<'a> * SetTree<'a>`	comparer : `IComparer<'a>` f : `'a -> bool` k : `'a` acc1 : `SetTree<'a>` acc2 : `SetTree<'a>` Returns: `SetTree<'a> * SetTree<'a>`
`SetTree.partitionAux comparer f s (arg4, arg5)` Full Usage: `SetTree.partitionAux comparer f s (arg4, arg5)` Parameters: comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` arg3 : `SetTree<'a>` arg4 : `SetTree<'a>` Returns: `SetTree<'a> * SetTree<'a>`	comparer : `IComparer<'a>` f : `'a -> bool` s : `SetTree<'a>` arg3 : `SetTree<'a>` arg4 : `SetTree<'a>` Returns: `SetTree<'a> * SetTree<'a>`
`SetTree.prevElem comparer k s` Full Usage: `SetTree.prevElem comparer k s` Parameters: comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` Returns: `'T option`	comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` Returns: `'T option`
`SetTree.prevElemCont comparer k s cont` Full Usage: `SetTree.prevElemCont comparer k s cont` Parameters: comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` cont : `'T option -> 'T option` Returns: `'T option`	comparer : `IComparer<'T>` k : `'T` s : `SetTree<'T>` cont : `'T option -> 'T option` Returns: `'T option`
`SetTree.rebalance t1 k t2` Full Usage: `SetTree.rebalance t1 k t2` Parameters: t1 : `SetTree<'a>` k : `'a` t2 : `SetTree<'a>` Returns: `SetTree<'a>`	t1 : `SetTree<'a>` k : `'a` t2 : `SetTree<'a>` Returns: `SetTree<'a>`
`SetTree.remove comparer k t` Full Usage: `SetTree.remove comparer k t` Parameters: comparer : `IComparer<'T>` k : `'T` t : `SetTree<'T>` Returns: `SetTree<'T>`	comparer : `IComparer<'T>` k : `'T` t : `SetTree<'T>` Returns: `SetTree<'T>`
`SetTree.spliceOutSuccessor t` Full Usage: `SetTree.spliceOutSuccessor t` Parameters: t : `SetTree<'a>` Returns: `'a * SetTree<'a>`	t : `SetTree<'a>` Returns: `'a * SetTree<'a>`
`SetTree.split comparer pivot t` Full Usage: `SetTree.split comparer pivot t` Parameters: comparer : `IComparer<'T>` pivot : `'T` t : `SetTree<'T>` Returns: `SetTree<'T> * bool * SetTree<'T>`	comparer : `IComparer<'T>` pivot : `'T` t : `SetTree<'T>` Returns: `SetTree<'T> * bool * SetTree<'T>`
`SetTree.subset comparer a b` Full Usage: `SetTree.subset comparer a b` Parameters: comparer : `IComparer<'a>` a : `SetTree<'a>` b : `SetTree<'a>` Returns: `bool`	comparer : `IComparer<'a>` a : `SetTree<'a>` b : `SetTree<'a>` Returns: `bool`
`SetTree.toArray s` Full Usage: `SetTree.toArray s` Parameters: s : `SetTree<'a>` Returns: `'a[]`	s : `SetTree<'a>` Returns: `'a[]`
`SetTree.toList s` Full Usage: `SetTree.toList s` Parameters: s : `SetTree<'a>` Returns: `'a list`	s : `SetTree<'a>` Returns: `'a list`
`SetTree.toSeq s` Full Usage: `SetTree.toSeq s` Parameters: s : `SetTree<'a>` Returns: `IEnumerator<'a>`	s : `SetTree<'a>` Returns: `IEnumerator<'a>`
`SetTree.tolerance` Full Usage: `SetTree.tolerance` Returns: `int`	Returns: `int`
`SetTree.union comparer t1 t2` Full Usage: `SetTree.union comparer t1 t2` Parameters: comparer : `IComparer<'a>` t1 : `SetTree<'a>` t2 : `SetTree<'a>` Returns: `SetTree<'a>`	comparer : `IComparer<'a>` t1 : `SetTree<'a>` t2 : `SetTree<'a>` Returns: `SetTree<'a>`