retrace

This crate implements a safe, generic rollback log with predictable latency.

toml [dependencies] retrace = "0.1.0"

The Retrace type is implemented as a lock-free linked list of flat chunks. To keep insertion latency predictable, it simply buffers them without applying them to a "tip" state, until there is enough intents for a chunk. It then builds the chunk, prepends it to the linked list, and in most cases spawns a background task to actually produce the state of the tip. Once completed, this result is atomically put back onto the list, without affecting existing readers and speeding up subsequent queries.

This crate contains only safe code and declares #[forbid(unsafe_code)].

Use cases

This crate is written with a use case that has the following characteristics in mind, your milage may vary:

Example

```rust use retrace::{Retrace, Reproducible, Options};

// For the example, a simple integer is used as state. A real world example // would have a much more complex structure in place of this.

[derive(Clone, PartialEq, Eq, Debug)]

struct Foo(i32);

impl Reproducible for Foo { type Intent = i32; type Error = ();

fn apply(&mut self, intent: &Self::Intent) -> Result<(), Self::Error> {
    self.0 += *intent;
    Ok(())
}

}

let mut retrace = Retrace::new(Foo(0), Options::default());

for i in 1..=100 { retrace.append(i); }

for i in (1..=100).rev() { assert_eq!( Foo((1 + i) * i / 2), retrace.eval((100 - i) as usize).unwrap() ); } ```

Features

Benchmarks

sh $ cargo install cargo-criterion # if you haven't yet $ cargo criterion --features=bench

Because of how integral caching is to retrace, it's tricky to benchmark cold performance using only the public API. The bench feature provides the Retrace::decache method, which is used to benchmark cold query performance. This isn't very useful for any other purpose, and should not be used unless for benchmarking.