Python's partition

[Tomek Sowiński]

Andrei Alexandrescu napisał:

> Looking through Python's string functions 
> (http://docs.python.org/release/2.5.2/lib/string-methods.html) I noticed 
> partition():
> 
> partition(sep)
>      Split the string at the first occurrence of sep, and return a 
> 3-tuple containing the part before the separator, the separator itself, 
> and the part after the separator. If the separator is not found, return 
> a 3-tuple containing the string itself, followed by two empty strings. 
> New in version 2.5.
> 
> Right now we find find and findSkip; partition would be a great 
> complement, and can be implemented for all forward ranges.
> 
> One question is naming - partition() is not good for us because 
> std.algorithm.partition implements Hoare's in-place partition algorithm. 
> How should we call the function?

Instead of a one-shot function, would a lazy range of pre-hit-post troikas be possible? That'd rhyme nicely with RegexMatch. In fact, match(string, string) overload is free...

-- 
Tomek