Lines Matching full:folding
17 * Depends on both normalization and case folding.
53 * performing the sub-processing (strlen, normalization, case-folding)
82 * (Same for case-folding.)
86 * and case-folding need code points.
92 * and the code point decomposes/case-folds, then the decomposition/folding
103 * Assumption: A decomposition or case-folding result string never contains
106 * decomposition/case-folding boundaries.
110 * first case-folds and then decomposes. This requires that case-folding does not
114 * This requires that case-folding does not un-NFD strings either.
121 * would be a partial NFD before the case folding, which does not work.
122 * Note that all of this is only a problem when case-folding _and_
151 /* decomposition and case folding variables */
161 /* case folding buffers, only use current-level start/limit */
346 /* copy the folding result to fold1[] */
355 /* set next level pointers to case folding */
391 /* copy the folding result to fold2[] */
400 /* set next level pointers to case folding */
492 * no decomposition/case folding, max level for both sides:
593 * case-folding preserves the FCD-ness of a string.
597 * Exception: When using the Turkic case-folding option, we do perform
