/usr/share/doc/libghc-text-doc/html/Data-Text-Internal-Search.html

<!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.Text.Internal.Search</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-Text-Internal-Search.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Text-Internal-Search.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">text-1.2.2.2: An efficient packed Unicode text type.</p></div><div id="content"><div id="module-header"><table class="info"><tr><th valign="top">Copyright</th><td>(c) Bryan O'Sullivan 2009</td></tr><tr><th>License</th><td>BSD-style</td></tr><tr><th>Maintainer</th><td>bos@serpentine.com</td></tr><tr><th>Stability</th><td>experimental</td></tr><tr><th>Portability</th><td>GHC</td></tr><tr><th>Safe Haskell</th><td>None</td></tr><tr><th>Language</th><td>Haskell98</td></tr></table><p class="caption">Data.Text.Internal.Search</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Fast substring search for <code><a href="Data-Text.html#t:Text">Text</a></code>, based on work by Boyer, Moore,
 Horspool, Sunday, and Lundh.</p><p>References:</p><ul><li>R. S. Boyer, J. S. Moore: A Fast String Searching Algorithm.
   Communications of the ACM, 20, 10, 762-772 (1977)</li><li>R. N. Horspool: Practical Fast Searching in Strings.  Software -
   Practice and Experience 10, 501-506 (1980)</li><li>D. M. Sunday: A Very Fast Substring Search Algorithm.
   Communications of the ACM, 33, 8, 132-142 (1990)</li><li>F. Lundh: The Fast Search Algorithm.
   <a href="http://effbot.org/zone/stringlib.htm">http://effbot.org/zone/stringlib.htm</a> (2006)</li></ul></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:indices">indices</a> :: <a href="Data-Text.html#t:Text">Text</a> -&gt; <a href="Data-Text.html#t:Text">Text</a> -&gt; [<a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Int.html#t:Int">Int</a>]</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a id="v:indices" class="def">indices</a> <a href="src/Data-Text-Internal-Search.html#indices" class="link">Source</a> <a href="#v:indices" class="selflink">#</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: <a href="Data-Text.html#t:Text">Text</a></td><td class="doc"><p>Substring to search for (<code>needle</code>)</p></td></tr><tr><td class="src">-&gt; <a href="Data-Text.html#t:Text">Text</a></td><td class="doc"><p>Text to search in (<code>haystack</code>)</p></td></tr><tr><td class="src">-&gt; [<a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Int.html#t:Int">Int</a>]</td><td class="doc empty">&nbsp;</td></tr></table></div><div class="doc"><p><em>O(n+m)</em> Find the offsets of all non-overlapping indices of
 <code>needle</code> within <code>haystack</code>.  The offsets returned represent
 uncorrected indices in the low-level &quot;needle&quot; array, to which its
 offset must be added.</p><p>In (unlikely) bad cases, this algorithm's complexity degrades
 towards <em>O(n*m)</em>.</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.17.3</p></div></body></html>
libghc-text-doc 1.2.2.2-1 / usr / share / doc / libghc-text-doc / html / Data-Text-Internal-Search.html
