| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell98 |
Data.Heap.Binomial
Synopsis
- 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 => a -> BinomialHeap a -> BinomialHeap a
Documentation
data (Ord a, Eq a) => BinomialHeap a Source #
Instances
| Ord a => Eq (BinomialHeap a) Source # | |
Defined in Data.Heap.Binomial Methods (==) :: BinomialHeap a -> BinomialHeap a -> Bool # (/=) :: BinomialHeap a -> BinomialHeap a -> Bool # | |
| Ord a => Ord (BinomialHeap a) Source # | |
Defined in Data.Heap.Binomial Methods compare :: BinomialHeap a -> BinomialHeap a -> Ordering # (<) :: BinomialHeap a -> BinomialHeap a -> Bool # (<=) :: BinomialHeap a -> BinomialHeap a -> Bool # (>) :: BinomialHeap a -> BinomialHeap a -> Bool # (>=) :: BinomialHeap a -> BinomialHeap a -> Bool # max :: BinomialHeap a -> BinomialHeap a -> BinomialHeap a # min :: BinomialHeap a -> BinomialHeap a -> BinomialHeap a # | |
head :: Ord a => BinomialHeap a -> a Source #
O(lg n)
tail :: Ord a => BinomialHeap a -> BinomialHeap a Source #
O(lg n)
merge :: Ord a => BinomialHeap a -> BinomialHeap a -> BinomialHeap a Source #
O(lg n).
singleton :: Ord a => a -> BinomialHeap a Source #
O(1).
empty :: Ord a => BinomialHeap a Source #
toList :: Ord a => BinomialHeap a -> [a] Source #
O(n lg n)
insert :: Ord a => a -> BinomialHeap a -> BinomialHeap a Source #
O(lg n)