// Copyright 2020 The Jujutsu Authors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #![allow(missing_docs)] use std::collections::HashMap; use std::collections::HashSet; use std::fmt; use std::fmt::Debug; use std::iter; use itertools::Itertools as _; use tracing::instrument; use crate::repo_path::RepoPath; use crate::repo_path::RepoPathComponentBuf; #[derive(PartialEq, Eq, Debug)] pub enum Visit { /// Everything in the directory is *guaranteed* to match, no need to check /// descendants AllRecursively, Specific { dirs: VisitDirs, files: VisitFiles, }, /// Nothing in the directory or its subdirectories will match. /// /// This is the same as `Specific` with no directories or files. Use /// `Visit::set()` to get create an instance that's `Specific` or /// `Nothing` depending on the values at runtime. Nothing, } impl Visit { fn sets(dirs: HashSet, files: HashSet) -> Self { if dirs.is_empty() && files.is_empty() { Self::Nothing } else { Self::Specific { dirs: VisitDirs::Set(dirs), files: VisitFiles::Set(files), } } } pub fn is_nothing(&self) -> bool { *self == Visit::Nothing } } #[derive(PartialEq, Eq, Debug)] pub enum VisitDirs { All, Set(HashSet), } #[derive(PartialEq, Eq, Debug)] pub enum VisitFiles { All, Set(HashSet), } pub trait Matcher: Debug + Sync { fn matches(&self, file: &RepoPath) -> bool; fn visit(&self, dir: &RepoPath) -> Visit; } impl Matcher for &T { fn matches(&self, file: &RepoPath) -> bool { ::matches(self, file) } fn visit(&self, dir: &RepoPath) -> Visit { ::visit(self, dir) } } impl Matcher for Box { fn matches(&self, file: &RepoPath) -> bool { ::matches(self, file) } fn visit(&self, dir: &RepoPath) -> Visit { ::visit(self, dir) } } #[derive(PartialEq, Eq, Debug)] pub struct NothingMatcher; impl Matcher for NothingMatcher { fn matches(&self, _file: &RepoPath) -> bool { false } fn visit(&self, _dir: &RepoPath) -> Visit { Visit::Nothing } } #[derive(PartialEq, Eq, Debug)] pub struct EverythingMatcher; impl Matcher for EverythingMatcher { fn matches(&self, _file: &RepoPath) -> bool { true } fn visit(&self, _dir: &RepoPath) -> Visit { Visit::AllRecursively } } #[derive(PartialEq, Eq, Debug)] pub struct FilesMatcher { tree: RepoPathTree, } impl FilesMatcher { pub fn new(files: impl IntoIterator>) -> Self { let mut tree = RepoPathTree::default(); for f in files { tree.add(f.as_ref()).value = FilesNodeKind::File; } FilesMatcher { tree } } } impl Matcher for FilesMatcher { fn matches(&self, file: &RepoPath) -> bool { self.tree .get(file) .map_or(false, |sub| sub.value == FilesNodeKind::File) } fn visit(&self, dir: &RepoPath) -> Visit { self.tree .get(dir) .map_or(Visit::Nothing, files_tree_to_visit_sets) } } #[derive(Clone, Copy, Debug, Default, Eq, PartialEq)] enum FilesNodeKind { /// Represents an intermediate directory. #[default] Dir, /// Represents a file (which might also be an intermediate directory.) File, } fn files_tree_to_visit_sets(tree: &RepoPathTree) -> Visit { let mut dirs = HashSet::new(); let mut files = HashSet::new(); for (name, sub) in &tree.entries { // should visit only intermediate directories if !sub.entries.is_empty() { dirs.insert(name.clone()); } if sub.value == FilesNodeKind::File { files.insert(name.clone()); } } Visit::sets(dirs, files) } #[derive(Debug)] pub struct PrefixMatcher { tree: RepoPathTree, } impl PrefixMatcher { #[instrument(skip(prefixes))] pub fn new(prefixes: impl IntoIterator>) -> Self { let mut tree = RepoPathTree::default(); for prefix in prefixes { tree.add(prefix.as_ref()).value = PrefixNodeKind::Prefix; } PrefixMatcher { tree } } } impl Matcher for PrefixMatcher { fn matches(&self, file: &RepoPath) -> bool { self.tree .walk_to(file) .any(|(sub, _)| sub.value == PrefixNodeKind::Prefix) } fn visit(&self, dir: &RepoPath) -> Visit { for (sub, tail_path) in self.tree.walk_to(dir) { // ancestor of 'dir' matches prefix paths if sub.value == PrefixNodeKind::Prefix { return Visit::AllRecursively; } // 'dir' found, and is an ancestor of prefix paths if tail_path.is_root() { return prefix_tree_to_visit_sets(sub); } } Visit::Nothing } } #[derive(Clone, Copy, Debug, Default, Eq, PartialEq)] enum PrefixNodeKind { /// Represents an intermediate directory. #[default] Dir, /// Represents a file and prefix directory. Prefix, } fn prefix_tree_to_visit_sets(tree: &RepoPathTree) -> Visit { let mut dirs = HashSet::new(); let mut files = HashSet::new(); for (name, sub) in &tree.entries { // should visit both intermediate and prefix directories dirs.insert(name.clone()); if sub.value == PrefixNodeKind::Prefix { files.insert(name.clone()); } } Visit::sets(dirs, files) } /// Matches file paths with glob patterns. /// /// Patterns are provided as `(dir, pattern)` pairs, where `dir` should be the /// longest directory path that contains no glob meta characters, and `pattern` /// will be evaluated relative to `dir`. #[derive(Clone, Debug)] pub struct FileGlobsMatcher { tree: RepoPathTree>, } impl FileGlobsMatcher { pub fn new>( dir_patterns: impl IntoIterator, ) -> Self { let mut tree: RepoPathTree> = Default::default(); for (dir, pattern) in dir_patterns { tree.add(dir.as_ref()).value.push(pattern); } FileGlobsMatcher { tree } } } impl Matcher for FileGlobsMatcher { fn matches(&self, file: &RepoPath) -> bool { // TODO: glob::Pattern relies on path::is_separator() internally, but // RepoPath separator should be '/'. One way to address this problem is // to switch to globset::Glob, and use the underlying regex pattern. const OPTIONS: glob::MatchOptions = glob::MatchOptions { case_sensitive: true, require_literal_separator: true, require_literal_leading_dot: false, }; // check if any ancestor (dir, patterns) matches 'file' self.tree .walk_to(file) .take_while(|(_, tail_path)| !tail_path.is_root()) // only dirs .any(|(sub, tail_path)| { let name = tail_path.as_internal_file_string(); sub.value.iter().any(|pat| pat.matches_with(name, OPTIONS)) }) } fn visit(&self, dir: &RepoPath) -> Visit { for (sub, tail_path) in self.tree.walk_to(dir) { // ancestor of 'dir' has patterns, can't narrow visit anymore if !sub.value.is_empty() { return Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All, }; } // 'dir' found, and is an ancestor of pattern paths if tail_path.is_root() { let sub_dirs = sub.entries.keys().cloned().collect(); return Visit::sets(sub_dirs, HashSet::new()); } } Visit::Nothing } } /// Matches paths that are matched by any of the input matchers. #[derive(Clone, Debug)] pub struct UnionMatcher { input1: M1, input2: M2, } impl UnionMatcher { pub fn new(input1: M1, input2: M2) -> Self { Self { input1, input2 } } } impl Matcher for UnionMatcher { fn matches(&self, file: &RepoPath) -> bool { self.input1.matches(file) || self.input2.matches(file) } fn visit(&self, dir: &RepoPath) -> Visit { match self.input1.visit(dir) { Visit::AllRecursively => Visit::AllRecursively, Visit::Nothing => self.input2.visit(dir), Visit::Specific { dirs: dirs1, files: files1, } => match self.input2.visit(dir) { Visit::AllRecursively => Visit::AllRecursively, Visit::Nothing => Visit::Specific { dirs: dirs1, files: files1, }, Visit::Specific { dirs: dirs2, files: files2, } => { let dirs = match (dirs1, dirs2) { (VisitDirs::All, _) | (_, VisitDirs::All) => VisitDirs::All, (VisitDirs::Set(dirs1), VisitDirs::Set(dirs2)) => { VisitDirs::Set(dirs1.iter().chain(&dirs2).cloned().collect()) } }; let files = match (files1, files2) { (VisitFiles::All, _) | (_, VisitFiles::All) => VisitFiles::All, (VisitFiles::Set(files1), VisitFiles::Set(files2)) => { VisitFiles::Set(files1.iter().chain(&files2).cloned().collect()) } }; Visit::Specific { dirs, files } } }, } } } /// Matches paths that are matched by the first input matcher but not by the /// second. #[derive(Clone, Debug)] pub struct DifferenceMatcher { /// The minuend wanted: M1, /// The subtrahend unwanted: M2, } impl DifferenceMatcher { pub fn new(wanted: M1, unwanted: M2) -> Self { Self { wanted, unwanted } } } impl Matcher for DifferenceMatcher { fn matches(&self, file: &RepoPath) -> bool { self.wanted.matches(file) && !self.unwanted.matches(file) } fn visit(&self, dir: &RepoPath) -> Visit { match self.unwanted.visit(dir) { Visit::AllRecursively => Visit::Nothing, Visit::Nothing => self.wanted.visit(dir), Visit::Specific { .. } => match self.wanted.visit(dir) { Visit::AllRecursively => Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All, }, wanted_visit => wanted_visit, }, } } } /// Matches paths that are matched by both input matchers. #[derive(Clone, Debug)] pub struct IntersectionMatcher { input1: M1, input2: M2, } impl IntersectionMatcher { pub fn new(input1: M1, input2: M2) -> Self { Self { input1, input2 } } } impl Matcher for IntersectionMatcher { fn matches(&self, file: &RepoPath) -> bool { self.input1.matches(file) && self.input2.matches(file) } fn visit(&self, dir: &RepoPath) -> Visit { match self.input1.visit(dir) { Visit::AllRecursively => self.input2.visit(dir), Visit::Nothing => Visit::Nothing, Visit::Specific { dirs: dirs1, files: files1, } => match self.input2.visit(dir) { Visit::AllRecursively => Visit::Specific { dirs: dirs1, files: files1, }, Visit::Nothing => Visit::Nothing, Visit::Specific { dirs: dirs2, files: files2, } => { let dirs = match (dirs1, dirs2) { (VisitDirs::All, VisitDirs::All) => VisitDirs::All, (dirs1, VisitDirs::All) => dirs1, (VisitDirs::All, dirs2) => dirs2, (VisitDirs::Set(dirs1), VisitDirs::Set(dirs2)) => { VisitDirs::Set(dirs1.intersection(&dirs2).cloned().collect()) } }; let files = match (files1, files2) { (VisitFiles::All, VisitFiles::All) => VisitFiles::All, (files1, VisitFiles::All) => files1, (VisitFiles::All, files2) => files2, (VisitFiles::Set(files1), VisitFiles::Set(files2)) => { VisitFiles::Set(files1.intersection(&files2).cloned().collect()) } }; match (&dirs, &files) { (VisitDirs::Set(dirs), VisitFiles::Set(files)) if dirs.is_empty() && files.is_empty() => { Visit::Nothing } _ => Visit::Specific { dirs, files }, } } }, } } } /// Tree that maps `RepoPath` to value of type `V`. #[derive(Clone, Default, Eq, PartialEq)] struct RepoPathTree { entries: HashMap>, value: V, } impl RepoPathTree { fn add(&mut self, dir: &RepoPath) -> &mut Self where V: Default, { dir.components().fold(self, |sub, name| { // Avoid name.clone() if entry already exists. if !sub.entries.contains_key(name) { sub.entries.insert(name.to_owned(), Self::default()); } sub.entries.get_mut(name).unwrap() }) } fn get(&self, dir: &RepoPath) -> Option<&Self> { dir.components() .try_fold(self, |sub, name| sub.entries.get(name)) } /// Walks the tree from the root to the given `dir`, yielding each sub tree /// and remaining path. fn walk_to<'a, 'b: 'a>( &'a self, dir: &'b RepoPath, ) -> impl Iterator + 'a { iter::successors(Some((self, dir)), |(sub, dir)| { let mut components = dir.components(); let name = components.next()?; Some((sub.entries.get(name)?, components.as_path())) }) } } impl Debug for RepoPathTree { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { self.value.fmt(f)?; f.write_str(" ")?; f.debug_map() .entries( self.entries .iter() .sorted_unstable_by_key(|&(name, _)| name), ) .finish() } } #[cfg(test)] mod tests { use maplit::hashset; use super::*; fn repo_path(value: &str) -> &RepoPath { RepoPath::from_internal_string(value) } #[test] fn test_nothingmatcher() { let m = NothingMatcher; assert!(!m.matches(repo_path("file"))); assert!(!m.matches(repo_path("dir/file"))); assert_eq!(m.visit(RepoPath::root()), Visit::Nothing); } #[test] fn test_filesmatcher_empty() { let m = FilesMatcher::new([] as [&RepoPath; 0]); assert!(!m.matches(repo_path("file"))); assert!(!m.matches(repo_path("dir/file"))); assert_eq!(m.visit(RepoPath::root()), Visit::Nothing); } #[test] fn test_filesmatcher_nonempty() { let m = FilesMatcher::new([ repo_path("dir1/subdir1/file1"), repo_path("dir1/subdir1/file2"), repo_path("dir1/subdir2/file3"), repo_path("file4"), ]); assert!(!m.matches(repo_path("dir1"))); assert!(!m.matches(repo_path("dir1/subdir1"))); assert!(m.matches(repo_path("dir1/subdir1/file1"))); assert!(m.matches(repo_path("dir1/subdir1/file2"))); assert!(!m.matches(repo_path("dir1/subdir1/file3"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets( hashset! {RepoPathComponentBuf::from("dir1")}, hashset! {RepoPathComponentBuf::from("file4")} ) ); assert_eq!( m.visit(repo_path("dir1")), Visit::sets( hashset! { RepoPathComponentBuf::from("subdir1"), RepoPathComponentBuf::from("subdir2"), }, hashset! {} ) ); assert_eq!( m.visit(repo_path("dir1/subdir1")), Visit::sets( hashset! {}, hashset! { RepoPathComponentBuf::from("file1"), RepoPathComponentBuf::from("file2"), }, ) ); assert_eq!( m.visit(repo_path("dir1/subdir2")), Visit::sets(hashset! {}, hashset! {RepoPathComponentBuf::from("file3")}) ); } #[test] fn test_prefixmatcher_empty() { let m = PrefixMatcher::new([] as [&RepoPath; 0]); assert!(!m.matches(repo_path("file"))); assert!(!m.matches(repo_path("dir/file"))); assert_eq!(m.visit(RepoPath::root()), Visit::Nothing); } #[test] fn test_prefixmatcher_root() { let m = PrefixMatcher::new([RepoPath::root()]); // Matches all files assert!(m.matches(repo_path("file"))); assert!(m.matches(repo_path("dir/file"))); // Visits all directories assert_eq!(m.visit(RepoPath::root()), Visit::AllRecursively); assert_eq!(m.visit(repo_path("foo/bar")), Visit::AllRecursively); } #[test] fn test_prefixmatcher_single_prefix() { let m = PrefixMatcher::new([repo_path("foo/bar")]); // Parts of the prefix should not match assert!(!m.matches(repo_path("foo"))); assert!(!m.matches(repo_path("bar"))); // A file matching the prefix exactly should match assert!(m.matches(repo_path("foo/bar"))); // Files in subdirectories should match assert!(m.matches(repo_path("foo/bar/baz"))); assert!(m.matches(repo_path("foo/bar/baz/qux"))); // Sibling files should not match assert!(!m.matches(repo_path("foo/foo"))); // An unrooted "foo/bar" should not match assert!(!m.matches(repo_path("bar/foo/bar"))); // The matcher should only visit directory foo/ in the root (file "foo" // shouldn't be visited) assert_eq!( m.visit(RepoPath::root()), Visit::sets(hashset! {RepoPathComponentBuf::from("foo")}, hashset! {}) ); // Inside parent directory "foo/", both subdirectory "bar" and file "bar" may // match assert_eq!( m.visit(repo_path("foo")), Visit::sets( hashset! {RepoPathComponentBuf::from("bar")}, hashset! {RepoPathComponentBuf::from("bar")} ) ); // Inside a directory that matches the prefix, everything matches recursively assert_eq!(m.visit(repo_path("foo/bar")), Visit::AllRecursively); // Same thing in subdirectories of the prefix assert_eq!(m.visit(repo_path("foo/bar/baz")), Visit::AllRecursively); // Nothing in directories that are siblings of the prefix can match, so don't // visit assert_eq!(m.visit(repo_path("bar")), Visit::Nothing); } #[test] fn test_prefixmatcher_nested_prefixes() { let m = PrefixMatcher::new([repo_path("foo"), repo_path("foo/bar/baz")]); assert!(m.matches(repo_path("foo"))); assert!(!m.matches(repo_path("bar"))); assert!(m.matches(repo_path("foo/bar"))); // Matches because the "foo" pattern matches assert!(m.matches(repo_path("foo/baz/foo"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets( hashset! {RepoPathComponentBuf::from("foo")}, hashset! {RepoPathComponentBuf::from("foo")} ) ); // Inside a directory that matches the prefix, everything matches recursively assert_eq!(m.visit(repo_path("foo")), Visit::AllRecursively); // Same thing in subdirectories of the prefix assert_eq!(m.visit(repo_path("foo/bar/baz")), Visit::AllRecursively); } #[test] fn test_fileglobsmatcher_rooted() { let to_pattern = |s| glob::Pattern::new(s).unwrap(); let m = FileGlobsMatcher::new([(RepoPath::root(), to_pattern("*.rs"))]); assert!(!m.matches(repo_path("foo"))); assert!(m.matches(repo_path("foo.rs"))); assert!(!m.matches(repo_path("foo.rss"))); assert!(!m.matches(repo_path("foo.rs/bar.rs"))); assert!(!m.matches(repo_path("foo/bar.rs"))); assert_eq!( m.visit(RepoPath::root()), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All } ); // Multiple patterns at the same directory let m = FileGlobsMatcher::new([ (RepoPath::root(), to_pattern("foo?")), (RepoPath::root(), to_pattern("**/*.rs")), ]); assert!(!m.matches(repo_path("foo"))); assert!(m.matches(repo_path("foo1"))); assert!(!m.matches(repo_path("Foo1"))); assert!(!m.matches(repo_path("foo1/foo2"))); assert!(m.matches(repo_path("foo.rs"))); assert!(m.matches(repo_path("foo.rs/bar.rs"))); assert!(m.matches(repo_path("foo/bar.rs"))); assert_eq!( m.visit(RepoPath::root()), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All } ); assert_eq!( m.visit(repo_path("foo")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All } ); assert_eq!( m.visit(repo_path("bar/baz")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All } ); } #[test] fn test_fileglobsmatcher_nested() { let to_pattern = |s| glob::Pattern::new(s).unwrap(); let m = FileGlobsMatcher::new([ (repo_path("foo"), to_pattern("**/*.a")), (repo_path("foo/bar"), to_pattern("*.b")), (repo_path("baz"), to_pattern("?*")), ]); assert!(!m.matches(repo_path("foo"))); assert!(m.matches(repo_path("foo/x.a"))); assert!(!m.matches(repo_path("foo/x.b"))); assert!(m.matches(repo_path("foo/bar/x.a"))); assert!(m.matches(repo_path("foo/bar/x.b"))); assert!(m.matches(repo_path("foo/bar/baz/x.a"))); assert!(!m.matches(repo_path("foo/bar/baz/x.b"))); assert!(!m.matches(repo_path("baz"))); assert!(m.matches(repo_path("baz/x"))); assert_eq!( m.visit(RepoPath::root()), Visit::Specific { dirs: VisitDirs::Set(hashset! { RepoPathComponentBuf::from("foo"), RepoPathComponentBuf::from("baz"), }), files: VisitFiles::Set(hashset! {}), } ); assert_eq!( m.visit(repo_path("foo")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All, } ); assert_eq!( m.visit(repo_path("foo/bar")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All, } ); assert_eq!( m.visit(repo_path("foo/bar/baz")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All, } ); assert_eq!(m.visit(repo_path("bar")), Visit::Nothing); assert_eq!( m.visit(repo_path("baz")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All, } ); } #[test] fn test_fileglobsmatcher_wildcard_any() { let to_pattern = |s| glob::Pattern::new(s).unwrap(); // "*" could match the root path, but it doesn't matter since the root // isn't a valid file path. let m = FileGlobsMatcher::new([(RepoPath::root(), to_pattern("*"))]); assert!(!m.matches(RepoPath::root())); // doesn't matter assert!(m.matches(repo_path("x"))); assert!(m.matches(repo_path("x.rs"))); assert!(!m.matches(repo_path("foo/bar.rs"))); assert_eq!( m.visit(RepoPath::root()), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All } ); // "foo/*" shouldn't match "foo" let m = FileGlobsMatcher::new([(repo_path("foo"), to_pattern("*"))]); assert!(!m.matches(RepoPath::root())); assert!(!m.matches(repo_path("foo"))); assert!(m.matches(repo_path("foo/x"))); assert!(!m.matches(repo_path("foo/bar/baz"))); assert_eq!( m.visit(RepoPath::root()), Visit::Specific { dirs: VisitDirs::Set(hashset! {RepoPathComponentBuf::from("foo")}), files: VisitFiles::Set(hashset! {}), } ); assert_eq!( m.visit(repo_path("foo")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All } ); assert_eq!(m.visit(repo_path("bar")), Visit::Nothing); } #[test] fn test_unionmatcher_concatenate_roots() { let m1 = PrefixMatcher::new([repo_path("foo"), repo_path("bar")]); let m2 = PrefixMatcher::new([repo_path("bar"), repo_path("baz")]); let m = UnionMatcher::new(&m1, &m2); assert!(m.matches(repo_path("foo"))); assert!(m.matches(repo_path("foo/bar"))); assert!(m.matches(repo_path("bar"))); assert!(m.matches(repo_path("bar/foo"))); assert!(m.matches(repo_path("baz"))); assert!(m.matches(repo_path("baz/foo"))); assert!(!m.matches(repo_path("qux"))); assert!(!m.matches(repo_path("qux/foo"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets( hashset! { RepoPathComponentBuf::from("foo"), RepoPathComponentBuf::from("bar"), RepoPathComponentBuf::from("baz"), }, hashset! { RepoPathComponentBuf::from("foo"), RepoPathComponentBuf::from("bar"), RepoPathComponentBuf::from("baz"), }, ) ); assert_eq!(m.visit(repo_path("foo")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("foo/bar")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("bar")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("bar/foo")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("baz")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("baz/foo")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("qux")), Visit::Nothing); assert_eq!(m.visit(repo_path("qux/foo")), Visit::Nothing); } #[test] fn test_unionmatcher_concatenate_subdirs() { let m1 = PrefixMatcher::new([repo_path("common/bar"), repo_path("1/foo")]); let m2 = PrefixMatcher::new([repo_path("common/baz"), repo_path("2/qux")]); let m = UnionMatcher::new(&m1, &m2); assert!(!m.matches(repo_path("common"))); assert!(!m.matches(repo_path("1"))); assert!(!m.matches(repo_path("2"))); assert!(m.matches(repo_path("common/bar"))); assert!(m.matches(repo_path("common/bar/baz"))); assert!(m.matches(repo_path("common/baz"))); assert!(m.matches(repo_path("1/foo"))); assert!(m.matches(repo_path("1/foo/qux"))); assert!(m.matches(repo_path("2/qux"))); assert!(!m.matches(repo_path("2/quux"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets( hashset! { RepoPathComponentBuf::from("common"), RepoPathComponentBuf::from("1"), RepoPathComponentBuf::from("2"), }, hashset! {}, ) ); assert_eq!( m.visit(repo_path("common")), Visit::sets( hashset! { RepoPathComponentBuf::from("bar"), RepoPathComponentBuf::from("baz"), }, hashset! { RepoPathComponentBuf::from("bar"), RepoPathComponentBuf::from("baz"), }, ) ); assert_eq!( m.visit(repo_path("1")), Visit::sets( hashset! {RepoPathComponentBuf::from("foo")}, hashset! {RepoPathComponentBuf::from("foo")}, ) ); assert_eq!( m.visit(repo_path("2")), Visit::sets( hashset! {RepoPathComponentBuf::from("qux")}, hashset! {RepoPathComponentBuf::from("qux")}, ) ); assert_eq!(m.visit(repo_path("common/bar")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("1/foo")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("2/qux")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("2/quux")), Visit::Nothing); } #[test] fn test_differencematcher_remove_subdir() { let m1 = PrefixMatcher::new([repo_path("foo"), repo_path("bar")]); let m2 = PrefixMatcher::new([repo_path("foo/bar")]); let m = DifferenceMatcher::new(&m1, &m2); assert!(m.matches(repo_path("foo"))); assert!(!m.matches(repo_path("foo/bar"))); assert!(!m.matches(repo_path("foo/bar/baz"))); assert!(m.matches(repo_path("foo/baz"))); assert!(m.matches(repo_path("bar"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets( hashset! { RepoPathComponentBuf::from("foo"), RepoPathComponentBuf::from("bar"), }, hashset! { RepoPathComponentBuf::from("foo"), RepoPathComponentBuf::from("bar"), }, ) ); assert_eq!( m.visit(repo_path("foo")), Visit::Specific { dirs: VisitDirs::All, files: VisitFiles::All, } ); assert_eq!(m.visit(repo_path("foo/bar")), Visit::Nothing); assert_eq!(m.visit(repo_path("foo/baz")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("bar")), Visit::AllRecursively); } #[test] fn test_differencematcher_shared_patterns() { let m1 = PrefixMatcher::new([repo_path("foo"), repo_path("bar")]); let m2 = PrefixMatcher::new([repo_path("foo")]); let m = DifferenceMatcher::new(&m1, &m2); assert!(!m.matches(repo_path("foo"))); assert!(!m.matches(repo_path("foo/bar"))); assert!(m.matches(repo_path("bar"))); assert!(m.matches(repo_path("bar/foo"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets( hashset! { RepoPathComponentBuf::from("foo"), RepoPathComponentBuf::from("bar"), }, hashset! { RepoPathComponentBuf::from("foo"), RepoPathComponentBuf::from("bar"), }, ) ); assert_eq!(m.visit(repo_path("foo")), Visit::Nothing); assert_eq!(m.visit(repo_path("foo/bar")), Visit::Nothing); assert_eq!(m.visit(repo_path("bar")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("bar/foo")), Visit::AllRecursively); } #[test] fn test_intersectionmatcher_intersecting_roots() { let m1 = PrefixMatcher::new([repo_path("foo"), repo_path("bar")]); let m2 = PrefixMatcher::new([repo_path("bar"), repo_path("baz")]); let m = IntersectionMatcher::new(&m1, &m2); assert!(!m.matches(repo_path("foo"))); assert!(!m.matches(repo_path("foo/bar"))); assert!(m.matches(repo_path("bar"))); assert!(m.matches(repo_path("bar/foo"))); assert!(!m.matches(repo_path("baz"))); assert!(!m.matches(repo_path("baz/foo"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets( hashset! {RepoPathComponentBuf::from("bar")}, hashset! {RepoPathComponentBuf::from("bar")} ) ); assert_eq!(m.visit(repo_path("foo")), Visit::Nothing); assert_eq!(m.visit(repo_path("foo/bar")), Visit::Nothing); assert_eq!(m.visit(repo_path("bar")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("bar/foo")), Visit::AllRecursively); assert_eq!(m.visit(repo_path("baz")), Visit::Nothing); assert_eq!(m.visit(repo_path("baz/foo")), Visit::Nothing); } #[test] fn test_intersectionmatcher_subdir() { let m1 = PrefixMatcher::new([repo_path("foo")]); let m2 = PrefixMatcher::new([repo_path("foo/bar")]); let m = IntersectionMatcher::new(&m1, &m2); assert!(!m.matches(repo_path("foo"))); assert!(!m.matches(repo_path("bar"))); assert!(m.matches(repo_path("foo/bar"))); assert!(m.matches(repo_path("foo/bar/baz"))); assert!(!m.matches(repo_path("foo/baz"))); assert_eq!( m.visit(RepoPath::root()), Visit::sets(hashset! {RepoPathComponentBuf::from("foo")}, hashset! {}) ); assert_eq!(m.visit(repo_path("bar")), Visit::Nothing); assert_eq!( m.visit(repo_path("foo")), Visit::sets( hashset! {RepoPathComponentBuf::from("bar")}, hashset! {RepoPathComponentBuf::from("bar")} ) ); assert_eq!(m.visit(repo_path("foo/bar")), Visit::AllRecursively); } }