|author||Rich Felker <email@example.com>||2012-04-24 04:23:55 -0400|
|committer||Rich Felker <firstname.lastname@example.org>||2012-04-24 04:23:55 -0400|
new wcwidth implementation (fast table-based)
i tried to go with improving the old binary-search-based algorithm, but between growth in the number of ranges, bad performance, and lack of confidence in the binary search code's stability under changes in the table, i decided it was worth the extra 1.8k to have something clean and maintainable. also note that, like the alpha and punct tables, there's definitely room to optimize the nonspacing/wide tables by overlapping subtables. this is not a high priority, but i've begun looking into how to do it, and i suspect the table sizes can be roughly halved. if that turns out to be true, the new, fast, table-based implementation will be roughly the same size as if i had just extended the old binary search one.
Diffstat (limited to 'src/ctype/isdigit.c')
0 files changed, 0 insertions, 0 deletions