orx-priority-queue 1.8.0

Priority queue traits and high performance d-ary heap implementations.
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

use super::heap_positions::HeapPositions;

#[derive(Clone, Debug)]
pub(crate) struct HeapPositionsNone;

impl<N> HeapPositions<N> for HeapPositionsNone {
    #[inline(always)]
    fn clear(&mut self) {}

    #[inline(always)]
    fn contains(&self, _node: &N) -> bool {
        false
    }

    #[inline(always)]
    fn position_of(&self, _node: &N) -> Option<usize> {
        None
    }

    #[inline(always)]
    fn insert(&mut self, _node: &N, _pos: usize) {}

    #[inline(always)]
    fn remove(&mut self, _node: &N) {}

    #[inline(always)]
    fn update_position_of(&mut self, _node: &N, _pos: usize) {}

    #[cfg(test)]
    fn is_valid<K>(&self, _offset: usize, _tree: &[(N, K)]) -> bool {
        true
    }
}