[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [idn] complexity/simplicity: NAMEPREP code vs ACE codes



In message <009001c0ffe9$72f278d0$0c680b41@c1340594a>,
"Mark Davis" <mark@macchiato.com> wrote:
> I agree that NamePrep is more complex than the ACEs. However, it is not that
> complicated, and there is a very extensive compliance test for NFKC on the
> Unicode site.

Yes.  I used your extensive test data to check my implementation
(thanks!).

I think this is an important point.  Although NAMEPREP (NFKC) is a
rather complex operation, you can make sure that your implementation
is correct because there is a good set of test data.

This also applies to ACE.  While simplicity is very important in order
to guarantee the interoperability among various implementations, some
degree of complexity could well be compensated by a good test data.
And for most of the proposed ACEs, the amount of the required test
data is much smaller than what is needed for NFKC.  DUDE and MACE
drafts already have such test data, and I believe authors of other
ACEs can also supply them.

						-- ishisone@sra.co.jp