
Hi, It's easy to sort a container of std::strings lexicographically. Just sort it - string's < operator takes care of things. But what if I wanted to do a case-insensitive sort? There's no predicate for case-insensitive comparison in the standard library, so I turned to the next logical place: Boost's string algorithm library. But while there's iequals, I couldn't find iless. It seems to me like this predicate would be quite useful. Yes, I know how complicated full-blown Unicode CI sorting can be. I read Sorting It All Out. But I think most people are looking for something simpler anyway. Sebastian Redl

hi, Such a predicate is planned. I was hoping to add it before christmas, but the things turn up differently. I will add it as soon as I find some time to spend on boost. Regards, Pavol On Thu, Jan 19, 2006 at 02:37:30AM +0100, Sebastian Redl wrote:
Hi,
It's easy to sort a container of std::strings lexicographically. Just sort it - string's < operator takes care of things. But what if I wanted to do a case-insensitive sort? There's no predicate for case-insensitive comparison in the standard library, so I turned to the next logical place: Boost's string algorithm library. But while there's iequals, I couldn't find iless. It seems to me like this predicate would be quite useful.
Yes, I know how complicated full-blown Unicode CI sorting can be. I read Sorting It All Out. But I think most people are looking for something simpler anyway.
Sebastian Redl _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
participants (2)
-
Pavol Droba
-
Sebastian Redl