Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
adjustMax :: (a -> a) -> MaxPQueue k a -> MaxPQueue k apqueue Data.PQueue.Prio.Max Alter the value at the maximum key. If the queue is empty, does nothing.
adjustMaxA :: Applicative f => (a -> f a) -> MaxPQueue k a -> f (MaxPQueue k a)pqueue Data.PQueue.Prio.Max per operation. Alter the value at the maximum key in an Applicative context. If the queue is empty, does nothing.
adjustMaxWithKey :: (k -> a -> a) -> MaxPQueue k a -> MaxPQueue k apqueue Data.PQueue.Prio.Max Alter the value at the maximum key. If the queue is empty, does nothing.
adjustMaxWithKeyA :: Applicative f => (k -> a -> f a) -> MaxPQueue k a -> f (MaxPQueue k a)pqueue Data.PQueue.Prio.Max per operation. Alter the value at the maximum key in an Applicative context. If the queue is empty, does nothing.
adjustMin :: (a -> a) -> MinPQueue k a -> MinPQueue k apqueue Data.PQueue.Prio.Min Alter the value at the minimum key. If the queue is empty, does nothing.
adjustMinA :: Applicative f => (a -> f a) -> MinPQueue k a -> f (MinPQueue k a)pqueue Data.PQueue.Prio.Min Alter the value at the minimum key in an Applicative context. If the queue is empty, does nothing.
adjustMinWithKey :: (k -> a -> a) -> MinPQueue k a -> MinPQueue k apqueue Data.PQueue.Prio.Min Alter the value at the minimum key. If the queue is empty, does nothing.
adjustMinWithKeyA :: Applicative f => (k -> a -> f a) -> MinPQueue k a -> f (MinPQueue k a)pqueue Data.PQueue.Prio.Min per operation. Alter the value at the minimum key in an Applicative context. If the queue is empty, does nothing.
adjustNested :: (Ord k, Foldable t, IsList (t a)) => (t a -> t a) -> k -> Map k (t a) -> Map k (t a)skeletest Skeletest.Internal.Utils.Map Same as adjust, except defaulting to an empty structure if it doesn't exist, and deleting the key if the adjusted value is empty.
makeJustPattern :: Name -> Patdbus DBus.Generation No documentation available.