Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

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

   snap-server	Snap.Http.Server.Config

   No documentation available.

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

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

   No documentation available.

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

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

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

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

   No documentation available.

6. toMap :: OMap k v -> Map k v

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

   No documentation available.

7. newtype OMap k v

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

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

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

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

   No documentation available.

9. toMap :: OMap k v -> Map k v

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

   No documentation available.

10. module Text.XML.HaXml.TypeMapping

    No documentation available.

Page 572 of many | Previous | Next