linear_collections 0.3.0

Map and Set types backed by linear data structures.
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

use crate::{ArrayMap, LinearMap};

#[cfg(test)]
#[test]
///Since I keep forgetting this, if len is moved into the trait
///and thus made non-const this test will fail to compile.
fn array_map_len_is_const() {
    const fn foo() -> usize {
        let f = unsafe { ArrayMap::from_array_unchecked([(1, 1)]) };

        f.len()
    }

    assert_eq!(foo(), 1);
}

#[test]
///Since I keep forgetting this, if len is moved into the trait
///and thus made non-const this test will fail to compile.
fn array_map_is_empty_is_const() {
    const fn foo() -> bool {
        let f = unsafe { ArrayMap::from_array_unchecked([(1, 1)]) };

        f.is_empty()
    }

    assert_eq!(foo(), false);
}

#[test]
///Will fail to compile if from_array_unchecked is not const.
fn from_array_unchecked_is_const() {
    const fn _foo() {
        let _ = unsafe { ArrayMap::from_array_unchecked([(1, 1)]) };
    }
}