Home
last modified time | relevance | path

Searched refs:trie (Results 251 – 275 of 7918) sorted by relevance

1...<<11121314151617181920>>...317

/dports/databases/mariadb103-server/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp460 if (!trie) { in grn_dat_get()
541 if (!trie) { in grn_dat_get_key()
561 if (!trie) { in grn_dat_get_key2()
737 if (!trie) { in grn_dat_scan()
857 if (!trie) { in grn_dat_lcp_search()
882 if (trie) { in grn_dat_size()
899 if (!trie) { in grn_dat_cursor_open()
1019 if (!trie) { in grn_dat_cursor_delete()
1042 if (trie) { in grn_dat_curr_id()
1055 if (!trie || !trie->max_key_id()) { in grn_dat_truncate()
[all …]
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp460 if (!trie) { in grn_dat_get()
541 if (!trie) { in grn_dat_get_key()
561 if (!trie) { in grn_dat_get_key2()
737 if (!trie) { in grn_dat_scan()
857 if (!trie) { in grn_dat_lcp_search()
882 if (trie) { in grn_dat_size()
899 if (!trie) { in grn_dat_cursor_open()
1019 if (!trie) { in grn_dat_cursor_delete()
1042 if (trie) { in grn_dat_curr_id()
1055 if (!trie || !trie->max_key_id()) { in grn_dat_truncate()
[all …]
/dports/security/xray-core/Xray-core-1.5.0/common/strmatcher/
H A Dac_automaton_matcher.go25 trie [][validCharCount]Edge member
126 ac.trie = append(ac.trie, newNode())
141 if len(ac.trie) < ac.count+1 {
142 ac.trie = append(ac.trie, newNode())
149 ac.trie[node][idx] = Edge{
169 if len(ac.trie) < ac.count+1 {
170 ac.trie = append(ac.trie, newNode())
177 ac.trie[node][idx] = Edge{
196 queue.PushBack(ac.trie[0][i])
208 ac.fail[ac.trie[node][i].nextNode] = ac.trie[ac.fail[node]][i].nextNode
[all …]
/dports/net/v2ray/v2ray-core-4.36.2/common/strmatcher/
H A Dac_automaton_matcher.go25 trie [][validCharCount]Edge member
126 ac.trie = append(ac.trie, newNode())
141 if len(ac.trie) < ac.count+1 {
142 ac.trie = append(ac.trie, newNode())
149 ac.trie[node][idx] = Edge{
169 if len(ac.trie) < ac.count+1 {
170 ac.trie = append(ac.trie, newNode())
177 ac.trie[node][idx] = Edge{
196 queue.PushBack(ac.trie[0][i])
208 ac.fail[ac.trie[node][i].nextNode] = ac.trie[ac.fail[node]][i].nextNode
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/trie/
H A Dproof_test.go17 package trie package
63 root := trie.Hash()
82 trie := new(Trie)
104 root := trie.Hash()
133 trie := new(Trie)
461 trie := new(Trie)
603 trie := new(Trie)
677 trie := new(Trie)
1030 trie := new(Trie)
1045 return trie, vals
[all …]
H A Dsecure_trie_test.go17 package trie package
32 return trie
47 trie.Update(key, val)
51 trie.Update(key, val)
57 trie.Update(key, val)
60 trie.Commit(nil)
63 return triedb, trie, content
67 trie := newEmptySecure()
85 hash := trie.Hash()
93 trie := newEmptySecure()
[all …]
/dports/devel/icu/icu/source/test/cintltst/
H A Dtrietest.c143 const UTrie *trie, in testTrieIteration() argument
172 if(trie->data32!=NULL) { in testTrieIteration()
193 if(trie->data32==NULL) { in testTrieIteration()
236 if(trie->data32!=NULL) { in testTrieIteration()
264 UTrie trie={ 0 }; in testTrieRangesWithMalloc() local
419 if(trie.isLatin1Linear) { in testTrieRangesWithMalloc()
420 if(trie.data32!=NULL) { in testTrieRangesWithMalloc()
458 UTrie trie={ 0 }; in testTrieRanges() local
628 if(trie.isLatin1Linear) { in testTrieRanges()
629 if(trie.data32!=NULL) { in testTrieRanges()
[all …]
/dports/devel/icu-lx/icu/source/test/cintltst/
H A Dtrietest.c143 const UTrie *trie, in testTrieIteration() argument
172 if(trie->data32!=NULL) { in testTrieIteration()
193 if(trie->data32==NULL) { in testTrieIteration()
236 if(trie->data32!=NULL) { in testTrieIteration()
264 UTrie trie={ 0 }; in testTrieRangesWithMalloc() local
419 if(trie.isLatin1Linear) { in testTrieRangesWithMalloc()
420 if(trie.data32!=NULL) { in testTrieRangesWithMalloc()
458 UTrie trie={ 0 }; in testTrieRanges() local
628 if(trie.isLatin1Linear) { in testTrieRanges()
629 if(trie.data32!=NULL) { in testTrieRanges()
[all …]
/dports/devel/py-datrie/datrie-0.8.2/tests/
H A Dtest_iteration.py15 trie[word] = index
17 return trie
22 trie['x'] = 1
23 trie['xo'] = 2
39 trie = _trie()
40 state = datrie.State(trie)
52 trie = _trie()
66 trie = _trie()
79 trie = _trie()
91 trie = _trie()
[all …]
H A Dtest_state.py9 trie = datrie.Trie(ranges=[(chr(0), chr(127))])
10 trie['f'] = 1
11 trie['fo'] = 2
12 trie['fa'] = 3
13 trie['faur'] = 4
14 trie['fauxiiiip'] = 5
15 trie['fauzox'] = 10
16 trie['fauzoy'] = 20
17 return trie
21 trie = _trie()
[all …]
/dports/net-mgmt/rtrlib/rtrlib-0.6.3/rtrlib/spki/hashtable/tommyds-1.8/
H A Dtommytrie.c82 trie->bucket[i] = 0; in tommy_trie_init()
84 trie->count = 0; in tommy_trie_init()
85 trie->node_count = 0; in tommy_trie_init()
87 trie->alloc = alloc; in tommy_trie_init()
125 ++trie->node_count; in trie_bucket_insert()
164 ++trie->count; in tommy_trie_insert()
242 tommy_allocator_free(trie->alloc, tree); in trie_bucket_remove_existing()
243 --trie->node_count; in trie_bucket_remove_existing()
264 --trie->count; in tommy_trie_remove()
282 --trie->count; in tommy_trie_remove_existing()
[all …]
/dports/devel/liblangtag/liblangtag-0.6.3/liblangtag/
H A Dlt-trie.c174 if (trie->root) { in _lt_trie_iter_init()
271 if (trie) in lt_trie_unref()
285 if (!trie->root) { in lt_trie_add()
288 lt_mem_add_ref((lt_mem_t *)trie, trie->root, in lt_trie_add()
290 lt_mem_add_weak_pointer(&trie->root->parent, (lt_pointer_t *)&trie->root); in lt_trie_add()
306 if (!trie->root) { in lt_trie_replace()
309 lt_mem_add_ref((lt_mem_t *)trie, trie->root, in lt_trie_replace()
324 if (!trie->root) in lt_trie_remove()
337 if (!trie->root) in lt_trie_lookup()
352 if (!trie->root) in lt_trie_keys()
[all …]
/dports/misc/libpostal/libpostal-1.1-alpha/test/
H A Dtest_trie.c14 bool added = trie_add(trie, key, data); in test_trie_add_get()
18 bool fetched = trie_get_data(trie, key, &trie_data); in test_trie_add_get()
26 CHECK_CALL(test_trie_add_get(trie, "st", 1)); in test_trie_setup()
27 CHECK_CALL(test_trie_add_get(trie, "street", 2)); in test_trie_setup()
28 CHECK_CALL(test_trie_add_get(trie, "st rt", 3)); in test_trie_setup()
29 CHECK_CALL(test_trie_add_get(trie, "st rd", 3)); in test_trie_setup()
31 CHECK_CALL(test_trie_add_get(trie, "maine", 5)); in test_trie_setup()
38 trie_t *trie = trie_new(); in test_trie() local
39 ASSERT(trie != NULL); in test_trie()
40 CHECK_CALL(test_trie_setup(trie)); in test_trie()
[all …]
/dports/devel/notcurses/notcurses-3.0.1/src/lib/
H A Dautomaton.c23 unsigned* trie; member
114 if(e->trie){ in esctrie_make_function()
137 if(e->trie[i]){ in esctrie_make_string()
209 if(e->trie[i]){ in link_kleene()
286 e->trie[i] = phi; in add_phi_and_eta_chain()
294 e->trie[follow] = eta; in add_phi_and_eta_chain()
346 if(e->trie[p]){ in add_phi_and_eta_recurse()
458 if(eptr->trie[c] == 0 || eptr->trie[c] == eptr->kleene){ in insert_path()
475 newe->trie[i] = esctrie_from_idx(a, eptr->trie[c])->trie[i]; in insert_path()
497 free(eptr->trie); in inputctx_add_cflow()
[all …]
/dports/mail/rspamd-devel/rspamd-93430bb/src/lua/
H A Dlua_trie.c41 LUA_FUNCTION_DEF (trie, create);
43 LUA_FUNCTION_DEF (trie, match);
47 LUA_FUNCTION_DEF (trie, destroy);
50 LUA_INTERFACE_DEF (trie, match),
59 LUA_INTERFACE_DEF (trie, create),
78 if (trie) { in lua_trie_destroy()
156 *ptrie = trie; in lua_trie_create()
287 if (trie) { in lua_trie_match()
376 if (trie && task) { in lua_trie_search_mime()
411 if (trie && task) { in lua_trie_search_rawmsg()
[all …]
/dports/mail/rspamd/rspamd-3.1/src/lua/
H A Dlua_trie.c41 LUA_FUNCTION_DEF (trie, create);
43 LUA_FUNCTION_DEF (trie, match);
47 LUA_FUNCTION_DEF (trie, destroy);
50 LUA_INTERFACE_DEF (trie, match),
59 LUA_INTERFACE_DEF (trie, create),
78 if (trie) { in lua_trie_destroy()
156 *ptrie = trie; in lua_trie_create()
287 if (trie) { in lua_trie_match()
376 if (trie && task) { in lua_trie_search_mime()
411 if (trie && task) { in lua_trie_search_rawmsg()
[all …]
/dports/sysutils/fselect/fselect-0.7.7/cargo-crates/radix_trie-0.2.1/src/
H A Dqc_test.rs77 let mut trie = Trie::new(); in insert_all_remove_all() localVariable
85 if trie.len() != length { in insert_all_remove_all()
90 if !trie.check_integrity() { in insert_all_remove_all()
102 if trie.len() != length { in insert_all_remove_all()
105 if trie.get(&k).is_some() { in insert_all_remove_all()
109 trie.check_integrity() in insert_all_remove_all()
124 match trie.subtrie(&k) { in subtrie()
143 trie.check_integrity() in subtrie()
181 ok && trie.check_integrity() in subtrie_mut_get()
214 trie.check_integrity() in subtrie_insert()
[all …]
/dports/devel/py-datrie/datrie-0.8.2/datrie.egg-info/
H A DPKG-INFO57 >>> trie[u'foo'] = 5
58 >>> trie[u'foobar'] = 10
63 Check if u'foo' is in trie::
65 >>> u'foo' in trie
70 >>> trie[u'foo']
114 >>> trie.keys(u'fo')
117 >>> trie.items(u'ba')
120 >>> trie.values(u'foob')
125 >>> trie.suffixes()
133 >>> trie.save('my.trie')
[all …]
/dports/devel/py-datrie/datrie-0.8.2/
H A DPKG-INFO57 >>> trie[u'foo'] = 5
58 >>> trie[u'foobar'] = 10
63 Check if u'foo' is in trie::
65 >>> u'foo' in trie
70 >>> trie[u'foo']
114 >>> trie.keys(u'fo')
117 >>> trie.items(u'ba')
120 >>> trie.values(u'foob')
125 >>> trie.suffixes()
133 >>> trie.save('my.trie')
[all …]
/dports/devel/re2c/re2c-2.2/examples/go/submatch/
H A D02_mtags.go28 *trie = append(*trie, mtagElem{val, tag})
29 return len(*trie) - 1
39 xval := trie[x].val
40 yval := trie[y].val
41 ss := unwind(trie, trie[x].pred, trie[y].pred, str)
57 trie := createTrie(256)
74 yyt2 = mtag(&trie, yyt2, mtagNil)
75 yyt1 = mtag(&trie, yyt1, mtagNil)
128 yyt1 = mtag(&trie, yyt1, cursor)
138 { return unwind(trie, x, y, str) }
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/status-im/keycard-go/vendor/github.com/ethereum/go-ethereum/light/
H A Dtrie.go59 if t.trie != nil {
60 cpytrie := *t.trie
61 cpy.trie = &cpytrie
95 trie *trie.Trie member
123 if t.trie == nil {
130 if t.trie == nil {
153 if t.trie == nil {
154 t.trie, err = trie.New(t.id.Root, trie.NewDatabase(t.db.backend.Database()))
170 trie.NodeIterator
178 if t.trie == nil {
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/light/
H A Dtrie.go65 if t.trie != nil {
66 cpytrie := *t.trie
67 cpy.trie = &cpytrie
102 trie *trie.Trie member
141 if t.trie == nil {
148 if t.trie == nil {
171 if t.trie == nil {
172 t.trie, err = trie.New(t.id.Root, trie.NewDatabase(t.db.backend.Database()))
188 trie.NodeIterator
196 if t.trie == nil {
[all …]
/dports/sysutils/bfs/bfs-2.3.1/tests/
H A Dtrie.c56 struct trie trie; in main() local
57 trie_init(&trie); in main()
60 assert(!trie_find_str(&trie, keys[i])); in main()
79 leaf = trie_insert_str(&trie, keys[i]); in main()
91 trie_remove(&trie, leaf); in main()
92 leaf = trie_find_str(&trie, keys[i]); in main()
104 leaf = trie_find_postfix(&trie, keys[i]); in main()
119 assert(!trie_find_mem(&trie, longstr, longsize)); in main()
123 assert(!trie_find_mem(&trie, longstr, longsize)); in main()
127 assert(!trie_find_mem(&trie, longstr, longsize)); in main()
[all …]
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/libp2p/go-cidranger/
H A Dtrie_test.go76 trie := newPrefixTree(tc.version)
89 walk := trie.walkDepth()
107 trie := newPrefixTree(rnet.IPv4)
198 trie := newPrefixTree(tc.version)
223 walk := trie.walkDepth()
266 trie := newPrefixTree(tc.version)
320 trie := newPrefixTree(tc.version)
373 trie := newPrefixTree(tc.version)
466 trie := newPrefixTree(tc.version)
502 trie := newPrefixTree(rnet.IPv4)
[all …]
/dports/lang/librep/librep_0.92.7/lisp/rep/data/
H A Dtrie.jl25 (define-structure rep.data.trie
27 (export make-trie
28 trie-insert-string!
29 trie-string-ref
30 trie-contains-string?
31 trie-foreach
32 make-trie-from-file)
58 (define make-trie make-node)
79 (trie-insert! (trie-insert-1! tree (car keys)) (cdr keys))))
87 (trie-insert-1! (trie-insert! tree (vector->list string)) word-terminator))
[all …]

1...<<11121314151617181920>>...317