reovim-kernel 0.14.4

Core kernel mechanisms for reovim (Linux kernel/ equivalent)
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

use super::*;

#[test]
fn test_tab_id_new() {
    let id1 = TabId::new();
    let id2 = TabId::new();
    assert_ne!(id1, id2);
    assert!(id2.as_usize() > id1.as_usize());
}

#[test]
fn test_tab_id_clone() {
    let id1 = TabId::new();
    let id2 = id1;
    assert_eq!(id1, id2);
}

#[test]
#[cfg_attr(coverage_nightly, coverage(off))]
fn test_tab_id_display() {
    let id = TabId(42);
    assert_eq!(format!("{id}"), "tab:42");
}

#[test]
fn test_tab_id_default() {
    let id = TabId::default();
    assert!(id.as_usize() > 0);
}

#[test]
fn test_tab_id_from_raw() {
    let id = TabId::from_raw(42);
    assert_eq!(id.as_usize(), 42);
}

#[test]
fn test_tab_id_ordering() {
    let id1 = TabId::from_raw(1);
    let id2 = TabId::from_raw(2);
    let id3 = TabId::from_raw(3);

    // PartialOrd
    assert!(id1 < id2);
    assert!(id2 < id3);
    assert!(id1 < id3);

    // Ord (for sorting)
    let mut ids = vec![id3, id1, id2];
    ids.sort();
    assert_eq!(ids, vec![id1, id2, id3]);
}

#[test]
fn test_tab_id_hash() {
    use std::collections::HashSet;

    let id1 = TabId::from_raw(1);
    let id2 = TabId::from_raw(2);
    let id1_copy = TabId::from_raw(1);

    let mut set = HashSet::new();
    set.insert(id1);
    set.insert(id2);
    set.insert(id1_copy);

    assert_eq!(set.len(), 2);
    assert!(set.contains(&id1));
    assert!(set.contains(&id2));
}