| /third_party/skia/third_party/externals/icu/source/common/ |
| D | ucharstrie.cpp | 127 if(node<kMinLinearMatch) { in nextImpl()
131 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
238 if(node<kMinLinearMatch) { in next()
264 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
327 if(node<kMinLinearMatch) { in findUniqueValue()
339 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
385 if(node<kMinLinearMatch) { in getNextUChars()
|
| D | bytestrie.cpp | 154 if(node<kMinLinearMatch) { in nextImpl()
158 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
268 if(node<kMinLinearMatch) { in next()
293 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
356 if(node<kMinLinearMatch) { in findUniqueValue()
367 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
407 if(node<kMinLinearMatch) { in getNextBytes()
|
| D | ucharstrieiterator.cpp | 163 if(node<kMinLinearMatch) { in next()
173 int32_t length=node-kMinLinearMatch+1; in next()
|
| D | bytestrieiterator.cpp | 149 if(node<kMinLinearMatch) { in next()
159 int32_t length=node-kMinLinearMatch+1; in next()
|
| /third_party/icu/icu4c/source/common/ |
| D | ucharstrie.cpp | 127 if(node<kMinLinearMatch) { in nextImpl()
131 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
238 if(node<kMinLinearMatch) { in next()
264 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
327 if(node<kMinLinearMatch) { in findUniqueValue()
339 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
385 if(node<kMinLinearMatch) { in getNextUChars()
|
| D | bytestrie.cpp | 154 if(node<kMinLinearMatch) { in nextImpl()
158 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
268 if(node<kMinLinearMatch) { in next()
293 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
356 if(node<kMinLinearMatch) { in findUniqueValue()
367 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
407 if(node<kMinLinearMatch) { in getNextBytes()
|
| D | ucharstrieiterator.cpp | 163 if(node<kMinLinearMatch) { in next()
173 int32_t length=node-kMinLinearMatch+1; in next()
|
| D | bytestrieiterator.cpp | 149 if(node<kMinLinearMatch) { in next()
159 int32_t length=node-kMinLinearMatch+1; in next()
|
| /third_party/node/deps/icu-small/source/common/ |
| D | ucharstrie.cpp | 127 if(node<kMinLinearMatch) { in nextImpl()
131 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
238 if(node<kMinLinearMatch) { in next()
264 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
327 if(node<kMinLinearMatch) { in findUniqueValue()
339 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
385 if(node<kMinLinearMatch) { in getNextUChars()
|
| D | bytestrie.cpp | 154 if(node<kMinLinearMatch) { in nextImpl()
158 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
268 if(node<kMinLinearMatch) { in next()
293 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
356 if(node<kMinLinearMatch) { in findUniqueValue()
367 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
407 if(node<kMinLinearMatch) { in getNextBytes()
|
| D | ucharstrieiterator.cpp | 163 if(node<kMinLinearMatch) { in next()
173 int32_t length=node-kMinLinearMatch+1; in next()
|
| D | bytestrieiterator.cpp | 149 if(node<kMinLinearMatch) { in next()
159 int32_t length=node-kMinLinearMatch+1; in next()
|
| /third_party/flutter/skia/third_party/externals/icu/source/common/ |
| D | ucharstrie.cpp | 127 if(node<kMinLinearMatch) { in nextImpl()
131 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
238 if(node<kMinLinearMatch) { in next()
264 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
327 if(node<kMinLinearMatch) { in findUniqueValue()
339 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
385 if(node<kMinLinearMatch) { in getNextUChars()
|
| D | bytestrie.cpp | 154 if(node<kMinLinearMatch) { in nextImpl()
158 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
268 if(node<kMinLinearMatch) { in next()
293 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
356 if(node<kMinLinearMatch) { in findUniqueValue()
367 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
407 if(node<kMinLinearMatch) { in getNextBytes()
|
| D | ucharstrieiterator.cpp | 163 if(node<kMinLinearMatch) { in next()
173 int32_t length=node-kMinLinearMatch+1; in next()
|
| D | bytestrieiterator.cpp | 149 if(node<kMinLinearMatch) { in next()
159 int32_t length=node-kMinLinearMatch+1; in next()
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/ |
| D | CharsTrie.java | 302 if(node<kMinLinearMatch) { in next()
321 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
401 if(node<kMinLinearMatch) { in getNextChars()
581 if(node<kMinLinearMatch) { in next()
591 int length=node-kMinLinearMatch+1; in next()
818 if(node<kMinLinearMatch) { in nextImpl()
822 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
894 if(node<kMinLinearMatch) { in findUniqueValue()
906 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
1001 /*package*/ static final int kMinLinearMatch=0x30; field in CharsTrie
[all …]
|
| D | BytesTrie.java | 335 if(node<kMinLinearMatch) { in next()
353 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
434 if(node<kMinLinearMatch) { in getNextBytes()
641 if(node<kMinLinearMatch) { in next()
651 int length=node-kMinLinearMatch+1; in next()
872 if(node<kMinLinearMatch) { in nextImpl()
876 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
948 if(node<kMinLinearMatch) { in findUniqueValue()
959 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
1043 /*package*/ static final int kMinLinearMatch=0x10; local
[all …]
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| D | BytesTrie.java | 355 if(node<kMinLinearMatch) { in next()
373 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
457 if(node<kMinLinearMatch) { in getNextBytes()
675 if(node<kMinLinearMatch) { in next()
685 int length=node-kMinLinearMatch+1; in next()
912 if(node<kMinLinearMatch) { in nextImpl()
916 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
988 if(node<kMinLinearMatch) { in findUniqueValue()
999 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
1083 /*package*/ static final int kMinLinearMatch=0x10; local
[all …]
|
| D | CharsTrie.java | 317 if(node<kMinLinearMatch) { in next()
336 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
419 if(node<kMinLinearMatch) { in getNextChars()
607 if(node<kMinLinearMatch) { in next()
617 int length=node-kMinLinearMatch+1; in next()
845 if(node<kMinLinearMatch) { in nextImpl()
849 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
921 if(node<kMinLinearMatch) { in findUniqueValue()
933 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
1028 /*package*/ static final int kMinLinearMatch=0x30; field in CharsTrie
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/common/unicode/ |
| D | bytestrie.h | 468 static const int32_t kMinLinearMatch=0x10; variable
476 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
|
| D | ucharstrie.h | 528 static const int32_t kMinLinearMatch=0x30; variable
534 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040
|
| /third_party/skia/third_party/externals/icu/source/common/unicode/ |
| D | bytestrie.h | 507 static const int32_t kMinLinearMatch=0x10; variable
515 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
|
| /third_party/icu/icu4c/source/common/unicode/ |
| D | bytestrie.h | 507 static const int32_t kMinLinearMatch=0x10; variable
515 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
|
| /third_party/node/deps/icu-small/source/common/unicode/ |
| D | bytestrie.h | 507 static const int32_t kMinLinearMatch=0x10; variable
515 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
|