HomeSort by relevance Sort by last modified time
    Searched defs:trie (Results 26 - 50 of 68) sorted by null

12 3

  /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);
trietest.c 56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) {
65 value=utrie_get32(trie, start, &inBlockZero);
87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) {
96 value=utrie_get32(trie, start, &inBlockZero);
142 const UTrie *trie,
171 if(trie->data32!=NULL) {
172 UTRIE_NEXT32(trie, p, limit, c, c2, value);
174 UTRIE_NEXT16(trie, p, limit, c, c2, value);
192 if(trie->data32==NULL) {
193 value=UTRIE_GET16_FROM_LEAD(trie, c)
263 UTrie trie={ 0 }; local
457 UTrie trie={ 0 }; local
825 UTrie trie; local
    [all...]
  /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);
  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
CollationTailoring.java 117 Trie2_32 trie; field in class:CollationTailoring
123 * It is immutable, and the data trie cannot be copied either.
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...]
CollationData.java 44 return trie.get(c);
48 return trie.get(c); // TODO: port UTRIE2_GET32_FROM_SUPP(trie, c) to Java?
484 /** Main lookup trie. */
485 Trie2_32 trie; field in class:CollationData
  /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...]
CollationData.java 46 return trie.get(c);
50 return trie.get(c); // TODO: port UTRIE2_GET32_FROM_SUPP(trie, c) to Java?
486 /** Main lookup trie. */
487 Trie2_32 trie; field in class:CollationData
  /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();
UBiDiProps.java 63 // read the trie
64 trie=Trie2_16.createFromSerialized(bytes);
66 int trieLength=trie.getSerializedLength();
68 throw new IOException(DATA_FILE_NAME+": not enough bytes for the trie");
70 // skip padding after trie bytes
106 /* add the start code point of each same-value range of the trie */
107 Iterator<Trie2.Range> trieIterator=trie.iterator();
175 return getClassFromProps(trie.get(c));
179 return getFlagFromProps(trie.get(c), IS_MIRRORED_SHIFT);
212 int props=trie.get(c)
263 private Trie2_16 trie; field in class:UBiDiProps
    [all...]
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/
TrieTest.java 19 import android.icu.impl.Trie;
26 * Testing class for Trie. Tests here will be simple, since both CharTrie and
113 implements Trie.DataManipulate
123 public _testEnumValue(Trie data)
134 private void _testTrieIteration(IntTrie trie, CheckRange checkRanges[],
156 int value = trie.getCodePointValue(c);
176 value = trie.getLeadValue(lead);
177 value = trie.getTrailValue(value, trail);
178 if (value != trie.getSurrogateValue(lead, trail)
215 errln("setting values into a trie failed")
236 IntTrie trie = newTrie.serialize(new _testFoldedValue(newTrie), local
481 CharTrie trie; local
506 IntTrie trie; local
    [all...]
  /external/icu/icu4c/source/common/
ucol_swp.cpp 32 * This performs data swapping for a folded trie (see utrie.c for details).
40 UTrieHeader trie; local
59 trie.signature=ds->readUInt32(inTrie->signature);
60 trie.options=ds->readUInt32(inTrie->options);
61 trie.indexLength=udata_readInt32(ds, inTrie->indexLength);
62 trie.dataLength=udata_readInt32(ds, inTrie->dataLength);
64 if( trie.signature!=0x54726965 ||
65 (trie.options&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_SHIFT ||
66 ((trie.options>>UTRIE_OPTIONS_INDEX_SHIFT)&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_INDEX_SHIFT ||
67 trie.indexLength<UTRIE_BMP_INDEX_LENGTH |
    [all...]
utrie2.cpp 18 * This is a common implementation of a Unicode trie.
21 * This is the second common version of a Unicode trie (hence the name UTrie2).
43 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) {
46 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) {
47 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY];
54 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
57 block=trie->index2[i2];
58 return trie->data[block+(c&UTRIE2_DATA_MASK)];
62 utrie2_get32(const UTrie2 *trie, UChar32 c)
138 UTrie2 *trie; local
240 UTrie2 *trie; local
438 UTrie2Header trie; local
    [all...]
ucnvsel.cpp 25 * a trie is built when you call ucnvsel_open() that
51 UTrie2 *trie; // 16 bit trie containing offsets into pv member in struct:UConverterSelector
141 result->trie = upvec_compactToUTrie2WithRowIndexes(upvec, status);
240 utrie2_close(sel->trie);
260 UCNVSEL_INDEX_TRIE_SIZE, // trie size in bytes
297 int32_t serializedTrieSize = utrie2_serialize(sel->trie, NULL, 0, status);
338 utrie2_serialize(sel->trie, p, serializedTrieSize, status);
567 // trie
568 sel->trie = utrie2_openFromSerialized(UTRIE2_16_VALUE_BITS
    [all...]
utrie.cpp 18 * This is a common implementation of a "folded" trie.
46 /* Building a trie ----------------------------------------------------------*/
53 UNewTrie *trie; local
63 trie=fillIn;
65 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie));
66 if(trie==NULL) {
70 uprv_memset(trie, 0, sizeof(UNewTrie));
71 trie->isAllocated= (UBool)(fillIn==NULL);
74 trie->data=aliasData;
75 trie->isDataAllocated=FALSE
117 UNewTrie *trie; local
    [all...]
ucase.cpp 41 UTrie2 trie; member in struct:UCaseProps
72 /* add the start code point of each same-value range of the trie */
73 utrie2_enum(&csp->trie, NULL, _enumPropertyStartsRange, sa);
137 uint16_t props=UTRIE2_GET16(&csp->trie, c);
154 uint16_t props=UTRIE2_GET16(&csp->trie, c);
171 uint16_t props=UTRIE2_GET16(&csp->trie, c);
232 props=UTRIE2_GET16(&csp->trie, c);
434 uint16_t props=UTRIE2_GET16(&csp->trie, c);
441 uint16_t props=UTRIE2_GET16(&csp->trie, c);
448 uint16_t props=UTRIE2_GET16(&csp->trie, c)
    [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();
UBiDiProps.java 59 // read the trie
60 trie=Trie2_16.createFromSerialized(bytes);
62 int trieLength=trie.getSerializedLength();
64 throw new IOException(DATA_FILE_NAME+": not enough bytes for the trie");
66 // skip padding after trie bytes
102 /* add the start code point of each same-value range of the trie */
103 Iterator<Trie2.Range> trieIterator=trie.iterator();
171 return getClassFromProps(trie.get(c));
175 return getFlagFromProps(trie.get(c), IS_MIRRORED_SHIFT);
208 int props=trie.get(c)
259 private Trie2_16 trie; field in class:UBiDiProps
    [all...]
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/
TrieTest.java 18 import com.ibm.icu.impl.Trie;
25 * Testing class for Trie. Tests here will be simple, since both CharTrie and
112 implements Trie.DataManipulate
122 public _testEnumValue(Trie data)
133 private void _testTrieIteration(IntTrie trie, CheckRange checkRanges[],
155 int value = trie.getCodePointValue(c);
175 value = trie.getLeadValue(lead);
176 value = trie.getTrailValue(value, trail);
177 if (value != trie.getSurrogateValue(lead, trail)
214 errln("setting values into a trie failed")
235 IntTrie trie = newTrie.serialize(new _testFoldedValue(newTrie), local
480 CharTrie trie; local
505 IntTrie trie; local
    [all...]
  /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);
  /external/icu/android_icu4j/src/main/java/android/icu/util/
Currency.java 64 // Cache to save currency name trie
692 TextTrieMap<CurrencyStringInfo> trie = trieVec.get(1); local
707 trie.put(name, new CurrencyStringInfo(isoCode, name));
737 // As the trie is traversed, handlePrefixMatch is called at each node. matchLength is the
739 // that key. matchLength increases with each call as trie is traversed.
743 // Since the best match criteria is only based on length of key in trie and since all the
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
Currency.java 64 // Cache to save currency name trie
718 TextTrieMap<CurrencyStringInfo> trie = trieVec.get(1); local
733 trie.put(name, new CurrencyStringInfo(isoCode, name));
763 // As the trie is traversed, handlePrefixMatch is called at each node. matchLength is the
765 // that key. matchLength increases with each call as trie is traversed.
769 // Since the best match criteria is only based on length of key in trie and since all the
    [all...]
  /external/icu/icu4c/source/test/perf/dicttrieperf/
dicttrieperf.cpp 266 BytesTrie trie(nameTrieBytes);
267 if(USTRINGTRIE_HAS_VALUE(trie.next(s, -1))) {
268 return trie.getValue();
343 // Note: CompactTrieDictionary::matches() is part of its trie implementation,
346 // check the trie state each time and load/store state in the object.
349 ucharsTrieMatches(UCharsTrie &trie,
361 UStringTrieResult result=trie.first(c);
390 result=trie.next(c);
409 : DictLookup(perfTest), trie(NULL) {
424 trie=builder->build(USTRINGTRIE_BUILD_SMALL, errorCode)
434 UCharsTrie *trie; member in class:UCharsTrieDictLookup
543 BytesTrie *trie; member in class:BytesTrieDictLookup
    [all...]
  /cts/common/host-side/tradefed/src/com/android/compatibility/common/tradefed/command/
CompatibilityConsole.java 87 protected void setCustomCommands(RegexTrie<Runnable> trie, List<String> genericHelp,
96 trie.put(new Runnable() {
102 trie.put(new Runnable() {
108 trie.put(new Runnable() {
114 trie.put(new Runnable() {
120 trie.put(new ArgRunnable<CaptureList>() {
133 trie.put(new ArgRunnable<CaptureList>() {
144 trie.put(new ArgRunnable<CaptureList>() {
150 trie.put(new Runnable() {
  /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...]

Completed in 865 milliseconds

12 3