On Tue, 12 Feb 2013 20:19:19 +0000
Richard Wordingham <richard.wordingham_at_ntlworld.com> wrote:
> Let F be the set of all CFCD strings.
> Let E(s) be the set of CFCD strings canonically equivalent to s.
> Let U be the set of strings of length one.
>
> Let T be a set of NFD collating elements. Then the canonical closure
> S of T is the least set such that:
>
> 1) E(T) ⊂ S
> 2) If xu ∈ S, vy ∈ T, u and v are characters, and vy is the last
> collation element in xuvy, then x(E(uv) ∩ U ∩ F)E(y) ⊂ S.
I got Condition 2 wrong. See
http://bugs.icu-project.org/trac/ticket/9319 for the correction.
Richard.
Received on Thu Feb 14 2013 - 14:09:14 CST
This archive was generated by hypermail 2.2.0 : Thu Feb 14 2013 - 14:09:16 CST