Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. builtinJust :: BuiltinId

   Agda	Agda.Syntax.Builtin

   No documentation available.

2. primJust :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

   Agda	Agda.TypeChecking.Monad.Builtin

   No documentation available.

3. adjust :: (Ord k, Ord (Tag v), HasTag v) => (v -> v) -> k -> BiMap k v -> BiMap k v

   Agda	Agda.Utils.BiMap

   Modifies the value at the given position, if any. O(log n). Precondition: See adjustPrecondition.

4. adjustPrecondition :: (Ord k, Eq v, Eq (Tag v), HasTag v) => (v -> v) -> k -> BiMap k v -> Bool

   Agda	Agda.Utils.BiMap

   The precondition for adjust f k m is that, if the value v is inserted into m, and tag v is defined, then no key other than k may map to a value v' for which tag v' = tag v.

5. applyWhenJust :: Maybe b -> (b -> a -> a) -> a -> a

   Agda	Agda.Utils.Function

   Maybe version of applyWhen.

6. catchImpossibleJust :: CatchImpossible m => (Impossible -> Maybe b) -> m a -> (b -> m a) -> m a

   Agda	Agda.Utils.Impossible

   Catch only Impossible exceptions selected by the filter.

7. handleImpossibleJust :: CatchImpossible m => (Impossible -> Maybe b) -> (b -> m a) -> m a -> m a

   Agda	Agda.Utils.Impossible

   Version of catchImpossibleJust with argument order suiting short handlers.

8. spanJust :: (a -> Maybe b) -> [a] -> (Prefix b, Suffix a)

   Agda	Agda.Utils.List

   A generalized version of span. O(length . fst . spanJust f).

9. takeWhileJust :: (a -> Maybe b) -> [a] -> Prefix b

   Agda	Agda.Utils.List

   A generalized version of takeWhile. (Cf. mapMaybe vs. filter). @O(length . takeWhileJust f). takeWhileJust f = fst . spanJust f.

10. adjustM :: (Functor f, Ord k) => (v -> f v) -> k -> Map k v -> f (Map k v)

    Agda	Agda.Utils.Map

    Update monadically the value at one position (must exist!).

Page 117 of many | Previous | Next