forked from elastic/beats
-
Notifications
You must be signed in to change notification settings - Fork 1
/
matcher.go
147 lines (123 loc) · 3.03 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
package match
import "regexp/syntax"
type Matcher struct {
stringMatcher
}
type ExactMatcher struct {
stringMatcher
}
type stringMatcher interface {
// MatchString tries to find a matching substring.
MatchString(s string) (matched bool)
// Match tries to find a matching substring.
Match(bs []byte) (matched bool)
// Describe the generator
String() string
}
func MustCompile(pattern string) Matcher {
m, err := Compile(pattern)
if err != nil {
panic(err)
}
return m
}
func MustCompileExact(pattern string) ExactMatcher {
m, err := CompileExact(pattern)
if err != nil {
panic(err)
}
return m
}
// CompileString matches a substring only, the input is not interpreted as
// regular expression
func CompileString(in string) (Matcher, error) {
if in == "" {
return Matcher{(*emptyStringMatcher)(nil)}, nil
}
return Matcher{&substringMatcher{in, []byte(in)}}, nil
}
// Compile regular expression to string matcher. String matcher by default uses
// regular expressions as provided by regexp library, but tries to optimize some
// common cases, replacing expensive patterns with cheaper custom implementations
// or removing terms not necessary for string matching.
func Compile(pattern string) (Matcher, error) {
regex, err := syntax.Parse(pattern, syntax.Perl)
if err != nil {
return Matcher{}, err
}
regex = optimize(regex).Simplify()
m, err := compile(regex)
return Matcher{m}, err
}
func CompileExact(pattern string) (ExactMatcher, error) {
regex, err := syntax.Parse(pattern, syntax.Perl)
if err != nil {
return ExactMatcher{}, err
}
regex = regex.Simplify()
if regex.Op != syntax.OpConcat {
regex = &syntax.Regexp{
Op: syntax.OpConcat,
Sub: []*syntax.Regexp{
patBeginText,
regex,
patEndText,
},
Flags: regex.Flags,
}
} else {
if !eqPrefixRegex(regex, patBeginText) {
regex.Sub = append([]*syntax.Regexp{patBeginText}, regex.Sub...)
}
if !eqSuffixRegex(regex, patEndText) {
regex.Sub = append(regex.Sub, patEndText)
}
}
regex = optimize(regex).Simplify()
m, err := compile(regex)
return ExactMatcher{m}, err
}
func (m *Matcher) Unpack(s string) error {
tmp, err := Compile(s)
if err != nil {
return err
}
*m = tmp
return nil
}
func (m *Matcher) MatchAnyString(strs []string) bool {
return matchAnyStrings(m.stringMatcher, strs)
}
func (m *Matcher) MatchAllStrings(strs []string) bool {
return matchAllStrings(m.stringMatcher, strs)
}
func (m *ExactMatcher) MatchAnyString(strs []string) bool {
return matchAnyStrings(m.stringMatcher, strs)
}
func (m *ExactMatcher) MatchAllStrings(strs []string) bool {
return matchAllStrings(m.stringMatcher, strs)
}
func (m *ExactMatcher) Unpack(s string) error {
tmp, err := CompileExact(s)
if err != nil {
return err
}
*m = tmp
return nil
}
func matchAnyStrings(m stringMatcher, strs []string) bool {
for _, s := range strs {
if m.MatchString(s) {
return true
}
}
return false
}
func matchAllStrings(m stringMatcher, strs []string) bool {
for _, s := range strs {
if !m.MatchString(s) {
return false
}
}
return true
}