/usr/share/doc/libghc-markov-chain-doc/html/Data-MarkovChain.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 20 21 | <!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.MarkovChain</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();setSynopsis("mini_Data-MarkovChain.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-MarkovChain.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">markov-chain-0.0.3.2: Markov Chains for generating random sequences with a user definable behaviour.</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Portability</th><td>Haskell 98</td></tr><tr><th>Stability</th><td>stable</td></tr><tr><th>Maintainer</th><td>haskell@henning-thielemann.de</td></tr><tr><th>Safe Haskell</th><td>Safe-Inferred</td></tr></table><p class="caption">Data.MarkovChain</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Markov chains can be used to recompose a list of elements
respecting the fact that the probability of a certain element
depends on preceding elements in the list.
</p></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:run">run</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a, <a href="/usr/share/doc/libghc-random-doc/html/System-Random.html#t:RandomGen">RandomGen</a> g) => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> [a] -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> g -> [a]</li><li class="src short"><a href="#v:runMulti">runMulti</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a, <a href="/usr/share/doc/libghc-random-doc/html/System-Random.html#t:RandomGen">RandomGen</a> g) => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> [[a]] -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a> -> g -> [[a]]</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a name="v:run" class="def">run</a><a href="src/Data-MarkovChain.html#run" class="link">Source</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a, <a href="/usr/share/doc/libghc-random-doc/html/System-Random.html#t:RandomGen">RandomGen</a> g)</td><td class="doc empty"> </td></tr><tr><td class="src">=> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a></td><td class="doc"><p>size of prediction context
</p></td></tr><tr><td class="src">-> [a]</td><td class="doc"><p>training sequence, the one to walk through randomly
</p></td></tr><tr><td class="src">-> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a></td><td class="doc"><p>index to start the random walk within the training sequence
</p></td></tr><tr><td class="src">-> g</td><td class="doc"><p>random generator state
</p></td></tr><tr><td class="src">-> [a]</td><td class="doc empty"> </td></tr></table></div><div class="doc"><p>Creates a chain of elements
respecting to the probabilities of possible successors.
The list is considered being cyclic in order
to have successors for the last elements.
</p><p>Example:
</p><pre> take 100 $ run 2 "The sad cat sat on the mat. " 0 (Random.mkStdGen 123)
</pre></div></div><div class="top"><p class="src"><a name="v:runMulti" class="def">runMulti</a><a href="src/Data-MarkovChain.html#runMulti" class="link">Source</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a, <a href="/usr/share/doc/libghc-random-doc/html/System-Random.html#t:RandomGen">RandomGen</a> g)</td><td class="doc empty"> </td></tr><tr><td class="src">=> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a></td><td class="doc"><p>size of prediction context
</p></td></tr><tr><td class="src">-> [[a]]</td><td class="doc"><p>training sequences, the order is relevant
</p></td></tr><tr><td class="src">-> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a></td><td class="doc"><p>index of starting training sequence
</p></td></tr><tr><td class="src">-> g</td><td class="doc"><p>random generator state
</p></td></tr><tr><td class="src">-> [[a]]</td><td class="doc empty"> </td></tr></table></div></div></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>
|