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

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

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

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

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

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

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

   rattletrap	Rattletrap.Type.Attribute

   No documentation available.

8. lookupAttributeMap :: ClassAttributeMap -> Map CompressedWord U32 -> CompressedWord -> BitGet (Map U32 U32)

   rattletrap	Rattletrap.Type.Attribute

   No documentation available.

9. lookupAttributeName :: ClassAttributeMap -> Map U32 U32 -> CompressedWord -> BitGet Str

   rattletrap	Rattletrap.Type.Attribute

   No documentation available.

10. lookupL :: Ord l => l -> Bimap l r -> Maybe r

    rattletrap	Rattletrap.Type.ClassAttributeMap

    No documentation available.

Page 142 of many | Previous | Next