indexmap 2.14.2

A hash table with consistent order and fast iteration.
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

#[test]
fn test_create_map() {
    let _m = indexmap::indexmap! {
        1 => 2,
        7 => 1,
        2 => 2,
        3 => 3,
    };
}

#[test]
fn test_create_set() {
    let _s = indexmap::indexset! {
        1,
        7,
        2,
        3,
    };
}

#[test]
fn test_map_shadow() {
    // The macro used to have its own `const CAP` which would shadow this, because items are not
    // protected by macro hygiene. Now we avoid any items in the macro, and its local `map` *is*
    // hygienic vs. the local `map` here.
    const CAP: usize = 42;
    let map = -1;
    let m = indexmap::indexmap! {
        map => CAP,
    };
    assert_eq!(m[&map], CAP);
    assert_eq!(m[0], CAP);
}

#[test]
fn test_map_shadow_default() {
    const CAP: usize = 42;
    let map = -1;
    let m = indexmap::indexmap_with_default! {
        fnv::FnvHasher;
        map => CAP,
    };
    assert_eq!(m[&map], CAP);
    assert_eq!(m[0], CAP);
}

#[test]
fn test_set_shadow() {
    const CAP: usize = 42;
    let s = indexmap::indexset!(CAP);
    assert_eq!(s[0], CAP);
}

#[test]
fn test_set_shadow_default() {
    const CAP: usize = 42;
    let s = indexmap::indexset_with_default!(fnv::FnvHasher; CAP);
    assert_eq!(s[0], CAP);
}