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.
mfromJust :: (?callStack :: CallStack) => String -> Maybe a -> aliquid-fixpoint Language.Fixpoint.Misc No documentation available.
adjustBindEnv :: ((Symbol, SortedReft) -> (Symbol, SortedReft)) -> BindId -> BindEnv a -> BindEnv aliquid-fixpoint Language.Fixpoint.Types.Environments No documentation available.
firstJust :: (a -> Maybe b) -> [a] -> Maybe bliquidhaskell-boot Language.Haskell.Liquid.Misc No documentation available.
safeFromJust :: String -> Maybe t -> tliquidhaskell-boot Language.Haskell.Liquid.Misc No documentation available.
adjust' :: Ord k => (a -> a) -> k -> Map k a -> Map k alrucache 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.
-
lumberjack Lumberjack No documentation available.
catchJust :: (MonadPeelIO m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m amonad-peel Control.Exception.Peel Generalized version of catchJust.
handleJust :: (MonadPeelIO m, Exception e) => (e -> Maybe b) -> (b -> m a) -> m a -> m amonad-peel Control.Exception.Peel Generalized version of handleJust.
tryJust :: (MonadPeelIO m, Exception e) => (e -> Maybe b) -> m a -> m (Either b a)monad-peel Control.Exception.Peel Generalized version of tryJust.
adjust :: (Ord k, MonoidNull v) => (v -> v) -> k -> MonoidMap k v -> MonoidMap k vmonoidmap-internal Data.MonoidMap.Internal Adjusts the value associated with the given key. Satisfies the following property:
adjust f k m == set k (f (get k m)) m