Sophie

Sophie

distrib > Mageia > 5 > i586 > media > core-release > by-pkgid > 6e204a966e8c42d976f99a1700ce5f20 > files > 2246

ghc-7.4.2-4.mga5.i586.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Data.Functor</title><link href="ocean.css" rel="stylesheet" type="text/css" title="Ocean" /><script src="haddock-util.js" type="text/javascript"></script><script type="text/javascript">//<![CDATA[
window.onload = function () {pageLoad();setSynopsis("mini_Data-Functor.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="index.html">Contents</a></li><li><a href="doc-index.html">Index</a></li></ul><p class="caption">base-4.5.1.0: Basic libraries</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Portability</th><td>portable</td></tr><tr><th>Stability</th><td>provisional</td></tr><tr><th>Maintainer</th><td>libraries@haskell.org</td></tr><tr><th>Safe Haskell</th><td>Trustworthy</td></tr></table><p class="caption">Data.Functor</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Functors: uniform action over a parameterized type, generalizing the
 <code><a href="Data-List.html#v:map">map</a></code> function on lists.
</p></div></div><div id="synopsis"><p id="control.syn" class="caption expander" onclick="toggleSection('syn')">Synopsis</p><ul id="section.syn" class="hide" onclick="toggleSection('syn')"><li class="src short"><span class="keyword">class</span>  <a href="#t:Functor">Functor</a> f  <span class="keyword">where</span><ul class="subs"><li><a href="#v:fmap">fmap</a> ::  (a -&gt; b) -&gt; f a -&gt; f b</li><li><a href="#v:-60--36-">(&lt;$)</a> ::  a -&gt; f b -&gt; f a</li></ul></li><li class="src short"><a href="#v:-60--36--62-">(&lt;$&gt;)</a> :: <a href="Data-Functor.html#t:Functor">Functor</a> f =&gt; (a -&gt; b) -&gt; f a -&gt; f b</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><span class="keyword">class</span>  <a name="t:Functor" class="def">Functor</a> f  <span class="keyword">where</span></p><div class="doc"><p>The <code><a href="Data-Functor.html#t:Functor">Functor</a></code> class is used for types that can be mapped over.
Instances of <code><a href="Data-Functor.html#t:Functor">Functor</a></code> should satisfy the following laws:
</p><pre> fmap id  ==  id
 fmap (f . g)  ==  fmap f . fmap g
</pre><p>The instances of <code><a href="Data-Functor.html#t:Functor">Functor</a></code> for lists, <code><a href="Data-Maybe.html#t:Maybe">Maybe</a></code> and <code><a href="System-IO.html#t:IO">IO</a></code>
satisfy these laws.
</p></div><div class="subs methods"><p class="caption">Methods</p><p class="src"><a name="v:fmap" class="def">fmap</a> ::  (a -&gt; b) -&gt; f a -&gt; f b</p><p class="src"><a name="v:-60--36-" class="def">(&lt;$)</a> ::  a -&gt; f b -&gt; f a</p><div class="doc"><p>Replace all locations in the input with the same value.
 The default definition is <code><code><a href="Data-Functor.html#v:fmap">fmap</a></code> . <code><a href="Prelude.html#v:const">const</a></code></code>, but this may be
 overridden with a more efficient version.
</p></div></div><div class="subs instances"><p id="control.i:Functor" class="caption collapser" onclick="toggleSection('i:Functor')">Instances</p><div id="section.i:Functor" class="show"><table><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> []</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> <a href="System-IO.html#t:IO">IO</a></td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> <a href="Data-Maybe.html#t:Maybe">Maybe</a></td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> <a href="Text-ParserCombinators-ReadP.html#t:ReadP">ReadP</a></td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> <a href="Text-ParserCombinators-ReadPrec.html#t:ReadPrec">ReadPrec</a></td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> <a href="GHC-Conc.html#t:STM">STM</a></td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> <a href="Control-Applicative.html#t:ZipList">ZipList</a></td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> Id</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> ((-&gt;) r)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> (<a href="Data-Either.html#t:Either">Either</a> a)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> (<a href="../ghc-prim-0.2.0.0/GHC-Tuple.html#t:-40--44--41-">(,)</a> a)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> (<a href="Control-Monad-ST-Safe.html#t:ST">ST</a> s)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Ix.html#t:Ix">Ix</a> i =&gt; <a href="Data-Functor.html#t:Functor">Functor</a> (Array i)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> (<a href="Control-Monad-ST-Lazy-Safe.html#t:ST">ST</a> s)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Control-Monad.html#t:Monad">Monad</a> m =&gt; <a href="Data-Functor.html#t:Functor">Functor</a> (<a href="Control-Applicative.html#t:WrappedMonad">WrappedMonad</a> m)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> (<a href="Control-Applicative.html#t:Const">Const</a> m)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> (StateR s)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Data-Functor.html#t:Functor">Functor</a> (StateL s)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="Control-Arrow.html#t:Arrow">Arrow</a> a =&gt; <a href="Data-Functor.html#t:Functor">Functor</a> (<a href="Control-Applicative.html#t:WrappedArrow">WrappedArrow</a> a b)</td><td class="doc empty">&nbsp;</td></tr></table></div></div></div><div class="top"><p class="src"><a name="v:-60--36--62-" class="def">(&lt;$&gt;)</a> :: <a href="Data-Functor.html#t:Functor">Functor</a> f =&gt; (a -&gt; b) -&gt; f a -&gt; f b</p><div class="doc"><p>An infix synonym for <code><a href="Data-Functor.html#v:fmap">fmap</a></code>.
</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.11.0</p></div></body></html>