case insensitive string::find | | |
Is there some quick C++ way I can do something similar to string::find ,
but case insensitive ? | | | | re: case insensitive string::find
"Nils O. Selåsdal" <NOS@Utel.no> wrote in message
news:b_5dd.2715$rh1.79702@news2.e.nsc.no...[color=blue]
> Is there some quick C++ way I can do something similar to string::find ,
> but case insensitive ?[/color]
You can use the predicate version of std::search
bool ci_equal(char ch1, char ch2)
{
return toupper((unsigned char)ch1) == toupper((unsigned char)ch2);
}
size_t ci_find(const string& str1, const string& str2)
{
string::iterator pos = search(str1. begin ( ), str1. end ( ), str2.
begin ( ), str2. end ( ), ci_equal);
if (pos == str1. end ( ))
return string::npos;
else
return pos - str1. begin ( );
}
Untested code.
John | | | | re: case insensitive string::find
John Harrison wrote:[color=blue]
> "Nils O. Selåsdal" <NOS@Utel.no> wrote in message
> news:b_5dd.2715$rh1.79702@news2.e.nsc.no...
>[color=green]
>>Is there some quick C++ way I can do something similar to string::find ,
>>but case insensitive ?[/color]
>
>
> You can use the predicate version of std::search
>
> bool ci_equal(char ch1, char ch2)
> {
> return toupper((unsigned char)ch1) == toupper((unsigned char)ch2);
> }
>
> size_t ci_find(const string& str1, const string& str2)
> {
> string::iterator pos = search(str1. begin ( ), str1. end ( ), str2.
> begin ( ), str2. end ( ), ci_equal);
> if (pos == str1. end ( ))
> return string::npos;
> else
> return pos - str1. begin ( );
> }
>
> Untested code.[/color]
Change to string::const_iterator, it seems to work fine.
Thanks. | | | | re: case insensitive string::find
John Harrison schrieb:
[color=blue]
> "Nils O. Selåsdal" <NOS@Utel.no> wrote:
>[color=green]
>>Is there some quick C++ way I can do something similar to string::find ,
>>but case insensitive ?[/color]
>
>
> You can use the predicate version of std::search
>
> bool ci_equal(char ch1, char ch2)
> {
> return toupper((unsigned char)ch1) == toupper((unsigned char)ch2);
> }[/color]
Caveat: that predicate will not work reliably for non-English strings.
e.g. in French accents are usually stripped off of capital letters, so
an 'E' can be equivalent (equal modulus case) to either 'e', 'é', 'è',
or 'ê'. In German, the letter 'ß' only exists in lower case, and the
correct capitalisation is "SS", while the reverse conversion is
ambiguous (some "SS" convert to "ss", others to 'ß').
It still doesn't catch all of those issues, but in most cases tolower()
is the better variant in my experience.
While 100% correct case conversions cannot be done in some languages
without knowledge of their spelling rules and exceptions to them, the
'ß' case IMHO shows that signatures like charT toupper( charT ) have
been designed with ignorance (no offence) towards languages where a
1-char-to-1-char conversion is not possible. Wide character support
doesn't alleviate this at all :-(((
Standardised whole-string case conversion functions would be deerly
needed, even if it's left to the implementation or the application to
implement them for a particular locale.
Regards,
Malte | | | | re: case insensitive string::find
On Tue, 19 Oct 2004 15:03:14 +0200, Malte Starostik wrote:
[color=blue]
> John Harrison schrieb:
>[color=green]
>> "Nils O. Selåsdal" <NOS@Utel.no> wrote:
>>[color=darkred]
>>>Is there some quick C++ way I can do something similar to string::find ,
>>>but case insensitive ?[/color][/color][/color]
....[color=blue]
> 1-char-to-1-char conversion is not possible. Wide character support
> doesn't alleviate this at all :-(((
> Standardised whole-string case conversion functions would be deerly
> needed, even if it's left to the implementation or the application to
> implement them for a particular locale.[/color]
Fortunatly for me, I need only care about ascii a-z,A-Z .. | | | | re: case insensitive string::find
"Nils O. Selåsdal" <NOS@Utel.no> wrote in message news:b_5dd.2715
[color=blue]
> Is there some quick C++ way I can do something similar to string::find ,
> but case insensitive ?[/color]
See John's post for an excellent solution.
A more elaborate possibility is to create a new traits class, similar to
std::char_traits<char>, that compares without sensitivity. But now all
string compare operations are case insensitive, so you might find yourself
trying to use std::search to compare with case sensitivity! I haven't tried
myself yet, but seems this should work:
class ichar_traits : public std::char_traits<char> {
public:
static bool eq(char, char);
static bool lt(char, char);
static int compare(const char *, const char *, size_t n);
static const char * find(const char *, size_t n, char);
};
std::basic_string<char, ichar_traits<char> > s1("Hello");
std::basic_string<char, ichar_traits<char> > s2("HELLO");
assert(s1==s2);
assert(s1.find(s2)==0); |  | | | | Forums
Visit our community forums for general discussions and latest on Bytes
/bytes/about
We are a network of experts and professionals in IT and software development that help one another with answers to tough questions and share insights.
Get the best answers to your questions from over 229,155 network members.
|