• Home
  • Raw
  • Download

Lines Matching refs:unitIndex

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
142 int32_t i=skipElementsBySomeUnits(start, unitIndex, length/2); in writeBranchSubNode()
144 middleUnits[ltLength]=getElementUnit(i, unitIndex); // middle unit in writeBranchSubNode()
145 lessThan[ltLength]=writeBranchSubNode(start, i, unitIndex, length/2); in writeBranchSubNode()
157 UChar unit=getElementUnit(i++, unitIndex); in writeBranchSubNode()
158 i=indexOfElementWithNextUnit(i, unitIndex, unit); in writeBranchSubNode()
159 isFinal[unitNumber]= start==i-1 && unitIndex+1==getElementStringLength(start); in writeBranchSubNode()
173 … jumpTargets[unitNumber]=writeNode(starts[unitNumber], starts[unitNumber+1], unitIndex+1); in writeBranchSubNode()
179 writeNode(start, limit, unitIndex+1); in writeBranchSubNode()
180 int32_t offset=write(getElementUnit(start, unitIndex)); in writeBranchSubNode()
193 offset=write(getElementUnit(start, unitIndex)); in writeBranchSubNode()
208 StringTrieBuilder::makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode)… in makeNode() argument
214 if(unitIndex==getElementStringLength(start)) { in makeNode()
224 int32_t minUnit=getElementUnit(start, unitIndex); in makeNode()
225 int32_t maxUnit=getElementUnit(limit-1, unitIndex); in makeNode()
228 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex); in makeNode()
231 int32_t length=lastUnitIndex-unitIndex; in makeNode()
239 node=createLinearMatchNode(start, unitIndex, length, nextNode); in makeNode()
242 int32_t length=countElementUnits(start, limit, unitIndex); in makeNode()
244 Node *subNode=makeBranchSubNode(start, limit, unitIndex, length, errorCode); in makeNode()
260 StringTrieBuilder::makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, in makeBranchSubNode() argument
271 int32_t i=skipElementsBySomeUnits(start, unitIndex, length/2); in makeBranchSubNode()
273 middleUnits[ltLength]=getElementUnit(i, unitIndex); // middle unit in makeBranchSubNode()
274 lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode); in makeBranchSubNode()
292 UChar unit=getElementUnit(i++, unitIndex); in makeBranchSubNode()
293 i=indexOfElementWithNextUnit(i, unitIndex, unit); in makeBranchSubNode()
294 if(start==i-1 && unitIndex+1==getElementStringLength(start)) { in makeBranchSubNode()
297 listNode->add(unit, makeNode(start, i, unitIndex+1, errorCode)); in makeBranchSubNode()
302 UChar unit=getElementUnit(start, unitIndex); in makeBranchSubNode()
303 if(start==limit-1 && unitIndex+1==getElementStringLength(start)) { in makeBranchSubNode()
306 listNode->add(unit, makeNode(start, limit, unitIndex+1, errorCode)); in makeBranchSubNode()