Lines Matching full:decomposition
81 * the decomposition, pushing the previous pointer onto a stack.
82 * When the end of the decomposition is reached, then the code unit reader
87 * The top part of the loop works on code units, while lookups for decomposition
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.
115 * The API function may also NFD the input and turn off decomposition.
129 /* stack element for previous-level source/decomposition pointers */
153 /* decomposition and case folding variables */
333 * compare this decomposition with the lead surrogate in the other string
335 * the decomposition would replace the entire code point
361 /* get ready to read from decomposition, continue with loop */
378 * compare this decomposition with the lead surrogate in the other string
380 * the decomposition would replace the entire code point
406 /* get ready to read from decomposition, continue with loop */
423 * compare this decomposition with the lead surrogate in the other string
425 * the decomposition would replace the entire code point
443 /* set next level pointers to decomposition */
447 /* get ready to read from decomposition, continue with loop */
464 * compare this decomposition with the lead surrogate in the other string
466 * the decomposition would replace the entire code point
484 /* set next level pointers to decomposition */
488 /* get ready to read from decomposition, continue with loop */
494 * no decomposition/case folding, max level for both sides:
