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.

Exact lookup

1. adjustMin :: (a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

   Update a value at the leftmost key in the tree.

2. adjustMin' :: (a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

   Update a value at the leftmost key in the tree. New value is evaluated to WHNF.

3. adjustMinWithKey :: (Build -> a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

   Update a value at the leftmost key in the tree.

4. adjustMinWithKey' :: (Build -> a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

   Update a value at the leftmost key in the tree. New value is evaluated to WHNF.

5. adjustR :: (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.

6. adjustR' :: (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.

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

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

9. 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"
   

10. 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")
    

Page 148 of many | Previous | Next