Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. m33AffineMap :: Num n => M33 n -> V2 n -> AffineMap V3 V2 n

   diagrams-lib	Diagrams.ThreeD.Projection

   Create an AffineMap from a 3x3 transformation matrix and a translation vector.

2. m44AffineMap :: Num n => M44 n -> AffineMap V3 V2 n

   diagrams-lib	Diagrams.ThreeD.Projection

   Create an AffineMap from a 4x4 homogeneous matrix, ignoring any perspective transforms.

3. type ExtensionMap = Map MimeType [Extension]

   mime-types	Network.Mime

   Maps mime types to extensions. The list of extensions is in alphabetical order.

4. type MimeMap = Map Extension MimeType

   mime-types	Network.Mime

   Maps extensions to mime types.

5. defaultExtensionMap :: ExtensionMap

   mime-types	Network.Mime

   A mapping of MimeType to a set of Extensions.

6. defaultMimeMap :: MimeMap

   mime-types	Network.Mime

   A default mapping from filename extension to mime type. Generated from the Apache and nginx mime.types files.

7. concatMap :: TextualMonoid t => (Char -> t) -> t -> t

   monoid-subclasses	Data.Monoid.Textual

   Equivalent to concatMap from Data.List with a Char -> String function. Preserves all non-character data.

8. foldMap :: (Factorial m, Monoid n) => (m -> n) -> m -> n

   monoid-subclasses	Data.Semigroup.Factorial

   Generalizes foldMap from Data.Foldable, except the function arguments are prime factors rather than the structure elements.

9. toMap :: Graph a -> Map (Key a) a

   Cabal-syntax	Distribution.Compat.Graph

   O(1). Convert a graph into a map from keys to nodes. The resulting map m is guaranteed to have the property that all ((k,n) -> k == nodeKey n) (toList m).

10. concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

    Cabal-syntax	Distribution.Compat.Prelude

    No documentation available.

Page 502 of many | Previous | Next