Lines Matching full:case
17 * Depends on both normalization and case folding.
40 * Further options include case-insensitive comparison and
54 * performing the sub-processing (strlen, normalization, case-folding)
73 * try to decompose/case-fold c1/c2, and continue if one does;
75 * // still c1!=c2 and neither decomposes/case-folds, return result
83 * (Same for case-folding.)
87 * and case-folding need code points.
90 * actually decomposes/case-folds.
93 * and the code point decomposes/case-folds, then the decomposition/folding
98 * in such a case.
104 * Assumption: A decomposition or case-folding result string never contains
107 * decomposition/case-folding boundaries.
111 * first case-folds and then decomposes. This requires that case-folding does not
115 * This requires that case-folding does not un-NFD strings either.
119 * If this happens, then a simple solution is to case-fold both strings up front
122 * would be a partial NFD before the case folding, which does not work.
123 * Note that all of this is only a problem when case-folding _and_
148 /* decomposition and case folding variables */
158 /* case folding buffers, only use current-level start/limit */
285 /* advance ++s1; only below if cp1 decomposes/case-folds */
301 /* advance ++s2; only below if cp2 decomposes/case-folds */
319 /* cp1 case-folds to the code point "length" or to p[length] */
322 /* advance beyond source surrogate pair if it case-folds */
352 /* set next level pointers to case folding */
364 /* cp2 case-folds to the code point "length" or to p[length] */
367 /* advance beyond source surrogate pair if it case-folds */
397 /* set next level pointers to case folding */
489 * no decomposition/case folding, max level for both sides:
571 * UAX #21 Case Mappings, as fixed for Unicode version 4
581 * case-folding preserves the FCD-ness of a string.
585 * Exception: When using the Turkic case-folding option, we do perform
586 * full NFD first. This is because in the Turkic case precomposed characters
