Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. adjustRWithKey :: (Build -> a -> a) -> Openness -> Feed -> RadixTree a -> RadixTree a

    radix-tree Data.RadixTree.Word8.Strict

    Apply a function to every value for which the key is greater than (or equal to) the given one.

  2. adjustRWithKey' :: (Build -> a -> a) -> Openness -> Feed -> RadixTree a -> RadixTree a

    radix-tree Data.RadixTree.Word8.Strict

    Apply a function to every value for which the key is greater than (or equal to) the given one. New value is evaluated to WHNF.

  3. adjust :: Int -> (a -> a) -> RAList a -> RAList a

    ral Data.RAList

    Adjust a value in the list. 

    >>> adjust 3 toUpper $ fromList "bcdef"
fromList "bcdEf"
    If index is out of bounds, the list is returned unmodified. 
    >>> adjust 10 toUpper $ fromList "bcdef"
fromList "bcdef"

    >>> adjust (-1) toUpper $ fromList "bcdef"
fromList "bcdef"

  4. adjust :: Int -> (a -> a) -> NERAList a -> NERAList a

    ral Data.RAList.NonEmpty

    Adjust a value in the list. 

    >>> adjust 3 toUpper $ fromNonEmpty $ 'a' :| "bcdef"
fromNonEmpty ('a' :| "bcDef")
    If index is out of bounds, the list is returned unmodified. 
    >>> adjust 10 toUpper $ fromNonEmpty $ 'a' :| "bcdef"
fromNonEmpty ('a' :| "bcdef")

    >>> adjust (-1) toUpper $ fromNonEmpty $ 'a' :| "bcdef"
fromNonEmpty ('a' :| "bcdef")

  5. adjust :: Ord a => (b -> b) -> a -> RMap a b -> RMap a b

    rec-def Data.Recursive.Map 

    RM.get (RM.adjust (applyFun f) k m) === M.adjust (applyFun f) k (RM.get m)

  6. adjustWithKey :: Ord a => (a -> b -> b) -> a -> RMap a b -> RMap a b

    rec-def Data.Recursive.Map 

    RM.get (RM.adjustWithKey (applyFun2 f) k m) === M.adjustWithKey (applyFun2 f) k (RM.get m)

  7. adjust :: Int -> (a -> a) -> Vector a -> Vector a

    rrb-vector Data.RRBVector

    Adjust the element at the index by applying the function to it. If the index is out of range, the original vector is returned.

  8. adjust' :: Int -> (a -> a) -> Vector a -> Vector a

    rrb-vector Data.RRBVector

    Like adjust, but the result of the function is forced.

  9. fromJust :: Maybe a -> a

    srtree Algorithm.EqSat

    No documentation available.

  10. whenJust :: Monad m => Maybe a -> (a -> m ()) -> m ()

    status-notifier-item StatusNotifier.Util

    No documentation available.

Page 148 of many | Previous | Next