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. lookupMinWithKey :: Patricia a -> Maybe (Lookup a)

   radix-tree	Data.Patricia.Word.Lazy

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

2. lookupR :: Word -> Patricia a -> Maybe (Lookup a)

   radix-tree	Data.Patricia.Word.Lazy

   Look up a value at a smallest key greater than or equal to the given key.

3. lookupL :: Word -> Patricia a -> Maybe (Lookup a)

   radix-tree	Data.Patricia.Word.Strict

   Look up a value at a largest key smaller than or equal to the given key.

4. lookupMax :: Patricia a -> Maybe a

   radix-tree	Data.Patricia.Word.Strict

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

5. lookupMaxWithKey :: Patricia a -> Maybe (Lookup a)

   radix-tree	Data.Patricia.Word.Strict

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

6. lookupMin :: Patricia a -> Maybe a

   radix-tree	Data.Patricia.Word.Strict

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

7. lookupMinWithKey :: Patricia a -> Maybe (Lookup a)

   radix-tree	Data.Patricia.Word.Strict

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

8. lookupR :: Word -> Patricia a -> Maybe (Lookup a)

   radix-tree	Data.Patricia.Word.Strict

   Look up a value at a smallest key greater than or equal to the given key.

9. lookupL :: Openness -> Feed1 -> Radix1Tree a -> Maybe (Lookup1 a)

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Look up a value at a largest key smaller than (or equal to) the given key.

10. lookupMax :: Radix1Tree a -> Maybe a

    radix-tree	Data.Radix1Tree.Word8.Lazy

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

Page 138 of many | Previous | Next