dscale 0.5.3

A fast & deterministic simulation framework for benchmarking and testing distributed 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
42
43
44

use std::{collections::BinaryHeap, hash::Hash};

use rustc_hash::FxHashMap;

pub struct LazyHeap<T: Ord + Hash + Eq + Clone> {
    heap: BinaryHeap<T>,
    tombstones: FxHashMap<T, ()>,
}

impl<T: Ord + Hash + Eq + Clone> LazyHeap<T> {
    pub fn new(prealloc_size: usize) -> Self {
        LazyHeap {
            heap: BinaryHeap::with_capacity(prealloc_size),
            tombstones: FxHashMap::default(),
        }
    }

    pub fn push(&mut self, item: T) {
        self.heap.push(item);
    }

    pub fn remove(&mut self, item: T) {
        self.tombstones.insert(item, ());
    }

    pub fn peek(&mut self) -> Option<&T> {
        self.evict_tombstones();
        self.heap.peek()
    }

    fn evict_tombstones(&mut self) {
        loop {
            match self.heap.peek() {
                None => break,
                Some(top) => match self.tombstones.remove(&top) {
                    Some(_) => {
                        self.heap.pop();
                    }
                    _ => break,
                },
            }
        }
    }
}