1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
#include <algorithm>
#include <iterator>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
bool caseString(string const &first, string const &second)
{
return strcasecmp(first.c_str(), second.c_str()) < 0;
}
void compare(string const &word1, string const &word2)
{
cout << '`' << word1 << "' is " <<
(
lexicographical_compare(word1.begin(), word1.end(),
word2.begin(), word2.end()) ?
"before `" : "beyond or at `"
) <<
word2 << "' in the alphabet\n";
}
int main()
{
string word1 = "hello";
string word2 = "help";
compare(word1, word2);
compare(word1, word1);
compare(word2, word1);
string one[] = {"alpha", "bravo", "charley"};
string two[] = {"ALPHA", "BRAVO", "DELTA"};
copy(one, one + 3, ostream_iterator<string>{ cout, " " });
cout << " is ordered " <<
(
lexicographical_compare(one, one + 3,
two, two + 3, caseString) ?
"before " : "beyond or at "
);
copy(two, two + 3, ostream_iterator<string>{ cout, " " });
cout << "\n"
"using case-insensitive comparisons.\n";
}
// Displays:
// `hello' is before `help' in the alphabet
// `hello' is beyond or at `hello' in the alphabet
// `help' is beyond or at `hello' in the alphabet
// alpha bravo charley is ordered before ALPHA BRAVO DELTA
// using case-insensitive comparisons.
|
