Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

  1. mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia b

    radix-tree Data.Patricia.Word.Strict

    Apply a function to every value in the tree and create a tree out of Just results. The Maybe is evaluated to WHNF.

  2. mapMaybe :: (a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

    radix-tree Data.Radix1Tree.Word8.Lazy

    Apply a function to every value in the tree and create one out of Just values.

  3. mapMaybeWithKey :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

    radix-tree Data.Radix1Tree.Word8.Lazy

    Apply a function to every value in the tree and create one out of Just values.

  4. mapMaybe :: (a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

    radix-tree Data.Radix1Tree.Word8.Strict

    Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.

  5. mapMaybeWithKey :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

    radix-tree Data.Radix1Tree.Word8.Strict

    Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.

  6. mapMaybe :: (a -> Maybe b) -> RadixTree a -> RadixTree b

    radix-tree Data.RadixTree.Word8.Lazy

    Apply a function to every value in the tree and create one out of Just values.

  7. mapMaybeWithKey :: (Build -> a -> Maybe b) -> RadixTree a -> RadixTree b

    radix-tree Data.RadixTree.Word8.Lazy

    Apply a function to every value in the tree and create one out of Just values.

  8. mapMaybe :: (a -> Maybe b) -> RadixTree a -> RadixTree b

    radix-tree Data.RadixTree.Word8.Strict

    Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.

  9. mapMaybeWithKey :: (Build -> a -> Maybe b) -> RadixTree a -> RadixTree b

    radix-tree Data.RadixTree.Word8.Strict

    Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.

  10. unfoldlMRangeMaybe :: forall (w :: Natural) (v :: Nat) m a . (0 <= w, Unfoldl 0 v w, Monad m) => m Bool -> m a -> m (Maybe (RangeR v w a))

    ranged-list Data.List.Range

    It is like unfoldlRangeMaybe. But it use a monad instead of a function. The first argument monad returns a boolean value. It creates values while this boolean value is True. If this boolean value is False before to create enough values or True after to create full values, then unfoldlMRangeMaybe returns Nothing. 

    >>> :set -XDataKinds

>>> :module + Data.IORef

>>> r <- newIORef 1

>>> check n0 = (< n0) <$> readIORef r

>>> count = readIORef r >>= \n -> n * 3 <$ writeIORef r (n + 1)

>>> unfoldlMRangeMaybe (check 2) count :: IO (Maybe (RangeR 3 5 Integer))
Nothing

    >>> writeIORef r 1

>>> unfoldlMRangeMaybe (check 5) count :: IO (Maybe (RangeR 3 5 Integer))
Just ((((NilR :++ 12) :+ 9) :+ 6) :+ 3)

    >>> writeIORef r 1

>>> unfoldlMRangeMaybe (check 10) count :: IO (Maybe (RangeR 3 5 Integer))
Nothing

Page 283 of many | Previous | Next