safegraph 0.1.0

A type-safe, scope-aware graph library that leverages Rust's type system to prevent common graph-related bugs at compile time
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

use safegraph::graph::edge::{Endpoints, Map};
use std::collections::{BTreeSet, HashSet};

#[test]
fn array_endpoints_iter() {
    let eps: [u32; 2] = [1, 2];
    let items: Vec<u32> = eps.into_iter().collect();
    assert_eq!(items, vec![1, 2]);
}

#[test]
fn array_endpoints_clone_iter() {
    let eps: [u32; 2] = [10, 20];
    let items: Vec<u32> = eps.iter().collect();
    assert_eq!(items, vec![10, 20]);
}

#[test]
fn array_endpoints_eq() {
    let a: [u32; 2] = [1, 2];
    let b: [u32; 2] = [1, 2];
    let c: [u32; 2] = [2, 1];
    assert_eq!(a, b);
    assert_ne!(a, c);
}

#[test]
fn array_endpoints_map_forward() {
    let eps: [u32; 2] = [1, 2];
    let mapped: [u64; 2] = eps.map_forward(|x| x as u64);
    assert_eq!(mapped, [1u64, 2u64]);
}

#[test]
fn array_endpoints_map_backward() {
    let mapped: [u64; 2] = [10, 20];
    let original: [u32; 2] = <[u32; 2]>::map_backward(mapped, |x| x as u32);
    assert_eq!(original, [10, 20]);
}

#[test]
fn array_endpoints_try_from_sources_targets() {
    let eps = <[u32; 2]>::try_from_sources_targets([5], [10]).unwrap();
    assert_eq!(eps, [5, 10]);
}

#[test]
fn hashset_endpoints_iter() {
    let eps: HashSet<u32> = [1, 2, 3].into_iter().collect();
    assert_eq!(eps.len(), 3);
}

#[test]
fn hashset_endpoints_map() {
    let eps: HashSet<u32> = [1, 2].into_iter().collect();
    let mapped: HashSet<u64> = eps.map_forward(|x| x as u64);
    assert!(mapped.contains(&1u64));
    assert!(mapped.contains(&2u64));
}

#[test]
fn hashset_endpoints_map_backward() {
    let mapped: HashSet<u64> = [10, 20].into_iter().collect();
    let original: HashSet<u32> = <HashSet<u32>>::map_backward(mapped, |x| x as u32);
    assert!(original.contains(&10));
    assert!(original.contains(&20));
}

#[test]
fn btreeset_endpoints_iter() {
    let eps: BTreeSet<u32> = [3, 1, 2].into_iter().collect();
    let items: Vec<u32> = eps.into_iter().collect();
    assert_eq!(items, vec![1, 2, 3]); // sorted
}

#[test]
fn btreeset_endpoints_map() {
    let eps: BTreeSet<u32> = [1, 2].into_iter().collect();
    let mapped: BTreeSet<u64> = eps.map_forward(|x| x as u64 * 10);
    let items: Vec<u64> = mapped.into_iter().collect();
    assert_eq!(items, vec![10, 20]);
}

#[test]
fn btreeset_endpoints_map_backward() {
    let mapped: BTreeSet<u64> = [10, 20].into_iter().collect();
    let original: BTreeSet<u32> = <BTreeSet<u32>>::map_backward(mapped, |x| x as u32);
    let items: Vec<u32> = original.into_iter().collect();
    assert_eq!(items, vec![10, 20]);
}