orx-priority-queue 0.3.3

Priority queue traits, d-ary heap implementations having binary heap as a special case.
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

mod priority_queue_deckey_tests;
mod priority_queue_tests;

use orx_priority_queue::DaryHeapWithMap;
use priority_queue_deckey_tests::*;
use priority_queue_tests::*;

#[test]
fn test_dary_forall() {
    for _ in 0..100 {
        test_dary_for::<2>();
        test_dary_for::<3>();
        test_dary_for::<4>();
        test_dary_for::<7>();
        test_dary_for::<8>();
        test_dary_for::<13>();
        test_dary_for::<16>();
    }
}

fn test_dary_for<const D: usize>() {
    let new_heap = DaryHeapWithMap::<usize, f64, D>::default;

    let change_key = [
        ChangeKeyMethod::Decrease,
        ChangeKeyMethod::Update,
        ChangeKeyMethod::TryDecrease,
    ];

    test_len(new_heap());
    test_is_empty(new_heap());
    test_as_slice(new_heap());
    test_peek(new_heap());
    test_clear(new_heap());
    test_push_pop(new_heap());
    test_push_pop_randomized(new_heap());
    test_push_then_pop(new_heap());
    test_push_then_pop_randomized(new_heap());

    test_contains(new_heap());
    test_key_of(new_heap());
    change_key
        .iter()
        .for_each(|change_key_method| test_change_key(new_heap(), *change_key_method));
    test_remove(new_heap());
    test_mixed(new_heap());

    change_key
        .iter()
        .for_each(|change_key_method| test_change_key_or_push(new_heap(), *change_key_method));
}