| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationDataBuilder.java | 55 trie = null;
68 if(trie != null) {
77 trie = new Trie2Writable(Collation.FALLBACK_CE32, Collation.FFFD_CE32);
85 trie.set(c, Collation.FALLBACK_CE32);
93 trie.setRange(Hangul.HANGUL_BASE, Hangul.HANGUL_END, hangulCE32, true);
117 return Collation.isAssignedCE32(trie.get(c));
183 int oldCE32 = trie.get(c);
193 trie.set(c, oldCE32);
199 trie.set(c, ce32);
212 trie.set(c, contextCE32)
1341 protected Trie2Writable trie; field in class:CollationDataBuilder
[all...] |
| IterCollationIterator.java | 58 return makeCodePointAndCE32Pair(c, trie.getFromU16SingleLead((char)c));
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationDataBuilder.java | 54 trie = null;
67 if(trie != null) {
76 trie = new Trie2Writable(Collation.FALLBACK_CE32, Collation.FFFD_CE32);
84 trie.set(c, Collation.FALLBACK_CE32);
92 trie.setRange(Hangul.HANGUL_BASE, Hangul.HANGUL_END, hangulCE32, true);
116 return Collation.isAssignedCE32(trie.get(c));
182 int oldCE32 = trie.get(c);
192 trie.set(c, oldCE32);
198 trie.set(c, ce32);
211 trie.set(c, contextCE32)
1340 protected Trie2Writable trie; field in class:CollationDataBuilder
[all...] |
| IterCollationIterator.java | 56 return makeCodePointAndCE32Pair(c, trie.getFromU16SingleLead((char)c));
|
| /external/icu/icu4c/source/i18n/ |
| collationdatabuilder.cpp | 111 * In particular, this class reads from the unfinished trie
123 * so that the CollationIterator does not need the finished trie
187 uint32_t ce32 = utrie2_get32(builder.trie, c);
253 return utrie2_get32(builder.trie, c);
261 return utrie2_get32(builder.trie, jamo);
283 trie(NULL),
294 utrie2_close(trie);
302 if(trie != NULL) {
313 trie = utrie2_open(Collation::FALLBACK_CE32, Collation::FFFD_CE32, &errorCode);
321 utrie2_set32(trie, c, Collation::FALLBACK_CE32, &errorCode)
[all...] |
| collationdata.h | 56 : trie(NULL),
69 return UTRIE2_GET32(trie, c);
73 return UTRIE2_GET32_FROM_SUPP(trie, c);
174 /** Main lookup trie. */
175 const UTrie2 *trie; member in struct:CollationData
|
| collationtailoring.cpp | 40 trie(NULL), unsafeBackwardSet(NULL),
63 utrie2_close(trie);
|
| utf8collationiterator.cpp | 54 return trie->data32[c];
59 uint32_t ce32 = trie->data32[trie->index[(UTRIE2_UTF8_2B_INDEX_2_OFFSET - 0xc0) + c] + t1];
71 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
163 return trie->data32[c];
168 uint32_t ce32 = trie->data32[trie->index[(UTRIE2_UTF8_2B_INDEX_2_OFFSET - 0xc0) + c] + t1];
220 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
|
| collationtailoring.h | 82 UTrie2 *trie; member in struct:CollationTailoring
90 * It is immutable, and the data trie cannot be copied either.
|
| /external/icu/icu4c/source/common/ |
| bytestrieiterator.cpp | 47 BytesTrie::Iterator::Iterator(const BytesTrie &trie, int32_t maxStringLength,
49 : bytes_(trie.bytes_), pos_(trie.pos_), initialPos_(trie.pos_),
50 remainingMatchLength_(trie.remainingMatchLength_),
51 initialRemainingMatchLength_(trie.remainingMatchLength_),
|
| ucharstrieiterator.cpp | 46 UCharsTrie::Iterator::Iterator(const UCharsTrie &trie, int32_t maxStringLength,
48 : uchars_(trie.uchars_), pos_(trie.pos_), initialPos_(trie.pos_),
49 remainingMatchLength_(trie.remainingMatchLength_),
50 initialRemainingMatchLength_(trie.remainingMatchLength_),
|
| propname.cpp | 219 UBool PropNameData::containsName(BytesTrie &trie, const char *name) {
234 result=trie.next((uint8_t)c);
260 BytesTrie trie(bytesTries+bytesTrieOffset);
261 if(containsName(trie, alias)) {
262 return trie.getValue();
|
| propname.h | 111 static UBool containsName(BytesTrie &trie, const char *name);
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 106 // Interface functions for int TRIE
108 static pANTLR3_TRIE_ENTRY intTrieGet (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key);
109 static ANTLR3_BOOLEAN intTrieDel (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key);
110 static ANTLR3_BOOLEAN intTrieAdd (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key, ANTLR3_UINT32 type, ANTLR3_INTKEY intType, void * data, void (ANTLR3_CDECL *freeptr)(void *));
111 static void intTrieFree (pANTLR3_INT_TRIE trie);
1770 pANTLR3_INT_TRIE trie; local
[all...] |
| /toolchain/binutils/binutils-2.25/bfd/ |
| mmo.c | 2637 struct mmo_symbol_trie *trie = rootp; local
[all...] |
| /cts/common/host-side/tradefed/src/com/android/compatibility/common/tradefed/command/ |
| CompatibilityConsole.java | 86 protected void setCustomCommands(RegexTrie<Runnable> trie, List<String> genericHelp,
95 trie.put(new Runnable() {
101 trie.put(new Runnable() {
107 trie.put(new Runnable() {
113 trie.put(new Runnable() {
119 trie.put(new ArgRunnable<CaptureList>() {
132 trie.put(new ArgRunnable<CaptureList>() {
143 trie.put(new ArgRunnable<CaptureList>() {
149 trie.put(new Runnable() {
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| UPropertyAliases.java | 203 private boolean containsName(BytesTrie trie, CharSequence name) {
215 result=trie.next(c);
273 BytesTrie trie=new BytesTrie(bytesTries, bytesTrieOffset); local
274 if(containsName(trie, alias)) {
275 return trie.getValue();
|
| UCaseProps.java | 66 // read the trie
67 trie=Trie2_16.createFromSerialized(bytes);
69 int trieLength=trie.getSerializedLength();
71 throw new IOException(DATA_FILE_NAME+": not enough bytes for the trie");
73 // skip padding after trie bytes
100 /* add the start code point of each same-value range of the trie */
101 Iterator<Trie2.Range> trieIterator=trie.iterator();
192 int props=trie.get(c);
208 int props=trie.get(c);
224 int props=trie.get(c)
1340 private Trie2_16 trie; field in class:UCaseProps
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| UPropertyAliases.java | 202 private boolean containsName(BytesTrie trie, CharSequence name) {
214 result=trie.next(c);
272 BytesTrie trie=new BytesTrie(bytesTries, bytesTrieOffset); local
273 if(containsName(trie, alias)) {
274 return trie.getValue();
|
| /external/icu/icu4j/main/classes/charset/src/com/ibm/icu/charset/ |
| CharsetSelector.java | 43 private IntTrie trie; field in class:CharsetSelector
86 trie = pvec.compactToTrieWithRowIndexes();
209 int pvIndex = trie.getCodePointValue(c);
|
| /tools/tradefederation/core/tests/src/com/android/tradefed/command/ |
| ConsoleTest.java | 220 RegexTrie<Runnable> trie = mConsole.getCommandTrie(); local
226 Runnable runnable = trie.retrieve(captures, command);
240 RegexTrie<Runnable> trie = mConsole.getCommandTrie(); local
246 Runnable runnable = trie.retrieve(captures, command);
264 RegexTrie<Runnable> trie = mConsole.getCommandTrie(); local
270 Runnable runnable = trie.retrieve(captures, command);
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/text/width/ |
| trieval.go | 5 // elem is an entry of the width trie. The high byte is used to encode the type
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/width/ |
| trieval.go | 5 // elem is an entry of the width trie. The high byte is used to encode the type
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 327 /* -------------- TRIE Interfaces ---------------- */
362 * and potentially a huge trie. This is the algorithm for a Patricia Trie.
363 * Note also that this trie [can] accept multiple entries for the same key and is
364 * therefore a kind of elastic bucket patricia trie.
377 pANTLR3_INT_TRIE_NODE root; /* Root node of this integer trie */
378 pANTLR3_INT_TRIE_NODE current; /* Used to traverse the TRIE with the next() method */
380 ANTLR3_BOOLEAN allowDups; /* Whether this trie accepts duplicate keys */
383 pANTLR3_TRIE_ENTRY (*get) (struct ANTLR3_INT_TRIE_struct * trie, ANTLR3_INTKEY key);
384 ANTLR3_BOOLEAN (*del) (struct ANTLR3_INT_TRIE_struct * trie, ANTLR3_INTKEY key)
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| sprpdata.c | 157 UTrie trie = data->sprepTrie; local
163 UTRIE_GET16(&trie, codepoint, result);
237 UTrie trie = data->sprepTrie; local
257 UTRIE_GET16(&trie,start, result);
|
