// Insert a rune in a buffer, ordered by Canonical Combining Class.
Insert a rune in a buffer, ordered by Canonical Combining Class.
// Insert a rune in a buffer ordered by Canonical Combining Class .
func insertOrdered(b Decomposition, r rune) Decomposition {
	n := len(b)
	b = append(b, 0)
	cc := ccc(r)
	if cc > 0 {
		for ; n > 0; n-- {
			if ccc(b[n-1]) <= cc {
				break
			}
			b[n] = b[n-1]
		}
	}
	b[n] = r
	return b
}
func insertOrdered ( b Decomposition , r rune ) Decomposition { n := len ( b ) b = append ( b , 0 ) cc := ccc ( r ) if cc > 0 { for ; n > 0 ; n -- { if ccc ( b [ n - 1 ] ) <= cc { break } b [ n ] = b [ n - 1 ] } } b [ n ] = r return b }
Insert a rune in a buffer, ordered by Canonical Combining Class.
Insert a rune in a buffer ordered by Canonical Combining Class .
// Use bubble sort.