Home
last modified time | relevance | path

Searched refs:trie (Results 1 – 25 of 4590) sorted by relevance

12345678910>>...184

/dports/devel/py-datrie/datrie-0.8.2/tests/
H A Dtest_trie.py22 trie['foo'] = '5'
26 trie['Foo'] = 10
29 del trie['foo']
36 trie['bar']
61 trie['fo'] = 4
64 del trie
80 trie['fo'] = 4
119 trie['а'] = 1
120 trie['б'] = 2
153 trie['foo'] = trie['bar'] = trie['foobar'] = 42
[all …]
/dports/www/shellinabox/shellinabox-2.20/libhttp/
H A Dtrie.c74 if (trie) { in destroyTrie()
77 if (trie->destructor && !trie->children[i].ch) { in destroyTrie()
78 trie->destructor(trie->arg, trie->children[i].value); in destroyTrie()
90 free(trie); in deleteTrie()
107 initTrie(trie->children, trie->destructor, trie->arg); in addLeafToTrie()
140 initTrie(child, trie->destructor, trie->arg); in addToTrie()
147 if (key[trie->idx] == trie->children[i].ch) { in addToTrie()
154 trie->destructor(trie->arg, trie->children[i].value); in addToTrie()
171 initTrie(newNode, trie->destructor, trie->arg); in addToTrie()
185 if (memcmp(trie->key, key, trie->idx)) { in getFromTrie()
[all …]
/dports/sysutils/fselect/fselect-0.7.7/cargo-crates/radix_trie-0.2.1/src/
H A Dtest.rs24 trie in test_trie()
29 let trie = test_trie(); in get_nonexistant() localVariable
36 let trie = test_trie(); in subtrie_nonexistant() localVariable
44 trie.insert("bär", 1); in unicode()
48 let values = trie in unicode()
177 assert_eq!(trie.get_ancestor_value(&"abcdefg"), trie.get(&"abcdef")); in nearest_ancestor()
178 assert_eq!(trie.get_ancestor_value(&"abcde"), trie.get(&"abcd")); in nearest_ancestor()
179 assert_eq!(trie.get_ancestor_value(&"aauksdjk"), trie.get(&"a")); in nearest_ancestor()
278 trie.remove(&"a"); in root_replace_bug()
280 trie.remove(&"p"); in root_replace_bug()
[all …]
/dports/misc/vifm/vifm-0.11/tests/utils/
H A Dtrie.c12 assert_non_null(trie); in TEST()
13 trie_free(trie); in TEST()
27 trie_free(trie); in TEST()
37 trie_free(trie); in TEST()
71 trie_free(trie); in TEST()
80 trie_free(trie); in TEST()
92 trie_free(trie); in TEST()
104 trie_free(trie); in TEST()
112 assert_int_equal(0, trie_set(trie, "str", trie)); in TEST()
116 trie_free(trie); in TEST()
[all …]
/dports/japanese/uim-mozc/mozc-2.23.2815.102.01/src/storage/louds/
H A Dlouds_trie_test.cc60 args.trie = ≜ in operator ()()
154 LoudsTrie trie; in TEST_P() local
177 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(root))); in TEST_P()
215 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(node_b))); in TEST_P()
432 trie.Close(); in TEST()
466 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
472 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
485 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
499 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
505 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
[all …]
/dports/japanese/ibus-mozc/mozc-2.23.2815.102.01/src/storage/louds/
H A Dlouds_trie_test.cc60 args.trie = ≜ in operator ()()
154 LoudsTrie trie; in TEST_P() local
177 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(root))); in TEST_P()
215 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(node_b))); in TEST_P()
432 trie.Close(); in TEST()
466 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
472 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
485 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
499 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
505 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
[all …]
/dports/japanese/mozc-tool/mozc-2.23.2815.102.01/src/storage/louds/
H A Dlouds_trie_test.cc60 args.trie = ≜ in operator ()()
154 LoudsTrie trie; in TEST_P() local
177 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(root))); in TEST_P()
215 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(node_b))); in TEST_P()
432 trie.Close(); in TEST()
466 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
472 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
485 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
499 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
505 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
[all …]
/dports/japanese/mozc-server/mozc-2.23.2815.102.01/src/storage/louds/
H A Dlouds_trie_test.cc60 args.trie = ≜ in operator ()()
154 LoudsTrie trie; in TEST_P() local
177 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(root))); in TEST_P()
215 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(node_b))); in TEST_P()
432 trie.Close(); in TEST()
466 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
472 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
485 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
499 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
505 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
[all …]
/dports/japanese/mozc-el/mozc-2.23.2815.102.01/src/storage/louds/
H A Dlouds_trie_test.cc60 args.trie = ≜ in operator ()()
154 LoudsTrie trie; in TEST_P() local
177 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(root))); in TEST_P()
215 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(node_b))); in TEST_P()
432 trie.Close(); in TEST()
466 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
472 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
485 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
499 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
505 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
[all …]
/dports/japanese/fcitx-mozc/mozc-2.23.2815.102.01/src/storage/louds/
H A Dlouds_trie_test.cc60 args.trie = ≜ in operator ()()
154 LoudsTrie trie; in TEST_P() local
177 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(root))); in TEST_P()
215 EXPECT_FALSE(trie.IsValidNode(trie.MoveToNextSibling(node_b))); in TEST_P()
432 trie.Close(); in TEST()
466 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
472 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
485 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
499 EXPECT_EQ(&trie, actual[0].trie); in TEST_P()
505 EXPECT_EQ(&trie, actual[1].trie); in TEST_P()
[all …]
/dports/misc/vifm/vifm-0.11/src/utils/
H A Dtrie.c49 trie = clone_nodes(trie, &error); in trie_clone()
56 return trie; in trie_clone()
66 if(trie == NULL) in clone_nodes()
89 if(trie != NULL) in trie_free()
94 free(trie); in trie_free()
107 free(trie); in trie_free_with_data()
150 *link = trie; in get_or_create()
169 link = (*str < trie->value) ? &trie->left : &trie->right; in get_or_create()
171 trie = *link; in get_or_create()
198 trie = trie->children; in trie_get()
[all …]
/dports/net/nanomsg/nanomsg-1.1.5/tests/
H A Dtrie.c32 struct nn_trie trie; in main() local
35 nn_trie_init (&trie); in main()
40 nn_trie_term (&trie); in main()
43 nn_trie_init (&trie); in main()
50 nn_trie_term (&trie); in main()
53 nn_trie_init (&trie); in main()
64 nn_trie_term (&trie); in main()
67 nn_trie_init (&trie); in main()
80 nn_trie_term (&trie); in main()
83 nn_trie_init (&trie); in main()
[all …]
/dports/devel/marisa-trie/marisa-trie-961ed33/tests/
H A Dmarisa-test.cc15 marisa::Trie trie; in TestEmptyTrie() local
46 trie.build(keyset); in TestEmptyTrie()
66 trie.build(keyset); in TestEmptyTrie()
96 marisa::Trie trie; in TestTinyTrie() local
266 marisa::Trie trie; in TestTrie() local
281 trie.clear(); in TestTrie()
302 trie.clear(); in TestTrie()
321 trie.clear(); in TestTrie()
334 stream << trie; in TestTrie()
335 trie.clear(); in TestTrie()
[all …]
/dports/devel/icu-lx/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/devel/icu/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/intl/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/intl/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/textproc/R-cran-stringi/stringi/src/icu69/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/www/firefox/firefox-99.0/intl/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/lang/v8/v8-9.6.180.12/third_party/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/intl/icu/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/www/node10/node-v10.24.1/deps/icu-small/source/common/
H A Dutrie2_builder.cpp117 UTrie2 *trie; in utrie2_open() local
245 return trie; in utrie2_open()
295 return trie; in cloneBuilder()
336 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
600 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
660 if(trie==NULL || trie->isCompacted) { in set32()
1128 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1130 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1134 trie->data[newStart++]=trie->initialValue; in compactData()
1204 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/devel/py-pytrie/PyTrie-0.3.1/tests/
H A Dtest_trie.py59 self.assertEqual(self.trie.keys('al'),
70 self.assertEqual(self.trie.items('al'),
76 trie = self.trie
79 trie.items(prefix),
80 list(zip(trie.keys(prefix), trie.values(prefix)))
84 self.trie[''] = '!'
86 self.assertEqual(self.trie.keys(''),
89 self.assertEqual(self.trie.values(''),
91 self.assertEqual(self.trie.items(''),
113 evaled = eval(repr(self.trie))
[all …]

12345678910>>...184