Copyright | (c) Dominik Schrempf 2020 |
---|---|
License | GPL-3.0-or-later |
Maintainer | dominik.schrempf@gmail.com |
Stability | unstable |
Portability | portable |
Safe Haskell | None |
Language | Haskell2010 |
Creation date: Wed May 20 09:11:25 2020.
Documentation
A Trace
passes through a list of states with associated likelihoods which
are called Item
s. New Item
s are prepended, and the path of the Markov
chain is stored in reversed order.
singletonT :: Item a -> Trace a Source #
The empty trace.