Lines Matching full:contraction
791 * Approximate determination if a character is at a contraction end.
792 * Guaranteed to be TRUE if a character is at the end of a contraction,
821 * in contraction processing.
888 for (c=0; c<0x300; c++) { // Find the Contraction-ending char.
1688 * If the base character is the start of a contraction, forward processing
1689 * will normalize the marks while checking for the contraction, which means
2068 contraction
2175 * Special normalization function for contraction in the forwards iterator.
2215 * Contraction character management function that returns the next character
2398 * @param constart index to the start character in the contraction table
2473 /* this is a multi-contraction*/
2523 * Special normalization function for contraction in the previous iterator.
2576 * Contraction character management function that returns the previous character
2680 // This loop will repeat only in the case of contractions, and only when a contraction
2681 // is found and the first CE resulting from that contraction is itself a special
2696 // Contraction tables are used - so the whole process is not unlike contraction.
2708 // are matching a potential contraction sequence
2710 // First we position ourselves at the begining of contraction sequence
2719 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
2738 // The source string char was in the contraction table, and the corresponding
2767 /* are matching a potential contraction sequence */
2769 /* First we position ourselves at the begining of contraction sequence */
2777 // back up the source over all the chars we scanned going into this contraction.
2791 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
2796 // Found the source string char in the contraction table.
2803 // Source string char was not in contraction table.
2804 // Unless we have a discontiguous contraction, we have finished
2805 // with this contraction.
2837 // Contraction can not be discontiguous.
2840 // not part of the contraction. */
2848 // Contraction is possibly discontiguous.
2872 /* The Source string did not match the contraction that we were checking. */
2874 /* scanned through what ultimately proved to not be a contraction. */
2881 // The source string char was in the contraction table, and the corresponding
2882 // CE is not a contraction CE. We completed the contraction, break
2884 // way out of contraction handling when the source actually contained
2885 // the contraction.
2890 // The source string char was in the contraction table, and the corresponding
2891 // CE is IS a contraction CE. We will continue looping to check the source
2892 // string for the remaining chars in the contraction.
2896 // CE from the contraction table. Remember the CE and scan position, so
2898 // match a longer contraction sequence.
3348 // Contraction tables are used - so the whole process is not unlike contraction.
3356 // are matching a potential contraction sequence
3358 contraction sequence
3368 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
3423 // The source string char was in the contraction table, and the corresponding
3444 /* commented away contraction end checks after adding the checks
3446 /* start of string or this is not the end of any contraction */
3462 // TODO: when we exhaust the contraction buffer,
6712 // F2 is contraction. We do something very similar to contractions
6713 // but have two indices, one in the real contraction table and the
6730 // We're going to jump into contraction table, pick the elements
6899 /* you can put in either one character or a contraction */
7986 while(schar > (tchar = *(UCharOffset+offset))) { /* since the contraction
8397 // We are stopped in the middle of a contraction.
8398 // Scan backwards through the == part of the string looking for the start of the contraction.
8509 /* If the identical portion ends within a contraction or a comibining */
8518 // We are stopped in the middle of a contraction.
8519 // Scan backwards through the == part of the string looking for the start of the contraction.
