Safe Haskell	Safe-Inferred
Language	GHC2021

Data.Heap.PairingHeap.Min

Documentation

data MinHeap a Source #

Constructors

MinFork !a [MinHeap a]
MinEmpty

Instances

Instances details

Ord a => Monoid (MinHeap a) Source #
Instance details Defined in Data.Heap.PairingHeap.Min Methods mempty :: MinHeap a # mappend :: MinHeap a -> MinHeap a -> MinHeap a # mconcat :: [MinHeap a] -> MinHeap a #
Ord a => Semigroup (MinHeap a) Source #
Instance details Defined in Data.Heap.PairingHeap.Min Methods (<>) :: MinHeap a -> MinHeap a -> MinHeap a # sconcat :: NonEmpty (MinHeap a) -> MinHeap a # stimes :: Integral b => b -> MinHeap a -> MinHeap a #
Ord a => IsList (MinHeap a) Source #
Instance details Defined in Data.Heap.PairingHeap.Min Associated Types type Item (MinHeap a) # Methods fromList :: [Item (MinHeap a)] -> MinHeap a # fromListN :: Int -> [Item (MinHeap a)] -> MinHeap a # toList :: MinHeap a -> [Item (MinHeap a)] #
(Show a, Ord a) => Show (MinHeap a) Source #
Instance details Defined in Data.Heap.PairingHeap.Min Methods showsPrec :: Int -> MinHeap a -> ShowS # show :: MinHeap a -> String # showList :: [MinHeap a] -> ShowS #
Ord a => Eq (MinHeap a) Source #
Instance details Defined in Data.Heap.PairingHeap.Min Methods (==) :: MinHeap a -> MinHeap a -> Bool # (/=) :: MinHeap a -> MinHeap a -> Bool #
Ord a => Ord (MinHeap a) Source #
Instance details Defined in Data.Heap.PairingHeap.Min Methods compare :: MinHeap a -> MinHeap a -> Ordering # (<) :: MinHeap a -> MinHeap a -> Bool # (<=) :: MinHeap a -> MinHeap a -> Bool # (>) :: MinHeap a -> MinHeap a -> Bool # (>=) :: MinHeap a -> MinHeap a -> Bool # max :: MinHeap a -> MinHeap a -> MinHeap a # min :: MinHeap a -> MinHeap a -> MinHeap a #
type Item (MinHeap a) Source #
Instance details Defined in Data.Heap.PairingHeap.Min type Item (MinHeap a) = a

emptyMinPH :: MinHeap a Source #

singletonMinPH :: a -> MinHeap a Source #

nullMinPH :: MinHeap a -> Bool Source #

insertMinPH :: Ord a => a -> MinHeap a -> MinHeap a Source #

minElemPH :: MinHeap a -> Maybe a Source #

deleteMinPH :: Ord a => MinHeap a -> Maybe (MinHeap a) Source #

deleteFindMinPH :: Ord a => MinHeap a -> Maybe (a, MinHeap a) Source #

mergeMinPH :: Ord a => MinHeap a -> MinHeap a -> MinHeap a Source #

mergePairsMinPH :: Ord a => [MinHeap a] -> MinHeap a Source #