Home
last modified time | relevance | path

Searched refs:unitIndex (Results 1 – 13 of 13) sorted by relevance

/external/chromium_org/third_party/icu/source/common/
Dstringtriebuilder.cpp85 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { in writeNode() argument
89 if(unitIndex==getElementStringLength(start)) { in writeNode()
98 int32_t minUnit=getElementUnit(start, unitIndex); in writeNode()
99 int32_t maxUnit=getElementUnit(limit-1, unitIndex); in writeNode()
102 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex); in writeNode()
105 int32_t length=lastUnitIndex-unitIndex; in writeNode()
113 writeElementUnits(start, unitIndex, length); in writeNode()
117 int32_t length=countElementUnits(start, limit, unitIndex); in writeNode()
119 writeBranchSubNode(start, limit, unitIndex, length); in writeNode()
133 StringTrieBuilder::writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t leng… in writeBranchSubNode() argument
[all …]
Ducharstriebuilder.cpp233 UCharsTrieBuilder::getElementUnit(int32_t i, int32_t unitIndex) const { in getElementUnit()
234 return elements[i].charAt(unitIndex, strings); in getElementUnit()
243 UCharsTrieBuilder::getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const { in getLimitOfLinearMatch()
247 while(++unitIndex<minStringLength && in getLimitOfLinearMatch()
248 firstElement.charAt(unitIndex, strings)== in getLimitOfLinearMatch()
249 lastElement.charAt(unitIndex, strings)) {} in getLimitOfLinearMatch()
250 return unitIndex; in getLimitOfLinearMatch()
254 UCharsTrieBuilder::countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const { in countElementUnits()
258 UChar unit=elements[i++].charAt(unitIndex, strings); in countElementUnits()
259 while(i<limit && unit==elements[i].charAt(unitIndex, strings)) { in countElementUnits()
[all …]
/external/icu/icu4c/source/common/
Dstringtriebuilder.cpp85 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { in writeNode() argument
89 if(unitIndex==getElementStringLength(start)) { in writeNode()
98 int32_t minUnit=getElementUnit(start, unitIndex); in writeNode()
99 int32_t maxUnit=getElementUnit(limit-1, unitIndex); in writeNode()
102 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex); in writeNode()
105 int32_t length=lastUnitIndex-unitIndex; in writeNode()
113 writeElementUnits(start, unitIndex, length); in writeNode()
117 int32_t length=countElementUnits(start, limit, unitIndex); in writeNode()
119 writeBranchSubNode(start, limit, unitIndex, length); in writeNode()
133 StringTrieBuilder::writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t leng… in writeBranchSubNode() argument
[all …]
Ducharstriebuilder.cpp233 UCharsTrieBuilder::getElementUnit(int32_t i, int32_t unitIndex) const { in getElementUnit()
234 return elements[i].charAt(unitIndex, strings); in getElementUnit()
243 UCharsTrieBuilder::getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const { in getLimitOfLinearMatch()
247 while(++unitIndex<minStringLength && in getLimitOfLinearMatch()
248 firstElement.charAt(unitIndex, strings)== in getLimitOfLinearMatch()
249 lastElement.charAt(unitIndex, strings)) {} in getLimitOfLinearMatch()
250 return unitIndex; in getLimitOfLinearMatch()
254 UCharsTrieBuilder::countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const { in countElementUnits()
258 UChar unit=elements[i++].charAt(unitIndex, strings); in countElementUnits()
259 while(i<limit && unit==elements[i].charAt(unitIndex, strings)) { in countElementUnits()
[all …]
/external/chromium_org/third_party/icu/source/common/unicode/
Ducharstriebuilder.h136 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;
162 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
168 virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length);
Dstringtriebuilder.h88 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;
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;
383 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
[all …]
/external/icu/icu4c/source/common/unicode/
Ducharstriebuilder.h136 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;
162 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
168 virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length);
Dstringtriebuilder.h88 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;
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;
385 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
[all …]
/external/icu/icu4c/source/tools/makeconv/
Dgencnvex.c413 int32_t start, int32_t limit, int32_t unitIndex, in generateToUTable() argument
430 low=bytes[unitIndex]; in generateToUTable()
437 high=bytes[unitIndex]; in generateToUTable()
447 if(count<0x100 && (unitIndex==0 || uniqueCount>=(3*count)/4)) { in generateToUTable()
477 high=bytes[unitIndex]; in generateToUTable()
513 if(m->bLen==unitIndex+1) { in generateToUTable()
517 if(subStart<subLimit && mappings[map[subStart]].bLen==unitIndex+1) { in generateToUTable()
536 if(!generateToUTable(extData, table, subStart, subLimit, unitIndex+1, defaultValue)) { in generateToUTable()
712 int32_t start, int32_t limit, int32_t unitIndex, in generateFromUTable() argument
730 low=uchars[unitIndex]; in generateFromUTable()
[all …]
/external/chromium_org/third_party/icu/source/tools/makeconv/
Dgencnvex.c413 int32_t start, int32_t limit, int32_t unitIndex, in generateToUTable() argument
430 low=bytes[unitIndex]; in generateToUTable()
437 high=bytes[unitIndex]; in generateToUTable()
447 if(count<0x100 && (unitIndex==0 || uniqueCount>=(3*count)/4)) { in generateToUTable()
477 high=bytes[unitIndex]; in generateToUTable()
513 if(m->bLen==unitIndex+1) { in generateToUTable()
517 if(subStart<subLimit && mappings[map[subStart]].bLen==unitIndex+1) { in generateToUTable()
536 if(!generateToUTable(extData, table, subStart, subLimit, unitIndex+1, defaultValue)) { in generateToUTable()
712 int32_t start, int32_t limit, int32_t unitIndex, in generateFromUTable() argument
730 low=uchars[unitIndex]; in generateFromUTable()
[all …]
/external/chromium_org/third_party/icu/source/test/intltest/
Dtufmtts.cpp282 for ( unsigned int unitIndex = 0; in testGreekWithFallback() local
283 unitIndex < sizeof(tunits)/sizeof(tunits[0]); in testGreekWithFallback()
284 ++unitIndex ) { in testGreekWithFallback()
286 … TimeUnitAmount *tamt = new TimeUnitAmount(numbers[numberIndex], tunits[unitIndex], status); in testGreekWithFallback()
290 … std::cout << "Failed to get TimeUnitAmount for " << tunits[unitIndex] << "\n"; in testGreekWithFallback()
325 …dex]) + " style: " + (int)styles[styleIndex] + " units: " + (int)tunits[unitIndex], expected[count… in testGreekWithFallback()
/external/icu/icu4c/source/test/intltest/
Dtufmtts.cpp332 for ( unsigned int unitIndex = 0; in testGreekWithFallback() local
333 unitIndex < sizeof(tunits)/sizeof(tunits[0]); in testGreekWithFallback()
334 ++unitIndex ) { in testGreekWithFallback()
336 … TimeUnitAmount *tamt = new TimeUnitAmount(numbers[numberIndex], tunits[unitIndex], status); in testGreekWithFallback()
340 … std::cout << "Failed to get TimeUnitAmount for " << tunits[unitIndex] << "\n"; in testGreekWithFallback()
375 …dex]) + " style: " + (int)styles[styleIndex] + " units: " + (int)tunits[unitIndex], expected[count… in testGreekWithFallback()
Dmeasfmttest.cpp605 for ( int32_t unitIndex = 0; unitIndex < LENGTHOF(units); ++unitIndex ) { in TestGreek() local
606 Measure measure(numbers[numIndex], new MeasureUnit(units[unitIndex]), status); in TestGreek()