-
Notifications
You must be signed in to change notification settings - Fork 8
/
match.go
133 lines (126 loc) · 3.05 KB
/
match.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
package stringsutil
import (
"errors"
"regexp"
"strings"
"time"
)
type MatchType int
const (
MatchExact MatchType = iota
MatchStringTrimSpace
MatchStringTrimSpaceLower
MatchStringPrefix
MatchStringSuffix
MatchStringRegexp
MatchTimeGT
MatchTimeGTE
MatchTimeLT
MatchTimeLTE
)
type MatchInfo struct {
MatchType MatchType
String string
Regexp *regexp.Regexp
TimeLayout string
TimeMin time.Time
TimeMax time.Time
}
// Match provides an canonical way to match strings using multiple approaches
func Match(s string, matchInfo MatchInfo) (bool, error) {
switch matchInfo.MatchType {
case MatchExact:
return s == matchInfo.String, nil
case MatchStringTrimSpace:
return strings.TrimSpace(s) == strings.TrimSpace(matchInfo.String), nil
case MatchStringTrimSpaceLower:
return strings.EqualFold(strings.TrimSpace(s), strings.TrimSpace(matchInfo.String)), nil
case MatchStringPrefix:
return strings.Index(s, matchInfo.String) == 0, nil
case MatchStringSuffix:
return ReverseIndex(s, matchInfo.String) == 0, nil
case MatchStringRegexp:
if matchInfo.Regexp == nil {
return false, errors.New("no regexp supplied")
}
return matchInfo.Regexp.MatchString(s), nil
case MatchTimeGT:
t, err := time.Parse(matchInfo.TimeLayout, s)
if err != nil {
return false, err
}
if t.After(matchInfo.TimeMin) {
return true, nil
} else {
return false, nil
}
case MatchTimeGTE:
t, err := time.Parse(matchInfo.TimeLayout, s)
if err != nil {
return false, err
}
if t.After(matchInfo.TimeMin) || t.Equal(matchInfo.TimeMin) {
return true, nil
} else {
return false, nil
}
case MatchTimeLT:
t, err := time.Parse(matchInfo.TimeLayout, s)
if err != nil {
return false, err
}
if t.Before(matchInfo.TimeMax) {
return true, nil
} else {
return false, nil
}
case MatchTimeLTE:
t, err := time.Parse(matchInfo.TimeLayout, s)
if err != nil {
return false, err
}
if t.Before(matchInfo.TimeMax) || t.Equal(matchInfo.TimeMax) {
return true, nil
} else {
return false, nil
}
default:
return false, nil
}
}
/*
func CheckSuffix(input, wantSuffix string) (fullstring, prefix, suffix string) {
fullstring = input
if len(suffix) > len(fullstring) {
return
}
lastIndex := strings.LastIndex(input, wantSuffix)
if lastIndex > 0 && lastIndex == len(input)-len(wantSuffix) {
prefix = fullstring[:len(input)-len(wantSuffix)]
suffix = wantSuffix
return
}
return
}*/
/*
func SuffixMap(inputs, suffixes []string) (prefixes []string, matches map[string]string, nonmatches []string) {
matches = map[string]string{}
for _, input := range inputs {
gotMatch := false
for _, suffix := range suffixes {
gotFull, gotPrefix, gotSuffix := SuffixParse(input, suffix)
if suffix == gotSuffix {
matches[gotSuffix] = gotFull
prefixes = append(prefixes, gotPrefix)
gotMatch = true
}
}
if !gotMatch {
nonmatches = append(nonmatches, input)
}
}
prefixes = SliceCondenseSpace(prefixes, true, true)
nonmatches = SliceCondenseSpace(nonmatches, true, true)
return prefixes, matches, nonmatches
}
*/