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. lookupLT :: Int -> RIntSet -> Maybe Int

   range-set-list	Data.RangeSet.IntMap

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

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

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

4. lookupLE :: Ord a => a -> RSet a -> Maybe a

   range-set-list	Data.RangeSet.List

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

5. lookupLT :: (Ord a, Enum a) => a -> RSet a -> Maybe a

   range-set-list	Data.RangeSet.List

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

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

   range-set-list	Data.RangeSet.Map

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

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

   range-set-list	Data.RangeSet.Map

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

8. lookupLE :: Ord a => a -> RSet a -> Maybe a

   range-set-list	Data.RangeSet.Map

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

9. lookupLT :: (Ord a, Enum a) => a -> RSet a -> Maybe a

   range-set-list	Data.RangeSet.Map

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

10. lookupAttributeIdLimit :: Map U32 U32 -> CompressedWord -> BitGet Word

    rattletrap	Rattletrap.Type.Attribute

    No documentation available.

Page 141 of many | Previous | Next