Lines Matching refs:table
109 // * if table is non-zero, it defines all the children.
112 // root node always uses a table for lookup efficiency.
116 // Node n5 has no children and so has zero prefix, next and table fields.
120 // table is a lookup table indexed by the next byte in the key, after
124 // genericReplacer.tableSize will be 5. Node n0's table will be
127 table []*trieNode
150 // First byte differs, start a new lookup table here. Looking up
163 t.table = make([]*trieNode, r.tableSize)
164 t.table[r.mapping[t.prefix[0]]] = prefixNode
165 t.table[r.mapping[key[0]]] = keyNode
179 } else if t.table != nil {
180 // Insert into existing table.
182 if t.table[m] == nil {
183 t.table[m] = new(trieNode)
185 t.table[m].add(key[1:], val, priority, r)
210 if node.table != nil {
215 node = node.table[index]
233 // tableSize is the size of a trie node's lookup table. It is the number
236 // mapping maps from key bytes to a dense index for trieNode.table.
263 // Ensure root node uses a lookup table (for performance).
264 r.root.table = make([]*trieNode, r.tableSize)
320 if index == r.tableSize || r.root.table[index] == nil {
