Copyright | 2021 Dominik Schrempf |
---|---|
License | GPL-3.0-or-later |
Maintainer | dominik.schrempf@gmail.com |
Stability | unstable |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Creation date: Wed May 20 09:11:25 2020.
Synopsis
- data Trace a
- replicateT :: Int -> Link a -> IO (Trace a)
- fromVectorT :: Vector (Link a) -> IO (Trace a)
- pushT :: Link a -> Trace a -> IO (Trace a)
- headT :: Trace a -> IO (Link a)
- takeT :: Int -> Trace a -> IO (Vector (Link a))
- freezeT :: Trace a -> IO (Stack Vector (Link a))
- thawT :: Stack Vector (Link a) -> IO (Trace a)
Documentation
replicateT :: Int -> Link a -> IO (Trace a) Source #
Initialize a trace of given length by replicating the same value.
Be careful not to compute summary statistics before pushing enough values.
Call error
if the maximum size is zero or negative.
fromVectorT :: Vector (Link a) -> IO (Trace a) Source #
Create a trace from a vector. The length is determined by the vector.
Call error
if the vector is empty.
takeT :: Int -> Trace a -> IO (Vector (Link a)) Source #
Get the k most recent links of the trace (see take
).