Hoogle Search

Within LTS Haskell 24.56 (ghc-9.10.3)

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

Exact lookup

1. unsafeAdjustMinWithKey' :: (Build1 -> a -> a) -> Radix1Tree a -> Radix1Tree a

   radix-tree	Data.Radix1Tree.Word8.Strict.Unsafe

   Update a value at the leftmost key in the tree. New value is evaluated to WHNF. Throws MalformedTree if the tree is empty.

2. adjustMax :: (a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Lazy

   Update a value at the rightmost key in the tree.

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

   radix-tree	Data.RadixTree.Word8.Lazy

   Update a value at the rightmost key in the tree.

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

   radix-tree	Data.RadixTree.Word8.Lazy

   Update a value at the leftmost key in the tree.

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

   radix-tree	Data.RadixTree.Word8.Lazy

   Update a value at the leftmost key in the tree.

6. adjustMax :: (a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

   Update a value at the rightmost key in the tree.

7. adjustMax' :: (a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

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

8. adjustMaxWithKey :: (Build -> a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

   Update a value at the rightmost key in the tree.

9. adjustMaxWithKey' :: (Build -> a -> a) -> RadixTree a -> RadixTree a

   radix-tree	Data.RadixTree.Word8.Strict

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

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

    radix-tree	Data.RadixTree.Word8.Strict

    Update a value at the leftmost key in the tree.

Page 202 of many | Previous | Next