bbox-core 0.6.0

Common functionality for BBOX services
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135

use ignore::{types::TypesBuilder, WalkBuilder};
use std::cmp;
use std::path::{Path, PathBuf};

#[cfg(any(unix, windows))]
const SAME_FS_SUPPORTED: bool = true;

#[cfg(not(any(unix, windows)))]
const SAME_FS_SUPPORTED: bool = false;

/// Find files with given pattern ignoring hidden directories or similar
pub fn search<P: AsRef<Path>>(basedir: P, pattern: &str) -> Vec<PathBuf> {
    let mut builder = TypesBuilder::new();
    builder.add("files", pattern).expect("Invalid file pattern");
    let types = builder
        .select("files")
        .build()
        .expect("Invalid Types definition");
    let walker = WalkBuilder::new(basedir)
        .follow_links(true)
        .same_file_system(SAME_FS_SUPPORTED)
        .types(types)
        .build();
    let mut files = Vec::new();
    for entry in walker.flatten() {
        if !entry.file_type().expect("stdin not supported").is_dir() {
            files.push(entry.path().to_path_buf());
        }
    }
    files
}

/// Given a vector of paths, calculate the path
/// that is the longest common prefix.
pub fn longest_common_prefix(paths: &Vec<PathBuf>) -> PathBuf {
    if paths.is_empty() {
        return PathBuf::new();
    }
    let path0 = &paths[0];
    let mut len = path0.components().count();
    for path in paths {
        len = cmp::min(
            len,
            path.components()
                .take(len)
                .zip(path0.components())
                .take_while(|&(a, b)| a == b)
                .count(),
        );
    }
    let common: Vec<_> = path0
        .components()
        .take(len)
        .map(|comp| comp.as_os_str())
        .collect();
    common.iter().collect()
}

#[cfg(test)]
mod test {
    use super::*;

    #[test]
    fn empty_lcp() {
        assert_eq!(longest_common_prefix(&vec![]), PathBuf::new());
    }

    #[test]
    fn single_lcp() {
        assert_eq!(
            longest_common_prefix(&vec![PathBuf::from("/a/b")]),
            PathBuf::from("/a/b")
        );
    }

    #[test]
    fn no_lcp() {
        assert_eq!(
            longest_common_prefix(&vec![
                PathBuf::from("/a"),
                PathBuf::from("/b"),
                PathBuf::from("/c")
            ]),
            PathBuf::from("/")
        );
    }

    #[test]
    fn valid_lcp() {
        assert_eq!(
            longest_common_prefix(&vec![
                PathBuf::from("/a/b/a"),
                PathBuf::from("/a/b/b"),
                PathBuf::from("/a/b/c")
            ]),
            PathBuf::from("/a/b")
        );
    }

    #[test]
    fn valid_is_shortest_lcp() {
        assert_eq!(
            longest_common_prefix(&vec![
                PathBuf::from("/a/b/a"),
                PathBuf::from("/a/b"),
                PathBuf::from("/a/b/c")
            ]),
            PathBuf::from("/a/b")
        );
    }

    #[test]
    fn lcp_files() {
        assert_eq!(
            longest_common_prefix(&vec![
                PathBuf::from("/a/b/c/f1.x"),
                PathBuf::from("/a/b/f2.x"),
                PathBuf::from("/a/f3.x")
            ]),
            PathBuf::from("/a")
        );
        assert_eq!(
            longest_common_prefix(&vec![
                PathBuf::from("/a/f3.x"),
                PathBuf::from("/a/b/c/f1.x"),
                PathBuf::from("/a/b/f2.x")
            ]),
            PathBuf::from("/a")
        );
        assert_eq!(
            longest_common_prefix(&vec![PathBuf::from("/a/f1.x"),]),
            PathBuf::from("/a/f1.x") // Strip file names, if you want the path
        );
    }
}