github.com/pgavlin/text@v0.0.0-20240419000839-8438d0a47805/export_test.go (about)

     1  // Copyright 2011 The Go Authors. All rights reserved.
     2  // Use of this source code is governed by a BSD-style
     3  // license that can be found in the LICENSE file.
     4  
     5  package text
     6  
     7  func (r *Replacer[S]) Replacer() any {
     8  	r.once.Do(r.buildOnce)
     9  	return r.r
    10  }
    11  
    12  func (r *Replacer[S]) PrintTrie() string {
    13  	r.once.Do(r.buildOnce)
    14  	gen := r.r.(*genericReplacer[S])
    15  	return gen.printNode(&gen.root, 0)
    16  }
    17  
    18  func (r *genericReplacer[S]) printNode(t *trieNode[S], depth int) (s string) {
    19  	if t.priority > 0 {
    20  		s += "+"
    21  	} else {
    22  		s += "-"
    23  	}
    24  	s += "\n"
    25  
    26  	if !IsEmpty(t.prefix) {
    27  		s += Concat(Repeat(".", depth), t.prefix)
    28  		s += r.printNode(t.next, depth+len(t.prefix))
    29  	} else if t.table != nil {
    30  		for b, m := range r.mapping {
    31  			if int(m) != r.tableSize && t.table[m] != nil {
    32  				s += Repeat(".", depth) + string([]byte{byte(b)})
    33  				s += r.printNode(t.table[m], depth+1)
    34  			}
    35  		}
    36  	}
    37  	return
    38  }
    39  
    40  func StringFind(pattern, text string) int {
    41  	return makeStringFinder(pattern).next(text)
    42  }
    43  
    44  func DumpTables(pattern string) ([]int, []int) {
    45  	finder := makeStringFinder(pattern)
    46  	return finder.badCharSkip[:], finder.goodSuffixSkip
    47  }