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

/*
==--==--==--==--==--==--==--==--==--==--==--==--==--==--==--==--

sub-strs

Copyright (C) 2019-2023  Anonymous

There are several releases over multiple years,
they are listed as ranges, such as: "2019-2023".

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License
along with this program.  If not, see <https://www.gnu.org/licenses/>.

::--::--::--::--::--::--::--::--::--::--::--::--::--::--::--::--
*/

//! # Glob set

use {
    alloc::{
        borrow::Cow,
        collections::BTreeSet,
    },
    crate::Glob,
};

/// # Glob set
///
/// This struct contains a set of [`Glob`][struct:Glob]'s.
///
/// [struct:Glob]: struct.Glob.html
#[derive(Debug, Eq, PartialEq)]
pub struct GlobSet<'a> {

    globs: BTreeSet<Glob<'a>>,

}

impl<'a> GlobSet<'a> {

    /// # Makes new instance from an iterator of [`Cow<'a, str>`][r::Cow]
    ///
    /// ## Notes
    ///
    /// - Empty strings will be ignored.
    /// - If the iterator contains no globs, `None` is returned.
    ///
    /// ## Examples
    ///
    /// ```
    /// use sub_strs::GlobSet;
    ///
    /// let glob_set = GlobSet::from_iter("*.rs|*.md".split('|')).unwrap();
    /// assert!(glob_set.any("this.rs"));
    /// assert!(glob_set.any("that.md"));
    /// assert!(glob_set.any("not-this") == false);
    /// ```
    ///
    /// [r::Cow]: https://doc.rust-lang.org/std/borrow/enum.Cow.html
    pub fn from_iter<I0, I1>(iter: I0) -> Option<Self> where I0: IntoIterator<Item=I1>, I1: Into<Cow<'a, str>> {
        let globs: BTreeSet<_> = iter.into_iter().filter_map(|s| {
            let s = s.into();
            (s.is_empty() == false).then(|| Glob::from(s))
        }).collect();
        (globs.is_empty() == false).then_some(Self { globs })
    }

    /// # Merges an iterator of [`GlobSet<'a>`][::GlobSet] into one
    ///
    /// ## Notes
    ///
    /// - If there are no inner [`Glob`][::Glob]'s, `None` is returned.
    /// - For `#![no_std]` users: this function takes little effort to remove duplicates. You should help with that yourself (by not providing
    ///   duplicates).
    ///
    /// ## Examples
    ///
    /// ```
    /// use sub_strs::GlobSet;
    ///
    /// let program_args = &["*.svg,*.OGG", "*.md"];
    /// let glob_set = GlobSet::merge(
    ///     program_args.iter().filter_map(|s|
    ///         GlobSet::from_iter(s.to_lowercase().split(',').map(|s| s.to_string()))
    ///     )
    /// );
    /// assert!(glob_set.map(|g| g.any("some.ogg")).unwrap_or(false));
    /// ```
    ///
    /// [::Glob]: struct.Glob.html
    /// [::GlobSet]: struct.GlobSet.html
    pub fn merge<I>(iter: I) -> Option<Self> where I: IntoIterator<Item=Self> {
        let result = iter.into_iter().fold(Self { globs: BTreeSet::new() }, |mut result, mut item| {
            result.globs.append(&mut item.globs);
            result
        });
        (result.globs.is_empty() == false).then_some(result)
    }

    /// # Checks if _any_ glob inside matches the input string
    pub fn any<S>(&self, s: S) -> bool where S: AsRef<str> {
        self.globs.iter().any(|g| g.matches(&s))
    }

}