Home
last modified time | relevance | path

Searched refs:trie (Results 226 – 250 of 7790) sorted by relevance

12345678910>>...312

/dports/textproc/gnugrep/grep-3.7/src/
H A Dkwset.c93 struct trie *trie; /* The trie itself. */ member
176 struct trie *trie = kwset->trie; in kwsincr() local
220 cur->trie->parent = trie; in kwsincr()
223 cur->trie->depth = trie->depth + 1; in kwsincr()
303 trie = cur->trie; in kwsincr()
367 tree->trie->fail = cur->trie; in treefails()
775 struct trie const *trie, *accept; in acexec_trans() local
784 trie = kwset->trie; in acexec_trans()
823 trie = trie->fail; in acexec_trans()
841 trie = tree->trie; in acexec_trans()
[all …]
/dports/databases/evolution-data-server/evolution-data-server-3.42.1/src/camel/
H A Dcamel-trie.c122 CamelTrie *trie; in camel_trie_new() local
125 trie->root.next = NULL; in camel_trie_new()
128 trie->root.final = 0; in camel_trie_new()
131 trie->icase = icase; in camel_trie_new()
136 return trie; in camel_trie_new()
183 q->fail = &trie->root; in trie_insert()
262 q = &trie->root; in camel_trie_add()
265 if (trie->icase) in camel_trie_add()
364 q = &trie->root; in camel_trie_search()
370 if (trie->icase) in camel_trie_search()
[all …]
/dports/www/minio-client/mc-RELEASE.2021-12-10T00-14-28Z/vendor/github.com/minio/pkg/trie/
H A Dtrie_test.go18 package trie package
26 trie := NewTrie()
28 if trie.size != 0 {
35 trie := NewTrie()
38 if trie.size != 0 {
42 trie.Insert("key")
43 trie.Insert("keyy")
46 if trie.size != 2 {
53 trie := NewTrie()
56 trie.Insert("minio")
[all …]
/dports/textproc/p5-Text-Match-FastAlternatives/Text-Match-FastAlternatives-1.05/
H A Dtrie.c26 #define ROOTNODE(trie) NODE(trie, BITS <= 32 ? sizeof *trie : PTRSIZE) argument
55 NM(trie_match)(const struct trie *trie, const U8 *s, STRLEN len) { in NM()
84 NM(trie_match_anchored)(const struct trie *trie, const U8 *s, STRLEN len) { in NM()
99 NM(trie_match_exact)(const struct trie *trie, const U8 *s, STRLEN len) { in NM()
129 NM(longest_suffix)(const struct trie *trie, const U8 *buf, STRLEN cur) { in NM()
146 NM(add_fail_pointers)(const struct trie *trie, const struct pool *pool, in NM()
162 NM(trie_get_node)(pTHX_ HV *limits, struct pool *pool, struct trie *trie, in NM()
187 static struct trie *
192 struct trie *trie = pool_alloc(&pool, sizeof *trie); in NM() local
227 NM(add_fail_pointers)(trie, &pool, ROOTNODE(trie), buf, 0); in NM()
[all …]
H A DFastAlternatives.xs14 struct trie { struct
177 struct trie *trie;
262 if (!trie)
270 DESTROY(trie)
275 buf = trie;
279 match(trie, targetsv)
291 if (CALL(trie, trie_match,(trie, target, target_len)))
331 if (CALL(trie, trie_match_exact,(trie, target, target_len)))
336 pointer_length(trie)
346 dump(trie)
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/trie/
H A Dtrie_test.go17 package trie package
52 return trie
56 var trie Trie
65 var trie Trie
321 trie.Hash()
519 return trie
547 trie.Hash()
554 trie.Hash()
583 trie.Hash()
623 trie.Hash()
[all …]
/dports/math/kktdirect/KKTDirect0.5/
H A Dkktsupport.h79 if(trie[a]){ in ~Trie32()
93 trie[a]=0; in ~Trie32()
142 if(!trie[a]){ in add()
147 if(!trie[a][b]){ in add()
152 if(!trie[a][b][c]){ in add()
159 trie[a][b][c][d]=i; in add()
160 ++trie[a][b][c][R]; in add()
173 assert(trie[a] && trie[a][b] && trie[a][b][c] && trie[a][b][c][d]!=-1); in remove()
190 trie[a][b]=0; in remove()
201 trie[a]=0; in remove()
[all …]
/dports/devel/kdevelop/kdevelop-21.12.3/plugins/qmljs/3rdparty/qtcreator-libs/qmljs/
H A Dpersistenttrie.cpp295 trie = TrieNode::insertF(trie,res); in operator ()()
475 trie = TrieNode::insertF(trie,s); in operator ()()
542 TrieNode::describe(dbg,trie.trie,0); in operator <<()
547 Trie::Trie(const TrieNode::Ptr &trie) : trie(trie) {} in Trie() argument
548 Trie::Trie(const Trie &o) : trie(o.trie){} in Trie()
576 trie = TrieNode::insertF(trie, value); in insert()
587 trie = TrieNode::intersectF(trie, v.trie).first; in intersect()
598 trie = TrieNode::mergeF(trie, v.trie).first; in merge()
603 trie = TrieNode::replaceF(trie, replacements); in replace()
613 return TrieNode::isSame(trie,o.trie); in operator ==()
[all …]
/dports/devel/qtcreator/qt-creator-opensource-src-5.0.3/src/libs/qmljs/
H A Dpersistenttrie.cpp292 trie = TrieNode::insertF(trie,res); in operator ()()
472 trie = TrieNode::insertF(trie,s); in operator ()()
539 TrieNode::describe(dbg,trie.trie,0); in operator <<()
544 Trie::Trie(const TrieNode::Ptr &trie) : trie(trie) {} in Trie() argument
572 trie = TrieNode::insertF(trie, value); in insert()
583 trie = TrieNode::intersectF(trie, v.trie).first; in intersect()
594 trie = TrieNode::mergeF(trie, v.trie).first; in merge()
599 trie = TrieNode::replaceF(trie, replacements); in replace()
609 return TrieNode::isSame(trie,o.trie); in operator ==()
614 return !TrieNode::isSame(trie,o.trie); in operator !=()
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/kernel/bpf/
H A Dlpm_trie.c322 if (trie->n_entries == trie->map.max_entries) { in trie_update_elem()
333 trie->n_entries++; in trie_update_elem()
345 slot = &trie->root; in trie_update_elem()
376 trie->n_entries--; in trie_update_elem()
419 trie->n_entries--; in trie_update_elem()
453 trim = &trie->root; in trie_delete_elem()
477 trie->n_entries--; in trie_delete_elem()
559 if (!trie) in trie_alloc()
566 trie->max_prefixlen = trie->data_size * 8; in trie_alloc()
570 return &trie->map; in trie_alloc()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/kernel/bpf/
H A Dlpm_trie.c322 if (trie->n_entries == trie->map.max_entries) { in trie_update_elem()
333 trie->n_entries++; in trie_update_elem()
345 slot = &trie->root; in trie_update_elem()
376 trie->n_entries--; in trie_update_elem()
419 trie->n_entries--; in trie_update_elem()
453 trim = &trie->root; in trie_delete_elem()
477 trie->n_entries--; in trie_delete_elem()
559 if (!trie) in trie_alloc()
566 trie->max_prefixlen = trie->data_size * 8; in trie_alloc()
570 return &trie->map; in trie_alloc()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/kernel/bpf/
H A Dlpm_trie.c322 if (trie->n_entries == trie->map.max_entries) { in trie_update_elem()
333 trie->n_entries++; in trie_update_elem()
345 slot = &trie->root; in trie_update_elem()
376 trie->n_entries--; in trie_update_elem()
419 trie->n_entries--; in trie_update_elem()
453 trim = &trie->root; in trie_delete_elem()
477 trie->n_entries--; in trie_delete_elem()
559 if (!trie) in trie_alloc()
566 trie->max_prefixlen = trie->data_size * 8; in trie_alloc()
570 return &trie->map; in trie_alloc()
[all …]
/dports/deskutils/mindforger/mindforger-1.52.0/lib/test/src/gear/
H A Dtrie_test.cpp45 m8r::Trie trie{}; in TEST() local
47 trie.addWord(w); in TEST()
51 trie.print(); in TEST()
72 m8r::Trie trie{}; in TEST() local
74 trie.addWord(w); in TEST()
78 trie.print(); in TEST()
84 trie.removeWord(word); in TEST()
86 trie.print(); in TEST()
93 trie.removeWord(word, true); in TEST()
95 trie.print(); in TEST()
[all …]
/dports/x11-toolkits/vte/vte-0.28.2/src/
H A Dtrie.c381 _vte_trie_free(trie->trie_paths[i].trie); in _vte_trie_free()
406 trie->result = g_quark_to_string(trie->quark); in _vte_trie_addx()
448 _vte_trie_addx(trie->trie_paths[i].trie, in _vte_trie_addx()
460 trie->trie_paths = g_realloc(trie->trie_paths, in _vte_trie_addx()
464 memset(&trie->trie_paths[i], 0, sizeof(trie->trie_paths[i])); in _vte_trie_addx()
465 trie->trie_paths[i].trie = _vte_trie_new(); in _vte_trie_addx()
470 _vte_trie_addx(trie->trie_paths[i].trie, in _vte_trie_addx()
562 struct _vte_trie *subtrie = trie->trie_paths[i].trie; in _vte_trie_matchx()
792 if (trie->trie_paths[i].trie->result != NULL) { in _vte_trie_printx()
794 trie->trie_paths[i].trie->result); in _vte_trie_printx()
[all …]
/dports/mail/astroid/astroid-0.15/src/utils/gmime/
H A Dgtrie.c142 GTrie *trie; in g_trie_new() local
153 return trie; in g_trie_new()
162 g_free (trie); in g_trie_free()
257 q = &trie->root; in g_trie_add()
266 if (trie->icase) in g_trie_add()
349 q = &trie->root; in g_trie_quick_search()
365 if (trie->icase) in g_trie_quick_search()
375 q = &trie->root; in g_trie_quick_search()
407 q = &trie->root; in g_trie_search()
426 if (trie->icase) in g_trie_search()
[all …]
/dports/mail/gmime26-sharp/gmime-2.6.23/util/
H A Dgtrie.c142 GTrie *trie; in g_trie_new() local
153 return trie; in g_trie_new()
162 g_free (trie); in g_trie_free()
257 q = &trie->root; in g_trie_add()
266 if (trie->icase) in g_trie_add()
349 q = &trie->root; in g_trie_quick_search()
365 if (trie->icase) in g_trie_quick_search()
375 q = &trie->root; in g_trie_quick_search()
407 q = &trie->root; in g_trie_search()
426 if (trie->icase) in g_trie_search()
[all …]
/dports/mail/gmime30/gmime-3.2.7/util/
H A Dgtrie.c142 GTrie *trie; in g_trie_new() local
153 return trie; in g_trie_new()
162 g_free (trie); in g_trie_free()
257 q = &trie->root; in g_trie_add()
266 if (trie->icase) in g_trie_add()
349 q = &trie->root; in g_trie_quick_search()
365 if (trie->icase) in g_trie_quick_search()
375 q = &trie->root; in g_trie_quick_search()
407 q = &trie->root; in g_trie_search()
426 if (trie->icase) in g_trie_search()
[all …]
/dports/mail/gmime26/gmime-2.6.23/util/
H A Dgtrie.c142 GTrie *trie; in g_trie_new() local
153 return trie; in g_trie_new()
162 g_free (trie); in g_trie_free()
257 q = &trie->root; in g_trie_add()
266 if (trie->icase) in g_trie_add()
349 q = &trie->root; in g_trie_quick_search()
365 if (trie->icase) in g_trie_quick_search()
375 q = &trie->root; in g_trie_quick_search()
407 q = &trie->root; in g_trie_search()
426 if (trie->icase) in g_trie_search()
[all …]
/dports/textproc/libparsifal/libparsifal-1.1.0/include/libparsifal/
H A Dxmldef.h192 struct trie { struct
199 static struct trie const T_N_[] = {
223 /* 23 */ {'\0', (struct trie*)5, NULL}
228 static struct trie const T_N_[] = {
252 /* 23 */ {'\0', (struct trie*)5, NULL}
257 static struct trie const T_N_[] = {
290 static struct trie T_N_[] = {
311 static struct trie const T_N_[] = {
356 static struct trie const T_N_[] = {
405 static struct trie const T_N_[] = {
[all …]
/dports/devel/py-pyicu/PyICU-2.4.3/test/
H A Dtest_UCharsTrie.py43 trie = builder.build(UStringTrieBuildOption.FAST)
45 for key, value in trie:
58 self.assertEqual((3, 6), (trie.next('abc'), trie.getValue()))
59 state = trie.saveState()
61 self.assertEqual(u'depq', trie.getNextUChars())
63 self.assertEqual((2, 2), (trie.next('d'), trie.getValue()))
64 self.assertEqual((0, None), (trie.next('e'), trie.getValue()))
66 trie.resetToState(state)
67 self.assertEqual((2, 11), (trie.next('ef'), trie.getValue()))
69 trie.resetToState(state)
[all …]
H A Dtest_BytesTrie.py43 trie = builder.build(UStringTrieBuildOption.FAST)
45 for key, value in trie:
58 self.assertEqual((3, 6), (trie.next('abc'), trie.getValue()))
59 state = trie.saveState()
61 self.assertEqual(b'depq', trie.getNextBytes())
63 self.assertEqual((2, 2), (trie.next('d'), trie.getValue()))
64 self.assertEqual((0, None), (trie.next('e'), trie.getValue()))
66 trie.resetToState(state)
67 self.assertEqual((2, 11), (trie.next('ef'), trie.getValue()))
69 trie.resetToState(state)
[all …]
/dports/databases/mariadb104-server/mariadb-10.4.24/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/mariadb104-client/mariadb-10.4.24/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/mariadb103-client/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp460 if (!trie) {
541 if (!trie) {
561 if (!trie) {
737 if (!trie) {
857 if (!trie) {
882 if (trie) {
899 if (!trie) {
1019 if (!trie) {
1042 if (trie) {
1055 if (!trie || !trie->max_key_id()) {
[all …]
/dports/databases/mariadb105-client/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 …]

12345678910>>...312