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 :: RadixTree a -> Maybe (Lookup a)

   radix-tree	Data.RadixTree.Word8.Strict

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

2. lookupR :: Openness -> Feed -> RadixTree a -> Maybe (Lookup a)

   radix-tree	Data.RadixTree.Word8.Strict

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

3. lookupL :: Color -> Word -> Zebra -> Maybe Word

   radix-tree	Data.Zebra.Word

   Look up the key of the given color that is smaller than or equal to the given key.

4. lookupR :: Color -> Word -> Zebra -> Maybe Word

   radix-tree	Data.Zebra.Word

   Look up the key of the given color that is greater than or equal to the given key.

5. lookupGE :: Int -> RIntSet -> Maybe Int

   range-set-list	Data.RangeSet.IntMap

   O(log n). Find smallest element greater or equal to than the given one.

6. lookupGT :: Int -> RIntSet -> Maybe Int

   range-set-list	Data.RangeSet.IntMap

   O(log n). Find smallest element greater than the given one.

7. lookupLE :: Int -> RIntSet -> Maybe Int

   range-set-list	Data.RangeSet.IntMap

   O(log n). Find largest element smaller or equal to than the given one.

8. lookupLT :: Int -> RIntSet -> Maybe Int

   range-set-list	Data.RangeSet.IntMap

   O(log n). Find largest element smaller than the given one.

9. lookupGE :: Ord a => a -> RSet a -> Maybe a

   range-set-list	Data.RangeSet.List

   O(n). Find smallest element greater or equal to than the given one.

10. lookupGT :: (Ord a, Enum a) => a -> RSet a -> Maybe a

    range-set-list	Data.RangeSet.List

    O(n). Find smallest element greater than the given one.

Page 141 of many | Previous | Next