map -package:charset -is:exact -package:ghc -package:base-compat package:Cabal-syntax -is:module

map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b
Cabal-syntax Distribution.Compat.NonEmptySet
map :: (a -> b) -> [a] -> [b]
Cabal-syntax Distribution.Compat.Prelude
data Map k a
Cabal-syntax Distribution.Compat.Prelude
A Map from keys k to values a. The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.
mapMaybe :: (a -> Maybe b) -> [a] -> [b]
Cabal-syntax Distribution.Compat.Prelude
mappend :: Monoid a => a -> a -> a
Cabal-syntax Distribution.Compat.Prelude Distribution.Compat.Semigroup
mapCondTree :: (a -> b) -> (c -> d) -> (Condition v -> Condition w) -> CondTree v c a -> CondTree w d b
Cabal-syntax Distribution.PackageDescription.Configuration Distribution.Types.CondTree
mapTreeConds :: (Condition v -> Condition w) -> CondTree v c a -> CondTree w c a
Cabal-syntax Distribution.PackageDescription.Configuration Distribution.Types.CondTree
mapTreeConstrs :: (c -> d) -> CondTree v c a -> CondTree v d a
Cabal-syntax Distribution.PackageDescription.Configuration Distribution.Types.CondTree
mapTreeData :: (a -> b) -> CondTree v c a -> CondTree v c b
Cabal-syntax Distribution.PackageDescription.Configuration Distribution.Types.CondTree
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).
concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
Cabal-syntax Distribution.Compat.Prelude
fmap :: Functor f => (a -> b) -> f a -> f b
Cabal-syntax Distribution.Compat.Prelude
foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
Cabal-syntax Distribution.Compat.Prelude
gmappend :: (Generic a, GSemigroup (Rep a)) => a -> a -> a
Cabal-syntax Distribution.Compat.Prelude Distribution.Compat.Semigroup
Generically generate a Semigroup (<>) operation for any type implementing Generic. This operation will append two values by point-wise appending their component fields. It is only defined for product types. 
gmappend a (gmappend b c) = gmappend (gmappend a b) c
Lucida_Bitmap_Fonts :: LicenseId
Cabal-syntax Distribution.SPDX Distribution.SPDX.LicenseId
Lucida-Bitmap-Fonts, Lucida Bitmap Fonts License, SPDX License List 3.23
data DependencyMap
Cabal-syntax Distribution.Types.DependencyMap
A map of dependencies. Newtyped since the default monoid instance is not appropriate. The monoid instance uses intersectVersionRanges.
fromDepMap :: DependencyMap -> [Dependency]
Cabal-syntax Distribution.Types.DependencyMap
toDepMap :: [Dependency] -> DependencyMap
Cabal-syntax Distribution.Types.DependencyMap