This file is indexed.

/usr/share/doc/libghc-stringsearch-doc/html/doc-index.html is in libghc-stringsearch-doc 0.3.6.6-6build1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

1
2
3
4
<!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>stringsearch-0.3.6.6: Fast searching, splitting and replacing of ByteStrings (Index)</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();};
//]]>
</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">stringsearch-0.3.6.6: Fast searching, splitting and replacing of ByteStrings</p></div><div id="content"><div id="index"><p class="caption">Index</p><table><tr><td class="src">breakAfter</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:breakAfter">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:breakAfter">Data.ByteString.Search</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:breakAfter">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:breakAfter">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">breakFindAfter</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:breakFindAfter">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:breakFindAfter">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">breakOn</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:breakOn">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:breakOn">Data.ByteString.Search</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:breakOn">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:breakOn">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">indices</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-KMP.html#v:indices">Data.ByteString.Search.KMP</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:indices">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:indices">Data.ByteString.Search</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-KMP.html#v:indices">Data.ByteString.Lazy.Search.KMP</a></td></tr><tr><td class="alt">5 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:indices">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">6 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:indices">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">indicesOfAny</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-KarpRabin.html#v:indicesOfAny">Data.ByteString.Search.KarpRabin</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-KarpRabin.html#v:indicesOfAny">Data.ByteString.Lazy.Search.KarpRabin</a></td></tr><tr><td class="src">matchLL</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-KnuthMorrisPratt.html#v:matchLL">Data.ByteString.Search.KnuthMorrisPratt</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search-BoyerMoore.html#v:matchLL">Data.ByteString.Search.BoyerMoore</a></td></tr><tr><td class="src">matchLS</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-KnuthMorrisPratt.html#v:matchLS">Data.ByteString.Search.KnuthMorrisPratt</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search-BoyerMoore.html#v:matchLS">Data.ByteString.Search.BoyerMoore</a></td></tr><tr><td class="src">matchSL</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-KnuthMorrisPratt.html#v:matchSL">Data.ByteString.Search.KnuthMorrisPratt</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search-BoyerMoore.html#v:matchSL">Data.ByteString.Search.BoyerMoore</a></td></tr><tr><td class="src">matchSS</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-KnuthMorrisPratt.html#v:matchSS">Data.ByteString.Search.KnuthMorrisPratt</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search-BoyerMoore.html#v:matchSS">Data.ByteString.Search.BoyerMoore</a></td></tr><tr><td class="src">nonOverlappingIndices</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-KMP.html#v:nonOverlappingIndices">Data.ByteString.Search.KMP</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:nonOverlappingIndices">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:nonOverlappingIndices">Data.ByteString.Search</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-KMP.html#v:nonOverlappingIndices">Data.ByteString.Lazy.Search.KMP</a></td></tr><tr><td class="alt">5 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:nonOverlappingIndices">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">6 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:nonOverlappingIndices">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">prependCycle</td><td class="module"><a href="Data-ByteString-Search-Substitution.html#v:prependCycle">Data.ByteString.Search.Substitution</a></td></tr><tr><td class="src">replace</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:replace">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:replace">Data.ByteString.Search</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:replace">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:replace">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">split</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:split">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:split">Data.ByteString.Search</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:split">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:split">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">splitKeepEnd</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:splitKeepEnd">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:splitKeepEnd">Data.ByteString.Search</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:splitKeepEnd">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:splitKeepEnd">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">splitKeepFront</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Search-DFA.html#v:splitKeepFront">Data.ByteString.Search.DFA</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Search.html#v:splitKeepFront">Data.ByteString.Search</a></td></tr><tr><td class="alt">3 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-DFA.html#v:splitKeepFront">Data.ByteString.Lazy.Search.DFA</a></td></tr><tr><td class="alt">4 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:splitKeepFront">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">strictify</td><td>&nbsp;</td></tr><tr><td class="alt">1 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search-KMP.html#v:strictify">Data.ByteString.Lazy.Search.KMP</a></td></tr><tr><td class="alt">2 (Function)</td><td class="module"><a href="Data-ByteString-Lazy-Search.html#v:strictify">Data.ByteString.Lazy.Search</a></td></tr><tr><td class="src">Substitution</td><td class="module"><a href="Data-ByteString-Search-Substitution.html#t:Substitution">Data.ByteString.Search.Substitution</a></td></tr><tr><td class="src">substitution</td><td class="module"><a href="Data-ByteString-Search-Substitution.html#v:substitution">Data.ByteString.Search.Substitution</a></td></tr></table></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>