broot 1.56.0

File browser and launcher
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

use {
    super::Pos,
    smallvec::SmallVec,
};

/// A NameMatch is a positive result of pattern matching inside
/// a filename or subpath
#[derive(Debug, Clone)]
pub struct NameMatch {
    pub score: i32, // score of the match, guaranteed strictly positive, bigger is better
    pub pos: Pos,   // positions of the matching chars
}

impl NameMatch {
    pub fn merge_with(self, other: Self) -> Self{
        let mut merged = SmallVec::new();
        let mut a_pos = self.pos.into_iter().peekable();
        let mut b_pos = other.pos.into_iter().peekable();

        loop {
            let (val, winning_iter) = match (a_pos.peek(), b_pos.peek()){
                (None, None) => break,
                (Some(a), None) => (*a, &mut a_pos),
                (None, Some(b)) => (*b, &mut b_pos),
                (Some(a), Some(b)) => {
                    if a < b {
                        (*a, &mut a_pos)
                    } else {
                        (*b, &mut b_pos)
                    }
                }
            };
            winning_iter.next();
            if let Some(last) = merged.last() {
                if val <= *last {
                    continue
                }
            }
            merged.push(val);
        }

        Self{
            score: self.score + other.score,
            pos: merged,
        }
    }
    /// wraps any group of matching characters with match_start and match_end
    pub fn wrap(
        &self,
        name: &str,
        match_start: &str,
        match_end: &str,
    ) -> String {
        let mut result = String::new();
        let mut index_in_pos = 0;
        let mut wrapped = false;
        for (idx, c) in name.chars().enumerate() {
            if index_in_pos < self.pos.len() && self.pos[index_in_pos] == idx {
                index_in_pos += 1;
                if !wrapped {
                    result.push_str(match_start);
                    wrapped = true;
                }
            } else if wrapped {
                result.push_str(match_end);
                wrapped = false;
            }
            result.push(c);
        }
        if wrapped {
            result.push_str(match_end);
        }
        result
    }
    // cut the name match in two parts by recomputing the pos
    // arrays
    pub fn cut_after(
        &mut self,
        chars_count: usize,
    ) -> Self {
        let mut tail = Self {
            score: self.score,
            pos: SmallVec::new(),
        };
        let idx = self.pos.iter().position(|&p| p >= chars_count);
        if let Some(idx) = idx {
            for p in self.pos.drain(idx..) {
                tail.pos.push(p - chars_count);
            }
        }
        tail
    }
}