Sophie

Sophie

distrib > Fedora > 16 > i386 > by-pkgid > 81de1043d7603e28eb2094171a1dbf32 > files > 36

ghc-bytestring-trie-devel-0.2.3-6.fc16.i686.rpm

<!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>bytestring-trie-0.2.3: An efficient finite map from (byte)strings to values.</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();};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="index.html">Contents</a></li><li><a href="doc-index.html">Index</a></li></ul><p class="caption">bytestring-trie-0.2.3: An efficient finite map from (byte)strings to values.</p></div><div id="content"><div id="description" class="doc"><h1>bytestring-trie-0.2.3: An efficient finite map from (byte)strings to values.</h1><p>An efficient finite map from (byte)strings to values.
</p><p>The implementation is based on big-endian patricia
trees, like <a href="Data-IntMap.html">Data.IntMap</a>. We first trie on the
elements of <a href="Data-ByteString.html">Data.ByteString</a> and then trie on the
big-endian bit representation of those elements.
Patricia trees have efficient algorithms for union
and other merging operations, but they're also quick
for lookups and insertions.
</p><p>If you are only interested in being able to associate
strings to values, then you may prefer the <code>hashmap</code>
package which is faster for those only needing a
map-like structure. This package is intended for
those who need the extra capabilities that a trie-like
structure can offer (e.g., structure sharing to
reduce memory costs for highly redundant keys,
taking the submap of all keys with a given prefix,
contextual mapping, extracting the minimum and
maximum keys, etc.)
</p></div><div id="module-list"><p class="caption">Modules</p><ul><li><span id="control.n.1" class="module collapser" onclick="toggleSection('n.1')">Data</span><ul id="section.n.1" class="show"><li><span class="module"><span id="control.n.1.1" class="collapser" onclick="toggleSection('n.1.1')">&nbsp;</span><a href="Data-Trie.html">Data.Trie</a></span><ul id="section.n.1.1" class="show"><li><span class="module"><a href="Data-Trie-Convenience.html">Data.Trie.Convenience</a></span></li><li><span class="module"><a href="Data-Trie-Internal.html">Data.Trie.Internal</a></span></li></ul></li></ul></li></ul></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.9.2</p></div></body></html>