HomeSort by relevance Sort by last modified time
    Searched refs:unitIndex (Results 1 - 25 of 29) sorted by null

1 2

  /external/icu/icu4c/source/common/unicode/
ucharstriebuilder.h 136 virtual UChar getElementUnit(int32_t i, int32_t unitIndex) const;
139 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const;
141 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const;
142 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const;
143 virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, UChar unit) const;
160 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
166 virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length);
stringtriebuilder.h 88 int32_t writeNode(int32_t start, int32_t limit, int32_t unitIndex);
90 int32_t writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length);
97 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
99 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
106 virtual UChar getElementUnit(int32_t i, int32_t unitIndex) const = 0;
113 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const = 0;
115 // Number of different units at unitIndex.
117 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const = 0;
119 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const = 0;
121 virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, UChar unit) const = 0
    [all...]
  /external/icu/icu4c/source/common/
stringtriebuilder.cpp 83 // have a common prefix of length unitIndex.
85 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) {
89 if(unitIndex==getElementStringLength(start)) {
97 // Now all [start..limit[ strings are longer than unitIndex.
98 int32_t minUnit=getElementUnit(start, unitIndex);
99 int32_t maxUnit=getElementUnit(limit-1, unitIndex);
101 // Linear-match node: All strings have the same character at unitIndex.
102 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex);
105 int32_t length=lastUnitIndex-unitIndex;
113 writeElementUnits(start, unitIndex, length)
    [all...]
ucharstriebuilder.cpp 233 UCharsTrieBuilder::getElementUnit(int32_t i, int32_t unitIndex) const {
234 return elements[i].charAt(unitIndex, strings);
243 UCharsTrieBuilder::getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const {
247 while(++unitIndex<minStringLength &&
248 firstElement.charAt(unitIndex, strings)==
249 lastElement.charAt(unitIndex, strings)) {}
250 return unitIndex;
254 UCharsTrieBuilder::countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const {
255 int32_t length=0; // Number of different units at unitIndex.
258 UChar unit=elements[i++].charAt(unitIndex, strings)
    [all...]
  /external/icu/icu4c/source/tools/makeconv/
gencnvex.c 387 * the same prefix of unitIndex length, and therefore all of these sequences
388 * are at least unitIndex+1 long.
396 * that occur at unitIndex.
399 * subsections, each corresponding to one unit value at unitIndex.
402 * >0: if there is one mapping with an input unit sequence of unitIndex+1
410 int32_t start, int32_t limit, int32_t unitIndex,
427 low=bytes[unitIndex];
434 high=bytes[unitIndex];
444 if(count<0x100 && (unitIndex==0 || uniqueCount>=(3*count)/4)) {
474 high=bytes[unitIndex];
    [all...]
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/
TimeUnitTest.java 241 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) {
243 timeUnitAmount = new TimeUnitAmount(numbers[numIndex], units[unitIndex]);
250 + ", units: " + units[unitIndex]
MeasureUnitTest.java     [all...]
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
TimeUnitTest.java 237 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) {
239 timeUnitAmount = new TimeUnitAmount(numbers[numIndex], units[unitIndex]);
246 + ", units: " + units[unitIndex]
MeasureUnitTest.java     [all...]
  /external/icu/icu4c/source/test/intltest/
tufmtts.cpp 383 for ( unsigned int unitIndex = 0;
384 unitIndex < sizeof(tunits)/sizeof(tunits[0]);
385 ++unitIndex ) {
387 TimeUnitAmount *tamt = new TimeUnitAmount(numbers[numberIndex], tunits[unitIndex], status);
391 std::cout << "Failed to get TimeUnitAmount for " << tunits[unitIndex] << "\n";
426 if (!assertEquals("formatted time string is not expected, locale: " + UnicodeString(locales[locIndex]) + " style: " + (int)styles[styleIndex] + " units: " + (int)tunits[unitIndex], expected[counter], str)) {
measfmttest.cpp     [all...]
  /external/icu/icu4c/source/i18n/
measfmt.cpp 228 &outer.cacheData.patterns[outer.unitIndex][outer.width][0];
268 outer.unitIndex = MeasureUnit::internalGetIndexForTypeAndSubtype(outer.type, key);
269 if (outer.unitIndex >= 0) {
322 width(UMEASFMT_WIDTH_COUNT), type(NULL), unitIndex(0) {}
393 int32_t unitIndex;
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.jdt.core_3.6.2.v_A76_R36x.jar 
  /prebuilts/devtools/tools/lib/
ecj-4.4.jar 
  /prebuilts/sdk/tools/jacks/
jack-3.36.CANDIDATE.jar 
jack-4.7.BETA.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/jdt/core/compiler/ecj/4.2.2/
ecj-4.2.2.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/jdt/core/compiler/ecj/4.4/
ecj-4.4.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/jdt/core/compiler/ecj/4.4.2/
ecj-4.4.2.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/jdt/core/compiler/ecj/4.5.1/
ecj-4.5.1.jar 
  /prebuilts/tools/common/offline-m2/org/eclipse/jdt/core/compiler/ecj/4.4/
ecj-4.4.jar 
  /prebuilts/tools/common/offline-m2/org/eclipse/jdt/core/compiler/ecj/4.4.2/
ecj-4.4.2.jar 
  /prebuilts/tools/common/offline-m2/org/eclipse/jdt/core/compiler/ecj/4.5.1/
ecj-4.5.1.jar 
  /prebuilts/misc/common/ecj/
ecj.jar 
  /external/icu/tools/srcgen/currysrc/libs/
org.eclipse.jdt.core_3.11.0.v20150602-1242.jar 

Completed in 2893 milliseconds

1 2