Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

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

    radix-tree Data.RadixTree.Word8.Lazy

    Update a value at the rightmost key in the tree.

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

    radix-tree Data.RadixTree.Word8.Lazy

    Update a value at the rightmost key in the tree.

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

    radix-tree Data.RadixTree.Word8.Lazy

    Update a value at the leftmost key in the tree.

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

    radix-tree Data.RadixTree.Word8.Lazy

    Update a value at the leftmost key in the tree.

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

    radix-tree Data.RadixTree.Word8.Strict

    Update a value at the rightmost 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. New value is evaluated to WHNF.

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

    radix-tree Data.RadixTree.Word8.Strict

    Update a value at the rightmost key in the tree.

  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. New value is evaluated to WHNF.

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

    radix-tree Data.RadixTree.Word8.Strict

    Update a value at the leftmost key in the tree.

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

Page 202 of many | Previous | Next