1/*
2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
| 1/*
2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
27 */
28
29#include <iostream>
30#include <string>
31#include <vector>
32
33#include "base/str.hh"
34
35int
36main(int argc, char *argv[])
37{
38 using namespace std;
39
40 if (argc != 3) {
41 cout << "Usage: " << argv[0] << " <string> <token>\n";
42 exit(1);
43 }
44
45 int i;
46 string test = argv[1];
47 vector<string> tokens1;
48 vector<string> tokens2;
49 char token = argv[2][0];
50
51 cout << "string = \"" << test << "\", token = \'" << token << "\'\n";
52 cout << "testing without ignore\n";
53 tokenize(tokens1, test, token, false);
54
55 if (tokens1.size()) {
56 int size = tokens1.size();
57 cout << "size = " << size << "\n";
58 for (i = 0; i < size; i++) {
59 cout << "'" << tokens1[i] << "' (" << tokens1[i].size()
60 << ")" << ((i == size - 1) ? "\n" : ", ");
61 }
62 } else {
63 cout << "no tokens" << endl;
64 }
65
66 cout << "testing with ignore\n";
67 tokenize(tokens2, test, token, true);
68
69 if (tokens2.size()) {
70 int size = tokens2.size();
71 cout << "size = " << size << "\n";
72 for (i = 0; i < size; i++) {
73 cout << "'" << tokens2[i] << "' (" << tokens2[i].size()
74 << ")" << ((i == size - 1) ? "\n" : ", ");
75 }
76 } else {
77 cout << "no tokens" << endl;
78 }
79
80 return 0;
81}
| 29 */
30
31#include <iostream>
32#include <string>
33#include <vector>
34
35#include "base/str.hh"
36
37int
38main(int argc, char *argv[])
39{
40 using namespace std;
41
42 if (argc != 3) {
43 cout << "Usage: " << argv[0] << " <string> <token>\n";
44 exit(1);
45 }
46
47 int i;
48 string test = argv[1];
49 vector<string> tokens1;
50 vector<string> tokens2;
51 char token = argv[2][0];
52
53 cout << "string = \"" << test << "\", token = \'" << token << "\'\n";
54 cout << "testing without ignore\n";
55 tokenize(tokens1, test, token, false);
56
57 if (tokens1.size()) {
58 int size = tokens1.size();
59 cout << "size = " << size << "\n";
60 for (i = 0; i < size; i++) {
61 cout << "'" << tokens1[i] << "' (" << tokens1[i].size()
62 << ")" << ((i == size - 1) ? "\n" : ", ");
63 }
64 } else {
65 cout << "no tokens" << endl;
66 }
67
68 cout << "testing with ignore\n";
69 tokenize(tokens2, test, token, true);
70
71 if (tokens2.size()) {
72 int size = tokens2.size();
73 cout << "size = " << size << "\n";
74 for (i = 0; i < size; i++) {
75 cout << "'" << tokens2[i] << "' (" << tokens2[i].size()
76 << ")" << ((i == size - 1) ? "\n" : ", ");
77 }
78 } else {
79 cout << "no tokens" << endl;
80 }
81
82 return 0;
83}
|