Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

  1. maybeStdDev :: MaybeVariance d => d -> Maybe Double

    statistics Statistics.Distribution

    No documentation available.

  2. maybeVariance :: MaybeVariance d => d -> Maybe Double

    statistics Statistics.Distribution

    No documentation available.

  3. maybeModify :: Storable e => Vector s e -> Int -> (e -> e) -> ST s Bool

    storablevector Data.StorableVector.ST.Strict

    Similar to maybeWrite. In future maybeModify will replace modify.

  4. 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.

  5. maybeWrite :: Storable e => Vector s e -> Int -> e -> ST s Bool

    storablevector 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.

  6. maybeToList :: Maybe a -> [a]

    Cabal-syntax Distribution.Compat.Prelude

    No documentation available.

  7. maybeToLibraryName :: Maybe UnqualComponentName -> LibraryName

    Cabal-syntax Distribution.Types.LibraryName

    Convert the UnqualComponentName of a library into a LibraryName.

  8. maybePlus :: (a -> Maybe a) -> a -> [a]

    hxt Data.Tree.NavigatableTree.XPathAxis

    collect all trees by moving into one direction, starting tree is not included

  9. maybeStar :: (a -> Maybe a) -> a -> [a]

    hxt Data.Tree.NavigatableTree.XPathAxis

    collect all trees by moving into one direction, starting tree is included

  10. maybeCons0 :: Maybe b -> [[b]]

    leancheck Test.LeanCheck.Tiers

    Like cons0 but lifted over a Maybe value. Only a Just value will be returned.

Page 39 of many | Previous | Next