public final Class NormalizerImpl

Returns: index into maybeYesCompositions

Does c have a composition boundary before it?

simpler, single-character version of mergeOrdered() - bubble-insert one single code point into the preceding string which is already canonically ordered (c, c2) may or may not yet have been inserted at src[current]..src[p] it must be p=current+lengthof(c, c2) i.e. p=current+(c2==0 ?

A little faster and simpler than isDecompYesAndZeroCC() but does not include the MaybeYes which combine-forward and have ccc=0.

merge two UTF-16 string parts together to canonically order (order by combining classes) their concatenation the two strings may already be adjacent, so that the merging is done in-place if the two strings are not adjacent, then the buffer holding the first one must be large enough the second string may or may not be ordered in itself before: [start]..[current] is already ordered, and [next]..[limit] may be ordered in itself, but is not in relation to [start..current[ after: [start..current+(limit-next)[ is ordered the algorithm is a simple bubble-sort that takes the characters from src[next++] and inserts them in correct combining class order into the preceding part of the string since this function is called much less often than the single-code point insertOrdered(), it just uses that for easier maintenance