This file is indexed.

/usr/share/doc/libghc-data-inttrie-doc/html/Data-IntTrie.html is in libghc-data-inttrie-doc 0.0.8-3.

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
<!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.IntTrie</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-IntTrie.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-IntTrie.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">data-inttrie-0.0.8: A lazy, infinite trie of integers.</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Portability</th><td>Haskell 2010</td></tr><tr><th>Stability</th><td>experimental</td></tr><tr><th>Maintainer</th><td>Luke Palmer &lt;lrpalmer@gmail.com&gt;</td></tr><tr><th>Safe Haskell</th><td>Safe-Inferred</td></tr></table><p class="caption">Data.IntTrie</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Provides a minimal infinite, lazy trie for integral types.
 It intentionally leaves out ideas such as delete and
 emptiness so that it can be used lazily, eg. as the target
 of an infinite foldr.  Essentially its purpose is to be an
 efficient implementation of a function from integral type,
 given point-at-a-time modifications.
</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">data</span>  <a href="#t:IntTrie">IntTrie</a> a</li><li class="src short"><a href="#v:identity">identity</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> a, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> a) =&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a</li><li class="src short"><a href="#v:apply">apply</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> b) =&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a -&gt; b -&gt; a</li><li class="src short"><a href="#v:modify">modify</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> b) =&gt; b -&gt; (a -&gt; a) -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a</li><li class="src short"><a href="#v:overwrite">overwrite</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> b) =&gt; b -&gt; a -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><span class="keyword">data</span>  <a name="t:IntTrie" class="def">IntTrie</a> a <a href="src/Data-IntTrie.html#IntTrie" class="link">Source</a></p><div class="doc"><p>A trie from integers to values of type a. 
</p><p>Semantics: [[IntTrie a]] = Integer -&gt; a
</p></div><div class="subs instances"><p id="control.i:IntTrie" class="caption collapser" onclick="toggleSection('i:IntTrie')">Instances</p><div id="section.i:IntTrie" class="show"><table><tr><td class="src"><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Control-Monad.html#t:Functor">Functor</a> <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a></td><td class="doc empty">&nbsp;</td></tr><tr><td class="src"><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Control-Applicative.html#t:Applicative">Applicative</a> <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a></td><td class="doc empty">&nbsp;</td></tr></table></div></div></div><div class="top"><p class="src"><a name="v:identity" class="def">identity</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> a, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> a) =&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a<a href="src/Data-IntTrie.html#identity" class="link">Source</a></p><div class="doc"><p>The identity trie.  
</p><pre> apply identity = id
</pre></div></div><div class="top"><p class="src"><a name="v:apply" class="def">apply</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> b) =&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a -&gt; b -&gt; a<a href="src/Data-IntTrie.html#apply" class="link">Source</a></p><div class="doc"><p>Apply the trie to an argument.  This is the semantic map.
</p></div></div><div class="top"><p class="src"><a name="v:modify" class="def">modify</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> b) =&gt; b -&gt; (a -&gt; a) -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a<a href="src/Data-IntTrie.html#modify" class="link">Source</a></p><div class="doc"><p>Modify the function at one point
</p><pre> apply (modify x f t) i | i == x = f (apply t i)
                        | otherwise = apply t i
</pre></div></div><div class="top"><p class="src"><a name="v:overwrite" class="def">overwrite</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Prelude.html#t:Num">Num</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bits.html#t:Bits">Bits</a> b) =&gt; b -&gt; a -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a -&gt; <a href="Data-IntTrie.html#t:IntTrie">IntTrie</a> a<a href="src/Data-IntTrie.html#overwrite" class="link">Source</a></p><div class="doc"><p>Overwrite the function at one point
</p><pre> overwrite i x = modify i (const x)
</pre></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.13.2</p></div></body></html>