Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. lookupLE :: KnownIntSet s => Int -> Maybe (Element s)

    refined-containers Data.IntSet.Refined

    Find the largest element smaller or equal to the given one.

  2. lookupLT :: KnownIntSet s => Int -> Maybe (Element s)

    refined-containers Data.IntSet.Refined

    Find the largest element smaller than the given one.

  3. lookupGE :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Refined

    Find the smallest key greater or equal to the given one, and return the associated key-value pair.

  4. lookupGT :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Refined

    Find the smallest key greater than the given one, and return the associated key-value pair.

  5. lookupLE :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Refined

    Find the largest key smaller or equal to the given one, and return the associated key-value pair.

  6. lookupLT :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Refined

    Find the largest key smaller than the given one, and return the associated key-value pair.

  7. lookupGE :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Strict.Refined

    Find the smallest key greater or equal to the given one, and return the associated key-value pair.

  8. lookupGT :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Strict.Refined

    Find the smallest key greater than the given one, and return the associated key-value pair.

  9. lookupLE :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Strict.Refined

    Find the largest key smaller or equal to the given one, and return the associated key-value pair.

  10. lookupLT :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

    refined-containers Data.Map.Strict.Refined

    Find the largest key smaller than the given one, and return the associated key-value pair.

Page 165 of many | Previous | Next