mirror of
https://github.com/v2fly/v2ray-core.git
synced 2024-09-06 03:54:22 -04:00
* Reorganize strmatcher's package structure * Rename types in strmatcher package according to their file names * Stablize strmatcher's Matcher interface * Implement []matcherEntry as SimpleMatcherGroup * Implement mph algorithm extracted from MphIndexMatcher as MphMatcherGroup * Implement AddMatcher/AddFullMatcher/AddDomainMatcher/AddSubstrMatcher for each MatcherGroup * Stablize strmatcher's MatcherGroup interface * Stablize strmatcher's IndexMatcher interface * Update strmatcher's benchmark * Compatibility fix for app/router's DomainMatcher condition * Fix code quality issue * Fix basic matcher issues * Update priority specification for Substr matcher
48 lines
1.6 KiB
Go
48 lines
1.6 KiB
Go
package strmatcher
|
|
|
|
import (
|
|
"sort"
|
|
"strings"
|
|
)
|
|
|
|
// SubstrMatcherGroup is implementation of MatcherGroup,
|
|
// It is simply implmeneted to comply with the priority specification of Substr matchers.
|
|
type SubstrMatcherGroup struct {
|
|
patterns []string
|
|
values []uint32
|
|
}
|
|
|
|
// AddSubstrMatcher implements MatcherGroupForSubstr.AddSubstrMatcher.
|
|
func (g *SubstrMatcherGroup) AddSubstrMatcher(matcher SubstrMatcher, value uint32) {
|
|
g.patterns = append(g.patterns, matcher.Pattern())
|
|
g.values = append(g.values, value)
|
|
}
|
|
|
|
// Match implements MatcherGroup.Match.
|
|
func (g *SubstrMatcherGroup) Match(input string) []uint32 {
|
|
result := []uint32{}
|
|
for i, pattern := range g.patterns {
|
|
for j := strings.LastIndex(input, pattern); j != -1; j = strings.LastIndex(input[:j], pattern) {
|
|
result = append(result, uint32(j)<<16|uint32(i)&0xffff) // uint32: position (higher 16 bit) | patternIdx (lower 16 bit)
|
|
}
|
|
}
|
|
// Sort the match results in dictionary order, so that:
|
|
// 1. Pattern matched at smaller position (meaning matched further) takes precedence.
|
|
// 2. When patterns matched at same position, pattern with smaller index (meaning inserted early) takes precedence.
|
|
sort.Slice(result, func(i, j int) bool { return result[i] < result[j] })
|
|
for i, entry := range result {
|
|
result[i] = g.values[entry&0xffff] // Get pattern value from its index (the lower 16 bit)
|
|
}
|
|
return result
|
|
}
|
|
|
|
// MatchAny implements MatcherGroup.MatchAny.
|
|
func (g *SubstrMatcherGroup) MatchAny(input string) bool {
|
|
for _, pattern := range g.patterns {
|
|
if strings.Contains(input, pattern) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|