eqlog-runtime 0.9.0

Datalog with equality
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

use std::collections::BTreeMap;
use crate::wbtree::map::WBTreeMap;

#[test]
fn test_removal_optimization() {
    let mut wb_map = WBTreeMap::new();
    let mut bt_map = BTreeMap::new();

    // Insert test data
    for i in 0..20 {
        wb_map.insert(i, i * 10);
        bt_map.insert(i, i * 10);
    }

    // Test removing existing keys
    for i in (0..20).step_by(3) {
        let wb_removed = wb_map.remove(&i);
        let bt_removed = bt_map.remove(&i);
        assert_eq!(wb_removed, bt_removed);
    }

    // Test removing non-existent keys
    for i in 100..105 {
        let wb_removed = wb_map.remove(&i);
        let bt_removed = bt_map.remove(&i);
        assert_eq!(wb_removed, bt_removed);
        assert_eq!(wb_removed, None);
    }

    // Verify final state matches
    assert_eq!(wb_map.len(), bt_map.len());
    for (k, v) in wb_map.iter() {
        assert_eq!(bt_map.get(k), Some(v));
    }
}