This file is indexed.

/usr/share/doc/libghc-markov-chain-doc/html/index.html is in libghc-markov-chain-doc 0.0.3.2-4.

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
<!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>markov-chain-0.0.3.2: Markov Chains for generating random sequences with a user definable behaviour.</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">markov-chain-0.0.3.2: Markov Chains for generating random sequences with a user definable behaviour.</p></div><div id="content"><div id="description"><h1>markov-chain-0.0.3.2: Markov Chains for generating random sequences with a user definable behaviour.</h1><div class="doc"><p>This library can be used to generate random sequences of anything
with a behaviour that is adapted to some training data.
Input a marketing text or a speech and
recompose it to another arbitrary text of this sort.
Input a dictionary of person names and create new names.
Input a sequence of notes and get out a new melody.
Input a set of Haskell modules and generate ...
nice idea but the result will certainly have neither correct syntax nor types.
I think, it's a good thing about Haskell, that you cannot fool it so easily.
The idea is very simple:
The algorithm analyses your input/training data
with respect to how likely an <code>a</code> or <code>e</code> follows the letters <code>r</code> and <code>e</code>.
Then on recomposition it chooses subsequent letters randomly
according to the frequencies found in the training data.
This library is well suited for <em>bull-shit generators</em>.
</p></div></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"><a href="Data-MarkovChain.html">Data.MarkovChain</a></span></li></ul></li></ul></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>