Home
last modified time | relevance | path

Searched refs:unitIndex (Results 1 - 24 of 24) sorted by relevance

/third_party/icu/icu4c/source/common/
H A Dstringtriebuilder.cpp85 // have a common prefix of length unitIndex.
87 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { in writeNode() argument
91 if(unitIndex==getElementStringLength(start)) { in writeNode()
99 // Now all [start..limit[ strings are longer than unitIndex. in writeNode()
100 int32_t minUnit=getElementUnit(start, unitIndex); in writeNode()
101 int32_t maxUnit=getElementUnit(limit-1, unitIndex); in writeNode()
103 // Linear-match node: All strings have the same character at 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, lengt in writeNode()
135 writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length) writeBranchSubNode() argument
208 makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) makeNode() argument
260 makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length, UErrorCode &errorCode) makeBranchSubNode() argument
[all...]
H A Ducharstriebuilder.cpp235 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()
257 int32_t length=0; // Number of different units at unitIndex. in countElementUnits()
260 UChar unit=elements[i++].charAt(unitIndex, string in countElementUnits()
270 skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const skipElementsBySomeUnits() argument
281 indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, UChar unit) const indexOfElementWithNextUnit() argument
314 createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, Node *nextNode) const createLinearMatchNode() argument
370 writeElementUnits(int32_t i, int32_t unitIndex, int32_t length) writeElementUnits() argument
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dstringtriebuilder.cpp85 // have a common prefix of length unitIndex.
87 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { in writeNode() argument
91 if(unitIndex==getElementStringLength(start)) { in writeNode()
99 // Now all [start..limit[ strings are longer than unitIndex. in writeNode()
100 int32_t minUnit=getElementUnit(start, unitIndex); in writeNode()
101 int32_t maxUnit=getElementUnit(limit-1, unitIndex); in writeNode()
103 // Linear-match node: All strings have the same character at 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, lengt in writeNode()
135 writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length) writeBranchSubNode() argument
208 makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) makeNode() argument
260 makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length, UErrorCode &errorCode) makeBranchSubNode() argument
[all...]
H A Ducharstriebuilder.cpp235 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()
257 int32_t length=0; // Number of different units at unitIndex. in countElementUnits()
260 char16_t unit=elements[i++].charAt(unitIndex, string in countElementUnits()
270 skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const skipElementsBySomeUnits() argument
281 indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const indexOfElementWithNextUnit() argument
314 createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, Node *nextNode) const createLinearMatchNode() argument
370 writeElementUnits(int32_t i, int32_t unitIndex, int32_t length) writeElementUnits() argument
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dstringtriebuilder.cpp85 // have a common prefix of length unitIndex.
87 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { in writeNode() argument
91 if(unitIndex==getElementStringLength(start)) { in writeNode()
99 // Now all [start..limit[ strings are longer than unitIndex. in writeNode()
100 int32_t minUnit=getElementUnit(start, unitIndex); in writeNode()
101 int32_t maxUnit=getElementUnit(limit-1, unitIndex); in writeNode()
103 // Linear-match node: All strings have the same character at 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, lengt in writeNode()
135 writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length) writeBranchSubNode() argument
208 makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) makeNode() argument
260 makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length, UErrorCode &errorCode) makeBranchSubNode() argument
[all...]
H A Ducharstriebuilder.cpp235 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()
257 int32_t length=0; // Number of different units at unitIndex. in countElementUnits()
260 UChar unit=elements[i++].charAt(unitIndex, string in countElementUnits()
270 skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const skipElementsBySomeUnits() argument
281 indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, UChar unit) const indexOfElementWithNextUnit() argument
314 createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, Node *nextNode) const createLinearMatchNode() argument
370 writeElementUnits(int32_t i, int32_t unitIndex, int32_t length) writeElementUnits() argument
[all...]
/third_party/icu/icu4c/source/common/unicode/
H A Ducharstriebuilder.h142 virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const override;
145 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const override;
147 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const override;
148 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const override;
149 virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const override;
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) override;
H A Dstringtriebuilder.h95 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;
122 // Number of different units at unitIndex.
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_
[all...]
/third_party/node/deps/icu-small/source/common/unicode/
H A Ducharstriebuilder.h142 virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const override;
145 virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const override;
147 virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const override;
148 virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const override;
149 virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const override;
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) override;
H A Dstringtriebuilder.h95 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;
122 // Number of different units at unitIndex.
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_
[all...]
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Ducharstriebuilder.h142 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);
H A Dstringtriebuilder.h95 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;
122 // Number of different units at unitIndex.
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_
[all...]
/third_party/icu/icu4c/source/tools/makeconv/
H A Dgencnvex.c395 * the same prefix of unitIndex length, and therefore all of these sequences
396 * are at least unitIndex+1 long.
404 * that occur at unitIndex.
407 * subsections, each corresponding to one unit value at unitIndex.
410 * >0: if there is one mapping with an input unit sequence of unitIndex+1
418 int32_t start, int32_t limit, int32_t unitIndex, in generateToUTable()
435 low=bytes[unitIndex]; in generateToUTable()
442 high=bytes[unitIndex]; in generateToUTable()
452 if(count<0x100 && (unitIndex==0 || uniqueCount>=(3*count)/4)) { in generateToUTable()
482 high=bytes[unitIndex]; in generateToUTable()
417 generateToUTable(CnvExtData *extData, UCMTable *table, int32_t start, int32_t limit, int32_t unitIndex, uint32_t defaultValue) generateToUTable() argument
716 generateFromUTable(CnvExtData *extData, UCMTable *table, int32_t start, int32_t limit, int32_t unitIndex, uint32_t defaultValue) generateFromUTable() argument
[all...]
/third_party/skia/third_party/externals/icu/source/tools/makeconv/
H A Dgencnvex.c394 * the same prefix of unitIndex length, and therefore all of these sequences
395 * are at least unitIndex+1 long.
403 * that occur at unitIndex.
406 * subsections, each corresponding to one unit value at unitIndex.
409 * >0: if there is one mapping with an input unit sequence of unitIndex+1
417 int32_t start, int32_t limit, int32_t unitIndex, in generateToUTable()
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()
416 generateToUTable(CnvExtData *extData, UCMTable *table, int32_t start, int32_t limit, int32_t unitIndex, uint32_t defaultValue) generateToUTable() argument
715 generateFromUTable(CnvExtData *extData, UCMTable *table, int32_t start, int32_t limit, int32_t unitIndex, uint32_t defaultValue) generateFromUTable() argument
[all...]
/third_party/typescript/tests/baselines/reference/
H A DparserRealSource9.js149 if ((this.checker.units) && (symbol.unitIndex >= 0) && (symbol.unitIndex < this.checker.units.length)) {
150 this.checker.locationInfo = this.checker.units[symbol.unitIndex];
350 if ((this.checker.units) && (symbol.unitIndex >= 0) && (symbol.unitIndex < this.checker.units.length)) {
351 this.checker.locationInfo = this.checker.units[symbol.unitIndex];
H A DparserRealSource7.js43 context.checker.locationInfo.unitIndex, true, field);
171 context.checker.locationInfo.unitIndex, modType);
218 context.checker.locationInfo.unitIndex, modType);
352 context.checker.locationInfo.unitIndex, classType);
436 context.checker.locationInfo.unitIndex,
482 context.checker.locationInfo.unitIndex,
535 context.checker.locationInfo.unitIndex,
606 funcDecl.unitIndex = context.checker.locationInfo.unitIndex;
875 var fieldSymbol = new FieldSymbol("prototype", ast.minChar, context.checker.locationInfo.unitIndex, tru
[all...]
H A DparserRealSource8.js164 var withSymbol = new WithSymbol(withStmt.minChar, context.typeFlow.checker.locationInfo.unitIndex, withType);
320 funcDecl.unitIndex = context.typeFlow.checker.locationInfo.unitIndex;
609 var withSymbol = new WithSymbol(withStmt.minChar, context.typeFlow.checker.locationInfo.unitIndex, withType);
743 funcDecl.unitIndex = context.typeFlow.checker.locationInfo.unitIndex;
H A DparserRealSource11.js971 public unitIndex = -1;
1105 constructor (public filename: string, public lineMap: number[], public unitIndex) { }
2267 typeFlow.checker.locationInfo.unitIndex,
3326 _this.unitIndex = -1;
3438 function LocationInfo(filename, lineMap, unitIndex) {
3441 this.unitIndex = unitIndex;
4568 var varSym = new VariableSymbol(this.param.id.text, this.param.minChar, typeFlow.checker.locationInfo.unitIndex, exceptVar);
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/format/
H A DTimeUnitTest.java251 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()
H A DMeasureUnitTest.java2020 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) { in TestGreek()
2021 Measure m = new Measure(numbers[numIndex], units[unitIndex]); in TestGreek()
2027 + ", units: " + units[unitIndex] in TestGreek()
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
H A DTimeUnitTest.java248 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()
H A DMeasureUnitTest.java2810 for ( int unitIndex = 0; unitIndex < units.length; ++unitIndex ) { in TestGreek()
2811 Measure m = new Measure(numbers[numIndex], units[unitIndex]); in TestGreek()
2817 + ", units: " + units[unitIndex] in TestGreek()
/third_party/icu/icu4c/source/test/intltest/
H A Dtufmtts.cpp387 for ( unsigned int unitIndex = 0; in testGreekWithFallback()
388 unitIndex < UPRV_LENGTHOF(tunits); in testGreekWithFallback()
389 ++unitIndex ) { in testGreekWithFallback()
391 LocalPointer<TimeUnitAmount>tamt(new TimeUnitAmount(numbers[numberIndex], tunits[unitIndex], status)); in testGreekWithFallback()
395 std::cout << "Failed to get TimeUnitAmount for " << tunits[unitIndex] << "\n"; in testGreekWithFallback()
429 if (!assertEquals("formatted time string is not expected, locale: " + UnicodeString(locales[locIndex]) + " style: " + (int)styles[styleIndex] + " units: " + (int)tunits[unitIndex], expected[counter], str)) { in testGreekWithFallback()
H A Dmeasfmttest.cpp4047 for ( int32_t unitIndex = 0; unitIndex < UPRV_LENGTHOF(units); ++unitIndex ) { in TestGreek()
4048 Measure measure(numbers[numIndex], new MeasureUnit(units[unitIndex]), status); in TestGreek()

Completed in 39 milliseconds