mirror of
https://github.com/golang/go
synced 2024-10-04 18:21:21 -06:00
631a0e71c1
The string searching is implemented separately so other functions may make use of it in the future. benchmark old ns/op new ns/op delta BenchmarkSingleMaxSkipping 125889 2474 -98.03% BenchmarkSingleLongSuffixFail 16252 1996 -87.72% BenchmarkSingleMatch 260793 136266 -47.75% benchmark old MB/s new MB/s speedup BenchmarkSingleMaxSkipping 79.43 4041.57 50.88x BenchmarkSingleLongSuffixFail 61.65 501.81 8.14x BenchmarkSingleMatch 57.52 110.08 1.91x R=nigeltao CC=golang-dev https://golang.org/cl/6545049
46 lines
1.0 KiB
Go
46 lines
1.0 KiB
Go
// Copyright 2011 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package strings
|
|
|
|
func (r *Replacer) Replacer() interface{} {
|
|
return r.r
|
|
}
|
|
|
|
func (r *Replacer) PrintTrie() string {
|
|
gen := r.r.(*genericReplacer)
|
|
return gen.printNode(&gen.root, 0)
|
|
}
|
|
|
|
func (r *genericReplacer) printNode(t *trieNode, depth int) (s string) {
|
|
if t.priority > 0 {
|
|
s += "+"
|
|
} else {
|
|
s += "-"
|
|
}
|
|
s += "\n"
|
|
|
|
if t.prefix != "" {
|
|
s += Repeat(".", depth) + t.prefix
|
|
s += r.printNode(t.next, depth+len(t.prefix))
|
|
} else if t.table != nil {
|
|
for b, m := range r.mapping {
|
|
if int(m) != r.tableSize && t.table[m] != nil {
|
|
s += Repeat(".", depth) + string([]byte{byte(b)})
|
|
s += r.printNode(t.table[m], depth+1)
|
|
}
|
|
}
|
|
}
|
|
return
|
|
}
|
|
|
|
func StringFind(pattern, text string) int {
|
|
return makeStringFinder(pattern).next(text)
|
|
}
|
|
|
|
func DumpTables(pattern string) ([]int, []int) {
|
|
finder := makeStringFinder(pattern)
|
|
return finder.badCharSkip[:], finder.goodSuffixSkip
|
|
}
|