/usr/share/doc/libghc-regex-tdfa-doc/html/Text-Regex-TDFA-IntArrTrieSet.html is in libghc-regex-tdfa-doc 1.1.8-4build1.
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 25 26 27 28 29 30 31 32 | <!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>Text.Regex.TDFA.IntArrTrieSet</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_Text-Regex-TDFA-IntArrTrieSet.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Text-Regex-TDFA-IntArrTrieSet.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">regex-tdfa-1.1.8: Replaces/Enhances Text.Regex</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Safe Haskell</th><td>Safe-Inferred</td></tr></table><p class="caption">Text.Regex.TDFA.IntArrTrieSet</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>This creates a lazy Trie based on a finite range of Ints and is used to
memorize a function over the subsets of this range.
</p><p>To create a Trie you need two supply 2 things
* Range of keys to bound
* A function or functions used to construct the value for a subset of keys
</p><p>The Trie uses the Array type internally.
</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:TrieSet">TrieSet</a> v = <a href="#v:TrieSet">TrieSet</a> {<ul class="subs"><li><a href="#v:value">value</a> :: v</li><li><a href="#v:next">next</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/array-0.4.0.1/Data-Array.html#t:Array">Array</a> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> (<a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v)</li></ul>}</li><li class="src short"><a href="#v:lookupAsc">lookupAsc</a> :: <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v -> [<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>] -> v</li><li class="src short"><a href="#v:fromBounds">fromBounds</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>) -> ([<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>] -> v) -> <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v</li><li class="src short"><a href="#v:fromSinglesMerge">fromSinglesMerge</a> :: v -> (v -> v -> v) -> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>) -> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> v) -> <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v</li><li class="src short"><a href="#v:fromSinglesSum">fromSinglesSum</a> :: ([v] -> v) -> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>) -> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> v) -> <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><span class="keyword">data</span> <a name="t:TrieSet" class="def">TrieSet</a> v <a href="src/Text-Regex-TDFA-IntArrTrieSet.html#TrieSet" class="link">Source</a></p><div class="subs constructors"><p class="caption">Constructors</p><table><tr><td class="src"><a name="v:TrieSet" class="def">TrieSet</a></td><td class="doc empty"> </td></tr><tr><td colspan="2"><div class="subs fields"><p class="caption">Fields</p><dl><dt class="src"><a name="v:value" class="def">value</a> :: v</dt><dd class="doc empty"> </dd><dt class="src"><a name="v:next" class="def">next</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/array-0.4.0.1/Data-Array.html#t:Array">Array</a> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> (<a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v)</dt><dd class="doc empty"> </dd></dl><div class="clear"></div></div></td></tr></table></div></div><div class="top"><p class="src"><a name="v:lookupAsc" class="def">lookupAsc</a> :: <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v -> [<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>] -> v<a href="src/Text-Regex-TDFA-IntArrTrieSet.html#lookupAsc" class="link">Source</a></p><div class="doc"><p>This is the accessor for the Trie. The list of keys should be
sorted.
</p></div></div><div class="top"><p class="src"><a name="v:fromBounds" class="def">fromBounds</a><a href="src/Text-Regex-TDFA-IntArrTrieSet.html#fromBounds" class="link">Source</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>)</td><td class="doc"><p>(lower,upper) range of keys, lower<=upper
</p></td></tr><tr><td class="src">-> ([<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>] -> v)</td><td class="doc"><p>Function from list of keys to its value.
It must work for distinct ascending lists.
</p></td></tr><tr><td class="src">-> <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v</td><td class="doc"><p>The constructed Trie
</p></td></tr></table></div><div class="doc"><p>This is a Trie constructor for a complete range of keys.
</p></div></div><div class="top"><p class="src"><a name="v:fromSinglesMerge" class="def">fromSinglesMerge</a><a href="src/Text-Regex-TDFA-IntArrTrieSet.html#fromSinglesMerge" class="link">Source</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: v</td><td class="doc"><p>value for (lookupAsc trie [])
</p></td></tr><tr><td class="src">-> (v -> v -> v)</td><td class="doc"><p>merge operation on values
</p></td></tr><tr><td class="src">-> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>)</td><td class="doc"><p>(lower,upper) range of keys, lower<=upper
</p></td></tr><tr><td class="src">-> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> v)</td><td class="doc"><p>Function from a single key to its value
</p></td></tr><tr><td class="src">-> <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v</td><td class="doc"><p>The constructed Trie
</p></td></tr></table></div><div class="doc"><p>This is a Trie constructor for a complete range of keys that uses
a function from single values and a merge operation on values to
fill the Trie.
</p></div></div><div class="top"><p class="src"><a name="v:fromSinglesSum" class="def">fromSinglesSum</a><a href="src/Text-Regex-TDFA-IntArrTrieSet.html#fromSinglesSum" class="link">Source</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: ([v] -> v)</td><td class="doc"><p>summation operation for values
</p></td></tr><tr><td class="src">-> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a>)</td><td class="doc"><p>(lower,upper) range of keys, lower <= upper
</p></td></tr><tr><td class="src">-> (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> v)</td><td class="doc"><p>Function from a single key to its value
</p></td></tr><tr><td class="src">-> <a href="Text-Regex-TDFA-IntArrTrieSet.html#t:TrieSet">TrieSet</a> v</td><td class="doc"><p>The constructed Trie
</p></td></tr></table></div><div class="doc"><p>This is a Trie constructor for a complete range of keys that uses
a function from single values and a sum operation of values to fill
the Trie.
</p></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>
|