• Home
  • Raw
  • Download

Lines Matching full:skipped

56 // State of combining marks skipped in discontiguous contraction.
85 // Goes backward through the skipped-marks buffer.
86 // Returns the number of code points read beyond the skipped marks
119 // Replaces the characters we consumed with the newly skipped ones.
130 // Combining marks skipped in previous discontiguous-contraction matching.
133 // Combining marks newly skipped in current discontiguous-contraction matching.
140 // When a partial match fails, we back out skipped and partial-matching input characters.
152 skipped(nullptr), in CollationIterator()
168 delete skipped; in ~CollationIterator()
176 // Ignore skipped since that should be unused between calls to nextCE(). in operator ==()
194 if(skipped != nullptr) { skipped->clear(); } in reset()
315 if(skipped == nullptr && numCpFwd < 0) { in appendCEsFromCE32()
348 // CEs from a discontiguous contraction plus the skipped combining marks in appendCEsFromCE32()
472 if(skipped != nullptr && skipped->hasNext()) { return skipped->next(); } in nextSkippedCodePoint()
475 if(skipped != nullptr && !skipped->isEmpty() && c >= 0) { skipped->incBeyond(); } in nextSkippedCodePoint()
482 if(skipped != nullptr && !skipped->isEmpty()) { in backwardNumSkipped()
483 n = skipped->backwardNumCodePoints(n); in backwardNumSkipped()
502 // If we are already processing skipped combining marks, then we do track the state. in nextCE32FromContraction()
504 if(skipped != nullptr && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
513 if(skipped != nullptr && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
545 // it might be skipped in discontiguous contraction. in nextCE32FromContraction()
600 if(skipped == nullptr || skipped->isEmpty()) { in nextCE32FromDiscontiguousContraction()
601 if(skipped == nullptr) { in nextCE32FromDiscontiguousContraction()
602 skipped = new SkippedState(); in nextCE32FromDiscontiguousContraction()
603 if(skipped == nullptr) { in nextCE32FromDiscontiguousContraction()
619 skipped->saveTrieState(suffixes); in nextCE32FromDiscontiguousContraction()
622 skipped->resetToTrieState(suffixes); in nextCE32FromDiscontiguousContraction()
625 skipped->setFirstSkipped(c); in nextCE32FromDiscontiguousContraction()
637 skipped->recordMatch(); in nextCE32FromDiscontiguousContraction()
639 skipped->saveTrieState(suffixes); in nextCE32FromDiscontiguousContraction()
642 skipped->skip(c); in nextCE32FromDiscontiguousContraction()
643 skipped->resetToTrieState(suffixes); in nextCE32FromDiscontiguousContraction()
655 UBool isTopDiscontiguous = skipped->isEmpty(); in nextCE32FromDiscontiguousContraction()
656 skipped->replaceMatch(); in nextCE32FromDiscontiguousContraction()
657 if(isTopDiscontiguous && !skipped->isEmpty()) { in nextCE32FromDiscontiguousContraction()
661 // and then from the combining marks that we skipped before the match. in nextCE32FromDiscontiguousContraction()
665 // Fetch CE32s for skipped combining marks from the normal data, with fallback, in nextCE32FromDiscontiguousContraction()
667 if(!skipped->hasNext()) { break; } in nextCE32FromDiscontiguousContraction()
668 c = skipped->next(); in nextCE32FromDiscontiguousContraction()
677 // replaces consumed combining marks with newly skipped ones in nextCE32FromDiscontiguousContraction()
680 skipped->clear(); in nextCE32FromDiscontiguousContraction()