bplus_store 0.2.0

Copy-on-write B+ tree with page-aligned storage, split/merge, and crash-safety primitives.
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
42
43
44
45
46
47
48
49
50
51
52
53

#![allow(dead_code)]

use std::sync::{Arc, Mutex};

#[derive(Default, Debug)]
struct EpochState {
    advances: u64,
    oldest_active: u64,
    to_reclaim: Vec<u64>,
}

/// Simple mock for EpochManager:
/// - count `advance()` calls
/// - configurable `oldest_active`
/// - returns a preset reclaim list
#[derive(Clone)]
pub struct TestEpoch {
    state: Arc<Mutex<EpochState>>,
}

impl TestEpoch {
    pub fn new() -> Self {
        Self {
            state: Arc::new(Mutex::new(EpochState::default())),
        }
    }

    pub fn set_oldest_active(&self, e: u64) {
        self.state.lock().unwrap().oldest_active = e;
    }

    pub fn set_reclaim_list(&self, pages: Vec<u64>) {
        self.state.lock().unwrap().to_reclaim = pages;
    }

    pub fn advance_count(&self) -> u64 {
        self.state.lock().unwrap().advances
    }
}

impl TestEpoch {
    fn advance(&self) {
        self.state.lock().unwrap().advances += 1;
    }

    fn oldest_active(&self) -> u64 {
        self.state.lock().unwrap().oldest_active
    }

    fn reclaim(&self, _safe_epoch: u64) -> Vec<u64> {
        self.state.lock().unwrap().to_reclaim.clone()
    }
}