Searched defs:trie (Results 1 - 25 of 78) sorted by relevance

1234

/external/icu/icu4c/source/i18n/
H A Duspoof_wsconf.h44 UTrie2 *trie; // Any-case or Lower-case Trie. member in class:BuilderScriptSet
H A Dcollationtailoring.h80 UTrie2 *trie; member in struct:CollationTailoring
88 * It is immutable, and the data trie cannot be copied either.
H A Dcollationdatabuilder.h237 UTrie2 *trie; member in class:CollationDataBuilder
H A Dcollationiterator.h86 : trie(d->trie),
248 * Returns the CE32 from the data trie.
259 // Main lookup trie of the data object.
260 const UTrie2 *trie; member in class:CollationIterator
/external/icu/icu4c/source/common/
H A Dpropsvec.h154 * vectors array, and freeze the trie.
160 UTrie2 *trie; member in struct:UPVecToUTrie2Context
167 /* context=UPVecToUTrie2Context, creates the trie and stores the rowIndex values */
H A Dbytestrieiterator.cpp45 BytesTrie::Iterator::Iterator(const BytesTrie &trie, int32_t maxStringLength, argument
47 : bytes_(trie.bytes_), pos_(trie.pos_), initialPos_(trie.pos_),
48 remainingMatchLength_(trie.remainingMatchLength_),
49 initialRemainingMatchLength_(trie.remainingMatchLength_),
H A Ducharstrieiterator.cpp44 UCharsTrie::Iterator::Iterator(const UCharsTrie &trie, int32_t maxStringLength, argument
46 : uchars_(trie.uchars_), pos_(trie.pos_), initialPos_(trie.pos_),
47 remainingMatchLength_(trie.remainingMatchLength_),
48 initialRemainingMatchLength_(trie.remainingMatchLength_),
/external/icu/icu4c/source/test/perf/unisetperf/draft/
H A Dtrieset.cpp16 * Modifies the trie index to make the BMP linear, and uses the original set
23 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH)
25 #define UTRIE_GET8_FROM_LEAD(trie, c16) \
26 ((const uint8_t *)(trie)->data32)[ \
27 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
63 // Preflight the trie length.
77 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie!
82 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT),
83 trie
109 UTrie trie; member in class:TrieSet
[all...]
/external/marisa-trie/lib/marisa/
H A Dprogress.h41 int trie() const { function in class:marisa::Progress
/external/marisa-trie/tests/
H A Dc-test.c8 marisa_trie *trie = NULL; local
12 ASSERT(marisa_init(&trie) == MARISA_OK);
13 ASSERT(marisa_init(&trie) == MARISA_HANDLE_ERROR);
14 ASSERT(marisa_end(trie) == MARISA_OK);
91 marisa_trie *trie = NULL; local
104 ASSERT(marisa_init(&trie) == MARISA_OK);
106 ASSERT(marisa_get_num_tries(trie) == 0);
107 ASSERT(marisa_get_num_keys(trie) == 0);
108 ASSERT(marisa_get_num_nodes(trie) == 0);
109 ASSERT(marisa_get_total_size(trie)
[all...]
H A Dtrie-test.cc56 marisa::Trie trie; local
58 ASSERT(trie.num_tries() == 0);
59 ASSERT(trie.num_keys() == 0);
60 ASSERT(trie.num_nodes() == 0);
61 ASSERT(trie.total_size() == (sizeof(marisa::UInt32) * 23));
64 trie.build(keys);
65 ASSERT(trie.num_tries() == 1);
66 ASSERT(trie.num_keys() == 0);
67 ASSERT(trie.num_nodes() == 1);
76 trie
190 marisa::Trie trie; local
416 marisa::Trie trie; local
514 marisa::Trie trie; local
578 marisa::Trie trie; local
[all...]
/external/marisa-trie/tools/
H A Dmarisa-lookup.cc33 marisa::Trie trie; local
37 trie.mmap(&mapper, args[0]);
45 trie.load(args[0]);
55 const marisa::UInt32 key_id = trie.lookup(str);
56 if (key_id != trie.notfound()) {
H A Dmarisa-build.cc28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
77 marisa::Trie trie; local
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
90 std::cerr << "size: " << trie.total_size() << std::endl;
94 trie.save(output_filename);
103 trie
[all...]
H A Dmarisa-predict.cc42 marisa::Trie trie; local
46 trie.mmap(&mapper, args[0]);
54 trie.load(args[0]);
66 std::size_t num_keys = trie.predict(str);
73 num_keys = trie.predict_depth_first(
76 num_keys = trie.predict_breadth_first(
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dprogress.h41 int trie() const { function in class:marisa_alpha::Progress
/external/marisa-trie/v0_1_5/tests/
H A Dc-test.c8 marisa_alpha_trie *trie = NULL; local
12 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_OK);
13 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_HANDLE_ERROR);
14 ASSERT(marisa_alpha_end(trie) == MARISA_ALPHA_OK);
96 marisa_alpha_trie *trie = NULL; local
109 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_OK);
111 ASSERT(marisa_alpha_get_num_tries(trie) == 0);
112 ASSERT(marisa_alpha_get_num_keys(trie) == 0);
113 ASSERT(marisa_alpha_get_num_nodes(trie) == 0);
114 ASSERT(marisa_alpha_get_total_size(trie)
[all...]
/external/marisa-trie/v0_1_5/tools/
H A Dmarisa_alpha-lookup.cc33 marisa_alpha::Trie trie; local
37 trie.mmap(&mapper, args[0]);
45 trie.load(args[0]);
55 const marisa_alpha::UInt32 key_id = trie.lookup(str);
56 if (key_id != trie.notfound()) {
H A Dmarisa_alpha-build.cc28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
77 marisa_alpha::Trie trie; local
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
90 std::cerr << "size: " << trie.total_size() << std::endl;
94 trie.save(output_filename);
103 trie
[all...]
H A Dmarisa_alpha-predict.cc42 marisa_alpha::Trie trie; local
46 trie.mmap(&mapper, args[0]);
54 trie.load(args[0]);
66 std::size_t num_keys = trie.predict(str);
73 num_keys = trie.predict_depth_first(
76 num_keys = trie.predict_breadth_first(
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
H A DCollationTailoring.java117 Trie2_32 trie; field in class:CollationTailoring
123 * It is immutable, and the data trie cannot be copied either.
/external/icu/icu4j/main/classes/charset/src/com/ibm/icu/charset/
H A DCharsetSelector.java41 private IntTrie trie; field in class:CharsetSelector
84 trie = pvec.compactToTrieWithRowIndexes();
207 int pvIndex = trie.getCodePointValue(c);
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DTrieIterator.java95 * @param trie to be used
98 public TrieIterator(Trie trie) argument
100 if (trie == null) {
102 "Argument trie cannot be null");
104 m_trie_ = trie;
157 * Called by next() to extracts a 32 bit value from a trie value
162 * @param value a value from the trie
241 * For each entry in the trie, the value to be delivered is passed through
519 * Initial value for trie values
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/
H A DTrie2Test.java61 Trie2Writable trie = new Trie2Writable(0,0);
63 trie.toTrie2_16().serialize(os);
95 Trie2Writable trie = new Trie2Writable(17,0);
97 it = trie.iterator();
113 for (Trie2.Range rr: trie) {
137 Trie2Writable trie = new Trie2Writable(0xbadfeed, 0);
138 trie.set(0x10123, 42);
148 Iterator<Trie2.Range> it = trie.iterator(vm);
160 Trie2Writable trie = new Trie2Writable(0xdefa17, 0);
161 trie
619 trieGettersTest(String testName, Trie2 trie, int[][] checkRanges) argument
[all...]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationTailoring.java115 Trie2_32 trie; field in class:CollationTailoring
121 * It is immutable, and the data trie cannot be copied either.
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DTrieIterator.java94 * @param trie to be used
97 public TrieIterator(Trie trie) argument
99 if (trie == null) {
101 "Argument trie cannot be null");
103 m_trie_ = trie;
156 * Called by next() to extracts a 32 bit value from a trie value
161 * @param value a value from the trie
240 * For each entry in the trie, the value to be delivered is passed through
518 * Initial value for trie values

Completed in 413 milliseconds

1234