Home
last modified time | relevance | path

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

/external/icu/icu4c/source/common/
Dbytestrie.cpp73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? in current()
103 U_ASSERT(node>=kMinValueLead); in branchNext()
130 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
141 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
154 } else if(node<kMinValueLead) { in nextImpl()
160 return (length<0 && (node=*pos)>=kMinValueLead) ? in nextImpl()
173 U_ASSERT(*pos<kMinValueLead); in nextImpl()
196 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
227 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
247 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
[all …]
Ducharstrie.cpp36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? in current()
103 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
114 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
127 } else if(node<kMinValueLead) { in nextImpl()
133 return (length<0 && (node=*pos)>=kMinValueLead) ? in nextImpl()
165 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
196 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
216 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
259 } else if(node<kMinValueLead) { in next()
334 } else if(node<kMinValueLead) { in findUniqueValue()
[all …]
Ducharstrieiterator.cpp132 if(node>=kMinValueLead) { in next()
Dbytestrieiterator.cpp133 if(node>=kMinValueLead) { in next()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
DBytesTrie.java199 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in current()
242 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in next()
287 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ? in next()
320 } else if(node<kMinValueLead) { in next()
338 assert((bytes_[pos]&0xff)<kMinValueLead); in next()
356 assert(leadByte>=kMinValueLead);
397 if(node>=kMinValueLead) { in getNextBytes()
403 assert(node<kMinValueLead); in getNextBytes()
607 if(node>=kMinValueLead) { in next()
725 assert(leadByte>=kMinValueLead); in skipValue()
[all …]
DCharsTrie.java138 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()
189 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
249 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
283 } else if(node<kMinValueLead) { in next()
318 assert(leadUnit>=kMinValueLead); in getValue()
360 if(node>=kMinValueLead) { in getNextChars()
523 if(node>=kMinValueLead) { in next()
674 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()
686 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()
768 result= node>=kMinValueLead ? valueResults_[node>>15] : Result.NO_VALUE; in branchNext()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/util/
DBytesTrie.java184 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in current()
225 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in next()
269 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ? in next()
302 } else if(node<kMinValueLead) { in next()
320 assert((bytes_[pos]&0xff)<kMinValueLead); in next()
337 assert(leadByte>=kMinValueLead);
376 if(node>=kMinValueLead) { in getNextBytes()
382 assert(node<kMinValueLead); in getNextBytes()
573 if(node>=kMinValueLead) { in next()
690 assert(leadByte>=kMinValueLead); in skipValue()
[all …]
DCharsTrie.java131 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()
179 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
237 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
271 } else if(node<kMinValueLead) { in next()
305 assert(leadUnit>=kMinValueLead); in getValue()
345 if(node>=kMinValueLead) { in getNextChars()
498 if(node>=kMinValueLead) { in next()
648 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()
660 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()
742 result= node>=kMinValueLead ? valueResults_[node>>15] : Result.NO_VALUE; in branchNext()
[all …]
/external/icu/icu4c/source/common/unicode/
Ducharstrie.h532 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 variable
533 static const int32_t kNodeTypeMask=kMinValueLead-1; // 0x003f
548 …static const int32_t kMinTwoUnitNodeValueLead=kMinValueLead+((kMaxOneUnitNodeValue+1)<<6); // 0x4…
Dbytestrie.h475 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 variable
480 static const int32_t kMinOneByteValueLead=kMinValueLead/2; // 0x10