aboutsummaryrefslogtreecommitdiff
path: root/libbutl/path-pattern.ixx
blob: 6fee31e3848c5145cb6dfb108e514f32253c79d5 (plain)
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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
// file      : libbutl/path-pattern.ixx -*- C++ -*-
// license   : MIT; see accompanying LICENSE file

namespace butl
{
  // path_match_flags
  //
  inline path_match_flags operator& (path_match_flags x, path_match_flags y)
  {
    return x &= y;
  }

  inline path_match_flags operator| (path_match_flags x, path_match_flags y)
  {
    return x |= y;
  }

  inline path_match_flags operator&= (path_match_flags& x, path_match_flags y)
  {
    return x = static_cast<path_match_flags> (
      static_cast<std::uint16_t> (x) &
      static_cast<std::uint16_t> (y));
  }

  inline path_match_flags operator|= (path_match_flags& x, path_match_flags y)
  {
    return x = static_cast<path_match_flags> (
      static_cast<std::uint16_t> (x) |
      static_cast<std::uint16_t> (y));
  }

  // path_pattern_iterator
  //
  inline path_pattern_iterator::
  path_pattern_iterator (std::string::const_iterator begin,
                         std::string::const_iterator end)
      : i_ (begin),
        e_ (end)
  {
    next (); // If i_ == e_ we will end up with the end iterator.
  }

  inline path_pattern_iterator::
  path_pattern_iterator (const std::string& s)
      : path_pattern_iterator (s.begin (), s.end ())
  {
  }

  inline bool
  operator== (const path_pattern_iterator& x, const path_pattern_iterator& y)
  {
    return x.t_.has_value () == y.t_.has_value () &&
           (!x.t_ || (x.i_ == y.i_ && x.e_ == y.e_));
  }

  inline bool
  operator!= (const path_pattern_iterator& x, const path_pattern_iterator& y)
  {
    return !(x == y);
  }

  inline path_pattern_iterator
  begin (const path_pattern_iterator& i)
  {
    return i;
  }

  inline path_pattern_iterator
  end (const path_pattern_iterator&)
  {
    return path_pattern_iterator ();
  }

  // patterns
  //
  inline char
  get_literal (const path_pattern_term& t)
  {
    assert (t.literal ());
    return *t.begin;
  }

  inline bool
  path_pattern (const std::string& s)
  {
    for (const path_pattern_term& t: path_pattern_iterator (s))
    {
      if (!t.literal ())
        return true;
    }

    return false;
  }

  // Return true for a pattern containing the specified number of the
  // consecutive star wildcards.
  //
  inline bool
  path_pattern_recursive (const std::string& s, std::size_t sn)
  {
    std::size_t n (0);
    for (const path_pattern_term& t: path_pattern_iterator (s))
    {
      if (t.star ())
      {
        if (++n == sn)
          return true;
      }
      else
        n = 0;
    }

    return false;
  }

  inline bool
  path_pattern_recursive (const std::string& s)
  {
    return path_pattern_recursive (s, 2);
  }

  inline bool
  path_pattern_self_matching (const std::string& s)
  {
    return path_pattern_recursive (s, 3);
  }

  inline bool
  path_pattern (const path& p)
  {
    for (auto i (p.begin ()); i != p.end (); ++i)
    {
      if (path_pattern (*i))
        return true;
    }

    return false;
  }

  inline std::size_t
  path_pattern_recursive (const path& p)
  {
    std::size_t r (0);
    for (auto i (p.begin ()); i != p.end (); ++i)
    {
      if (path_pattern_recursive (*i))
        ++r;
    }

    return r;
  }

  inline bool
  path_pattern_self_matching (const path& p)
  {
    return !p.empty () && path_pattern_self_matching (*p.begin ());
  }
}