<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<head>
<!-- Generated by HsColour, http://www.cs.york.ac.uk/fp/darcs/hscolour/ -->
<title>Text/Regex/TDFA/IntArrTrieSet.hs</title>
<link type='text/css' rel='stylesheet' href='hscolour.css' />
</head>
<body>
<pre><a name="line-1"></a><span class='hs-comment'>{- |
<a name="line-2"></a>This creates a lazy Trie based on a finite range of Ints and is used to
<a name="line-3"></a>memorize a function over the subsets of this range.
<a name="line-4"></a>
<a name="line-5"></a>To create a Trie you need two supply 2 things
<a name="line-6"></a> * Range of keys to bound
<a name="line-7"></a> * A function or functions used to construct the value for a subset of keys
<a name="line-8"></a>
<a name="line-9"></a>The Trie uses the Array type internally.
<a name="line-10"></a>-}</span>
<a name="line-11"></a><span class='hs-keyword'>module</span> <span class='hs-conid'>Text</span><span class='hs-varop'>.</span><span class='hs-conid'>Regex</span><span class='hs-varop'>.</span><span class='hs-conid'>TDFA</span><span class='hs-varop'>.</span><span class='hs-conid'>IntArrTrieSet</span> <span class='hs-keyword'>where</span>
<a name="line-12"></a>
<a name="line-13"></a><span class='hs-comment'>{- By Chris Kuklewicz, 2007. BSD License, see the LICENSE file. -}</span>
<a name="line-14"></a>
<a name="line-15"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span><span class='hs-varop'>.</span><span class='hs-conid'>IArray</span><span class='hs-layout'>(</span><span class='hs-conid'>Array</span><span class='hs-layout'>,</span><span class='hs-layout'>(</span><span class='hs-varop'>!</span><span class='hs-layout'>)</span><span class='hs-layout'>,</span><span class='hs-varid'>listArray</span><span class='hs-layout'>)</span>
<a name="line-16"></a>
<a name="line-17"></a><a name="TrieSet"></a><span class='hs-keyword'>data</span> <span class='hs-conid'>TrieSet</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>TrieSet</span> <span class='hs-layout'>{</span> <span class='hs-varid'>value</span> <span class='hs-keyglyph'>::</span> <span class='hs-varid'>v</span>
<a name="line-18"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>next</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Array</span> <span class='hs-conid'>Int</span> <span class='hs-layout'>(</span><span class='hs-conid'>TrieSet</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-layout'>}</span>
<a name="line-19"></a>
<a name="line-20"></a><a name="lookupAsc"></a><span class='hs-comment'>-- | This is the accessor for the Trie. The list of keys should be</span>
<a name="line-21"></a><span class='hs-comment'>-- sorted.</span>
<a name="line-22"></a><span class='hs-definition'>lookupAsc</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TrieSet</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>Int</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>v</span>
<a name="line-23"></a><span class='hs-definition'>lookupAsc</span> <span class='hs-layout'>(</span><span class='hs-conid'>TrieSet</span> <span class='hs-layout'>{</span><span class='hs-varid'>value</span><span class='hs-keyglyph'>=</span><span class='hs-varid'>v</span><span class='hs-layout'>,</span><span class='hs-varid'>next</span><span class='hs-keyglyph'>=</span><span class='hs-varid'>n</span><span class='hs-layout'>}</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-24"></a> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span><span class='hs-varid'>keys</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyword'>case</span> <span class='hs-varid'>keys</span> <span class='hs-keyword'>of</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>v</span>
<a name="line-25"></a> <span class='hs-layout'>(</span><span class='hs-varid'>key</span><span class='hs-conop'>:</span><span class='hs-varid'>keys'</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>lookupAsc</span> <span class='hs-layout'>(</span><span class='hs-varid'>n</span><span class='hs-varop'>!</span><span class='hs-varid'>key</span><span class='hs-layout'>)</span> <span class='hs-varid'>keys'</span><span class='hs-layout'>)</span>
<a name="line-26"></a>
<a name="line-27"></a><a name="fromBounds"></a><span class='hs-comment'>-- | This is a Trie constructor for a complete range of keys.</span>
<a name="line-28"></a><span class='hs-definition'>fromBounds</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Int</span><span class='hs-layout'>,</span><span class='hs-conid'>Int</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ (lower,upper) range of keys, lower<=upper</span>
<a name="line-29"></a> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>[</span><span class='hs-conid'>Int</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ Function from list of keys to its value.</span>
<a name="line-30"></a> <span class='hs-comment'>-- It must work for distinct ascending lists.</span>
<a name="line-31"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TrieSet</span> <span class='hs-varid'>v</span> <span class='hs-comment'>-- ^ The constructed Trie</span>
<a name="line-32"></a><span class='hs-definition'>fromBounds</span> <span class='hs-layout'>(</span><span class='hs-varid'>start</span><span class='hs-layout'>,</span><span class='hs-varid'>stop</span><span class='hs-layout'>)</span> <span class='hs-varid'>keysToValue</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>build</span> <span class='hs-varid'>id</span> <span class='hs-varid'>start</span> <span class='hs-keyword'>where</span>
<a name="line-33"></a> <span class='hs-varid'>build</span> <span class='hs-varid'>keys</span> <span class='hs-varid'>low</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>TrieSet</span> <span class='hs-layout'>{</span> <span class='hs-varid'>value</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>keysToValue</span> <span class='hs-layout'>(</span><span class='hs-varid'>keys</span> <span class='hs-conid'>[]</span><span class='hs-layout'>)</span>
<a name="line-34"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>next</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>listArray</span> <span class='hs-layout'>(</span><span class='hs-varid'>low</span><span class='hs-layout'>,</span><span class='hs-varid'>stop</span><span class='hs-layout'>)</span>
<a name="line-35"></a> <span class='hs-keyglyph'>[</span><span class='hs-varid'>build</span> <span class='hs-layout'>(</span><span class='hs-varid'>keys</span><span class='hs-varop'>.</span><span class='hs-layout'>(</span><span class='hs-varid'>x</span><span class='hs-conop'>:</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>succ</span> <span class='hs-varid'>x</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>x</span> <span class='hs-keyglyph'><-</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>low</span><span class='hs-keyglyph'>..</span><span class='hs-varid'>stop</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>]</span> <span class='hs-layout'>}</span>
<a name="line-36"></a>
<a name="line-37"></a><a name="fromSinglesMerge"></a><span class='hs-comment'>-- | This is a Trie constructor for a complete range of keys that uses</span>
<a name="line-38"></a><span class='hs-comment'>-- a function from single values and a merge operation on values to</span>
<a name="line-39"></a><span class='hs-comment'>-- fill the Trie.</span>
<a name="line-40"></a><span class='hs-definition'>fromSinglesMerge</span> <span class='hs-keyglyph'>::</span> <span class='hs-varid'>v</span> <span class='hs-comment'>-- ^ value for (lookupAsc trie [])</span>
<a name="line-41"></a> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span><span class='hs-keyglyph'>-></span><span class='hs-varid'>v</span><span class='hs-keyglyph'>-></span><span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ merge operation on values</span>
<a name="line-42"></a> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Int</span><span class='hs-layout'>,</span><span class='hs-conid'>Int</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ (lower,upper) range of keys, lower<=upper</span>
<a name="line-43"></a> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Int</span><span class='hs-keyglyph'>-></span><span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ Function from a single key to its value</span>
<a name="line-44"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TrieSet</span> <span class='hs-varid'>v</span> <span class='hs-comment'>-- ^ The constructed Trie</span>
<a name="line-45"></a><span class='hs-definition'>fromSinglesMerge</span> <span class='hs-varid'>emptyValue</span> <span class='hs-varid'>mergeValues</span> <span class='hs-varid'>bound</span> <span class='hs-varid'>keyToValue</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>trieSet</span> <span class='hs-keyword'>where</span>
<a name="line-46"></a> <span class='hs-varid'>trieSet</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromBounds</span> <span class='hs-varid'>bound</span> <span class='hs-varid'>keysToValue'</span>
<a name="line-47"></a> <span class='hs-varid'>keysToValue'</span> <span class='hs-varid'>keys</span> <span class='hs-keyglyph'>=</span>
<a name="line-48"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>keys</span> <span class='hs-keyword'>of</span>
<a name="line-49"></a> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>emptyValue</span>
<a name="line-50"></a> <span class='hs-keyglyph'>[</span><span class='hs-varid'>key</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>keyToValue</span> <span class='hs-varid'>key</span>
<a name="line-51"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>mergeValues</span> <span class='hs-layout'>(</span><span class='hs-varid'>keysToValue</span> <span class='hs-layout'>(</span><span class='hs-varid'>init</span> <span class='hs-varid'>keys</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>keysToValue</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>last</span> <span class='hs-varid'>keys</span><span class='hs-keyglyph'>]</span><span class='hs-layout'>)</span>
<a name="line-52"></a> <span class='hs-varid'>keysToValue</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>lookupAsc</span> <span class='hs-varid'>trieSet</span>
<a name="line-53"></a>
<a name="line-54"></a><a name="fromSinglesSum"></a><span class='hs-comment'>-- | This is a Trie constructor for a complete range of keys that uses</span>
<a name="line-55"></a><span class='hs-comment'>-- a function from single values and a sum operation of values to fill</span>
<a name="line-56"></a><span class='hs-comment'>-- the Trie.</span>
<a name="line-57"></a><span class='hs-definition'>fromSinglesSum</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>[</span><span class='hs-varid'>v</span><span class='hs-keyglyph'>]</span><span class='hs-keyglyph'>-></span><span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ summation operation for values</span>
<a name="line-58"></a> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Int</span><span class='hs-layout'>,</span><span class='hs-conid'>Int</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ (lower,upper) range of keys, lower <= upper</span>
<a name="line-59"></a> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Int</span><span class='hs-keyglyph'>-></span><span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ Function from a single key to its value</span>
<a name="line-60"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TrieSet</span> <span class='hs-varid'>v</span> <span class='hs-comment'>-- ^ The constructed Trie</span>
<a name="line-61"></a><span class='hs-definition'>fromSinglesSum</span> <span class='hs-varid'>mergeValues</span> <span class='hs-varid'>bound</span> <span class='hs-varid'>keyToValue</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>trieSet</span> <span class='hs-keyword'>where</span>
<a name="line-62"></a> <span class='hs-varid'>trieSet</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromBounds</span> <span class='hs-varid'>bound</span> <span class='hs-varid'>keysToValue'</span>
<a name="line-63"></a> <span class='hs-varid'>keysToValue'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mergeValues</span> <span class='hs-varop'>.</span> <span class='hs-varid'>map</span> <span class='hs-varid'>keyToValue</span>
</pre></body>
</html>
