/usr/share/doc/haskell-edison-api-doc/html/Data-Edison-Prelude.html is in libghc-edison-api-doc 1.2.1-17.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 | <!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.Edison.Prelude</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-Edison-Prelude.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Edison-Prelude.html">Source</a></li><li><a href="index.html">Contents</a></li><li><a href="doc-index.html">Index</a></li></ul><p class="caption">EdisonAPI-1.2.1: A library of efficient, purely-functional data structures (API)</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Portability</th><td>GHC, Hugs (MPTC and FD)</td></tr><tr><th>Stability</th><td>stable</td></tr><tr><th>Maintainer</th><td>robdockins AT fastmail DOT fm</td></tr><tr><th>Safe Haskell</th><td>Safe-Infered</td></tr></table><p class="caption">Data.Edison.Prelude</p></div><div id="table-of-contents"><p class="caption">Contents</p><ul><li><a href="#g:1">Hashing classes
</a></li></ul></div><div id="description"><p class="caption">Description</p><div class="doc"><p>This module is a central depository of common definitions
used throughout Edison.
</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="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Eq.html#t:Eq">Eq</a> a => <a href="#t:Hash">Hash</a> a <span class="keyword">where</span><ul class="subs"><li><a href="#v:hash">hash</a> :: a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Int.html#t:Int">Int</a></li></ul></li><li class="src short"><span class="keyword">class</span> <a href="Data-Edison-Prelude.html#t:Hash">Hash</a> a => <a href="#t:UniqueHash">UniqueHash</a> a </li><li class="src short"><span class="keyword">class</span> <a href="Data-Edison-Prelude.html#t:UniqueHash">UniqueHash</a> a => <a href="#t:ReversibleHash">ReversibleHash</a> a <span class="keyword">where</span><ul class="subs"><li><a href="#v:unhash">unhash</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Int.html#t:Int">Int</a> -> a</li></ul></li><li class="src short"><span class="keyword">class</span> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Monoid.html#t:Monoid">Monoid</a> v => <a href="#t:Measured">Measured</a> v a | a -> v <span class="keyword">where</span><ul class="subs"><li><a href="#v:measure">measure</a> :: a -> v</li></ul></li></ul></div><div id="interface"><h1 id="g:1">Hashing classes
</h1><div class="top"><p class="src"><span class="keyword">class</span> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Eq.html#t:Eq">Eq</a> a => <a name="t:Hash" class="def">Hash</a> a <span class="keyword">where</span><a href="src/Data-Edison-Prelude.html#Hash" class="link">Source</a></p><div class="doc"><p>This class represents hashable objects. If obeys the
following invariant:
</p><pre>forall x,y :: a. (x == y) implies (hash x == hash y)</pre></div><div class="subs methods"><p class="caption">Methods</p><p class="src"><a name="v:hash" class="def">hash</a> :: a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Int.html#t:Int">Int</a><a href="src/Data-Edison-Prelude.html#hash" class="link">Source</a></p></div></div><div class="top"><p class="src"><span class="keyword">class</span> <a href="Data-Edison-Prelude.html#t:Hash">Hash</a> a => <a name="t:UniqueHash" class="def">UniqueHash</a> a <a href="src/Data-Edison-Prelude.html#UniqueHash" class="link">Source</a></p><div class="doc"><p>This class represents hashable objects where the hash function
is <em>unique</em> (injective). There are no new methods, just a
stronger invariant:
</p><pre>forall x,y :: a. (x == y) iff (hash x == hash y)</pre></div></div><div class="top"><p class="src"><span class="keyword">class</span> <a href="Data-Edison-Prelude.html#t:UniqueHash">UniqueHash</a> a => <a name="t:ReversibleHash" class="def">ReversibleHash</a> a <span class="keyword">where</span><a href="src/Data-Edison-Prelude.html#ReversibleHash" class="link">Source</a></p><div class="doc"><p>This class represents hashable objects where the hash is
reversible.
</p><pre>forall x :: a. unhash (hash x) == x</pre><p>Note that:
</p><pre>hash (unhash i) == i</pre><p>does not necessarily hold because <code><a href="Data-Edison-Prelude.html#v:unhash">unhash</a></code> is not necessarily
defined for all <code>i</code>, only for all <code>i</code> in the range of hash.
</p></div><div class="subs methods"><p class="caption">Methods</p><p class="src"><a name="v:unhash" class="def">unhash</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Int.html#t:Int">Int</a> -> a<a href="src/Data-Edison-Prelude.html#unhash" class="link">Source</a></p></div></div><div class="top"><p class="src"><span class="keyword">class</span> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Monoid.html#t:Monoid">Monoid</a> v => <a name="t:Measured" class="def">Measured</a> v a | a -> v <span class="keyword">where</span><a href="src/Data-Edison-Prelude.html#Measured" class="link">Source</a></p><div class="doc"><p>This class represents a quantity that can be measured. It is
calculated by an associative function with a unit (hence the
<code>Monoid</code> superclass, and by a function which gives the measurement
for an individual item. Some datastructures are able to speed up
the calculation of a measure by caching intermediate values of
the computation.
</p></div><div class="subs methods"><p class="caption">Methods</p><p class="src"><a name="v:measure" class="def">measure</a> :: a -> v<a href="src/Data-Edison-Prelude.html#measure" class="link">Source</a></p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.10.0</p></div></body></html>
|