Hoogle Search
Within LTS Haskell 24.62 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
radix-tree Data.Radix1Tree.Word8.Strict Result of a tree split with a lookup.
SplitLookup1 :: !Radix1Tree l -> !Maybe x -> !Radix1Tree r -> SplitLookup1 l x rradix-tree Data.Radix1Tree.Word8.Strict No documentation available.
splitLookup :: Feed1 -> Radix1Tree a -> SplitLookup1 a a aradix-tree Data.Radix1Tree.Word8.Strict Split1 the tree into two, such that values with keys smaller than the given one are on the left, values with keys greater than the given one are on the right, and the value at the given key is returned separately.
unsafeLookupMax :: Radix1Tree a -> (# a #)radix-tree Data.Radix1Tree.Word8.Strict.Unsafe Look up a value at the rightmost key in the tree. Throws MalformedTree if the tree is empty.
unsafeLookupMaxWithKey :: Radix1Tree a -> Lookup1 aradix-tree Data.Radix1Tree.Word8.Strict.Unsafe Look up a value at the rightmost key in the tree. Throws MalformedTree if the tree is empty.
unsafeLookupMin :: Radix1Tree a -> (# a #)radix-tree Data.Radix1Tree.Word8.Strict.Unsafe Look up a value at the leftmost key in the tree. Throws MalformedTree if the tree is empty.
unsafeLookupMinWithKey :: Radix1Tree a -> Lookup1 aradix-tree Data.Radix1Tree.Word8.Strict.Unsafe Look up a value at the leftmost key in the tree. Throws MalformedTree if the tree is empty.
splitLookup :: Feed -> RadixTree a -> (RadixTree a, Maybe a, RadixTree a)radix-tree Data.RadixTree.Word8.Lazy Split the tree into two, such that values with keys smaller than the given one are on the left, values with keys greater than the given one are on the right, and the value at the given key is returned separately.
-
radix-tree Data.RadixTree.Word8.Strict Result of a tree split with a lookup.
SplitLookup :: !RadixTree l -> !Maybe x -> !RadixTree r -> SplitLookup l x rradix-tree Data.RadixTree.Word8.Strict No documentation available.