Home
last modified time | relevance | path

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

12

/third_party/skia/third_party/externals/icu/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()
/third_party/flutter/skia/third_party/externals/icu/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()
/third_party/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()
/third_party/node/deps/icu-small/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()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
DBytesTrie.java233 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in current()
274 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? in next()
318 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ? in next()
351 } else if(node<kMinValueLead) { in next()
369 assert((bytes_[pos]&0xff)<kMinValueLead); in next()
386 assert(leadByte>=kMinValueLead);
425 if(node>=kMinValueLead) { in getNextBytes()
431 assert(node<kMinValueLead); in getNextBytes()
627 if(node>=kMinValueLead) { in next()
745 assert(leadByte>=kMinValueLead); in skipValue()
[all …]
DCharsTrie.java179 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()
227 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
285 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()
319 } else if(node<kMinValueLead) { in next()
353 assert(leadUnit>=kMinValueLead); in getValue()
393 if(node>=kMinValueLead) { in getNextChars()
551 if(node>=kMinValueLead) { in next()
702 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()
714 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()
796 result= node>=kMinValueLead ? valueResults_[node>>15] : Result.NO_VALUE; in branchNext()
[all …]
/third_party/flutter/skia/third_party/externals/icu/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
/third_party/node/deps/icu-small/source/common/unicode/
Ducharstrie.h570 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 variable
571 static const int32_t kNodeTypeMask=kMinValueLead-1; // 0x003f
586 …static const int32_t kMinTwoUnitNodeValueLead=kMinValueLead+((kMaxOneUnitNodeValue+1)<<6); // 0x4…
Dbytestrie.h515 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 variable
520 static const int32_t kMinOneByteValueLead=kMinValueLead/2; // 0x10
/third_party/icu/icu4c/source/common/unicode/
Ducharstrie.h572 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 variable
573 static const int32_t kNodeTypeMask=kMinValueLead-1; // 0x003f
588 …static const int32_t kMinTwoUnitNodeValueLead=kMinValueLead+((kMaxOneUnitNodeValue+1)<<6); // 0x4…
Dbytestrie.h514 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 variable
519 static const int32_t kMinOneByteValueLead=kMinValueLead/2; // 0x10
/third_party/skia/third_party/externals/icu/source/common/unicode/
Ducharstrie.h570 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 variable
571 static const int32_t kNodeTypeMask=kMinValueLead-1; // 0x003f
586 …static const int32_t kMinTwoUnitNodeValueLead=kMinValueLead+((kMaxOneUnitNodeValue+1)<<6); // 0x4…
Dbytestrie.h515 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 variable
520 static const int32_t kMinOneByteValueLead=kMinValueLead/2; // 0x10

12