golang 字典树 搜索+sugg 示例_golang使用字典树进行keyword匹配

package main

import (
    "fmt"
    "sort"
    "sync"
)

type KeyWordKV map[int64]string
type CharBeginKV map[string][]*KeyWordTreeNode
type PairList []Pair

func (p PairList) Len() int           { return len(p) }
func (p PairList) Less(i, j int) bool { return p[i].V > p[j].V }
func (p PairList) Swap(i, j int)      { p[i], p[j] = p[j], p[i] }

type Pair struct {
    K int64
    V int64
}

type KeyWordTreeNode struct {
    // 1, 2, 3
    KeyWordIds map[int64]bool
    // 百，度， 一， 下
    Char string
    // 父节点
    ParentKeyWordTreeNode *KeyWordTreeNode
    // 子节点集合
    SubKeyWordTreeNodes map[string]*KeyWordTreeNode
}

func NewKeyWordTreeNode() *KeyWordTreeNode {
    return &KeyWordTreeNode{
        KeyWordIds:            make(map[int64]bool, 0),
        Char:                  "",
        ParentKeyWordTreeNode: nil,
        SubKeyWordTreeNodes:   make(map[string]*KeyWordTreeNode, 0),
    }
}

func NewKeyWordTreeNodeWithParams(ch string, parent *KeyWordTreeNode) *KeyWordTreeNode {
    return &KeyWordTreeNode{
        KeyWordIds:            make(map[int64]bool, 0),
        Char:                  ch,
        ParentKeyWordTreeNode: parent,
        SubKeyWordTreeNodes:   make(map[string]*KeyWordTreeNode, 0),
    }
}

type KeyWordServer struct {
    root          *KeyWordTreeNode
    kv            KeyWordKV
    char_begin_kv CharBeginKV
    rw            sync.RWMutex
}

func NewKeyWordServer() *KeyWordServer {
    return &KeyWordServer{
        root:          NewKeyWordTreeNode(),
        kv:            KeyWordKV{},
        char_begin_kv: CharBeginKV{},
    }
}

func (s *KeyWordServer) Put(id int64, keyword string) {
    s.rw.Lock()
    s.kv[id] = keyword
    key_word_tmp_pt := s.root
    for _, v := range keyword {
        ch := string(v)
        if key_word_tmp_pt.SubKeyWordTreeNodes[ch] == nil {
            // root：{百:{}}
            node := NewKeyWordTreeNodeWithParams(ch, key_word_tmp_pt)
            key_word_tmp_pt.SubKeyWordTreeNodes[ch] = node
            // 记住不同位置的"百"的起点
            s.char_begin_kv[ch] = append(s.char_begin_kv[ch], node)

        }
        // {百:{度:{}}}
        key_word_tree_node := key_word_tmp_pt.SubKeyWordTreeNodes[ch]
        key_word_tree_node.KeyWordIds[id] = true
        // 更新指针
        key_word_tmp_pt = key_word_tmp_pt.SubKeyWordTreeNodes[ch]
    }
    s.rw.Unlock()
}

func (s *KeyWordServer) Sugg(keyword string, limit int) []string {
    s.rw.RLock()
    key_word_tmp_pt := s.root
    is_end := true
    for _, v := range keyword {
        ch := string(v)
        if key_word_tmp_pt.SubKeyWordTreeNodes[ch] == nil {
            is_end = false
            break
        }
        // 更新指针
        key_word_tmp_pt = key_word_tmp_pt.SubKeyWordTreeNodes[ch]
    }
    if is_end {
        // 前缀
        ret := make([]string, 0)
        ids := key_word_tmp_pt.KeyWordIds
        for id, _ := range ids {
            ret = append(ret, s.kv[id])
            limit --
            if limit == 0 {
                break
            }
        }
        return ret
    }
    s.rw.RUnlock()
    return make([]string, 0)
}

func (s *KeyWordServer) Search(keyword string, limit int) []string {
    s.rw.RLock()
    ids := make(map[int64]int64, 0)
    for pos, v := range keyword {
        ch := string(v)
        begins := s.char_begin_kv[ch]
        for _, begin := range begins {
            key_word_tmp_pt := begin
            next_pos := pos + 1
            for len(key_word_tmp_pt.SubKeyWordTreeNodes) > 0 && next_pos < len(keyword) {
                // 最大匹配
                next_ch := string(keyword[next_pos])
                if key_word_tmp_pt.SubKeyWordTreeNodes[next_ch] == nil {
                    break
                }
                key_word_tmp_pt = key_word_tmp_pt.SubKeyWordTreeNodes[next_ch]
                next_pos++
            }
            // 保存结果
            for id, _ := range key_word_tmp_pt.KeyWordIds {
                ids[id] = ids[id] + 1
            }
        }
    }
    // 排序输出果
    list := PairList{}
    for id, count := range ids {
        list = append(list, Pair{
            K: id,
            V: count,
        })
    }
    if !sort.IsSorted(list) {
        sort.Sort(list)
    }
    if len(list) > limit {
        list = list[:limit]
    }
    ret := make([]string, 0)
    for _, item := range list {
        ret = append(ret, s.kv[item.K])
    }
    s.rw.RUnlock()
    return ret
}

func (s *KeyWordServer) DebugPrint() {
    fmt.Println("s.kv =", s.kv)
    key_word_tmp_pt := s.root
    dfs(key_word_tmp_pt)
}
func dfs(root *KeyWordTreeNode) {
    if root == nil {
        return
    } else {
        fmt.Println("s.root =", root.Char)
        fmt.Println("s.KeyWordIds =", root.KeyWordIds)
        for _, v := range root.SubKeyWordTreeNodes {
            dfs(v)
        }
    }
}

func main() {
    s := NewKeyWordServer()
    s.Put(1, "ba")
    s.Put(2, "abd")
    s.Put(3, "acd")
    //s.DebugPrint()
    //fmt.Println(s.Sugg("b", 2))
    //fmt.Println(s.Search("a", 2))
    //fmt.Println(s.Search("b", 2))
    //fmt.Println(s.Search("c", 2))
    fmt.Println(s.Search("ba", 2))
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194