Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. newtype IntMapOf k v

   semirings	Data.Semiring

   Wrapper to mimic Map (Sum Int) v, Map (Product Int) v, etc., while having a more efficient underlying representation.

2. IntMapOf :: IntMap v -> IntMapOf k v

   semirings	Data.Semiring

   No documentation available.

3. foldMapP :: (Foldable t, Semiring s) => (a -> s) -> t a -> s

   semirings	Data.Semiring

   Map each element of the structure to a semiring, and combine the results using plus.

4. foldMapT :: (Foldable t, Semiring s) => (a -> s) -> t a -> s

   semirings	Data.Semiring

   Map each element of the structure to a semiring, and combine the results using times.

5. getIntMap :: IntMapOf k v -> IntMap v

   semirings	Data.Semiring

   No documentation available.

6. fmapOpt :: (a -> b) -> OptDescr a -> OptDescr b

   snap-server	Snap.Http.Server.Config

   No documentation available.

7. fmapOpt :: (a -> b) -> OptDescr a -> OptDescr b

   snap-server	Snap.Internal.Http.Server.Config

   No documentation available.

8. module Language.Haskell.TH.Desugar.OMap

   An OMap behaves much like a Map, with all the same asymptotics, but also remembers the order that keys were inserted. This module offers a simplified version of the Data.Map.Ordered API that assumes left-biased indices everywhere and uses a different Semigroup instance (the one in this module uses (<>) = union) and Monoid instance (the one in this module uses mappend = union).

9. newtype OMap k v

   th-desugar	Language.Haskell.TH.Desugar.OMap

   An ordered map whose insertPre, insertPost, intersection, intersectionWithKey, union, and unionWithKey operations are biased towards leftmost indices when when breaking ties between keys.

10. OMap :: Bias L (OMap k v) -> OMap k v

    th-desugar	Language.Haskell.TH.Desugar.OMap

    No documentation available.

Page 578 of many | Previous | Next