Hoogle Search

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

htmlEntityMap :: HashMap Text Text

html-entity-map Data.HTML.Entities

Map from HTML5 entity names to the corresponding Unicode text. The names do not include the starting & and the ending ;, only the name itself.
concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

ihaskell IHaskellPrelude

Map a function over all the elements of a container and concatenate the resulting lists.
Examples
Basic usage:
```
>>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
[1,2,3,10,11,12,100,101,102,1000,1001,1002]
```
```
>>> concatMap (take 3) (Just [1..])
[1,2,3]
```
contramap :: Contravariant f => (a' -> a) -> f a -> f a'

incipit-base Incipit.Base

No documentation available.
fmap :: Functor f => (a -> b) -> f a -> f b

incipit-base Incipit.Base

fmap is used to apply a function of type (a -> b) to a value of type f a, where f is a functor, to produce a value of type f b. Note that for any type constructor with more than one parameter (e.g., Either), only the last type parameter can be modified with fmap (e.g., b in `Either a b`). Some type constructors with two parameters or more have a Bifunctor instance that allows both the last and the penultimate parameters to be mapped over.
Examples
Convert from a Maybe Int to a Maybe String using show:
```
>>> fmap show Nothing
Nothing

>>> fmap show (Just 3)
Just "3"
```
Convert from an Either Int Int to an Either Int String using show:
```
>>> fmap show (Left 17)
Left 17

>>> fmap show (Right 17)
Right "17"
```
Double each element of a list:
```
>>> fmap (*2) [1,2,3]
[2,4,6]
```
Apply even to the second element of a pair:
```
>>> fmap even (2,2)
(2,True)
```
It may seem surprising that the function is only applied to the last element of the tuple compared to the list example above which applies it to every element in the list. To understand, remember that tuples are type constructors with multiple type parameters: a tuple of 3 elements (a,b,c) can also be written (,,) a b c and its Functor instance is defined for Functor ((,,) a b) (i.e., only the third parameter is free to be mapped over with fmap). It explains why fmap can be used with tuples containing values of different types as in the following example:
```
>>> fmap even ("hello", 1.0, 4)
("hello",1.0,True)
```
concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

incipit-base Incipit.Foldable

Map a function over all the elements of a container and concatenate the resulting lists.
Examples
Basic usage:
```
>>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
[1,2,3,10,11,12,100,101,102,1000,1001,1002]
```
```
>>> concatMap (take 3) (Just [1..])
[1,2,3]
```
foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m

incipit-base Incipit.Foldable

Map each element of the structure into a monoid, and combine the results with (<>). This fold is right-associative and lazy in the accumulator. For strict left-associative folds consider foldMap' instead.
Examples
Basic usage:
```
>>> foldMap Sum [1, 3, 5]
Sum {getSum = 9}
```
```
>>> foldMap Product [1, 3, 5]
Product {getProduct = 15}
```
```
>>> foldMap (replicate 3) [1, 2, 3]
[1,1,1,2,2,2,3,3,3]
```
When a Monoid's (<>) is lazy in its second argument, foldMap can return a result even from an unbounded structure. For example, lazy accumulation enables Data.ByteString.Builder to efficiently serialise large data structures and produce the output incrementally:
```
>>> import qualified Data.ByteString.Lazy as L

>>> import qualified Data.ByteString.Builder as B

>>> let bld :: Int -> B.Builder; bld i = B.intDec i <> B.word8 0x20

>>> let lbs = B.toLazyByteString $ foldMap bld [0..]

>>> L.take 64 lbs
"0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24"
```

html-entity-map	Data.HTML.Entities

ihaskell	IHaskellPrelude

incipit-base	Incipit.Base

incipit-base	Incipit.Base

foldMap' :: (Foldable t, Monoid m) => (a -> m) -> t a -> m

incipit-base	Incipit.Foldable

A left-associative variant of foldMap that is strict in the accumulator. Use this method for strict reduction when partial results are merged via (<>).

Examples

Define a Monoid over finite bit strings under xor. Use it to strictly compute the xor of a list of Int values.

>>> :set -XGeneralizedNewtypeDeriving

>>> import Data.Bits (Bits, FiniteBits, xor, zeroBits)

>>> import Data.Foldable (foldMap')

>>> import Numeric (showHex)

>>> 

>>> newtype X a = X a deriving (Eq, Bounded, Enum, Bits, FiniteBits)

>>> instance Bits a => Semigroup (X a) where X a <> X b = X (a `xor` b)

>>> instance Bits a => Monoid    (X a) where mempty     = X zeroBits

>>> 

>>> let bits :: [Int]; bits = [0xcafe, 0xfeed, 0xdeaf, 0xbeef, 0x5411]

>>> (\ (X a) -> showString "0x" . showHex a $ "") $ foldMap' X bits
"0x42"

data IntMap a

incipit-base Incipit.Libraries

A map of integers to values a.
module Data.ShareMap

No documentation available.
data ShareMap k v

liquid-fixpoint Data.ShareMap

A HashMap that can share the values of some entries If two keys k1 and k2 are mapped to single v, updating the entry for k1 also updates the entry for k2 and viceversa. The user of the map is responsible for indicating which keys are going to share their values. Keys can be updated with shareMapInsertWith and mergeKeysWith.

incipit-base	Incipit.Libraries

liquid-fixpoint	Data.ShareMap

Page 1064 of many | Previous | Next