mirror of
https://github.com/elkowar/dots-of-war.git
synced 2024-12-27 06:32:23 +00:00
116 lines
152 KiB
Text
116 lines
152 KiB
Text
|
<!DOCTYPE HTML>
|
||
|
|
<html>
|
||
|
|
<head profile="http://a9.com/-/spec/opensearch/1.1/">
|
||
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf8" />
|
||
|
|
<title>map package: - Hoogle</title>
|
||
|
|
<meta name="robots" content="index" />
|
||
|
|
<link type="text/css" rel="stylesheet" href="hoogle.css" />
|
||
|
|
<link rel="stylesheet" type="text/css" href="plugin/chosen.css" />
|
||
|
|
<link type="image/png" rel="icon" href="favicon.png" />
|
||
|
|
<link type="image/png" rel="apple-touch-icon" href="favicon57.png" />
|
||
|
|
<link type="application/opensearchdescription+xml" rel="search" href="search.xml" title="Hoogle" />
|
||
|
|
<script type="text/javascript" src="plugin/jquery.js"> </script>
|
||
|
|
<script type="text/javascript" src="plugin/jquery-cookie.js"> </script>
|
||
|
|
<script type="text/javascript" src="plugin/chosen-jquery.js"> </script>
|
||
|
|
<script type="text/javascript" src="hoogle.js"> </script>
|
||
|
|
</head>
|
||
|
|
<body>
|
||
|
|
<div id="links">
|
||
|
|
<ul id="top-menu">
|
||
|
|
<li id="plugin"><a>Search plugin</a></li>
|
||
|
|
<li><a href="https://github.com/ndmitchell/hoogle/blob/master/README.md">Manual</a></li>
|
||
|
|
<li><a href="https://www.haskell.org">haskell.org</a></li>
|
||
|
|
</ul>
|
||
|
|
</div>
|
||
|
|
<form action="" method="get" id="search">
|
||
|
|
<a id="logo" href="https://hoogle.haskell.org">
|
||
|
|
<img src="hoogle.png" width="160" height="58" alt="Hoogle"
|
||
|
|
/></a>
|
||
|
|
<input name="hoogle" id="hoogle" class="HOOGLE_REAL" type="text" autocomplete="off" autofocus="autofocus" accesskey="1" placeholder="Search for..." value="map" />
|
||
|
|
<select name="scope" id="scope" data-live-search="true"><option>set:stackage</option><option>set:haskell-platform</option><option>set:included-with-ghc</option><option>package:abstract-deque</option><option>package:abstract-par</option><option>package:AC-Angle</option><option>package:accuerr</option><option>package:ace</option><option>package:action-permutations</option><option>package:active</option><option>package:ad</option><option>package:adjunctions</option><option>package:adler32</option><option>package:advent-of-code-api</option><option>package:aeson</option><option>package:aeson-attoparsec</option><option>package:aeson-better-errors</option><option>package:aeson-casing</option><option>package:aeson-combinators</option><option>package:aeson-compat</option><option>package:aeson-default</option><option>package:aeson-diff</option><option>package:aeson-generic-compat</option><option>package:aeson-lens</option><option>package:aeson-optics</option><option>package:aeson-picker</option><option>package:aeson-pretty</option><option>package:aeson-qq</option><option>package:aeson-schemas</option><option>package:aeson-utils</option><option>package:aeson-yak</option><option>package:aeson-yaml</option><option>package:al</option><option>package:alarmclock</option><option>package:alerts</option><option>package:alex</option><option>package:alg</option><option>package:algebraic-graphs</option><option>package:Allure</option><option>package:almost-fix</option><option>package:alsa-core</option><option>package:alsa-mixer</option><option>package:alsa-pcm</option><option>package:alsa-seq</option><option>package:alternative-vector</option><option>package:ALUT</option><option>package:amazonka</option><option>package:amazonka-apigateway</option><option>package:amazonka-application-autoscaling</option><option>package:amazonka-appstream</option><option>package:amazonka-athena</option><option>package:amazonka-autoscaling</option><option>package:amazonka-budgets</option><option>package:amazonka-certificatemanager</option><option>package:amazonka-cloudformation</option><option>package:amazonka-cloudfront</option><option>package:amazonka-cloudhsm</option><option>package:amazonka-cloudsearch</option><option>package:amazonka-cloudsearch-domains</option><option>package:amazonka-cloudtrail</option><option>package:amazonka-cloudwatch</option><option>package:amazonka-cloudwatch-events</option><option>package:amazonka-cloudwatch-logs</option><option>package:amazonka-codebuild</option><option>package:amazonka-codecommit</option><option>package:amazonka-codedeploy</option><option>package:amazonka-codepipeline</option><option>package:amazonka-cognito-identity</option><option>package:amazonka-cognito-idp</option><option>package:amazonka-cognito-sync</option><option>package:amazonka-config</option><option>package:amazonka-core</option><option>package:amazonka-datapipeline</option><option>package:amazonka-devicefarm</option><option>package:amazonka-directconnect</option><option>package:amazonka-discovery</option><option>package:amazonka-dms</option><option>package:amazonka-ds</option><option>package:amazonka-dynamodb</option><option>package:amazonka-dynamodb-streams</option><option>package:amazonka-ecr</option><option>package:amazonka-ecs</option><option>package:amazonka-efs</option><option>package:amazonka-elasticache</option><option>package:amazonka-elasticbeanstalk</option><option>package:amazonka-elasticsearch</option><option>package:amazonka-elastictranscoder</option><option>package:amazonka-elb</option><option>package:amazonka-elbv2</option><option>package:amazonka-emr</option><option>package:amazonka-gamelift</option><option>package:amazonka-glacier</option><option>package:amazonka-glue</option><option>package:amazonka-health</option><option>package:amazonka-iam</option><option>package:amazonka-importexport</option><option>package:amazonka-inspector</option><option>package:amazonka-iot</option><option>package:amazonka-iot-dataplane</option><option>package:amazonka-kinesis</option><option>package:amazonka-kinesis-analytics</option><option>package:am
|
||
|
|
<input id="submit" type="submit" value="Search" />
|
||
|
|
</form>
|
||
|
|
<div id="body">
|
||
|
|
<h1>map</h1><ul id="left"><li><b>Packages</b></li><li><a class=" minus" href="?hoogle=map%20-is%3Aexact&scope=package:"></a><a class="plus" href="?hoogle=map%20is%3Aexact&scope=package:">is:exact</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Abase&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Abase&scope=package:">base</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Abytestring&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Abytestring&scope=package:">bytestring</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Acontainers&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Acontainers&scope=package:">containers</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Atext&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Atext&scope=package:">text</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Ahspec&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Ahspec&scope=package:">hspec</a></li><li><a class=" minus" href="?hoogle=map%20-package%3ACabal&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3ACabal&scope=package:">Cabal</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Avector&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Avector&scope=package:">vector</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Aunordered-containers&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Aunordered-containers&scope=package:">unordered-containers</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Aconduit&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Aconduit&scope=package:">conduit</a></li><li><a class=" minus" href="?hoogle=map%20-package%3Acase-insensitive&scope=package:"></a><a class="plus" href="?hoogle=map%20package%3Acase-insensitive&scope=package:">case-insensitive</a></li></ul><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/base/docs/Prelude.html#v:map"><span class=name><b>map</b></span> :: (a -> b) -> [a] -> [b]</a></div><div class="from"><a href="https://hackage.haskell.org/package/base">base</a> <a href="https://hackage.haskell.org/package/base/docs/Prelude.html#v:map">Prelude</a> <a href="https://hackage.haskell.org/package/base/docs/Data-List.html#v:map">Data.List</a> <a href="https://hackage.haskell.org/package/base/docs/GHC-List.html#v:map">GHC.List</a> <a href="https://hackage.haskell.org/package/base/docs/GHC-OldList.html#v:map">GHC.OldList</a></div><div class="doc newline shut"><a>map</a> <tt>f xs</tt> is the list obtained by applying <tt>f</tt>
|
||
|
|
to each element of <tt>xs</tt>, i.e.,
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
|
||
|
|
map f [x1, x2, ...] == [f x1, f x2, ...]
|
||
|
|
</pre>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/base/docs/Data-List-NonEmpty.html#v:map"><span class=name><b>map</b></span> :: (a -> b) -> NonEmpty a -> NonEmpty b</a></div><div class="from"><a href="https://hackage.haskell.org/package/base">base</a> <a href="https://hackage.haskell.org/package/base/docs/Data-List-NonEmpty.html#v:map">Data.List.NonEmpty</a></div><div class="doc newline shut">Map a function over a <a>NonEmpty</a> stream.
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/bytestring/docs/Data-ByteString.html#v:map"><span class=name><b>map</b></span> :: (Word8 -> Word8) -> ByteString -> ByteString</a></div><div class="from"><a href="https://hackage.haskell.org/package/bytestring">bytestring</a> <a href="https://hackage.haskell.org/package/bytestring/docs/Data-ByteString.html#v:map">Data.ByteString</a> <a href="https://hackage.haskell.org/package/bytestring/docs/Data-ByteString-Lazy.html#v:map">Data.ByteString.Lazy</a></div><div class="doc newline shut"><i>O(n)</i> <a>map</a> <tt>f xs</tt> is the ByteString obtained by
|
||
|
|
applying <tt>f</tt> to each element of <tt>xs</tt>.
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/bytestring/docs/Data-ByteString-Char8.html#v:map"><span class=name><b>map</b></span> :: (Char -> Char) -> ByteString -> ByteString</a></div><div class="from"><a href="https://hackage.haskell.org/package/bytestring">bytestring</a> <a href="https://hackage.haskell.org/package/bytestring/docs/Data-ByteString-Char8.html#v:map">Data.ByteString.Char8</a> <a href="https://hackage.haskell.org/package/bytestring/docs/Data-ByteString-Lazy-Char8.html#v:map">Data.ByteString.Lazy.Char8</a></div><div class="doc newline shut"><i>O(n)</i> <a>map</a> <tt>f xs</tt> is the ByteString obtained by
|
||
|
|
applying <tt>f</tt> to each element of <tt>xs</tt>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/containers/docs/Data-IntMap-Internal.html#v:map"><span class=name><b>map</b></span> :: (a -> b) -> IntMap a -> IntMap b</a></div><div class="from"><a href="https://hackage.haskell.org/package/containers">containers</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-IntMap-Internal.html#v:map">Data.IntMap.Internal</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-IntMap-Lazy.html#v:map">Data.IntMap.Lazy</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-IntMap-Strict.html#v:map">Data.IntMap.Strict</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-IntMap-Strict-Internal.html#v:map">Data.IntMap.Strict.Internal</a></div><div class="doc newline shut"><i>O(n)</i>. Map a function over all values in the map.
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
|
||
|
|
</pre>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/containers/docs/Data-IntSet.html#v:map"><span class=name><b>map</b></span> :: (Key -> Key) -> IntSet -> IntSet</a></div><div class="from"><a href="https://hackage.haskell.org/package/containers">containers</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-IntSet.html#v:map">Data.IntSet</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-IntSet-Internal.html#v:map">Data.IntSet.Internal</a></div><div class="doc newline shut"><i>O(n*min(n,W))</i>. <tt><a>map</a> f s</tt> is the set obtained by
|
||
|
|
applying <tt>f</tt> to each element of <tt>s</tt>.
|
||
|
|
|
||
|
|
It's worth noting that the size of the result may be smaller if, for
|
||
|
|
some <tt>(x,y)</tt>, <tt>x /= y && f x == f y</tt>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/containers/docs/Data-Map-Internal.html#v:map"><span class=name><b>map</b></span> :: (a -> b) -> Map k a -> Map k b</a></div><div class="from"><a href="https://hackage.haskell.org/package/containers">containers</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-Map-Internal.html#v:map">Data.Map.Internal</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-Map-Lazy.html#v:map">Data.Map.Lazy</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-Map-Strict.html#v:map">Data.Map.Strict</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-Map-Strict-Internal.html#v:map">Data.Map.Strict.Internal</a></div><div class="doc newline shut"><i>O(n)</i>. Map a function over all values in the map.
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
|
||
|
|
</pre>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/containers/docs/Data-Set.html#v:map"><span class=name><b>map</b></span> :: Ord b => (a -> b) -> Set a -> Set b</a></div><div class="from"><a href="https://hackage.haskell.org/package/containers">containers</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-Set.html#v:map">Data.Set</a> <a href="https://hackage.haskell.org/package/containers/docs/Data-Set-Internal.html#v:map">Data.Set.Internal</a></div><div class="doc newline shut"><i>O(n*log n)</i>. <tt><a>map</a> f s</tt> is the set obtained by
|
||
|
|
applying <tt>f</tt> to each element of <tt>s</tt>.
|
||
|
|
|
||
|
|
It's worth noting that the size of the result may be smaller if, for
|
||
|
|
some <tt>(x,y)</tt>, <tt>x /= y && f x == f y</tt>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/text/docs/Data-Text.html#v:map"><span class=name><b>map</b></span> :: (Char -> Char) -> Text -> Text</a></div><div class="from"><a href="https://hackage.haskell.org/package/text">text</a> <a href="https://hackage.haskell.org/package/text/docs/Data-Text.html#v:map">Data.Text</a></div><div class="doc newline shut"><i>O(n)</i> <a>map</a> <tt>f</tt> <tt>t</tt> is the <a>Text</a>
|
||
|
|
obtained by applying <tt>f</tt> to each element of <tt>t</tt>.
|
||
|
|
|
||
|
|
Example:
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
>>> let message = pack "I am not angry. Not at all."
|
||
|
|
|
||
|
|
>>> T.map (\c -> if c == '.' then '!' else c) message
|
||
|
|
"I am not angry! Not at all!"
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
Subject to fusion. Performs replacement on invalid scalar values.
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/text/docs/Data-Text-Internal-Fusion-Common.html#v:map"><span class=name><b>map</b></span> :: (Char -> Char) -> Stream Char -> Stream Char</a></div><div class="from"><a href="https://hackage.haskell.org/package/text">text</a> <a href="https://hackage.haskell.org/package/text/docs/Data-Text-Internal-Fusion-Common.html#v:map">Data.Text.Internal.Fusion.Common</a></div><div class="doc newline shut"><i>O(n)</i> <a>map</a> <tt>f </tt>xs is the Stream Char obtained by
|
||
|
|
applying <tt>f</tt> to each element of <tt>xs</tt>.
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/text/docs/Data-Text-Lazy.html#v:map"><span class=name><b>map</b></span> :: (Char -> Char) -> Text -> Text</a></div><div class="from"><a href="https://hackage.haskell.org/package/text">text</a> <a href="https://hackage.haskell.org/package/text/docs/Data-Text-Lazy.html#v:map">Data.Text.Lazy</a></div><div class="doc newline shut"><i>O(n)</i> <a>map</a> <tt>f</tt> <tt>t</tt> is the <a>Text</a>
|
||
|
|
obtained by applying <tt>f</tt> to each element of <tt>t</tt>. Subject
|
||
|
|
to fusion. Performs replacement on invalid scalar values.
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/hspec/docs/Test-Hspec-Discover.html#v:map"><span class=name><b>map</b></span> :: () => (a -> b) -> [a] -> [b]</a></div><div class="from"><a href="https://hackage.haskell.org/package/hspec">hspec</a> <a href="https://hackage.haskell.org/package/hspec/docs/Test-Hspec-Discover.html#v:map">Test.Hspec.Discover</a>, <a href="https://hackage.haskell.org/package/Cabal">Cabal</a> <a href="https://hackage.haskell.org/package/Cabal/docs/Distribution-Compat-Prelude-Internal.html#v:map">Distribution.Compat.Prelude.Internal</a></div><div class="doc newline shut"><a>map</a> <tt>f xs</tt> is the list obtained by applying <tt>f</tt>
|
||
|
|
to each element of <tt>xs</tt>, i.e.,
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
|
||
|
|
map f [x1, x2, ...] == [f x1, f x2, ...]
|
||
|
|
</pre>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector.html#v:map"><span class=name><b>map</b></span> :: (a -> b) -> Vector a -> Vector b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector.html#v:map">Data.Vector</a></div><div class="doc newline shut"><i>O(n)</i> Map a function over a vector
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Fusion-Bundle.html#v:map"><span class=name><b>map</b></span> :: (a -> b) -> Bundle v a -> Bundle v b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Fusion-Bundle.html#v:map">Data.Vector.Fusion.Bundle</a></div><div class="doc newline shut">Map a function over a <a>Bundle</a>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Fusion-Bundle-Monadic.html#v:map"><span class=name><b>map</b></span> :: Monad m => (a -> b) -> Bundle m v a -> Bundle m v b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Fusion-Bundle-Monadic.html#v:map">Data.Vector.Fusion.Bundle.Monadic</a></div><div class="doc newline shut">Map a function over a <a>Bundle</a>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Fusion-Stream-Monadic.html#v:map"><span class=name><b>map</b></span> :: Monad m => (a -> b) -> Stream m a -> Stream m b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Fusion-Stream-Monadic.html#v:map">Data.Vector.Fusion.Stream.Monadic</a></div><div class="doc newline shut">Map a function over a <a>Stream</a>
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Generic.html#v:map"><span class=name><b>map</b></span> :: (Vector v a, Vector v b) => (a -> b) -> v a -> v b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Generic.html#v:map">Data.Vector.Generic</a></div><div class="doc newline shut"><i>O(n)</i> Map a function over a vector
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Primitive.html#v:map"><span class=name><b>map</b></span> :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Primitive.html#v:map">Data.Vector.Primitive</a></div><div class="doc newline shut"><i>O(n)</i> Map a function over a vector
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Storable.html#v:map"><span class=name><b>map</b></span> :: (Storable a, Storable b) => (a -> b) -> Vector a -> Vector b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Storable.html#v:map">Data.Vector.Storable</a></div><div class="doc newline shut"><i>O(n)</i> Map a function over a vector
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Unboxed.html#v:map"><span class=name><b>map</b></span> :: (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b</a></div><div class="from"><a href="https://hackage.haskell.org/package/vector">vector</a> <a href="https://hackage.haskell.org/package/vector/docs/Data-Vector-Unboxed.html#v:map">Data.Vector.Unboxed</a></div><div class="doc newline shut"><i>O(n)</i> Map a function over a vector
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/unordered-containers/docs/Data-HashMap-Lazy.html#v:map"><span class=name><b>map</b></span> :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2</a></div><div class="from"><a href="https://hackage.haskell.org/package/unordered-containers">unordered-containers</a> <a href="https://hackage.haskell.org/package/unordered-containers/docs/Data-HashMap-Lazy.html#v:map">Data.HashMap.Lazy</a> <a href="https://hackage.haskell.org/package/unordered-containers/docs/Data-HashMap-Strict.html#v:map">Data.HashMap.Strict</a></div><div class="doc newline shut"><i>O(n)</i> Transform this map by applying a function to every value.
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/unordered-containers/docs/Data-HashSet.html#v:map"><span class=name><b>map</b></span> :: (Hashable b, Eq b) => (a -> b) -> HashSet a -> HashSet b</a></div><div class="from"><a href="https://hackage.haskell.org/package/unordered-containers">unordered-containers</a> <a href="https://hackage.haskell.org/package/unordered-containers/docs/Data-HashSet.html#v:map">Data.HashSet</a></div><div class="doc newline shut"><i>O(n)</i> Transform this set by applying a function to every value.
|
||
|
|
The resulting set may be smaller than the source.
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/conduit/docs/Data-Conduit-Combinators.html#v:map"><span class=name><b>map</b></span> :: Monad m => (a -> b) -> ConduitT a b m ()</a></div><div class="from"><a href="https://hackage.haskell.org/package/conduit">conduit</a> <a href="https://hackage.haskell.org/package/conduit/docs/Data-Conduit-Combinators.html#v:map">Data.Conduit.Combinators</a></div><div class="doc newline shut">Apply a transformation to all values in a stream.
|
||
|
|
|
||
|
|
Subject to fusion
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/conduit/docs/Data-Conduit-List.html#v:map"><span class=name><b>map</b></span> :: Monad m => (a -> b) -> ConduitT a b m ()</a></div><div class="from"><a href="https://hackage.haskell.org/package/conduit">conduit</a> <a href="https://hackage.haskell.org/package/conduit/docs/Data-Conduit-List.html#v:map">Data.Conduit.List</a></div><div class="doc newline shut">Apply a transformation to all values in a stream.
|
||
|
|
|
||
|
|
Subject to fusion
|
||
|
|
|
||
|
|
Since 0.3.0
|
||
|
|
</div></div><div class="result"><div class="ans"><a href="https://hackage.haskell.org/package/case-insensitive/docs/Data-CaseInsensitive.html#v:map"><span class=name><b>map</b></span> :: FoldCase s2 => (s1 -> s2) -> CI s1 -> CI s2</a></div><div class="from"><a href="https://hackage.haskell.org/package/case-insensitive">case-insensitive</a> <a href="https://hackage.haskell.org/package/case-insensitive/docs/Data-CaseInsensitive.html#v:map">Data.CaseInsensitive</a></div><div class="doc newline shut">Transform the original string-like value but keep it case insensitive.
|
||
|
|
</div></div>
|
||
|
|
</div>
|
||
|
|
<div id="footer">© <a href="http://ndmitchell.com">Neil Mitchell</a> 2004-2020, version 5.0.17.15 2020-03-17 03:14</div>
|
||
|
|
</body>
|
||
|
|
</html>
|