TreeStructures-0.0.2: A collection of heaps and search trees
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Heap.Skew

Documentation

data Ord a => SkewHeap a Source #

Instances

Instances details
Ord a => Eq (SkewHeap a) Source # 
Instance details

Defined in Data.Heap.Skew

Methods

(==) :: SkewHeap a -> SkewHeap a -> Bool #

(/=) :: SkewHeap a -> SkewHeap a -> Bool #

Ord a => Ord (SkewHeap a) Source # 
Instance details

Defined in Data.Heap.Skew

Methods

compare :: SkewHeap a -> SkewHeap a -> Ordering #

(<) :: SkewHeap a -> SkewHeap a -> Bool #

(<=) :: SkewHeap a -> SkewHeap a -> Bool #

(>) :: SkewHeap a -> SkewHeap a -> Bool #

(>=) :: SkewHeap a -> SkewHeap a -> Bool #

max :: SkewHeap a -> SkewHeap a -> SkewHeap a #

min :: SkewHeap a -> SkewHeap a -> SkewHeap a #

head :: Ord a => SkewHeap a -> a Source #

tail :: Ord a => SkewHeap a -> SkewHeap a Source #

merge :: Ord a => SkewHeap a -> SkewHeap a -> SkewHeap a Source #

singleton :: Ord a => a -> SkewHeap a Source #

empty :: Ord a => SkewHeap a Source #

null :: Ord a => SkewHeap a -> Bool Source #

fromList :: Ord a => [a] -> SkewHeap a Source #

toList :: Ord a => SkewHeap a -> [a] Source #

insert :: Ord a => a -> SkewHeap a -> SkewHeap a Source #