Searched refs:nextForCodePoint (Results 1 – 24 of 24) sorted by relevance
234 … if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()235 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()236 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()237 … (result=trie.nextForCodePoint(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()238 … (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()239 …(result=trie.nextForCodePoint(0x10ffff))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()245 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()246 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()247 … (result=trie.nextForCodePoint(0x20002))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()252 …if( (result=trie.reset().nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.curr… in Test32NextForCodePoint()[all …]
230 … if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()231 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()232 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()233 … (result=trie.nextForCodePoint(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()234 … (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()235 …(result=trie.nextForCodePoint(0x10ffff))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()241 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()242 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()243 … (result=trie.nextForCodePoint(0x20002))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()248 …if( (result=trie.reset().nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.curr… in Test32NextForCodePoint()[all …]
300 if( (result=trie->nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()301 (result=trie->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()302 (result=trie->nextForCodePoint(0x9999))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()303 (result=trie->nextForCodePoint(0x20000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()304 (result=trie->nextForCodePoint(0xdfff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()305 … (result=trie->nextForCodePoint(0x10ffff))!=USTRINGTRIE_FINAL_VALUE || result!=trie->current() || in TestNextForCodePoint()311 (result=trie->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()312 (result=trie->nextForCodePoint(0x9999))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()313 … (result=trie->nextForCodePoint(0x20002))!=USTRINGTRIE_FINAL_VALUE || result!=trie->current() || in TestNextForCodePoint()318 …if( (result=trie->reset().nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current… in TestNextForCodePoint()[all …]
58 result = uct.nextForCodePoint(c); in matches()
57 result = uct.nextForCodePoint(c); in matches()
77 ((r = backwardsTrie.nextForCodePoint(uch)).hasNext())) {// more in the trie in next()104 && ((rfwd = forwardsPartialTrie.nextForCodePoint(uch)).hasNext())) { in next()
75 ((r = backwardsTrie.nextForCodePoint(uch)).hasNext())) {// more in the trie in next()102 && ((rfwd = forwardsPartialTrie.nextForCodePoint(uch)).hasNext())) { in next()
671 BytesTrie.Result match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()758 match = suffixes.nextForCodePoint(c); in nextCE32FromContraction()814 suffixes.nextForCodePoint(nextCodePoint()); in nextCE32FromDiscontiguousContraction()832 if(prevCC < (fcd16 >> 8) && (match = suffixes.nextForCodePoint(c)).hasValue()) { in nextCE32FromDiscontiguousContraction()
458 UStringTrieResult match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()548 match = suffixes.nextForCodePoint(c); in nextCE32FromContraction()612 suffixes.nextForCodePoint(nextCodePoint(errorCode)); in nextCE32FromDiscontiguousContraction()630 if(prevCC < (fcd16 >> 8) && USTRINGTRIE_HAS_VALUE(match = suffixes.nextForCodePoint(c))) { in nextCE32FromDiscontiguousContraction()
673 BytesTrie.Result match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()760 match = suffixes.nextForCodePoint(c); in nextCE32FromContraction()816 suffixes.nextForCodePoint(nextCodePoint()); in nextCE32FromDiscontiguousContraction()834 if(prevCC < (fcd16 >> 8) && (match = suffixes.nextForCodePoint(c)).hasValue()) { in nextCE32FromDiscontiguousContraction()
279 USTRINGTRIE_HAS_NEXT(r=fData->fBackwardsTrie->nextForCodePoint(uch))) {// more in the trie in breakExceptionAt()314 USTRINGTRIE_HAS_NEXT(rfwd=fData->fForwardsPartialTrie->nextForCodePoint(uch))) { in breakExceptionAt()
51 UCharsTrie::nextForCodePoint(UChar32 cp) { in nextForCodePoint() function in UCharsTrie
192 UStringTrieResult nextForCodePoint(UChar32 cp);
206 public Result nextForCodePoint(int cp) { in nextForCodePoint() method in CharsTrie
195 public Result nextForCodePoint(int cp) { in nextForCodePoint() method in CharsTrie
12;ICU4J 4.8;; 2ST@3.6;PB;NS;NF;NS; ...
12;ICU4J 50.1;; 2ST@3.6;PB;NS;NF;NS; ...