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.

Exact lookup

1. lookupMax :: Patricia a -> Maybe a

   radix-tree	Data.Patricia.Word.Lazy

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

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

   radix-tree	Data.Patricia.Word.Lazy

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

3. lookupMin :: Patricia a -> Maybe a

   radix-tree	Data.Patricia.Word.Lazy

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

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

   radix-tree	Data.Patricia.Word.Lazy

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

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

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

7. lookupMax :: Patricia a -> Maybe a

   radix-tree	Data.Patricia.Word.Strict

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

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

   radix-tree	Data.Patricia.Word.Strict

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

9. lookupMin :: Patricia a -> Maybe a

   radix-tree	Data.Patricia.Word.Strict

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

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

    radix-tree	Data.Patricia.Word.Strict

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

Page 137 of many | Previous | Next