Lots of low hanging fruit in Phobos

Dmitry Olshansky dmitry.olsh at gmail.com
Thu Mar 6 13:54:04 PST 2014


07-Mar-2014 01:30, Vladimir Panteleev пишет:
> On Thursday, 6 March 2014 at 21:26:45 UTC, Walter Bright wrote:
>> The existing functions should not be removed, but perhaps rewritten as
>> wrappers around the algorithm versions.
>
> How does one handle case sensitivity for ranges of abstract types?

+1

>> I've found that rewriting traditional code, which is what std.string
>> is now, in terms of algorithms is a bit mind-bending. But it's well
>> worth it, and fun.
>
> Would be pretty neat if std.string and std.regex would work with
> char-like types which actually carry more data per character. That way,
> it'd be possible to do string/regex transforms (search & replace, etc.)
> but keep track where exactly each character came from.

Exactly. I've been toying with idea of having generic notion of 
Alphabets for more then a year now. That would also be generalizing code 
unit / code point stuff of Unicode, into legacy encodings and beyond.

One case I had in mind is the very limited (A, C, T, G) alphabet in 
bio-informatics.

-- 
Dmitry Olshansky


More information about the Digitalmars-d mailing list