Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Heap.Class

Synopsis

class Heap f where
- empty :: Ord a => f a
- null :: Ord a => f a -> Bool
- insert :: Ord a => a -> f a -> f a
- merge :: Ord a => f a -> f a -> f a
- findMin :: Ord a => f a -> Maybe a
- deleteMin :: Ord a => f a -> Maybe (f a)
- singleton :: Ord a => a -> f a
- viewMin :: Ord a => f a -> Maybe (a, f a)
- fromList :: Ord a => [a] -> f a
- toList :: Ord a => f a -> [a]
- span :: Ord a => (a -> Bool) -> f a -> (f a, f a)
data Entry p a = Entry {
- priority :: !p
- payload :: a
}
union :: (Ord a, Heap f) => f a -> f a -> f a
uncons :: (Ord a, Heap f) => f a -> Maybe (a, f a)

Documentation

class Heap f where Source #

Minimal complete definition

empty, null, insert, merge, findMin, deleteMin

Methods

empty :: Ord a => f a Source #

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

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

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

findMin :: Ord a => f a -> Maybe a Source #

deleteMin :: Ord a => f a -> Maybe (f a) Source #

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

viewMin :: Ord a => f a -> Maybe (a, f a) Source #

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

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

span :: Ord a => (a -> Bool) -> f a -> (f a, f a) Source #

Instances

Instances details

Heap Heap Source #
Instance details Defined in Data.Heap.Ekmett Methods empty :: Ord a => Heap a Source # null :: Ord a => Heap a -> Bool Source # insert :: Ord a => a -> Heap a -> Heap a Source # merge :: Ord a => Heap a -> Heap a -> Heap a Source # findMin :: Ord a => Heap a -> Maybe a Source # deleteMin :: Ord a => Heap a -> Maybe (Heap a) Source # singleton :: Ord a => a -> Heap a Source # viewMin :: Ord a => Heap a -> Maybe (a, Heap a) Source # fromList :: Ord a => [a] -> Heap a Source # toList :: Ord a => Heap a -> [a] Source # span :: Ord a => (a -> Bool) -> Heap a -> (Heap a, Heap a) Source #
Heap Pairing Source #
Instance details Defined in Data.Heap.Pairing Methods empty :: Ord a => Pairing a Source # null :: Ord a => Pairing a -> Bool Source # insert :: Ord a => a -> Pairing a -> Pairing a Source # merge :: Ord a => Pairing a -> Pairing a -> Pairing a Source # findMin :: Ord a => Pairing a -> Maybe a Source # deleteMin :: Ord a => Pairing a -> Maybe (Pairing a) Source # singleton :: Ord a => a -> Pairing a Source # viewMin :: Ord a => Pairing a -> Maybe (a, Pairing a) Source # fromList :: Ord a => [a] -> Pairing a Source # toList :: Ord a => Pairing a -> [a] Source # span :: Ord a => (a -> Bool) -> Pairing a -> (Pairing a, Pairing a) Source #
Heap Spray Source #
Instance details Defined in Data.Heap.Spray Methods empty :: Ord a => Spray a Source # null :: Ord a => Spray a -> Bool Source # insert :: Ord a => a -> Spray a -> Spray a Source # merge :: Ord a => Spray a -> Spray a -> Spray a Source # findMin :: Ord a => Spray a -> Maybe a Source # deleteMin :: Ord a => Spray a -> Maybe (Spray a) Source # singleton :: Ord a => a -> Spray a Source # viewMin :: Ord a => Spray a -> Maybe (a, Spray a) Source # fromList :: Ord a => [a] -> Spray a Source # toList :: Ord a => Spray a -> [a] Source # span :: Ord a => (a -> Bool) -> Spray a -> (Spray a, Spray a) Source #

data Entry p a Source #

Constructors

Entry
Fields priority :: !p payload :: a

Instances

Instances details

Bifunctor Entry Source #
Instance details Defined in Data.Entry Methods bimap :: (a -> b) -> (c -> d) -> Entry a c -> Entry b d # first :: (a -> b) -> Entry a c -> Entry b c # second :: (b -> c) -> Entry a b -> Entry a c #
Functor (Entry p) Source #
Instance details Defined in Data.Entry Methods fmap :: (a -> b) -> Entry p a -> Entry p b # (<$) :: a -> Entry p b -> Entry p a #
Foldable (Entry p) Source #
Instance details Defined in Data.Entry Methods fold :: Monoid m => Entry p m -> m # foldMap :: Monoid m => (a -> m) -> Entry p a -> m # foldMap' :: Monoid m => (a -> m) -> Entry p a -> m # foldr :: (a -> b -> b) -> b -> Entry p a -> b # foldr' :: (a -> b -> b) -> b -> Entry p a -> b # foldl :: (b -> a -> b) -> b -> Entry p a -> b # foldl' :: (b -> a -> b) -> b -> Entry p a -> b # foldr1 :: (a -> a -> a) -> Entry p a -> a # foldl1 :: (a -> a -> a) -> Entry p a -> a # toList :: Entry p a -> [a] # null :: Entry p a -> Bool # length :: Entry p a -> Int # elem :: Eq a => a -> Entry p a -> Bool # maximum :: Ord a => Entry p a -> a # minimum :: Ord a => Entry p a -> a # sum :: Num a => Entry p a -> a # product :: Num a => Entry p a -> a #
Traversable (Entry p) Source #
Instance details Defined in Data.Entry Methods traverse :: Applicative f => (a -> f b) -> Entry p a -> f (Entry p b) # sequenceA :: Applicative f => Entry p (f a) -> f (Entry p a) # mapM :: Monad m => (a -> m b) -> Entry p a -> m (Entry p b) # sequence :: Monad m => Entry p (m a) -> m (Entry p a) #
Eq p => Eq (Entry p a) Source #
Instance details Defined in Data.Entry Methods (==) :: Entry p a -> Entry p a -> Bool # (/=) :: Entry p a -> Entry p a -> Bool #
Ord p => Ord (Entry p a) Source #
Instance details Defined in Data.Entry Methods compare :: Entry p a -> Entry p a -> Ordering # (<) :: Entry p a -> Entry p a -> Bool # (<=) :: Entry p a -> Entry p a -> Bool # (>) :: Entry p a -> Entry p a -> Bool # (>=) :: Entry p a -> Entry p a -> Bool # max :: Entry p a -> Entry p a -> Entry p a # min :: Entry p a -> Entry p a -> Entry p a #
(Read p, Read a) => Read (Entry p a) Source #
Instance details Defined in Data.Entry Methods readsPrec :: Int -> ReadS (Entry p a) # readList :: ReadS [Entry p a] # readPrec :: ReadPrec (Entry p a) # readListPrec :: ReadPrec [Entry p a] #
(Show p, Show a) => Show (Entry p a) Source #
Instance details Defined in Data.Entry Methods showsPrec :: Int -> Entry p a -> ShowS # show :: Entry p a -> String # showList :: [Entry p a] -> ShowS #

union :: (Ord a, Heap f) => f a -> f a -> f a Source #

Synonym for merge.

uncons :: (Ord a, Heap f) => f a -> Maybe (a, f a) Source #

Synonym for viewMin.