{-# LANGUAGE CPP #-}

module Data.PQueue.Prio.Max.Internals where

import Control.DeepSeq (NFData(rnf))

# if __GLASGOW_HASKELL__
import Data.Data (Data, Typeable)
# endif

import Data.PQueue.Prio.Internals (MinPQueue)

newtype Down a = Down { Down a -> a
unDown :: a }
# if __GLASGOW_HASKELL__
  deriving (Down a -> Down a -> Bool
(Down a -> Down a -> Bool)
-> (Down a -> Down a -> Bool) -> Eq (Down a)
forall a. Eq a => Down a -> Down a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Down a -> Down a -> Bool
$c/= :: forall a. Eq a => Down a -> Down a -> Bool
== :: Down a -> Down a -> Bool
$c== :: forall a. Eq a => Down a -> Down a -> Bool
Eq, Typeable (Down a)
DataType
Constr
Typeable (Down a)
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Down a -> c (Down a))
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c (Down a))
-> (Down a -> Constr)
-> (Down a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c (Down a)))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Down a)))
-> ((forall b. Data b => b -> b) -> Down a -> Down a)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Down a -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Down a -> r)
-> (forall u. (forall d. Data d => d -> u) -> Down a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Down a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Down a -> m (Down a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Down a -> m (Down a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Down a -> m (Down a))
-> Data (Down a)
Down a -> DataType
Down a -> Constr
(forall d. Data d => c (t d)) -> Maybe (c (Down a))
(forall b. Data b => b -> b) -> Down a -> Down a
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Down a -> c (Down a)
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Down a)
forall a. Data a => Typeable (Down a)
forall a. Data a => Down a -> DataType
forall a. Data a => Down a -> Constr
forall a.
Data a =>
(forall b. Data b => b -> b) -> Down a -> Down a
forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Down a -> u
forall a u. Data a => (forall d. Data d => d -> u) -> Down a -> [u]
forall a r r'.
Data a =>
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
forall a r r'.
Data a =>
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Down a -> m (Down a)
forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Down a -> m (Down a)
forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Down a)
forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Down a -> c (Down a)
forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Down a))
forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Down a))
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Down a -> u
forall u. (forall d. Data d => d -> u) -> Down a -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Down a -> m (Down a)
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Down a -> m (Down a)
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Down a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Down a -> c (Down a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Down a))
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Down a))
$cDown :: Constr
$tDown :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Down a -> m (Down a)
$cgmapMo :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Down a -> m (Down a)
gmapMp :: (forall d. Data d => d -> m d) -> Down a -> m (Down a)
$cgmapMp :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Down a -> m (Down a)
gmapM :: (forall d. Data d => d -> m d) -> Down a -> m (Down a)
$cgmapM :: forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Down a -> m (Down a)
gmapQi :: Int -> (forall d. Data d => d -> u) -> Down a -> u
$cgmapQi :: forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Down a -> u
gmapQ :: (forall d. Data d => d -> u) -> Down a -> [u]
$cgmapQ :: forall a u. Data a => (forall d. Data d => d -> u) -> Down a -> [u]
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
$cgmapQr :: forall a r r'.
Data a =>
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
$cgmapQl :: forall a r r'.
Data a =>
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r
gmapT :: (forall b. Data b => b -> b) -> Down a -> Down a
$cgmapT :: forall a.
Data a =>
(forall b. Data b => b -> b) -> Down a -> Down a
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Down a))
$cdataCast2 :: forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Down a))
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c (Down a))
$cdataCast1 :: forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Down a))
dataTypeOf :: Down a -> DataType
$cdataTypeOf :: forall a. Data a => Down a -> DataType
toConstr :: Down a -> Constr
$ctoConstr :: forall a. Data a => Down a -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Down a)
$cgunfold :: forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Down a)
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Down a -> c (Down a)
$cgfoldl :: forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Down a -> c (Down a)
$cp1Data :: forall a. Data a => Typeable (Down a)
Data, Typeable)
# else
  deriving (Eq)
# endif

-- | A priority queue where values of type @a@ are annotated with keys of type @k@.
-- The queue supports extracting the element with maximum key.
newtype MaxPQueue k a = MaxPQ (MinPQueue (Down k) a)
# if __GLASGOW_HASKELL__
  deriving (MaxPQueue k a -> MaxPQueue k a -> Bool
(MaxPQueue k a -> MaxPQueue k a -> Bool)
-> (MaxPQueue k a -> MaxPQueue k a -> Bool) -> Eq (MaxPQueue k a)
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall k a. (Ord k, Eq a) => MaxPQueue k a -> MaxPQueue k a -> Bool
/= :: MaxPQueue k a -> MaxPQueue k a -> Bool
$c/= :: forall k a. (Ord k, Eq a) => MaxPQueue k a -> MaxPQueue k a -> Bool
== :: MaxPQueue k a -> MaxPQueue k a -> Bool
$c== :: forall k a. (Ord k, Eq a) => MaxPQueue k a -> MaxPQueue k a -> Bool
Eq, Eq (MaxPQueue k a)
Eq (MaxPQueue k a)
-> (MaxPQueue k a -> MaxPQueue k a -> Ordering)
-> (MaxPQueue k a -> MaxPQueue k a -> Bool)
-> (MaxPQueue k a -> MaxPQueue k a -> Bool)
-> (MaxPQueue k a -> MaxPQueue k a -> Bool)
-> (MaxPQueue k a -> MaxPQueue k a -> Bool)
-> (MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a)
-> (MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a)
-> Ord (MaxPQueue k a)
MaxPQueue k a -> MaxPQueue k a -> Bool
MaxPQueue k a -> MaxPQueue k a -> Ordering
MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall k a. (Ord k, Ord a) => Eq (MaxPQueue k a)
forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> Bool
forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> Ordering
forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a
min :: MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a
$cmin :: forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a
max :: MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a
$cmax :: forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> MaxPQueue k a
>= :: MaxPQueue k a -> MaxPQueue k a -> Bool
$c>= :: forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> Bool
> :: MaxPQueue k a -> MaxPQueue k a -> Bool
$c> :: forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> Bool
<= :: MaxPQueue k a -> MaxPQueue k a -> Bool
$c<= :: forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> Bool
< :: MaxPQueue k a -> MaxPQueue k a -> Bool
$c< :: forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> Bool
compare :: MaxPQueue k a -> MaxPQueue k a -> Ordering
$ccompare :: forall k a.
(Ord k, Ord a) =>
MaxPQueue k a -> MaxPQueue k a -> Ordering
$cp1Ord :: forall k a. (Ord k, Ord a) => Eq (MaxPQueue k a)
Ord, Typeable (MaxPQueue k a)
DataType
Constr
Typeable (MaxPQueue k a)
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> MaxPQueue k a -> c (MaxPQueue k a))
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c (MaxPQueue k a))
-> (MaxPQueue k a -> Constr)
-> (MaxPQueue k a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c (MaxPQueue k a)))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c (MaxPQueue k a)))
-> ((forall b. Data b => b -> b) -> MaxPQueue k a -> MaxPQueue k a)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r)
-> (forall u. (forall d. Data d => d -> u) -> MaxPQueue k a -> [u])
-> (forall u.
    Int -> (forall d. Data d => d -> u) -> MaxPQueue k a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d)
    -> MaxPQueue k a -> m (MaxPQueue k a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> MaxPQueue k a -> m (MaxPQueue k a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> MaxPQueue k a -> m (MaxPQueue k a))
-> Data (MaxPQueue k a)
MaxPQueue k a -> DataType
MaxPQueue k a -> Constr
(forall b. Data b => b -> b) -> MaxPQueue k a -> MaxPQueue k a
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> MaxPQueue k a -> c (MaxPQueue k a)
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (MaxPQueue k a)
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (MaxPQueue k a))
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> MaxPQueue k a -> u
forall u. (forall d. Data d => d -> u) -> MaxPQueue k a -> [u]
forall k a. (Data k, Data a, Ord k) => Typeable (MaxPQueue k a)
forall k a. (Data k, Data a, Ord k) => MaxPQueue k a -> DataType
forall k a. (Data k, Data a, Ord k) => MaxPQueue k a -> Constr
forall k a.
(Data k, Data a, Ord k) =>
(forall b. Data b => b -> b) -> MaxPQueue k a -> MaxPQueue k a
forall k a u.
(Data k, Data a, Ord k) =>
Int -> (forall d. Data d => d -> u) -> MaxPQueue k a -> u
forall k a u.
(Data k, Data a, Ord k) =>
(forall d. Data d => d -> u) -> MaxPQueue k a -> [u]
forall k a r r'.
(Data k, Data a, Ord k) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
forall k a r r'.
(Data k, Data a, Ord k) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
forall k a (m :: * -> *).
(Data k, Data a, Ord k, Monad m) =>
(forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
forall k a (m :: * -> *).
(Data k, Data a, Ord k, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
forall k a (c :: * -> *).
(Data k, Data a, Ord k) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (MaxPQueue k a)
forall k a (c :: * -> *).
(Data k, Data a, Ord k) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> MaxPQueue k a -> c (MaxPQueue k a)
forall k a (t :: * -> *) (c :: * -> *).
(Data k, Data a, Ord k, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (MaxPQueue k a))
forall k a (t :: * -> * -> *) (c :: * -> *).
(Data k, Data a, Ord k, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (MaxPQueue k a))
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (MaxPQueue k a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> MaxPQueue k a -> c (MaxPQueue k a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (MaxPQueue k a))
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (MaxPQueue k a))
$cMaxPQ :: Constr
$tMaxPQueue :: DataType
gmapMo :: (forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
$cgmapMo :: forall k a (m :: * -> *).
(Data k, Data a, Ord k, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
gmapMp :: (forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
$cgmapMp :: forall k a (m :: * -> *).
(Data k, Data a, Ord k, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
gmapM :: (forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
$cgmapM :: forall k a (m :: * -> *).
(Data k, Data a, Ord k, Monad m) =>
(forall d. Data d => d -> m d)
-> MaxPQueue k a -> m (MaxPQueue k a)
gmapQi :: Int -> (forall d. Data d => d -> u) -> MaxPQueue k a -> u
$cgmapQi :: forall k a u.
(Data k, Data a, Ord k) =>
Int -> (forall d. Data d => d -> u) -> MaxPQueue k a -> u
gmapQ :: (forall d. Data d => d -> u) -> MaxPQueue k a -> [u]
$cgmapQ :: forall k a u.
(Data k, Data a, Ord k) =>
(forall d. Data d => d -> u) -> MaxPQueue k a -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
$cgmapQr :: forall k a r r'.
(Data k, Data a, Ord k) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
$cgmapQl :: forall k a r r'.
(Data k, Data a, Ord k) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> MaxPQueue k a -> r
gmapT :: (forall b. Data b => b -> b) -> MaxPQueue k a -> MaxPQueue k a
$cgmapT :: forall k a.
(Data k, Data a, Ord k) =>
(forall b. Data b => b -> b) -> MaxPQueue k a -> MaxPQueue k a
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (MaxPQueue k a))
$cdataCast2 :: forall k a (t :: * -> * -> *) (c :: * -> *).
(Data k, Data a, Ord k, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (MaxPQueue k a))
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c (MaxPQueue k a))
$cdataCast1 :: forall k a (t :: * -> *) (c :: * -> *).
(Data k, Data a, Ord k, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (MaxPQueue k a))
dataTypeOf :: MaxPQueue k a -> DataType
$cdataTypeOf :: forall k a. (Data k, Data a, Ord k) => MaxPQueue k a -> DataType
toConstr :: MaxPQueue k a -> Constr
$ctoConstr :: forall k a. (Data k, Data a, Ord k) => MaxPQueue k a -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (MaxPQueue k a)
$cgunfold :: forall k a (c :: * -> *).
(Data k, Data a, Ord k) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (MaxPQueue k a)
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> MaxPQueue k a -> c (MaxPQueue k a)
$cgfoldl :: forall k a (c :: * -> *).
(Data k, Data a, Ord k) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> MaxPQueue k a -> c (MaxPQueue k a)
$cp1Data :: forall k a. (Data k, Data a, Ord k) => Typeable (MaxPQueue k a)
Data, Typeable)
# else
  deriving (Eq, Ord)
# endif

instance (NFData k, NFData a) => NFData (MaxPQueue k a) where
  rnf :: MaxPQueue k a -> ()
rnf (MaxPQ MinPQueue (Down k) a
q) = MinPQueue (Down k) a -> ()
forall a. NFData a => a -> ()
rnf MinPQueue (Down k) a
q

instance NFData a => NFData (Down a) where
  rnf :: Down a -> ()
rnf (Down a
a) = a -> ()
forall a. NFData a => a -> ()
rnf a
a

instance Ord a => Ord (Down a) where
  Down a
a compare :: Down a -> Down a -> Ordering
`compare` Down a
b = a
b a -> a -> Ordering
forall a. Ord a => a -> a -> Ordering
`compare` a
a
  Down a
a <= :: Down a -> Down a -> Bool
<= Down a
b = a
b a -> a -> Bool
forall a. Ord a => a -> a -> Bool
<= a
a

instance Functor Down where
  fmap :: (a -> b) -> Down a -> Down b
fmap a -> b
f (Down a
a) = b -> Down b
forall a. a -> Down a
Down (a -> b
f a
a)

instance Foldable Down where
  foldr :: (a -> b -> b) -> b -> Down a -> b
foldr a -> b -> b
f b
z (Down a
a) = a
a a -> b -> b
`f` b
z
  foldl :: (b -> a -> b) -> b -> Down a -> b
foldl b -> a -> b
f b
z (Down a
a) = b
z b -> a -> b
`f` a
a

instance Traversable Down where
  traverse :: (a -> f b) -> Down a -> f (Down b)
traverse a -> f b
f (Down a
a) = b -> Down b
forall a. a -> Down a
Down (b -> Down b) -> f b -> f (Down b)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> a -> f b
f a
a