'T SkewBinomialHeap (FSharpx.Collections)

'T SkewBinomialHeap Type

Namespace: FSharpx.Collections.Experimental
Assembly: FSharpx.Collections.Experimental.dll
Base Type: obj
All Interfaces: IPriorityQueue<'T> , IHeap<'T SkewBinomialHeap, 'T> , IHeap<'T> , IReadOnlyCollection<'T> , IEnumerable<'T> , IEnumerable , IEquatable<'T SkewBinomialHeap>

A SkewBinomialHeap is a priority queue where elements are inserted in any order, using "insert" and are extracted in either ascending or descending order using "head", "peek", "tail", "pop" or any of their "try" variants. The main advantage of the SkewBinomialHeap over the BinomialHeap is that it supports insertions in constant time O(1). (Based on "Purely Functional Data Structures" - 1996 by Chris Okasaki)

Constructors

Constructor Description

Constructor	Description
`SkewBinomialHeap(descending)` Full Usage: `SkewBinomialHeap(descending)` Parameters: descending : `bool` Returns: `'T SkewBinomialHeap`	descending : `bool` Returns: `'T SkewBinomialHeap`
`SkewBinomialHeap()` Full Usage: `SkewBinomialHeap()` Returns: `'T SkewBinomialHeap`	Returns: `'T SkewBinomialHeap`


                
                  
                    
                      SkewBinomialHeap(descending)

Full Usage: SkewBinomialHeap(descending)

Parameters:

descending : bool

Returns: 'T SkewBinomialHeap

descending : bool

Returns: 'T SkewBinomialHeap


                
                  
                    
                      SkewBinomialHeap()

Full Usage: SkewBinomialHeap()

Returns: 'T SkewBinomialHeap

Returns: 'T SkewBinomialHeap

Instance members

Instance member	Description
`this.Count` Full Usage: `this.Count` Returns: `int`	Returns: `int`
`this.Head()` Full Usage: `this.Head()` Returns: `'T`	Returns: `'T`
`this.Insert(value)` Full Usage: `this.Insert(value)` Parameters: value : `'T` Returns: `'T SkewBinomialHeap`	value : `'T` Returns: `'T SkewBinomialHeap`
`this.IsDescending` Full Usage: `this.IsDescending` Returns: `bool`	Returns: `bool`
`this.IsEmpty` Full Usage: `this.IsEmpty` Returns: `bool`	Returns: `bool`
`this.Merge(other)` Full Usage: `this.Merge(other)` Parameters: other : `'T SkewBinomialHeap` Returns: `'T SkewBinomialHeap`	other : `'T SkewBinomialHeap` Returns: `'T SkewBinomialHeap`
`this.Tail()` Full Usage: `this.Tail()` Returns: `'T SkewBinomialHeap`	Returns: `'T SkewBinomialHeap`
`this.ToList()` Full Usage: `this.ToList()` Returns: `'T list`	Returns: `'T list`
`this.TryHead()` Full Usage: `this.TryHead()` Returns: `'T option`	Returns: `'T option`
`this.TryMerge(other)` Full Usage: `this.TryMerge(other)` Parameters: other : `'T SkewBinomialHeap` Returns: `'T SkewBinomialHeap option`	other : `'T SkewBinomialHeap` Returns: `'T SkewBinomialHeap option`
`this.TryTail()` Full Usage: `this.TryTail()` Returns: `'T SkewBinomialHeap option`	Returns: `'T SkewBinomialHeap option`
`this.TryUncons()` Full Usage: `this.TryUncons()` Returns: `('T * 'T SkewBinomialHeap) option`	Returns: `('T * 'T SkewBinomialHeap) option`
`this.Uncons()` Full Usage: `this.Uncons()` Returns: `'T * 'T SkewBinomialHeap`	Returns: `'T * 'T SkewBinomialHeap`