tokentest.cc revision 1793
112855Sgabeblack@google.com/* 212855Sgabeblack@google.com * Copyright (c) 2002-2005 The Regents of The University of Michigan 312855Sgabeblack@google.com * All rights reserved. 412855Sgabeblack@google.com * 512855Sgabeblack@google.com * Redistribution and use in source and binary forms, with or without 612855Sgabeblack@google.com * modification, are permitted provided that the following conditions are 712855Sgabeblack@google.com * met: redistributions of source code must retain the above copyright 812855Sgabeblack@google.com * notice, this list of conditions and the following disclaimer; 912855Sgabeblack@google.com * redistributions in binary form must reproduce the above copyright 1012855Sgabeblack@google.com * notice, this list of conditions and the following disclaimer in the 1112855Sgabeblack@google.com * documentation and/or other materials provided with the distribution; 1212855Sgabeblack@google.com * neither the name of the copyright holders nor the names of its 1312855Sgabeblack@google.com * contributors may be used to endorse or promote products derived from 1412855Sgabeblack@google.com * this software without specific prior written permission. 1512855Sgabeblack@google.com * 1612855Sgabeblack@google.com * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1712855Sgabeblack@google.com * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1812855Sgabeblack@google.com * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 1912855Sgabeblack@google.com * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 2012855Sgabeblack@google.com * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2112855Sgabeblack@google.com * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 2212855Sgabeblack@google.com * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2312855Sgabeblack@google.com * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2412855Sgabeblack@google.com * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2512855Sgabeblack@google.com * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 2612855Sgabeblack@google.com * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2712855Sgabeblack@google.com */ 2812855Sgabeblack@google.com 2912855Sgabeblack@google.com#include <iostream> 3012855Sgabeblack@google.com#include <string> 3112855Sgabeblack@google.com#include <vector> 3212855Sgabeblack@google.com 3312855Sgabeblack@google.com#include "base/str.hh" 3412855Sgabeblack@google.com 3512855Sgabeblack@google.comint 3612855Sgabeblack@google.commain(int argc, char *argv[]) 3712855Sgabeblack@google.com{ 3812855Sgabeblack@google.com using namespace std; 3912855Sgabeblack@google.com 4012855Sgabeblack@google.com if (argc != 3) { 4112855Sgabeblack@google.com cout << "Usage: " << argv[0] << " <string> <token>\n"; 4212855Sgabeblack@google.com exit(1); 4312855Sgabeblack@google.com } 4412855Sgabeblack@google.com 4512855Sgabeblack@google.com int i; 4612855Sgabeblack@google.com string test = argv[1]; 4712855Sgabeblack@google.com vector<string> tokens1; 4812855Sgabeblack@google.com vector<string> tokens2; 4912855Sgabeblack@google.com char token = argv[2][0]; 5012855Sgabeblack@google.com 5112855Sgabeblack@google.com cout << "string = \"" << test << "\", token = \'" << token << "\'\n"; 5212855Sgabeblack@google.com cout << "testing without ignore\n"; 5312855Sgabeblack@google.com tokenize(tokens1, test, token, false); 5412855Sgabeblack@google.com 5512855Sgabeblack@google.com if (tokens1.size()) { 5612855Sgabeblack@google.com int size = tokens1.size(); 5712855Sgabeblack@google.com cout << "size = " << size << "\n"; 5812855Sgabeblack@google.com for (i = 0; i < size; i++) { 5912855Sgabeblack@google.com cout << "'" << tokens1[i] << "' (" << tokens1[i].size() 6012855Sgabeblack@google.com << ")" << ((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} 82