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. adjustMaxWithKey :: (Word -> a -> a) -> Patricia a -> Patricia a

    radix-tree Data.Patricia.Word.Strict

    Update a value at the rightmost key in the tree.

  2. adjustMaxWithKey' :: (Word -> a -> a) -> Patricia a -> Patricia a

    radix-tree Data.Patricia.Word.Strict

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

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

    radix-tree Data.Patricia.Word.Strict

    Update a value at the leftmost key in the tree.

  4. adjustMin' :: (a -> a) -> Patricia a -> Patricia a

    radix-tree Data.Patricia.Word.Strict

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

  5. adjustMinWithKey :: (Word -> a -> a) -> Patricia a -> Patricia a

    radix-tree Data.Patricia.Word.Strict

    Update a value at the leftmost key in the tree.

  6. adjustMinWithKey' :: (Word -> a -> a) -> Patricia a -> Patricia a

    radix-tree Data.Patricia.Word.Strict

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

  7. adjustMax :: (a -> a) -> Radix1Tree a -> Radix1Tree a

    radix-tree Data.Radix1Tree.Word8.Lazy

    Update a value at the rightmost key in the tree.

  8. adjustMaxWithKey :: (Build1 -> a -> a) -> Radix1Tree a -> Radix1Tree a

    radix-tree Data.Radix1Tree.Word8.Lazy

    Update a value at the rightmost key in the tree.

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

    radix-tree Data.Radix1Tree.Word8.Lazy

    Update a value at the leftmost key in the tree.

  10. adjustMinWithKey :: (Build1 -> a -> a) -> Radix1Tree a -> Radix1Tree a

    radix-tree Data.Radix1Tree.Word8.Lazy

    Update a value at the leftmost key in the tree.

Page 199 of many | Previous | Next