Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. adjust :: (v -> v) -> KeySpec -> KVITable v -> KVITable v

   kvitable	Data.KVITable

   Adjust a value at the specified keyspec; return the original KVITable if that keyspec is not found in the table.

2. adjustWithKey :: (KeySpec -> v -> v) -> KeySpec -> KVITable v -> KVITable v

   kvitable	Data.KVITable

   Adjust a value at the specified keyspec; return the original KVITable if that keyspec is not found in the table.

3. mfromJust :: (?callStack :: CallStack) => String -> Maybe a -> a

   liquid-fixpoint	Language.Fixpoint.Misc

   No documentation available.

4. adjustBindEnv :: ((Symbol, SortedReft) -> (Symbol, SortedReft)) -> BindId -> BindEnv a -> BindEnv a

   liquid-fixpoint	Language.Fixpoint.Types.Environments

   No documentation available.

5. firstJust :: (a -> Maybe b) -> [a] -> Maybe b

   liquidhaskell-boot	Language.Haskell.Liquid.Misc

   No documentation available.

6. safeFromJust :: String -> Maybe t -> t

   liquidhaskell-boot	Language.Haskell.Liquid.Misc

   No documentation available.

7. adjust' :: Ord k => (a -> a) -> k -> Map k a -> Map k a

   lrucache	Data.Cache.LRU.Internal

   Internal function. This is very similar to adjust, with two major differences. First, it's strict in the application of the function, which is a huge win when working with this structure. Second, it requires that the key be present in order to work. If the key isn't present, undefined will be inserted into the Map, which will cause problems later.

8. adjustLogAction :: LoggingMonad msg m => (forall (k :: Type -> Type) . () => LogAction k msg -> LogAction k msg) -> m a -> m a

   lumberjack	Lumberjack

   No documentation available.

9. takingJusts :: forall a (m :: Type -> Type) . Monad m => MachineT m (Is (Maybe a)) a

   machines	Data.Machine.Process

   A Process that passes through elements unwrapped from Just until a Nothing is found, then stops. This can be constructed from a plan with

   takingJusts :: Process (Maybe a) a
   takingJusts = repeatedly $ await >>= maybe stop yield
   

   Examples:

   >>> run $ takingJusts <~ source [Just 1, Just 2, Nothing, Just 3, Just 4]
   [1,2]
   

10. catchJust :: (MonadPeelIO m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m a

    monad-peel	Control.Exception.Peel

    Generalized version of catchJust.

Page 101 of many | Previous | Next