This file is indexed.

/usr/share/doc/libghc-edison-api-doc/html/Data-Edison-Coll-Utils.html is in libghc-edison-api-doc 1.3.1-2.

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
<!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.Coll.Utils</title><link href="ocean.css" rel="stylesheet" type="text/css" title="Ocean" /><script src="haddock-util.js" type="text/javascript"></script><script src="file:///usr/share/javascript/mathjax/MathJax.js" type="text/javascript"></script><script type="text/javascript">//<![CDATA[
window.onload = function () {pageLoad();setSynopsis("mini_Data-Edison-Coll-Utils.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Edison-Coll-Utils.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.3.1: A library of efficient, purely-functional data structures (API)</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Copyright</th><td>Copyright (c) 1998 Chris Okasaki</td></tr><tr><th>License</th><td>MIT; see COPYRIGHT file for terms and conditions</td></tr><tr><th>Maintainer</th><td>robdockins AT fastmail DOT fm</td></tr><tr><th>Stability</th><td>stable</td></tr><tr><th>Portability</th><td>GHC, Hugs (MPTC and FD)</td></tr><tr><th>Safe Haskell</th><td>Safe</td></tr><tr><th>Language</th><td>Haskell2010</td></tr></table><p class="caption">Data.Edison.Coll.Utils</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>This module provides implementations of several useful operations
   that are not included in the collection classes themselves.  This is
   usually because the operation involves transforming a collection into a
   different type of collection; such operations cannot be typed using
   the collection classes without significantly complicating them.</p><p>Be aware that these functions are defined using the external class
   interfaces and may be less efficient than corresponding, but more
   restrictively typed, functions in the collection classes.</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"><a href="#v:map">map</a> :: (<a href="Data-Edison-Coll.html#t:Coll">Coll</a> cin a, <a href="Data-Edison-Coll.html#t:CollX">CollX</a> cout b) =&gt; (a -&gt; b) -&gt; cin -&gt; cout</li><li class="src short"><a href="#v:mapPartial">mapPartial</a> :: (<a href="Data-Edison-Coll.html#t:Coll">Coll</a> cin a, <a href="Data-Edison-Coll.html#t:CollX">CollX</a> cout b) =&gt; (a -&gt; <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Maybe.html#t:Maybe">Maybe</a> b) -&gt; cin -&gt; cout</li><li class="src short"><a href="#v:unsafeMapMonotonic">unsafeMapMonotonic</a> :: (<a href="Data-Edison-Coll.html#t:OrdColl">OrdColl</a> cin a, <a href="Data-Edison-Coll.html#t:OrdCollX">OrdCollX</a> cout b) =&gt; (a -&gt; b) -&gt; cin -&gt; cout</li><li class="src short"><a href="#v:unionMap">unionMap</a> :: (<a href="Data-Edison-Coll.html#t:Coll">Coll</a> cin a, <a href="Data-Edison-Coll.html#t:CollX">CollX</a> cout b) =&gt; (a -&gt; cout) -&gt; cin -&gt; cout</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a id="v:map" class="def">map</a> :: (<a href="Data-Edison-Coll.html#t:Coll">Coll</a> cin a, <a href="Data-Edison-Coll.html#t:CollX">CollX</a> cout b) =&gt; (a -&gt; b) -&gt; cin -&gt; cout <a href="src/Data-Edison-Coll-Utils.html#map" class="link">Source</a> <a href="#v:map" class="selflink">#</a></p><div class="doc"><p>Apply a function across all the elements in a collection and transform
   the collection type.</p></div></div><div class="top"><p class="src"><a id="v:mapPartial" class="def">mapPartial</a> :: (<a href="Data-Edison-Coll.html#t:Coll">Coll</a> cin a, <a href="Data-Edison-Coll.html#t:CollX">CollX</a> cout b) =&gt; (a -&gt; <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Maybe.html#t:Maybe">Maybe</a> b) -&gt; cin -&gt; cout <a href="src/Data-Edison-Coll-Utils.html#mapPartial" class="link">Source</a> <a href="#v:mapPartial" class="selflink">#</a></p><div class="doc"><p>Map a partial function across all elements of a collection and transform
   the collection type.</p></div></div><div class="top"><p class="src"><a id="v:unsafeMapMonotonic" class="def">unsafeMapMonotonic</a> :: (<a href="Data-Edison-Coll.html#t:OrdColl">OrdColl</a> cin a, <a href="Data-Edison-Coll.html#t:OrdCollX">OrdCollX</a> cout b) =&gt; (a -&gt; b) -&gt; cin -&gt; cout <a href="src/Data-Edison-Coll-Utils.html#unsafeMapMonotonic" class="link">Source</a> <a href="#v:unsafeMapMonotonic" class="selflink">#</a></p><div class="doc"><p>Map a monotonic function across all the elements of a collection and
   transform the collection type.   The function is required to satisfy
   the following precondition:</p><pre>forall x y. x &lt; y ==&gt; f x &lt; f y</pre></div></div><div class="top"><p class="src"><a id="v:unionMap" class="def">unionMap</a> :: (<a href="Data-Edison-Coll.html#t:Coll">Coll</a> cin a, <a href="Data-Edison-Coll.html#t:CollX">CollX</a> cout b) =&gt; (a -&gt; cout) -&gt; cin -&gt; cout <a href="src/Data-Edison-Coll-Utils.html#unionMap" class="link">Source</a> <a href="#v:unionMap" class="selflink">#</a></p><div class="doc"><p>Map a collection-producing function across all elements of a collection
   and collect the results together using <code><a href="Data-Edison-Coll.html#v:union">union</a></code>.</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.17.2</p></div></body></html>