4c3cd4c9e3
Because it's literally ten times faster: benchmark old ns/op new ns/op delta BenchmarkMatch-8 13842 1200 -91.33% BenchmarkMatchCached-8 139 147 +5.76% benchmark old allocs new allocs delta BenchmarkMatch-8 0 0 +0.00% BenchmarkMatchCached-8 0 0 +0.00% benchmark old bytes new bytes delta BenchmarkMatch-8 12 0 -100.00% BenchmarkMatchCached-8 0 0 +0.00%
50 lines
786 B
Go
50 lines
786 B
Go
package match
|
|
|
|
import (
|
|
"fmt"
|
|
"github.com/gobwas/glob/runes"
|
|
"unicode/utf8"
|
|
)
|
|
|
|
type List struct {
|
|
List []rune
|
|
Not bool
|
|
}
|
|
|
|
func NewList(list []rune, not bool) List {
|
|
return List{list, not}
|
|
}
|
|
|
|
func (self List) Match(s string) bool {
|
|
r, w := utf8.DecodeRuneInString(s)
|
|
if len(s) > w {
|
|
return false
|
|
}
|
|
|
|
inList := runes.IndexRune(self.List, r) != -1
|
|
return inList == !self.Not
|
|
}
|
|
|
|
func (self List) Len() int {
|
|
return lenOne
|
|
}
|
|
|
|
func (self List) Index(s string) (int, []int) {
|
|
for i, r := range s {
|
|
if self.Not == (runes.IndexRune(self.List, r) == -1) {
|
|
return i, segmentsByRuneLength[utf8.RuneLen(r)]
|
|
}
|
|
}
|
|
|
|
return -1, nil
|
|
}
|
|
|
|
func (self List) String() string {
|
|
var not string
|
|
if self.Not {
|
|
not = "!"
|
|
}
|
|
|
|
return fmt.Sprintf("<list:%s[%s]>", not, string(self.List))
|
|
}
|