molframe-core 0.6.4

Core types, storage and analysis contracts for molframe
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

use super::*;

#[test]
fn an_all_present_mask_costs_a_length_rather_than_two_bit_sets() {
    let mask = ValidityMask::all_present(1_000_000);
    assert!(mask.is_all_present());
    assert_eq!(mask.present_count(), 1_000_000);
    assert!(matches!(mask, ValidityMask::AllPresent(_)));
}

#[test]
fn unrecorded_and_inapplicable_are_distinguishable_after_a_round_trip() {
    let mask =
        ValidityMask::try_from_iter([Presence::Present, Presence::Unknown, Presence::Inapplicable])
            .expect("small validity mask");
    assert_eq!(mask.get(0), Presence::Present);
    assert_eq!(mask.get(1), Presence::Unknown);
    assert_eq!(mask.get(2), Presence::Inapplicable);
    assert_eq!(mask.present_count(), 1);
}

#[test]
fn marking_a_position_absent_materialises_the_bit_sets_once() {
    let mut mask = ValidityMask::all_present(4);
    mask.set(2, Presence::Unknown);
    assert!(matches!(mask, ValidityMask::Mixed { .. }));
    assert_eq!(mask.get(0), Presence::Present);
    assert_eq!(mask.get(2), Presence::Unknown);
    assert_eq!(mask.present_count(), 3);
}

#[test]
fn a_bounded_build_agrees_with_pushing_one_presence_at_a_time() {
    for len in [0_u32, 1, 63, 64, 65, 130] {
        let presences: Vec<Presence> = (0..len)
            .map(|position| match position % 5 {
                0 | 1 => Presence::Present,
                2 => Presence::Unknown,
                _ => Presence::Inapplicable,
            })
            .collect();
        let bounded = ValidityMask::from_bounded_iter(presences.iter().copied(), len);
        let pushed = ValidityMask::try_from_iter(presences.iter().copied()).expect("fits");
        assert_eq!(bounded.present_count(), pushed.present_count(), "len {len}");
        for position in 0..len {
            assert_eq!(bounded.get(position), pushed.get(position), "len {len}");
        }
    }
}

#[test]
fn marking_everything_present_again_collapses_the_mask() {
    let mut mask = ValidityMask::all_present(4);
    mask.set(1, Presence::Inapplicable);
    mask.set(1, Presence::Present);
    mask.compact();
    assert!(matches!(mask, ValidityMask::AllPresent(4)));
}

#[test]
fn a_position_past_the_end_is_inapplicable_rather_than_present() {
    let mask = ValidityMask::all_present(2);
    assert_eq!(mask.get(2), Presence::Inapplicable);
    assert_eq!(mask.get(u32::MAX), Presence::Inapplicable);
}

#[test]
fn setting_present_on_a_compact_mask_leaves_it_compact() {
    let mut mask = ValidityMask::all_present(8);
    mask.set(3, Presence::Present);
    assert!(matches!(mask, ValidityMask::AllPresent(8)));
}