low-latency-data-structures 0.0.1

Experimental lock-free SPSC, SPMC broadcast, and SeqLock primitives tuned for ultra-low-latency systems
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

//! End-to-end smoke binary. Exercises one trivial path through each
//! primitive so a release build catches obvious regressions before the
//! benchmark suite runs.

use low_latency_data_structures::spmc::{self, ReadResult};
use low_latency_data_structures::{seqlock, spsc};

fn main() {
    println!("hello from smoke tests");
    smoke_spsc();
    smoke_seqlock();
    smoke_spmc();
    println!("smoke tests seem ok");
}

fn smoke_spsc() {
    println!("smoke_spsc...");
    let (producer, consumer) = spsc::new::<i32, 128>();
    assert!(producer.push(123).is_none());
    assert!(matches!(consumer.pop(), Some(123)));
}

fn smoke_seqlock() {
    println!("smoke_seqlock...");
    let (writer, reader) = seqlock::new(0);
    writer.write(123);
    assert_eq!(reader.read(), 123);
}

fn smoke_spmc() {
    println!("smoke_spmc...");
    let (producer, consumers) = spmc::new::<i32, 128, 2>();
    let [mut c1, mut c2] = consumers;
    assert_eq!(c1.try_read(), ReadResult::Empty);
    assert_eq!(c2.try_read(), ReadResult::Empty);
    producer.publish(123);
    assert_eq!(c1.try_read(), ReadResult::Value(123));
    assert_eq!(c2.try_read(), ReadResult::Value(123));
    assert_eq!(c1.try_read(), ReadResult::Empty);
    assert_eq!(c2.try_read(), ReadResult::Empty);
}