Unicode, graphemes and D

Dmitry Olshansky dmitry.olsh at gmail.com
Thu Apr 5 09:17:41 PDT 2012


On 05.04.2012 18:56, stephan wrote:
>
>>
>> FYI
>> http://www.google-melange.com/gsoc/proposal/review/google/gsoc2012/dolsh/20002#
>>
>
> Maybe helpful for your GSOC project: as part of a larger code base, we
> have implemented many standard Unicode algorithms (normalization;
> casefolding; graphemes; info like general category, Bidi class, joining
> type, etc.; ...).
>
> The doc and source can be found at http://stephan.bitbucket.org/. As
> this was just a helper, it is not fully polished (but it works and is
> reasonably fast).

Nice.
I'll add a link to my proposal. Though I can use it iff the license is 
Boost compatible.

-- 
Dmitry Olshansky


More information about the Digitalmars-d mailing list