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

/external/icu/icu4c/source/common/
H A Dbytestrie.cpp73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
103 U_ASSERT(node>=kMinValueLead);
130 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
141 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
154 } else if(node<kMinValueLead) {
160 return (length<0 && (node=*pos)>=kMinValueLead) ?
173 U_ASSERT(*pos<kMinValueLead);
196 return (length<0 && (node=*pos)>=kMinValueLead) ?
227 return (length<0 && (node=*pos)>=kMinValueLead) ?
247 return (length<0 && (node=*pos)>=kMinValueLead)
[all...]
H A Ducharstrie.cpp36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
103 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
114 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
127 } else if(node<kMinValueLead) {
133 return (length<0 && (node=*pos)>=kMinValueLead) ?
165 return (length<0 && (node=*pos)>=kMinValueLead) ?
196 return (length<0 && (node=*pos)>=kMinValueLead) ?
216 return (length<0 && (node=*pos)>=kMinValueLead) ?
259 } else if(node<kMinValueLead) {
334 } else if(node<kMinValueLead) {
[all...]
H A Dbytestrieiterator.cpp133 if(node>=kMinValueLead) {
H A Ducharstrieiterator.cpp132 if(node>=kMinValueLead) {
/external/icu/android_icu4j/src/main/java/android/icu/util/
H A DBytesTrie.java184 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
225 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
269 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ?
302 } else if(node<kMinValueLead) {
320 assert((bytes_[pos]&0xff)<kMinValueLead);
337 assert(leadByte>=kMinValueLead);
376 if(node>=kMinValueLead) {
382 assert(node<kMinValueLead);
573 if(node>=kMinValueLead) {
690 assert(leadByte>=kMinValueLead);
996 /*package*/ static final int kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 field in class:BytesTrie
[all...]
H A DCharsTrie.java131 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
179 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
237 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
271 } else if(node<kMinValueLead) {
305 assert(leadUnit>=kMinValueLead);
345 if(node>=kMinValueLead) {
498 if(node>=kMinValueLead) {
648 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
660 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
742 result= node>=kMinValueLead
953 /*package*/ static final int kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 field in class:CharsTrie
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DBytesTrie.java199 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
242 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
287 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ?
320 } else if(node<kMinValueLead) {
338 assert((bytes_[pos]&0xff)<kMinValueLead);
356 assert(leadByte>=kMinValueLead);
397 if(node>=kMinValueLead) {
403 assert(node<kMinValueLead);
607 if(node>=kMinValueLead) {
725 assert(leadByte>=kMinValueLead);
1031 /*package*/ static final int kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 field in class:BytesTrie
[all...]
H A DCharsTrie.java138 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
189 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
249 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
283 } else if(node<kMinValueLead) {
318 assert(leadUnit>=kMinValueLead);
360 if(node>=kMinValueLead) {
523 if(node>=kMinValueLead) {
674 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
686 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
768 result= node>=kMinValueLead
979 /*package*/ static final int kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 field in class:CharsTrie
[all...]
/external/icu/icu4c/source/common/unicode/
H A Ducharstrie.h223 // U_ASSERT(leadUnit>=kMinValueLead);
409 // U_ASSERT(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
421 // U_ASSERT(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
532 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040 member in class:UCharsTrie
533 static const int32_t kNodeTypeMask=kMinValueLead-1; // 0x003f
548 static const int32_t kMinTwoUnitNodeValueLead=kMinValueLead+((kMaxOneUnitNodeValue+1)<<6); // 0x4040
H A Dbytestrie.h209 // U_ASSERT(leadByte>=kMinValueLead);
367 // U_ASSERT(leadByte>=kMinValueLead);
475 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20 member in class:BytesTrie
480 static const int32_t kMinOneByteValueLead=kMinValueLead/2; // 0x10

Completed in 510 milliseconds