swh-graph-stdlib 13.0.0

Library of algorithms and data structures for swh-graph
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94

// Copyright (C) 2026  The Software Heritage developers
// See the AUTHORS file at the top-level directory of this distribution
// License: GNU General Public License version 3, or any later version
// See top-level LICENSE file for more information

use std::collections::HashSet;

use rayon::iter::ParallelIterator;
use swh_graph_stdlib::labeling::{DenseLabels, Labels};

macro_rules! set {
    ($($v:expr),* $(,)?) => {{
        vec![$($v,)*].into_iter().collect::<HashSet<_>>()
    }};
}

fn new_store(num_nodes: usize) -> DenseLabels<u64> {
    DenseLabels::new(num_nodes, ())
}

#[test]
fn test_insert_and_get() {
    let mut store = new_store(5);
    assert!(store.is_empty());

    assert!(store.insert(0, 10).is_none());
    assert!(!store.is_empty());

    assert!(store.insert(3, 30).is_none());

    assert_eq!(store.get(0), Some(&10));
    assert_eq!(store.get(3), Some(&30));
    assert_eq!(store.get(1), None);
    assert_eq!(store.get(2), None);
    assert_eq!(store.get(4), None);

    assert!(store.contains_key(0));
    assert!(!store.contains_key(1));
    assert!(!store.contains_key(2));
    assert!(store.contains_key(3));
    assert!(!store.contains_key(4));
}

#[test]
fn test_insert_overwrites() {
    let mut store = new_store(3);

    assert!(store.insert(1, 10).is_none());

    assert_eq!(store.insert(1, 20), Some(10));
    assert_eq!(store.get(1), Some(&20));

    assert_eq!(store.insert(1, 30), Some(20));
    assert_eq!(store.get(1), Some(&30));

    assert!(!store.is_empty());
}

#[test]
fn test_remove() {
    let mut store = new_store(4);

    store.insert(1, 10);
    store.insert(2, 20);

    assert!(store.remove(0).is_none());

    assert_eq!(store.remove(1), Some(10));
    assert_eq!(store.get(1), None);
    assert!(!store.contains_key(1));
    assert!(store.remove(1).is_none());

    assert_eq!(store.get(2), Some(&20));
    assert!(!store.is_empty());

    assert_eq!(store.remove(2), Some(20));
    assert!(store.is_empty());
}

#[test]
fn test_iterators() {
    let mut store = new_store(4);
    store.insert(1, 10);
    store.insert(3, 30);

    let iter_result: Vec<Option<&u64>> = store.iter().collect();
    assert_eq!(iter_result, vec![None, Some(&10), None, Some(&30)]);

    let labeled: HashSet<(usize, &u64)> = store.iter_labeled().collect();
    assert_eq!(labeled, set![(1, &10), (3, &30)]);

    let par_labeled: HashSet<(usize, &u64)> = store.par_iter_labeled().collect();
    assert_eq!(par_labeled, labeled);
}