Hoogle Search
Within LTS Haskell 24.65 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookupMin :: Radix1Tree a -> Maybe aradix-tree Data.Radix1Tree.Word8.Strict Look up a value at the leftmost key in the tree.
lookupMinWithKey :: Radix1Tree a -> Maybe (Lookup1 a)radix-tree Data.Radix1Tree.Word8.Strict Look up a value at the leftmost key in the tree.
lookupR :: Openness -> Feed1 -> Radix1Tree a -> Maybe (Lookup1 a)radix-tree Data.Radix1Tree.Word8.Strict Look up a value at a smallest key greater than (or equal to) the given key.
lookupL :: Openness -> Feed -> RadixTree a -> Maybe (Lookup a)radix-tree Data.RadixTree.Word8.Lazy Look up a value at a largest key smaller than (or equal to) the given key.
lookupMax :: RadixTree a -> Maybe aradix-tree Data.RadixTree.Word8.Lazy Look up a value at the rightmost key in the tree.
lookupMaxWithKey :: RadixTree a -> Maybe (Lookup a)radix-tree Data.RadixTree.Word8.Lazy Look up a value at the rightmost key in the tree.
lookupMin :: RadixTree a -> Maybe aradix-tree Data.RadixTree.Word8.Lazy Look up a value at the leftmost key in the tree.
lookupMinWithKey :: RadixTree a -> Maybe (Lookup a)radix-tree Data.RadixTree.Word8.Lazy Look up a value at the leftmost key in the tree.
lookupR :: Openness -> Feed -> RadixTree a -> Maybe (Lookup a)radix-tree Data.RadixTree.Word8.Lazy Look up a value at a smallest key greater than (or equal to) the given key.
lookupL :: Openness -> Feed -> RadixTree a -> Maybe (Lookup a)radix-tree Data.RadixTree.Word8.Strict Look up a value at a largest key smaller than (or equal to) the given key.