Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Heap.Ekmett

Contents

Orphan instances

Documentation

data Heap a #

Instances

Instances details

Foldable Heap
Instance details Defined in Data.Heap Methods fold :: Monoid m => Heap m -> m # foldMap :: Monoid m => (a -> m) -> Heap a -> m # foldMap' :: Monoid m => (a -> m) -> Heap a -> m # foldr :: (a -> b -> b) -> b -> Heap a -> b # foldr' :: (a -> b -> b) -> b -> Heap a -> b # foldl :: (b -> a -> b) -> b -> Heap a -> b # foldl' :: (b -> a -> b) -> b -> Heap a -> b # foldr1 :: (a -> a -> a) -> Heap a -> a # foldl1 :: (a -> a -> a) -> Heap a -> a # toList :: Heap a -> [a] # null :: Heap a -> Bool # length :: Heap a -> Int # elem :: Eq a => a -> Heap a -> Bool # maximum :: Ord a => Heap a -> a # minimum :: Ord a => Heap a -> a # sum :: Num a => Heap a -> a # product :: Num a => Heap a -> a #
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 #
Eq (Heap a)
Instance details Defined in Data.Heap Methods (==) :: Heap a -> Heap a -> Bool # (/=) :: Heap a -> Heap a -> Bool #
(Ord a, Data a) => Data (Heap a)
Instance details Defined in Data.Heap Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Heap a -> c (Heap a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Heap a) # toConstr :: Heap a -> Constr # dataTypeOf :: Heap a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Heap a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Heap a)) # gmapT :: (forall b. Data b => b -> b) -> Heap a -> Heap a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Heap a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Heap a -> r # gmapQ :: (forall d. Data d => d -> u) -> Heap a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Heap a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Heap a -> m (Heap a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Heap a -> m (Heap a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Heap a -> m (Heap a) #
Ord (Heap a)
Instance details Defined in Data.Heap Methods compare :: Heap a -> Heap a -> Ordering # (<) :: Heap a -> Heap a -> Bool # (<=) :: Heap a -> Heap a -> Bool # (>) :: Heap a -> Heap a -> Bool # (>=) :: Heap a -> Heap a -> Bool # max :: Heap a -> Heap a -> Heap a # min :: Heap a -> Heap a -> Heap a #
(Ord a, Read a) => Read (Heap a)
Instance details Defined in Data.Heap Methods readsPrec :: Int -> ReadS (Heap a) # readList :: ReadS [Heap a] # readPrec :: ReadPrec (Heap a) # readListPrec :: ReadPrec [Heap a] #
Show a => Show (Heap a)
Instance details Defined in Data.Heap Methods showsPrec :: Int -> Heap a -> ShowS # show :: Heap a -> String # showList :: [Heap a] -> ShowS #
Semigroup (Heap a)
Instance details Defined in Data.Heap Methods (<>) :: Heap a -> Heap a -> Heap a # sconcat :: NonEmpty (Heap a) -> Heap a # stimes :: Integral b => b -> Heap a -> Heap a #
Monoid (Heap a)
Instance details Defined in Data.Heap Methods mempty :: Heap a # mappend :: Heap a -> Heap a -> Heap a # mconcat :: [Heap a] -> Heap a #

module Data.Heap.Class

Orphan instances

Heap Heap Source #

Instance details

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 #