Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

Exact lookup

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

2. lookupMax :: RadixTree a -> Maybe a

   radix-tree	Data.RadixTree.Word8.Lazy

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

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

   radix-tree	Data.RadixTree.Word8.Lazy

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

4. lookupMin :: RadixTree a -> Maybe a

   radix-tree	Data.RadixTree.Word8.Lazy

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

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

   radix-tree	Data.RadixTree.Word8.Lazy

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

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

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

8. lookupMax :: RadixTree a -> Maybe a

   radix-tree	Data.RadixTree.Word8.Strict

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

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

   radix-tree	Data.RadixTree.Word8.Strict

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

10. lookupMin :: RadixTree a -> Maybe a

    radix-tree	Data.RadixTree.Word8.Strict

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

Page 140 of many | Previous | Next