Lines Matching defs:that
425 // starting size, chances are that we either have an algorithmic
533 // this means that the lower is single reordering character
570 // Now let's check the trial. The problem is that when you combine characters,
571 // you can end up with concatenation that is unknown for the examined API.
595 // I'm basically saying that I'll add this kind of contraction for cases where I combine
620 // that should be already visible in their order.
633 // there is possibility that either xym or xy are contractions
680 // it is possible that there is an NFC version version of one of the
728 // this means that the contraction has been broken by the newly added accent
740 // this means that the contraction has been broken by the newly added accent
752 // this means that the contraction has been broken by the newly added accent
769 // this means that the contraction has been broken by the newly added accent
991 // if the first one skips, that means that
1046 // it turns out that looking at accents as possible expansions is
1786 // there are two tables that keep seen elements.
1852 // we are not interested in stuff from the reference that is already accounted
1910 // myLatestEqual points at the last point that was the same
1919 // Try to weed out stuff that is not affected, like:
1926 // we have a sequence that spans from myLatestEqual to myLine (that one could be NULL,
1930 // tailoring, that element could be removed.
1971 SortedLines::transferCumulativeStrength(Line *previous, Line *that) {
1972 if(that->strength > previous->cumulativeStrength) {
1973 that->cumulativeStrength = previous->cumulativeStrength;
1975 that->cumulativeStrength = that->strength;