reovim-driver-syntax 0.14.4

Syntax highlighting driver for reovim (trait definitions only)
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110

use {super::*, crate::HighlightCategory, std::collections::HashMap};

/// Simple in-memory cache implementation for testing.
struct SimpleCache {
    entries: HashMap<(usize, usize), Vec<Annotation>>,
}

impl SimpleCache {
    fn new() -> Self {
        Self {
            entries: HashMap::new(),
        }
    }
}

impl SyntaxCache for SimpleCache {
    fn get(&self, byte_range: Range<usize>) -> Option<Vec<Annotation>> {
        self.entries
            .get(&(byte_range.start, byte_range.end))
            .cloned()
    }

    fn insert(&mut self, byte_range: Range<usize>, highlights: Vec<Annotation>) {
        self.entries
            .insert((byte_range.start, byte_range.end), highlights);
    }

    #[cfg_attr(coverage_nightly, coverage(off))]
    fn invalidate_range(&mut self, byte_range: Range<usize>) {
        self.entries
            .retain(|(start, end), _| *end <= byte_range.start || *start >= byte_range.end);
    }

    fn clear(&mut self) {
        self.entries.clear();
    }

    fn is_empty(&self) -> bool {
        self.entries.is_empty()
    }
}

fn ann(start: usize, end: usize, cat: &str) -> Annotation {
    Annotation::new(start, end, HighlightCategory::new(cat))
}

#[test]
fn test_cache_insert_and_get() {
    let mut cache = SimpleCache::new();

    let highlights = vec![ann(0, 5, "keyword"), ann(6, 10, "function")];

    cache.insert(0..100, highlights.clone());

    let cached = cache.get(0..100);
    assert!(cached.is_some());
    assert_eq!(cached.unwrap(), highlights);
}

#[test]
fn test_cache_get_missing() {
    let cache = SimpleCache::new();

    let cached = cache.get(0..100);
    assert!(cached.is_none());
}

#[test]
fn test_cache_invalidate_range() {
    let mut cache = SimpleCache::new();

    cache.insert(0..50, vec![ann(0, 50, "keyword")]);
    cache.insert(50..100, vec![ann(50, 100, "function")]);
    cache.insert(100..150, vec![ann(100, 150, "string")]);

    cache.invalidate_range(40..60);

    assert!(cache.get(0..50).is_none());
    assert!(cache.get(50..100).is_none());
    assert!(cache.get(100..150).is_some());
}

#[test]
fn test_cache_clear() {
    let mut cache = SimpleCache::new();

    cache.insert(0..50, vec![ann(0, 50, "keyword")]);
    cache.insert(50..100, vec![ann(50, 100, "function")]);

    assert!(!cache.is_empty());

    cache.clear();

    assert!(cache.is_empty());
    assert!(cache.get(0..50).is_none());
    assert!(cache.get(50..100).is_none());
}

#[test]
fn test_cache_is_empty() {
    let mut cache = SimpleCache::new();

    assert!(cache.is_empty());

    cache.insert(0..50, vec![]);
    assert!(!cache.is_empty());

    cache.clear();
    assert!(cache.is_empty());
}