/external/icu/icu4c/source/common/ |
D | stringtriebuilder.cpp | 87 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { in writeNode() argument 91 if(unitIndex==getElementStringLength(start)) { in writeNode() 100 int32_t minUnit=getElementUnit(start, unitIndex); in writeNode() 101 int32_t maxUnit=getElementUnit(limit-1, unitIndex); in writeNode() 104 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex); in writeNode() 107 int32_t length=lastUnitIndex-unitIndex; in writeNode() 115 writeElementUnits(start, unitIndex, length); in writeNode() 119 int32_t length=countElementUnits(start, limit, unitIndex); in writeNode() 121 writeBranchSubNode(start, limit, unitIndex, length); in writeNode() 135 StringTrieBuilder::writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t leng… in writeBranchSubNode() argument [all …]
|
D | ucharstriebuilder.cpp | 235 UCharsTrieBuilder::getElementUnit(int32_t i, int32_t unitIndex) const { in getElementUnit() 236 return elements[i].charAt(unitIndex, strings); in getElementUnit() 245 UCharsTrieBuilder::getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const { in getLimitOfLinearMatch() 249 while(++unitIndex<minStringLength && in getLimitOfLinearMatch() 250 firstElement.charAt(unitIndex, strings)== in getLimitOfLinearMatch() 251 lastElement.charAt(unitIndex, strings)) {} in getLimitOfLinearMatch() 252 return unitIndex; in getLimitOfLinearMatch() 256 UCharsTrieBuilder::countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const { in countElementUnits() 260 UChar unit=elements[i++].charAt(unitIndex, strings); in countElementUnits() 261 while(i<limit && unit==elements[i].charAt(unitIndex, strings)) { in countElementUnits() [all …]
|
/external/icu/libicu/cts_headers/unicode/ |
D | ucharstriebuilder.h | 142 virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const; 145 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const; 147 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const; 148 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const; 149 virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const; 166 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, 172 virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length);
|
D | stringtriebuilder.h | 95 int32_t writeNode(int32_t start, int32_t limit, int32_t unitIndex); 97 int32_t writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length); 104 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode); 106 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, 113 virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const = 0; 120 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const = 0; 124 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const = 0; 126 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const = 0; 128 … virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const = 0; 407 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, [all …]
|
/external/icu/icu4c/source/common/unicode/ |
D | ucharstriebuilder.h | 142 virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const; 145 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const; 147 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const; 148 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const; 149 virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const; 166 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, 172 virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length);
|
D | stringtriebuilder.h | 95 int32_t writeNode(int32_t start, int32_t limit, int32_t unitIndex); 97 int32_t writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length); 104 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode); 106 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, 113 virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const = 0; 120 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const = 0; 124 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const = 0; 126 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const = 0; 128 … virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const = 0; 407 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, [all …]
|
/external/icu/icu4c/source/tools/makeconv/ |
D | gencnvex.c | 417 int32_t start, int32_t limit, int32_t unitIndex, in generateToUTable() argument 434 low=bytes[unitIndex]; in generateToUTable() 441 high=bytes[unitIndex]; in generateToUTable() 451 if(count<0x100 && (unitIndex==0 || uniqueCount>=(3*count)/4)) { in generateToUTable() 481 high=bytes[unitIndex]; in generateToUTable() 517 if(m->bLen==unitIndex+1) { in generateToUTable() 521 if(subStart<subLimit && mappings[map[subStart]].bLen==unitIndex+1) { in generateToUTable() 540 if(!generateToUTable(extData, table, subStart, subLimit, unitIndex+1, defaultValue)) { in generateToUTable() 716 int32_t start, int32_t limit, int32_t unitIndex, in generateFromUTable() argument 734 low=uchars[unitIndex]; in generateFromUTable() [all …]
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
D | TimeUnitTest.java | 248 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) { in TestGreek() 250 timeUnitAmount = new TimeUnitAmount(numbers[numIndex], units[unitIndex]); in TestGreek() 257 + ", units: " + units[unitIndex] in TestGreek()
|
D | MeasureUnitTest.java | 2220 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) { in TestGreek() 2221 Measure m = new Measure(numbers[numIndex], units[unitIndex]); in TestGreek() 2227 + ", units: " + units[unitIndex] in TestGreek()
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
D | TimeUnitTest.java | 251 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) { in TestGreek() 253 timeUnitAmount = new TimeUnitAmount(numbers[numIndex], units[unitIndex]); in TestGreek() 260 + ", units: " + units[unitIndex] in TestGreek()
|
D | MeasureUnitTest.java | 2223 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) { in TestGreek() 2224 Measure m = new Measure(numbers[numIndex], units[unitIndex]); in TestGreek() 2230 + ", units: " + units[unitIndex] in TestGreek()
|
/external/icu/icu4c/source/test/intltest/ |
D | tufmtts.cpp | 385 for ( unsigned int unitIndex = 0; in testGreekWithFallback() local 386 unitIndex < UPRV_LENGTHOF(tunits); in testGreekWithFallback() 387 ++unitIndex ) { in testGreekWithFallback() 389 …alPointer<TimeUnitAmount>tamt(new TimeUnitAmount(numbers[numberIndex], tunits[unitIndex], status)); in testGreekWithFallback() 393 … std::cout << "Failed to get TimeUnitAmount for " << tunits[unitIndex] << "\n"; in testGreekWithFallback() 427 …dex]) + " style: " + (int)styles[styleIndex] + " units: " + (int)tunits[unitIndex], expected[count… in testGreekWithFallback()
|
D | measfmttest.cpp | 2890 for ( int32_t unitIndex = 0; unitIndex < UPRV_LENGTHOF(units); ++unitIndex ) { in TestGreek() local 2891 Measure measure(numbers[numIndex], new MeasureUnit(units[unitIndex]), status); in TestGreek()
|