Home
last modified time | relevance | path

Searched refs:kMinValueLead (Results 1 – 10 of 10) sorted by relevance

/external/icu/icu4c/source/common/
Dbytestrie.cpp75 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? in current()
105 U_ASSERT(node>=kMinValueLead); in branchNext()
132 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
143 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
156 } else if(node<kMinValueLead) { in nextImpl()
162 return (length<0 && (node=*pos)>=kMinValueLead) ? in nextImpl()
175 U_ASSERT(*pos<kMinValueLead); in nextImpl()
198 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
229 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
249 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
[all …]
Ducharstrie.cpp38 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? in current()
105 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
116 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
129 } else if(node<kMinValueLead) { in nextImpl()
135 return (length<0 && (node=*pos)>=kMinValueLead) ? in nextImpl()
167 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
199 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
219 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
262 } else if(node<kMinValueLead) { in next()
337 } else if(node<kMinValueLead) { in findUniqueValue()
[all …]
Ducharstrieiterator.cpp134 if(node>=kMinValueLead) { in next()
Dbytestrieiterator.cpp135 if(node>=kMinValueLead) { in next()
/external/icu/android_icu4j/src/main/java/android/icu/util/
DBytesTrie.java188 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in current()
229 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in next()
273 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ? in next()
306 } else if(node<kMinValueLead) { in next()
324 assert((bytes_[pos]&0xff)<kMinValueLead); in next()
341 assert(leadByte>=kMinValueLead);
380 if(node>=kMinValueLead) { in getNextBytes()
386 assert(node<kMinValueLead); in getNextBytes()
582 if(node>=kMinValueLead) { in next()
700 assert(leadByte>=kMinValueLead); in skipValue()
[all …]
DCharsTrie.java134 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()
182 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
240 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
274 } else if(node<kMinValueLead) { in next()
308 assert(leadUnit>=kMinValueLead); in getValue()
348 if(node>=kMinValueLead) { in getNextChars()
506 if(node>=kMinValueLead) { in next()
657 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()
669 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()
751 result= node>=kMinValueLead ? valueResults_[node>>15] : Result.NO_VALUE; in branchNext()
[all …]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
DBytesTrie.java201 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in current()
244 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in next()
289 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ? in next()
322 } else if(node<kMinValueLead) { in next()
340 assert((bytes_[pos]&0xff)<kMinValueLead); in next()
358 assert(leadByte>=kMinValueLead);
399 if(node>=kMinValueLead) { in getNextBytes()
405 assert(node<kMinValueLead); in getNextBytes()
612 if(node>=kMinValueLead) { in next()
731 assert(leadByte>=kMinValueLead); in skipValue()
[all …]
DCharsTrie.java140 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()
191 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
251 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
285 } else if(node<kMinValueLead) { in next()
320 assert(leadUnit>=kMinValueLead); in getValue()
362 if(node>=kMinValueLead) { in getNextChars()
528 if(node>=kMinValueLead) { in next()
680 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()
692 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()
774 result= node>=kMinValueLead ? valueResults_[node>>15] : Result.NO_VALUE; in branchNext()
[all …]
/external/icu/icu4c/source/common/unicode/
Ducharstrie.h534 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 variable
535 static const int32_t kNodeTypeMask=kMinValueLead-1; // 0x003f
550 …static const int32_t kMinTwoUnitNodeValueLead=kMinValueLead+((kMaxOneUnitNodeValue+1)<<6); // 0x4…
Dbytestrie.h476 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 variable
481 static const int32_t kMinOneByteValueLead=kMinValueLead/2; // 0x10