Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
adjustLWithKey :: (Build1 -> a -> a) -> Openness -> Feed1 -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Apply a function to every value for which the key is smaller than (or equal to) the given one.
adjustLWithKey' :: (Build1 -> a -> a) -> Openness -> Feed1 -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Apply a function to every value for which the key is smaller than (or equal to) the given one. New value is evaluated to WHNF.
adjustMax :: (a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the rightmost key in the tree.
adjustMax' :: (a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the rightmost key in the tree. New value is evaluated to WHNF.
adjustMaxWithKey :: (Build1 -> a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the rightmost key in the tree.
adjustMaxWithKey' :: (Build1 -> a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the rightmost key in the tree. New value is evaluated to WHNF.
adjustMin :: (a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the leftmost key in the tree.
adjustMin' :: (a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the leftmost key in the tree. New value is evaluated to WHNF.
adjustMinWithKey :: (Build1 -> a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the leftmost key in the tree.
adjustMinWithKey' :: (Build1 -> a -> a) -> Radix1Tree a -> Radix1Tree aradix-tree Data.Radix1Tree.Word8.Strict Update a value at the leftmost key in the tree. New value is evaluated to WHNF.