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

//! a filtering pattern using a regular expression

use {
    super::NameMatch,
    crate::errors::PatternError,
    lazy_regex::regex,
    smallvec::SmallVec,
    std::fmt,
};

#[derive(Debug, Clone)]
pub struct RegexPattern {
    rex: regex::Regex,
    flags: String,
}

impl fmt::Display for RegexPattern {
    fn fmt(
        &self,
        f: &mut fmt::Formatter<'_>,
    ) -> fmt::Result {
        if self.flags.is_empty() {
            write!(f, "/{}", self.rex)
        } else {
            write!(f, "/{}/{}", self.rex, self.flags)
        }
    }
}

impl RegexPattern {
    pub fn from(
        pat: &str,
        flags: &str,
    ) -> Result<Self, PatternError> {
        Ok(RegexPattern {
            rex: super::build_regex(pat, flags)?,
            flags: flags.to_string(),
        })
    }
    /// return a match if the pattern can be found in the candidate string
    pub fn find(
        &self,
        candidate: &str,
    ) -> Option<NameMatch> {
        // note that there's no significative cost related to using
        //  find over is_match
        self.rex.find(candidate).map(|rm| {
            let chars_before = candidate[..rm.start()].chars().count();
            let rm_chars = rm.as_str().chars().count();
            let mut pos = SmallVec::with_capacity(rm_chars);
            for i in 0..rm_chars {
                pos.push(chars_before + i);
            }
            super::NameMatch { score: 1, pos }
        })
    }
    pub fn is_empty(&self) -> bool {
        self.rex.as_str().is_empty()
    }
}