Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

  1. lookupIndex :: Ord k => k -> MonoidalMap k a -> Maybe Int

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  2. lookupLE :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  3. lookupLT :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  4. lookupMax :: MonoidalMap k a -> Maybe (k, a)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  5. lookupMin :: MonoidalMap k a -> Maybe (k, a)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  6. lookupGE :: Key -> NEIntMap a -> Maybe (Key, a)

    nonempty-containers Data.IntMap.NonEmpty

    O(log n). Find smallest key greater or equal to the given one and return the corresponding (key, value) pair. 

    lookupGE 3 (fromList ((3,'a') :| [(5,'b')])) == Just (3, 'a')
lookupGE 4 (fromList ((3,'a') :| [(5,'b')])) == Just (5, 'b')
lookupGE 6 (fromList ((3,'a') :| [(5,'b')])) == Nothing

  7. lookupGT :: Key -> NEIntMap a -> Maybe (Key, a)

    nonempty-containers Data.IntMap.NonEmpty

    O(log n). Find smallest key greater than the given one and return the corresponding (key, value) pair. 

    lookupGT 4 (fromList ((3,'a') :| [(5,'b')])) == Just (5, 'b')
lookupGT 5 (fromList ((3,'a') :| [(5,'b')])) == Nothing

  8. lookupLE :: Key -> NEIntMap a -> Maybe (Key, a)

    nonempty-containers Data.IntMap.NonEmpty

    O(log n). Find largest key smaller or equal to the given one and return the corresponding (key, value) pair. 

    lookupLE 2 (fromList ((3,'a') :| [(5,'b')])) == Nothing
lookupLE 4 (fromList ((3,'a') :| [(5,'b')])) == Just (3, 'a')
lookupLE 5 (fromList ((3,'a') :| [(5,'b')])) == Just (5, 'b')

  9. lookupLT :: Key -> NEIntMap a -> Maybe (Key, a)

    nonempty-containers Data.IntMap.NonEmpty

    O(log n). Find largest key smaller than the given one and return the corresponding (key, value) pair. 

    lookupLT 3 (fromList ((3,'a') :| [(5,'b')])) == Nothing
lookupLT 4 (fromList ((3,'a') :| [(5,'b')])) == Just (3, 'a')

  10. lookupGE :: Key -> NEIntSet -> Maybe Key

    nonempty-containers Data.IntSet.NonEmpty

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

    lookupLT 3 (fromList (3 :| [5])) == Just 3
lookupLT 4 (fromList (3 :| [5])) == Just 5
lookupLT 6 (fromList (3 :| [5])) == Nothing

Page 101 of many | Previous | Next