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.

Exact lookup

1. tryJust :: forall e (r :: EffectRow) b a . Member (Error e :: (Type -> Type) -> Type -> Type) r => (e -> Maybe b) -> Sem r a -> Sem r (Either b a)

   polysemy	Polysemy.Error

   A variant of try that takes an exception predicate to select which exceptions are caught (c.f. catchJust). If the exception does not match the predicate, it is re-thrown.

2. shouldBeJust :: (HasCallStack, MonadIO m) => Maybe a -> m ()

   sandwich	Test.Sandwich.Expectations

   Asserts that the given Maybe is Just.

3. xF86XK_BrightnessAdjust :: KeySym

   X11	Graphics.X11.ExtraTypes.XF86

   No documentation available.

4. xF86XK_ContrastAdjust :: KeySym

   X11	Graphics.X11.ExtraTypes.XF86

   No documentation available.

5. adjust :: (Ord a, Ord b) => (b -> b) -> a -> Bimap a b -> Bimap a b

   bimap	Data.Bimap

   O(log n). Update a value at a specific left key with the result of the provided function. When the left key is not a member of the bimap, the original bimap is returned.

6. adjustR :: (Ord a, Ord b) => (a -> a) -> b -> Bimap a b -> Bimap a b

   bimap	Data.Bimap

   O(log n). Update a value at a specific right key with the result of the provided function. When the right key is not a member of the bimap, the original bimap is returned.

7. adjustWithKey :: (Ord a, Ord b) => (a -> b -> b) -> a -> Bimap a b -> Bimap a b

   bimap	Data.Bimap

   O(log n). Adjust a value at a specific left key. When the left key is not a member of the bimap, the original bimap is returned.

8. adjustWithKeyR :: (Ord a, Ord b) => (b -> a -> a) -> b -> Bimap a b -> Bimap a b

   bimap	Data.Bimap

   O(log n). Adjust a value at a specific right key. When the right key is not a member of the bimap, the original bimap is returned.

9. adjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a

   enummapset	Data.EnumMap.Lazy

   No documentation available.

10. adjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a

    enummapset	Data.EnumMap.Lazy

    No documentation available.

Page 47 of many | Previous | Next