Searched refs:nextForCodePoint (Results 1 – 25 of 26) sorted by relevance
12
243 … if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()244 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()245 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()246 … (result=trie.nextForCodePoint(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()247 … (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()248 …(result=trie.nextForCodePoint(0x10ffff))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()254 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()255 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()256 … (result=trie.nextForCodePoint(0x20002))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()261 …if( (result=trie.reset().nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.curr… in Test32NextForCodePoint()[all …]
244 … if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_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(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()248 … (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()249 …(result=trie.nextForCodePoint(0x10ffff))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()255 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()256 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint()257 … (result=trie.nextForCodePoint(0x20002))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint()262 …if( (result=trie.reset().nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.curr… in Test32NextForCodePoint()[all …]
302 if( (result=trie->nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()303 (result=trie->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()304 (result=trie->nextForCodePoint(0x9999))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()305 (result=trie->nextForCodePoint(0x20000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()306 (result=trie->nextForCodePoint(0xdfff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()307 … (result=trie->nextForCodePoint(0x10ffff))!=USTRINGTRIE_FINAL_VALUE || result!=trie->current() || in TestNextForCodePoint()313 (result=trie->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()314 (result=trie->nextForCodePoint(0x9999))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()315 … (result=trie->nextForCodePoint(0x20002))!=USTRINGTRIE_FINAL_VALUE || result!=trie->current() || in TestNextForCodePoint()320 …if( (result=trie->reset().nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current… in TestNextForCodePoint()[all …]
61 result = uct.nextForCodePoint(c); in matches()
60 result = uct.nextForCodePoint(c); in matches()
86 ((r = backwardsTrie.nextForCodePoint(uch)).hasNext())) {// more in the trie in breakExceptionAt()110 && ((rfwd = forwardsPartialTrie.nextForCodePoint(uch)).hasNext())) { in breakExceptionAt()
84 ((r = backwardsTrie.nextForCodePoint(uch)).hasNext())) {// more in the trie in breakExceptionAt()108 && ((rfwd = forwardsPartialTrie.nextForCodePoint(uch)).hasNext())) { in breakExceptionAt()
681 BytesTrie.Result match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()768 match = suffixes.nextForCodePoint(c); in nextCE32FromContraction()824 suffixes.nextForCodePoint(nextCodePoint()); in nextCE32FromDiscontiguousContraction()842 if(prevCC < (fcd16 >> 8) && (match = suffixes.nextForCodePoint(c)).hasValue()) { in nextCE32FromDiscontiguousContraction()
679 BytesTrie.Result match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()766 match = suffixes.nextForCodePoint(c); in nextCE32FromContraction()822 suffixes.nextForCodePoint(nextCodePoint()); in nextCE32FromDiscontiguousContraction()840 if(prevCC < (fcd16 >> 8) && (match = suffixes.nextForCodePoint(c)).hasValue()) { in nextCE32FromDiscontiguousContraction()
460 UStringTrieResult match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()550 match = suffixes.nextForCodePoint(c); in nextCE32FromContraction()614 suffixes.nextForCodePoint(nextCodePoint(errorCode)); in nextCE32FromDiscontiguousContraction()632 if(prevCC < (fcd16 >> 8) && USTRINGTRIE_HAS_VALUE(match = suffixes.nextForCodePoint(c))) { in nextCE32FromDiscontiguousContraction()
281 USTRINGTRIE_HAS_NEXT(r=fData->fBackwardsTrie->nextForCodePoint(uch))) {// more in the trie in breakExceptionAt()316 USTRINGTRIE_HAS_NEXT(rfwd=fData->fForwardsPartialTrie->nextForCodePoint(uch))) { in breakExceptionAt()
53 UCharsTrie::nextForCodePoint(UChar32 cp) { in nextForCodePoint() function in UCharsTrie
194 UStringTrieResult nextForCodePoint(UChar32 cp);
197 public Result nextForCodePoint(int cp) { in nextForCodePoint() method in CharsTrie
208 public Result nextForCodePoint(int cp) { in nextForCodePoint() method in CharsTrie
12;ICU4J 4.8;; 2ST@3.6;PB;NS;NF;NS; ...