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.
-
incipit-base Incipit.Base The isJust function returns True iff its argument is of the form Just _.
Examples
Basic usage:>>> isJust (Just 3) True
>>> isJust (Just ()) True
>>> isJust Nothing False
Only the outer constructor is taken into consideration:>>> isJust (Just Nothing) True
endsJust :: (HasCallStack, Show a, Eq a) => IO (Maybe a) -> a -> Expectationkeyed-vals-hspec-tests Test.KeyedVals.Hspec action `endsJust` expected sets the expectation that action returns Just expected.
Example
>>> pure (readMaybe "1" :: Maybe Int) `endsJust` 1
endsJust_ :: Show a => IO (Maybe a) -> IO ()keyed-vals-hspec-tests Test.KeyedVals.Hspec endsJust_ action sets the expectation that action returns Just a.
Example
>>> endsJust_ $ pure (readMaybe "1" :: Maybe Int)
adjust :: (v -> v) -> KeySpec -> KVITable v -> KVITable vkvitable Data.KVITable Adjust a value at the specified keyspec; return the original KVITable if that keyspec is not found in the table.
adjustWithKey :: (KeySpec -> v -> v) -> KeySpec -> KVITable v -> KVITable vkvitable Data.KVITable Adjust a value at the specified keyspec; return the original KVITable if that keyspec is not found in the table.
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.