利用STL名字第二长的算法----lexicographical_compare
// 返回在忽略大小写的情况下c1是否在c2前面;
bool ciCharLess(char c1, char c2) {
tolower(static_cast<unsigned char>(c1)) <
tolower(static_cast<unsigned char>(c2));
}
bool ciStringCompare(const string& s1, const string& s2){
return lexicographical_compare(s1.begin(), s1.end(), s2.begin(), s2.end(),
ciCharLess);
}
lexicographical_compare是strcmp的泛型版本