/dports/audio/visp-go/visp-2585747/vendor/github.com/go-chi/chi/ |
H A D | README.md | 175 chi's router is based on a kind of [Patricia Radix trie](https://en.wikipedia.org/wiki/Radix_tree).
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/net/idna/ |
H A D | idna10.0.0.go | 94 o.trie = trie 120 o.trie = trie 186 trie *idnaTrie member 291 trie: trie, 300 trie: trie, 310 trie: trie, 443 v, sz := trie.lookupString(s[i:]) 487 v, sz := trie.lookupString(s[i:]) 728 trie := p.trie // p.checkJoiners is only set if trie is set. 730 v, sz := trie.lookupString(s) [all …]
|
H A D | idna9.0.0.go | 93 o.trie = trie 119 o.trie = trie 186 trie *idnaTrie member 292 trie: trie, 302 trie: trie, 312 trie: trie, 428 v, sz := trie.lookupString(s[i:]) 450 v, sz := trie.lookupString(s[i:]) 676 trie := p.trie // p.checkJoiners is only set if trie is set. 678 v, sz := trie.lookupString(s) [all …]
|
H A D | trie.go | 48 var trie = &idnaTrie{} var
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/text/cases/ |
H A D | context.go | 85 v, sz := trie.lookup(c.src[c.pSrc:])
|
H A D | gen_trieval.go | 178 var trie = newCaseTrie(0) var
|
H A D | map.go | 544 switch v, _ := trie.lookup(c.src[c.pSrc:]); info(v).cccType() {
|
H A D | trieval.go | 173 var trie = newCaseTrie(0) var
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/text/collate/build/ |
H A D | builder.go | 463 b.t.trie = *i
|
H A D | table.go | 18 trie trie 36 update(t.trie.printArrays(w, name))
|
H A D | trie.go | 31 type trie struct { struct 84 t *trie 104 index.t = &trie{} 169 func genValueBlock(t *trie, n *trieNode) { argument 177 func genLookupBlock(t *trie, n *trieNode) { argument 209 func (b *trieBuilder) generate() (t *trie, err error) { 232 func (t *trie) printArrays(w io.Writer, name string) (n, size int, err error) { argument 285 func (t *trie) printStruct(w io.Writer, handle *trieHandle, name string) (n, sz int, err error) { argument 288 sz += int(reflect.TypeOf(trie{}).Size())
|
H A D | trie_test.go | 23 func makeTestTrie(t *testing.T) trie { 107 var testTrie = trie{ testLookup[1216:], testValues[0:], testLookup[:], testValues[:]}`
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/text/internal/export/idna/ |
H A D | gen10.0.0_test.go | 23 v, _ := trie.lookupString(string(r))
|
H A D | gen9.0.0_test.go | 23 v, _ := trie.lookupString(string(r))
|
H A D | idna10.0.0.go | 94 o.trie = trie 120 o.trie = trie 186 trie *idnaTrie 291 trie: trie, 300 trie: trie, 310 trie: trie, 443 v, sz := trie.lookupString(s[i:]) 487 v, sz := trie.lookupString(s[i:]) 728 trie := p.trie // p.checkJoiners is only set if trie is set. 730 v, sz := trie.lookupString(s) [all …]
|
H A D | idna9.0.0.go | 93 o.trie = trie 119 o.trie = trie 186 trie *idnaTrie member 292 trie: trie, 302 trie: trie, 312 trie: trie, 428 v, sz := trie.lookupString(s[i:]) 450 v, sz := trie.lookupString(s[i:]) 676 trie := p.trie // p.checkJoiners is only set if trie is set. 678 v, sz := trie.lookupString(s) [all …]
|
H A D | trie.go | 46 var trie = &idnaTrie{}
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/text/internal/triegen/ |
H A D | example_test.go | 52 trie := newRandTrie(0) 60 if v, _ := trie.lookupString(string(r)); v != runes[r] {
|
H A D | gen_test.go | 63 type trie struct{} struct 65 func (t *trie) lookupString(string) (uint8, int) { return 0, 1 } argument 66 func (t *trie) lookupStringUnsafe(string) uint64 { return 0 } argument 68 func newRandTrie(i int) *trie { return &trie{} } 69 func newMultiTrie(i int) *trie { return &trie{} }
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/text/unicode/bidi/ |
H A D | prop.go | 15 var trie = newBidiTrie(0) var 101 return Properties{entry: trie.lookupValue(uint32(i), c1)}, 2 117 return Properties{entry: trie.lookupValue(uint32(i), c2), last: c2}, 3 139 return Properties{entry: trie.lookupValue(uint32(i), c3)}, 4 164 return Properties{entry: trie.lookupValue(uint32(i), c1)}, 2 180 return Properties{entry: trie.lookupValue(uint32(i), c2), last: c2}, 3 202 return Properties{entry: trie.lookupValue(uint32(i), c3)}, 4
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/text/unicode/norm/ |
H A D | maketables.go | 681 trie := triegen.NewTrie(varnames[i]) 688 trie.Insert(rune(r), uint64(positionMap[key])) 698 trie.Insert(c.codePoint, uint64(positionMap[nLeadStr])) 700 trie.Insert(c.codePoint, uint64(0x8000|v)) 703 sz, err := trie.Gen(w, triegen.Compact(&normCompacter{name: varnames[i]}))
|
/dports/audio/visp-go/visp-2585747/vendor/golang.org/x/text/width/ |
H A D | transform.go | 25 v, size := trie.lookup(src[n:]) 65 v, size := trie.lookup(src[nSrc:]) 107 v, size := trie.lookup(src[n:]) 148 v, size := trie.lookup(src[nSrc:]) 187 v, size := trie.lookup(src[n:]) 211 v, size := trie.lookup(src[nSrc:])
|
H A D | width.go | 70 var trie = newWidthTrie(0) var 75 v, sz := trie.lookup(b) 82 v, sz := trie.lookupString(s) 90 v, _ := trie.lookup(buf[:n])
|
/dports/audio/zrythm/zrythm-1.0.0-alpha.26.0.13/doc/dev/m.css/documentation/ |
H A D | doxygen.py | 149 trie = Trie() 151 trie.insert(e.name, index) 158 current = trie 370 def serialize_search_data(trie: Trie, map: ResultMap, symbol_count, merge_subtrees=True, merge_pref… 371 serialized_trie = trie.serialize(merge_subtrees=merge_subtrees) 2550 trie = Trie() 2579 trie.insert(html.unescape(result.name).lower(), index) 2627 …trie.insert(name.lower(), index, lookahead_barriers=lookahead_barriers if add_lookahead_barriers e… 2640 trie.insert(search.lower(), keyword_index) 2647 trie.sort(map) [all …]
|
/dports/audio/zrythm/zrythm-1.0.0-alpha.26.0.13/ext/zix/test/ |
H A D | dict_bench.c | 104 ZixTrie* trie = zix_trie_new(); in main() local 145 ZixStatus st = zix_trie_insert(trie, strings[i], lengths[i]); in main() 214 if (zix_trie_find(trie, strings[index], &match)) { in main() 242 zix_trie_free(trie); in main()
|