Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. 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.

  2. adjustMaxWithKey :: (k -> a -> a) -> MaxPQueue k a -> MaxPQueue k a

    pqueue Data.PQueue.Prio.Max

    Alter the value at the maximum key. If the queue is empty, does nothing.

  3. 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.

  4. adjustMin :: (a -> a) -> MinPQueue k a -> MinPQueue k a

    pqueue Data.PQueue.Prio.Min

    Alter the value at the minimum key. If the queue is empty, does nothing.

  5. 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.

  6. adjustMinWithKey :: (k -> a -> a) -> MinPQueue k a -> MinPQueue k a

    pqueue Data.PQueue.Prio.Min

    Alter the value at the minimum key. If the queue is empty, does nothing.

  7. 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.

  8. 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.

  9. makeJustPattern :: Name -> Pat

    dbus DBus.Generation

    No documentation available.

  10. catchJust :: forall e b (es :: [Effect]) a . Exception e => (e -> Maybe b) -> Eff es a -> (b -> Eff es a) -> Eff es a

    effectful-core Effectful.Exception

    Lifted catchJust.

Page 60 of many | Previous | Next