Gecko [ 167.86.127.34 ]

Name	Size	Permission
builder.go	3.48 KB	-rw-r--r--
builder_test.go	7 KB	-rw-r--r--
compare.go	1.06 KB	-rw-r--r--
compare_test.go	2.75 KB	-rw-r--r--
example_test.go	8.71 KB	-rw-r--r--
export_test.go	1.08 KB	-rw-r--r--
reader.go	3.54 KB	-rw-r--r--
reader_test.go	5.9 KB	-rw-r--r--
replace.go	14.44 KB	-rw-r--r--
replace_test.go	14.08 KB	-rw-r--r--
search.go	4.19 KB	-rw-r--r--
search_test.go	1.88 KB	-rw-r--r--
strings.go	27.19 KB	-rw-r--r--
strings_test.go	47.13 KB	-rw-r--r--

Code Editor : export_test.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{} {
	r.once.Do(r.buildOnce)
	return r.r
}

func (r *Replacer) PrintTrie() string {
	r.once.Do(r.buildOnce)
	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
}

${this.title}

Code Editor : export_test.go