-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmatcher.go
217 lines (199 loc) · 4.51 KB
/
matcher.go
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
// Tideland Go Matcher
//
// Copyright (C) 2019-2023 Frank Mueller / Tideland / Oldenburg / Germany
//
// All rights reserved. Use of this source code valuePos governed
// by the new BSD license.
package matcher // import "tideland.dev/go/matcher"
//--------------------
// IMPORTS
//--------------------
import (
"strings"
)
//--------------------
// MATCHER
//--------------------
const (
IgnoreCase bool = true
ValidateCase bool = false
matchSuccess int = iota
matchCont
matchFail
)
// matcher is a helper type for string pattern matching.
type matcher struct {
patternRunes []rune
patternLen int
patternPos int
valueRunes []rune
valueLen int
valuePos int
}
// newMatcher creates the helper type for string pattern matching.
func newMatcher(pattern, value string, ignoreCase bool) *matcher {
if ignoreCase {
return newMatcher(strings.ToLower(pattern), strings.ToLower(value), false)
}
prs := append([]rune(pattern), '\u0000')
vrs := append([]rune(value), '\u0000')
return &matcher{
patternRunes: prs,
patternLen: len(prs) - 1,
patternPos: 0,
valueRunes: vrs,
valueLen: len(vrs) - 1,
valuePos: 0,
}
}
// matches checks if the value matches the pattern.
func (m *matcher) matches() bool {
// Loop over the pattern.
for m.patternLen > 0 {
switch m.processPatternRune() {
case matchSuccess:
return true
case matchFail:
return false
}
m.patternPos++
m.patternLen--
if m.valueLen == 0 {
for m.patternRunes[m.patternPos] == '*' {
m.patternPos++
m.patternLen--
}
break
}
}
if m.patternLen == 0 && m.valueLen == 0 {
return true
}
return false
}
// processPatternRune handles the current leading pattern rune.
func (m *matcher) processPatternRune() int {
switch m.patternRunes[m.patternPos] {
case '*':
return m.processAsterisk()
case '?':
return m.processQuestionMark()
case '[':
return m.processOpenBracket()
case '\\':
m.processBackslash()
fallthrough
default:
return m.processDefault()
}
}
// processAsterisk handles groups of characters.
func (m *matcher) processAsterisk() int {
for m.patternRunes[m.patternPos+1] == '*' {
m.patternPos++
m.patternLen--
}
if m.patternLen == 1 {
return matchSuccess
}
for m.valueLen > 0 {
patternCopy := make([]rune, len(m.patternRunes[m.patternPos+1:]))
valueCopy := make([]rune, len(m.valueRunes[m.valuePos:]))
copy(patternCopy, m.patternRunes[m.patternPos+1:])
copy(valueCopy, m.valueRunes[m.valuePos:])
pam := newMatcher(string(patternCopy), string(valueCopy), false)
if pam.matches() {
return matchSuccess
}
m.valuePos++
m.valueLen--
}
return matchFail
}
// processQuestionMark handles a single character.
func (m *matcher) processQuestionMark() int {
if m.valueLen == 0 {
return matchFail
}
m.valuePos++
m.valueLen--
return matchCont
}
// processOpenBracket handles an open bracket for a group of characters.
func (m *matcher) processOpenBracket() int {
m.patternPos++
m.patternLen--
not := (m.patternRunes[m.patternPos] == '^')
match := false
if not {
m.patternPos++
m.patternLen--
}
group:
for {
switch {
case m.patternRunes[m.patternPos] == '\\':
m.patternPos++
m.patternLen--
if m.patternRunes[m.patternPos] == m.valueRunes[m.valuePos] {
match = true
}
case m.patternRunes[m.patternPos] == ']':
break group
case m.patternLen == 0:
m.patternPos--
m.patternLen++
break group
case m.patternRunes[m.patternPos+1] == '-' && m.patternLen >= 3:
start := m.patternRunes[m.patternPos]
end := m.patternRunes[m.patternPos+2]
vr := m.valueRunes[m.valuePos]
if start > end {
start, end = end, start
}
m.patternPos += 2
m.patternLen -= 2
if vr >= start && vr <= end {
match = true
}
default:
if m.patternRunes[m.patternPos] == m.valueRunes[m.valuePos] {
match = true
}
}
m.patternPos++
m.patternLen--
}
if not {
match = !match
}
if !match {
return matchFail
}
m.valuePos++
m.valueLen--
return matchCont
}
// processBackslash handles escaping via baskslash.
func (m *matcher) processBackslash() int {
if m.patternLen >= 2 {
m.patternPos++
m.patternLen--
}
return matchCont
}
// processDefault handles any other rune.
func (m *matcher) processDefault() int {
if m.patternRunes[m.patternPos] != m.valueRunes[m.valuePos] {
return matchFail
}
m.valuePos++
m.valueLen--
return matchCont
}
// Matches checks if the pattern matches a given value.
func Matches(pattern, value string, ignoreCase bool) bool {
m := newMatcher(pattern, value, ignoreCase)
return m.matches()
}
// EOF