Lines Matching full:decomposition
80 * the decomposition, pushing the previous pointer onto a stack.
81 * When the end of the decomposition is reached, then the code unit reader
86 * The top part of the loop works on code units, while lookups for decomposition
93 * and the code point decomposes/case-folds, then the decomposition/folding
104 * Assumption: A decomposition or case-folding result string never contains
107 * decomposition/case-folding boundaries.
114 * The API function may also NFD the input and turn off decomposition.
128 * for calling the decomposition access function.
131 /* stack element for previous-level source/decomposition pointers */
148 /* decomposition and case folding variables */
155 /* decomposition buffers for Hangul */
328 * compare this decomposition with the lead surrogate in the other string
330 * the decomposition would replace the entire code point
356 /* get ready to read from decomposition, continue with loop */
373 * compare this decomposition with the lead surrogate in the other string
375 * the decomposition would replace the entire code point
401 /* get ready to read from decomposition, continue with loop */
418 * compare this decomposition with the lead surrogate in the other string
420 * the decomposition would replace the entire code point
438 /* set next level pointers to decomposition */
442 /* get ready to read from decomposition, continue with loop */
459 * compare this decomposition with the lead surrogate in the other string
461 * the decomposition would replace the entire code point
479 /* set next level pointers to decomposition */
483 /* get ready to read from decomposition, continue with loop */
489 * no decomposition/case folding, max level for both sides:
