Data.Heap.Binomial
- data (Ord a, Eq a) => BinomialHeap a
- head :: Ord a => BinomialHeap a -> a
- tail :: Ord a => BinomialHeap a -> BinomialHeap a
- merge :: Ord a => BinomialHeap a -> BinomialHeap a -> BinomialHeap a
- singleton :: Ord a => a -> BinomialHeap a
- empty :: Ord a => BinomialHeap a
- null :: Ord a => BinomialHeap a -> Bool
- fromList :: (Ord a, Eq a) => [a] -> BinomialHeap a
- toList :: Ord a => BinomialHeap a -> [a]
- insert :: Ord a => BinomialHeap a -> a -> BinomialHeap a
Documentation
data (Ord a, Eq a) => BinomialHeap a Source
Instances
| Ord a => Eq (BinomialHeap a) | |
| Ord a => Ord (BinomialHeap a) |
head :: Ord a => BinomialHeap a -> aSource
O(lg n)
tail :: Ord a => BinomialHeap a -> BinomialHeap aSource
O(lg n)
merge :: Ord a => BinomialHeap a -> BinomialHeap a -> BinomialHeap aSource
O(lg n).
singleton :: Ord a => a -> BinomialHeap aSource
O(1).
empty :: Ord a => BinomialHeap aSource
null :: Ord a => BinomialHeap a -> BoolSource
fromList :: (Ord a, Eq a) => [a] -> BinomialHeap aSource
O(n)
toList :: Ord a => BinomialHeap a -> [a]Source
O(n lg n)
insert :: Ord a => BinomialHeap a -> a -> BinomialHeap aSource
O(lg n)