In message <001e01c0ffd0$1a717ee0$[EMAIL PROTECTED]>,
"Soobok Lee" <[EMAIL PROTECTED]> wrote:
> For whom had never looked into NAMEPREP codes in MDNkit of JPNIC,
> ...
> [root@bora lib]# wc name*[hc] uni*[hc]
> 296 1109 8554 nameprep.c
> 136 804 5475 nameprep_template.c
> 1694 11778 73804 nameprepdata.c
> 484 1822 12314 unicode.c
> 6806 38573 327222 unicodedata.c
> 9416 54086 427369 total
If you look closer, you'll find that nameprepdata.c and unicodedata.c
above contain only data -- some large tables, which are generated from
NAMEPREP draft and Unicode Character Database. So I don't think it is
fair to count them when you compare complexity. On the other hand
you overlooked unormalize.c, which implements Unicode Normalization
Forms.
Anyway I agree that NAMEPREP (NFKC in particular) is no simpler than
most of the proposed ACEs. Before implementing NFKC you have to read
the specification, which is longer than any ACE I-Ds, and relevant
documents, understand what's going on, and generate tables from the
data... Also I think it is harder to test the correctness of the
implementation.
-- [EMAIL PROTECTED]
