Re: Do sorted ranges have any special properties?

[bearophile]

Philippe Sigaud:

> auto vowelsInMyText = filter ! q{a in assumeSorted("aeiou")} (myText);

In a so small array of chars (or even wchars/dchars) a sequential search (if 
well implemented!) is the fastest algorithm.

Bye,
bearophile