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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
#include "base/StringUtil.h"
int PositionAfter(string& in, string& to_find, int startSearchAt)
{
int max_pos = in.size() - to_find.size();
for ( int i = startSearchAt; i <= max_pos; i++ )
{
int j;
for ( j = 0; j < (int) to_find.size( ); ++j )
if ( in[i + j] != to_find[j] )
break;
if ( j == (int) to_find.size( ) )
return i;
}
return -1;
}
string After(string &s, string &t)
{
string ret("");
string::size_type pos = s.find(t);
if ( pos != string::npos )
ret = s.substr(pos+t.size(),s.size());
return ret;
}
string Before(string &s, string &t)
{
string ret("");
string::size_type pos = s.find(t);
if ( pos != string::npos )
ret = s.substr(0,pos);
return ret;
}
bool Contains(string &s, string &t)
{
return (s.find(t) != string::npos);
}
string After(string &s, char *t)
{
string ret("");
string targ(t);
string::size_type pos = s.find(targ);
if ( pos != string::npos )
ret = s.substr(pos+targ.size(),s.size());
return ret;
}
string Before(string &s, char *t)
{
string ret("");
string::size_type pos = s.find(t);
if ( pos != string::npos )
ret = s.substr(0,pos);
return ret;
}
bool Contains(string &s, char * t)
{
return (s.find(t) != string::npos);
}
bool ContainsAt(string &s, string &t, int at)
{
string::size_type pos = s.find(t);
return ( (int) pos == at );
}
int Tokenize( const string &a_string,
vector<char> &separators,
vector<string> &tokens )
{
tokens.clear();
// Parse string.
static vector< pair<int, int> > token_interval;
token_interval.clear( );
bool in_token = false;
int token_start = 0;
for (int ii=0; ii<(int)a_string.size( ); ii++) {
bool matches_separator = false;
for (int jj=0; jj<(int)separators.size( ); jj++)
if ( separators[jj] ==a_string[ii] ) {
matches_separator = true;
break;
}
if ( matches_separator ) {
if ( in_token ) {
token_interval.push_back( pair<int, int>( token_start, ii ) );
in_token = false;
}
}
else {
if ( !in_token ) {
token_start = ii;
in_token = true;
}
}
}
if ( in_token ) token_interval.push_back( pair<int, int>( token_start, (int)a_string.size() ) );
// Create tokens.
tokens.reserve( token_interval.size( ) );
for (int ii=0; ii<(int)token_interval.size( ); ii++) {
int token_length = token_interval[ii].second - token_interval[ii].first;
tokens.push_back( a_string.substr( token_interval[ii].first, token_length ) );
}
// Return number of tokens.
return (int)token_interval.size( );
}
int Tokenize( const string &a_string,
vector<string> &tokens )
{
static vector<char> separators;
separators.clear( );
separators.push_back( ' ' );
separators.push_back( '\t' );
return Tokenize( a_string, separators, tokens );
}
|
