Created
December 2, 2020 15:26
-
-
Save ken39arg/94414ef581a6132dccd4c8f700a7ba83 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package phrasetrie | |
type node struct { | |
children map[rune]*node | |
value string | |
} | |
func newNode() *node { | |
return &node{ | |
children: make(map[rune]*node), | |
} | |
} | |
type Trie struct { | |
root *node | |
} | |
func NewTrie(keys ...string) *Trie { | |
t := &Trie{ | |
root: newNode(), | |
} | |
for _, k := range keys { | |
t.add(k) | |
} | |
return t | |
} | |
func (t *Trie) add(key string) { | |
n := t.root | |
for _, c := range key { | |
if _, ok := n.children[c]; !ok { | |
n.children[c] = newNode() | |
} | |
n = n.children[c] | |
} | |
n.value = key | |
} | |
func (t *Trie) Match(word string) bool { | |
_, idx, _ := t.search([]rune(word), 0, false) | |
return 0 <= idx | |
} | |
func (t *Trie) FindString(word string) string { | |
v, _, _ := t.search([]rune(word), 0, false) | |
return v | |
} | |
func (t *Trie) FindLongestString(word string) string { | |
v, _, _ := t.search([]rune(word), 0, true) | |
return v | |
} | |
func (t *Trie) ReplaceAll(word, repl string) string { | |
return t.ReplaceAllFunc(word, func(_ string) string { return repl }) | |
} | |
func (t *Trie) ReplaceAllFunc(word string, repl func(string) string) string { | |
chars := []rune(word) | |
dist := make([]rune, 0, len(chars)) | |
start := 0 | |
for { | |
found, idx, end := t.search(chars, start, true) | |
if idx < 0 { | |
dist = append(dist, chars[start:]...) | |
break | |
} | |
dist = append(dist, chars[start:idx]...) | |
dist = append(dist, []rune(repl(found))...) | |
start = end + 1 | |
} | |
return string(dist) | |
} | |
func (t *Trie) search(chars []rune, start int, longest bool) (string, int, int) { | |
end := len(chars) | |
var v string | |
var e int | |
for i := start; i < end; i++ { | |
if n, ok := t.root.children[chars[i]]; ok { | |
for j := i + 1; j < end; j++ { | |
if n, ok = n.children[chars[j]]; ok { | |
if n.value != "" { | |
v = n.value | |
e = j | |
if !longest { | |
break | |
} | |
} | |
} else { | |
break | |
} | |
} | |
if v != "" { | |
return v, i, e | |
} | |
} | |
} | |
return "", -1, -1 | |
} |
Author
ken39arg
commented
Dec 3, 2020
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment