Lines Matching full:folding
17 * Depends on both normalization and case folding.
55 * performing the sub-processing (strlen, normalization, case-folding)
84 * (Same for case-folding.)
88 * and case-folding need code points.
94 * and the code point decomposes/case-folds, then the decomposition/folding
105 * Assumption: A decomposition or case-folding result string never contains
108 * decomposition/case-folding boundaries.
112 * first case-folds and then decomposes. This requires that case-folding does not
116 * This requires that case-folding does not un-NFD strings either.
123 * would be a partial NFD before the case folding, which does not work.
124 * Note that all of this is only a problem when case-folding _and_
153 /* decomposition and case folding variables */
163 /* case folding buffers, only use current-level start/limit */
348 /* copy the folding result to fold1[] */
357 /* set next level pointers to case folding */
393 /* copy the folding result to fold2[] */
402 /* set next level pointers to case folding */
494 * no decomposition/case folding, max level for both sides:
566 * case-folding preserves the FCD-ness of a string.
570 * Exception: When using the Turkic case-folding option, we do perform
