Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
maybeModify :: Storable e => Vector s e -> Int -> (e -> e) -> ST s Boolstorablevector Data.StorableVector.ST.Strict Similar to maybeWrite. In future maybeModify will replace modify.
maybeRead :: Storable e => Vector s e -> Int -> ST s (Maybe e)storablevector Data.StorableVector.ST.Strict Returns Just e, when the element e could be read and Nothing if the index was out of range. This way you can avoid duplicate index checks that may be needed when using read.
Control.Monad.ST.runST (do arr <- new_ 10; Monad.zipWithM_ (write arr) [9,8..0] ['a'..]; read arr 3)
In future maybeRead will replace read.maybeWrite :: Storable e => Vector s e -> Int -> e -> ST s Boolstorablevector Data.StorableVector.ST.Strict Returns True if the element could be written and False if the index was out of range.
runSTVector (do arr <- new_ 10; foldr (\c go i -> maybeWrite arr i c >>= \cont -> if cont then go (succ i) else return arr) (error "unreachable") ['a'..] 0)
In future maybeWrite will replace write.-
Cabal-syntax Distribution.Compat.Prelude No documentation available.
maybeToLibraryName :: Maybe UnqualComponentName -> LibraryNameCabal-syntax Distribution.Types.LibraryName Convert the UnqualComponentName of a library into a LibraryName.
maybePlus :: (a -> Maybe a) -> a -> [a]hxt Data.Tree.NavigatableTree.XPathAxis collect all trees by moving into one direction, starting tree is not included
maybeStar :: (a -> Maybe a) -> a -> [a]hxt Data.Tree.NavigatableTree.XPathAxis collect all trees by moving into one direction, starting tree is included
maybeCons0 :: Maybe b -> [[b]]leancheck Test.LeanCheck.Tiers Like cons0 but lifted over a Maybe value. Only a Just value will be returned.
maybeCons1 :: Listable a => (a -> Maybe b) -> [[b]]leancheck Test.LeanCheck.Tiers Like cons1 but lifted over a Maybe result. This discard Nothing values. Only Just values are returned.
maybeCons2 :: (Listable a, Listable b) => (a -> b -> Maybe c) -> [[c]]leancheck Test.LeanCheck.Tiers Like cons2 but lifted over a Maybe result. This discard Nothing values. Only Just values are returned. Useful when declaring generators which have pre-conditions:
data Fraction = Fraction Int Int mkFraction _ 0 = Nothing mkFraction n d = Fraction n d instance Listable Fraction where tiers = maybeCons2 mkFraction