|
|
@ -16,123 +16,68 @@ |
|
|
|
|
|
|
|
|
|
|
|
package wildcard |
|
|
|
package wildcard |
|
|
|
|
|
|
|
|
|
|
|
import ( |
|
|
|
// MatchSimple - finds whether the text matches/satisfies the pattern string.
|
|
|
|
"strings" |
|
|
|
|
|
|
|
"unicode/utf8" |
|
|
|
|
|
|
|
) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Match - finds whether the text matches/satisfies the pattern string.
|
|
|
|
|
|
|
|
// supports only '*' wildcard in the pattern.
|
|
|
|
// supports only '*' wildcard in the pattern.
|
|
|
|
// considers a file system path as a flat name space.
|
|
|
|
// considers a file system path as a flat name space.
|
|
|
|
func Match(pattern, text string) bool { |
|
|
|
func MatchSimple(pattern, name string) bool { |
|
|
|
if pattern == "" { |
|
|
|
if pattern == "" { |
|
|
|
return text == pattern |
|
|
|
return name == pattern |
|
|
|
} |
|
|
|
} |
|
|
|
if pattern == "*" { |
|
|
|
if pattern == "*" { |
|
|
|
return true |
|
|
|
return true |
|
|
|
} |
|
|
|
} |
|
|
|
parts := strings.Split(pattern, "*") |
|
|
|
rname := make([]rune, 0, len(name)) |
|
|
|
if len(parts) == 1 { |
|
|
|
rpattern := make([]rune, 0, len(pattern)) |
|
|
|
return text == pattern |
|
|
|
for _, r := range name { |
|
|
|
} |
|
|
|
rname = append(rname, r) |
|
|
|
tGlob := strings.HasSuffix(pattern, "*") |
|
|
|
|
|
|
|
end := len(parts) - 1 |
|
|
|
|
|
|
|
if !strings.HasPrefix(text, parts[0]) { |
|
|
|
|
|
|
|
return false |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
for i := 1; i < end; i++ { |
|
|
|
|
|
|
|
if !strings.Contains(text, parts[i]) { |
|
|
|
|
|
|
|
return false |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
idx := strings.Index(text, parts[i]) + len(parts[i]) |
|
|
|
for _, r := range pattern { |
|
|
|
text = text[idx:] |
|
|
|
rpattern = append(rpattern, r) |
|
|
|
} |
|
|
|
} |
|
|
|
return tGlob || strings.HasSuffix(text, parts[end]) |
|
|
|
simple := true // Does only wildcard '*' match.
|
|
|
|
|
|
|
|
return deepMatchRune(rname, rpattern, simple) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// MatchExtended - finds whether the text matches/satisfies the pattern string.
|
|
|
|
// Match - finds whether the text matches/satisfies the pattern string.
|
|
|
|
// supports '*' and '?' wildcards in the pattern string.
|
|
|
|
// supports '*' and '?' wildcards in the pattern string.
|
|
|
|
// unlike path.Match(), considers a path as a flat name space while matching the pattern.
|
|
|
|
// unlike path.Match(), considers a path as a flat name space while matching the pattern.
|
|
|
|
// The difference is illustrated in the example here https://play.golang.org/p/Ega9qgD4Qz .
|
|
|
|
// The difference is illustrated in the example here https://play.golang.org/p/Ega9qgD4Qz .
|
|
|
|
func MatchExtended(pattern, name string) (matched bool) { |
|
|
|
func Match(pattern, name string) (matched bool) { |
|
|
|
Pattern: |
|
|
|
if pattern == "" { |
|
|
|
for len(pattern) > 0 { |
|
|
|
return name == pattern |
|
|
|
var star bool |
|
|
|
|
|
|
|
var chunk string |
|
|
|
|
|
|
|
star, chunk, pattern = scanChunk(pattern) |
|
|
|
|
|
|
|
if star && chunk == "" { |
|
|
|
|
|
|
|
// Trailing * matches rest of string.
|
|
|
|
|
|
|
|
return true |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
// Look for match at current position.
|
|
|
|
|
|
|
|
t, ok := matchChunk(chunk, name) |
|
|
|
|
|
|
|
// if we're the last chunk, make sure we've exhausted the name
|
|
|
|
|
|
|
|
// otherwise we'll give a false result even if we could still match
|
|
|
|
|
|
|
|
// using the star
|
|
|
|
|
|
|
|
if ok && (len(t) == 0 || len(pattern) > 0) { |
|
|
|
|
|
|
|
name = t |
|
|
|
|
|
|
|
continue |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if star { |
|
|
|
|
|
|
|
// Look for match skipping i+1 bytes.
|
|
|
|
|
|
|
|
for i := 0; i < len(name); i++ { |
|
|
|
|
|
|
|
t, ok := matchChunk(chunk, name[i+1:]) |
|
|
|
|
|
|
|
if ok { |
|
|
|
|
|
|
|
// if we're the last chunk, make sure we exhausted the name
|
|
|
|
|
|
|
|
if len(pattern) == 0 && len(t) > 0 { |
|
|
|
|
|
|
|
continue |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
name = t |
|
|
|
|
|
|
|
continue Pattern |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
return false |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
return len(name) == 0 |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// scanChunk gets the next segment of pattern, which is a non-star string
|
|
|
|
|
|
|
|
// possibly preceded by a star.
|
|
|
|
|
|
|
|
func scanChunk(pattern string) (star bool, chunk, rest string) { |
|
|
|
|
|
|
|
for len(pattern) > 0 && pattern[0] == '*' { |
|
|
|
|
|
|
|
pattern = pattern[1:] |
|
|
|
|
|
|
|
star = true |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
inrange := false |
|
|
|
if pattern == "*" { |
|
|
|
var i int |
|
|
|
return true |
|
|
|
Scan: |
|
|
|
|
|
|
|
for i = 0; i < len(pattern); i++ { |
|
|
|
|
|
|
|
switch pattern[i] { |
|
|
|
|
|
|
|
case '*': |
|
|
|
|
|
|
|
if !inrange { |
|
|
|
|
|
|
|
break Scan |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
rname := make([]rune, 0, len(name)) |
|
|
|
|
|
|
|
rpattern := make([]rune, 0, len(pattern)) |
|
|
|
|
|
|
|
for _, r := range name { |
|
|
|
|
|
|
|
rname = append(rname, r) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
for _, r := range pattern { |
|
|
|
|
|
|
|
rpattern = append(rpattern, r) |
|
|
|
} |
|
|
|
} |
|
|
|
return star, pattern[0:i], pattern[i:] |
|
|
|
simple := false // Does extended wildcard '*' and '?' match.
|
|
|
|
|
|
|
|
return deepMatchRune(rname, rpattern, simple) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// matchChunk checks whether chunk matches the beginning of s.
|
|
|
|
func deepMatchRune(str, pattern []rune, simple bool) bool { |
|
|
|
// If so, it returns the remainder of s (after the match).
|
|
|
|
for len(pattern) > 0 { |
|
|
|
// Chunk is all single-character operators: literals, char classes, and ?.
|
|
|
|
switch pattern[0] { |
|
|
|
func matchChunk(chunk, s string) (rest string, ok bool) { |
|
|
|
default: |
|
|
|
for len(chunk) > 0 { |
|
|
|
if len(str) == 0 || str[0] != pattern[0] { |
|
|
|
if len(s) == 0 { |
|
|
|
return false |
|
|
|
return |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
switch chunk[0] { |
|
|
|
|
|
|
|
case '?': |
|
|
|
case '?': |
|
|
|
_, n := utf8.DecodeRuneInString(s) |
|
|
|
if len(str) == 0 && !simple { |
|
|
|
s = s[n:] |
|
|
|
return false |
|
|
|
chunk = chunk[1:] |
|
|
|
|
|
|
|
default: |
|
|
|
|
|
|
|
if chunk[0] != s[0] { |
|
|
|
|
|
|
|
return |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
s = s[1:] |
|
|
|
case '*': |
|
|
|
chunk = chunk[1:] |
|
|
|
return deepMatchRune(str, pattern[1:], simple) || |
|
|
|
|
|
|
|
(len(str) > 0 && deepMatchRune(str[1:], pattern, simple)) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
str = str[1:] |
|
|
|
|
|
|
|
pattern = pattern[1:] |
|
|
|
} |
|
|
|
} |
|
|
|
return s, true |
|
|
|
return len(str) == 0 && len(pattern) == 0 |
|
|
|
} |
|
|
|
} |
|
|
|