Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. lookupMaxWithKey :: Radix1Tree a -> Maybe (Lookup1 a)

   radix-tree	Data.Radix1Tree.Word8.Strict

   Look up a value at the rightmost key in the tree.

2. lookupMin :: Radix1Tree a -> Maybe a

   radix-tree	Data.Radix1Tree.Word8.Strict

   Look up a value at the leftmost key in the tree.

3. lookupMinWithKey :: Radix1Tree a -> Maybe (Lookup1 a)

   radix-tree	Data.Radix1Tree.Word8.Strict

   Look up a value at the leftmost key in the tree.

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

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

6. lookupMax :: RadixTree a -> Maybe a

   radix-tree	Data.RadixTree.Word8.Lazy

   Look up a value at the rightmost key in the tree.

7. lookupMaxWithKey :: RadixTree a -> Maybe (Lookup a)

   radix-tree	Data.RadixTree.Word8.Lazy

   Look up a value at the rightmost key in the tree.

8. lookupMin :: RadixTree a -> Maybe a

   radix-tree	Data.RadixTree.Word8.Lazy

   Look up a value at the leftmost key in the tree.

9. lookupMinWithKey :: RadixTree a -> Maybe (Lookup a)

   radix-tree	Data.RadixTree.Word8.Lazy

   Look up a value at the leftmost key in the tree.

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

Page 103 of many | Previous | Next