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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2008 by Eran Ifrah
// file name : tokenizer.cpp
//
// -------------------------------------------------------------------------
// A
// _____ _ _ _ _
// / __ \ | | | | (_) |
// | / \/ ___ __| | ___| | _| |_ ___
// | | / _ \ / _ |/ _ \ | | | __/ _ )
// | \__/\ (_) | (_| | __/ |___| | || __/
// \____/\___/ \__,_|\___\_____/_|\__\___|
//
// F i l e
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
// StringTokenizer.cpp: implementation of the StringTokenizer class.
//
//////////////////////////////////////////////////////////////////////
#include "precompiled_header.h"
#include "tokenizer.h"
#ifdef __VISUALC__
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
#endif
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
StringTokenizer::StringTokenizer(const wxString& str,
const wxString& strDelimiter,
const bool &bAllowEmptyTokens /* false */)
{
Initialize();
int nEnd = (int)str.find(strDelimiter, 0);
int nStart = 0;
wxString token;
while( nEnd != -1 )
{
if( nEnd != nStart)
token = str.substr(nStart, nEnd-nStart);
else
token.Empty();
if(!token.empty())
m_tokensArr.push_back(token);
else if( bAllowEmptyTokens )
m_tokensArr.push_back(token);
// next token
nStart = nEnd + (int)strDelimiter.length();
nEnd = (int)str.find(strDelimiter, nStart );
}
if( nStart != (int)str.length() )
{
//We have another token which is not delimited
wxString token = str.substr(nStart);
m_tokensArr.push_back(token);
}
}
StringTokenizer::StringTokenizer(const wxString& str, const wxArrayString& delimiterArr, const bool &allowEmptyTokens)
{
Initialize();
wxString tmpStr( str );
// Replace all delimiters to the first one
if(delimiterArr.GetCount() >= 2)
{
size_t i=1;
for(; i<delimiterArr.GetCount(); i++)
tmpStr.Replace(delimiterArr[i], delimiterArr[0]);
}
*this = StringTokenizer(tmpStr, delimiterArr[0], allowEmptyTokens);
}
// Default
StringTokenizer::StringTokenizer()
{
Initialize();
}
// Copy constructor
StringTokenizer::StringTokenizer(const StringTokenizer &src)
{
*this = src;
}
StringTokenizer& StringTokenizer::operator =(const StringTokenizer &src)
{
if( &src == this)
return *this;
Initialize();
// Copy the tokens
m_tokensArr.clear();
for( int i=0; i<(int)src.m_tokensArr.size() ; i++)
m_tokensArr.push_back(src.m_tokensArr[i]);
m_nCurr = src.m_nCurr;
return *this;
}
StringTokenizer::~StringTokenizer()
{
m_tokensArr.clear();
m_nCurr = 0;
}
// Return current token and advance to the next. If there are no more tokens, return empty string.
wxString StringTokenizer::Next()
{
if( m_nCurr == (int)m_tokensArr.size() )
{
// We are at the end of the tokens array
return wxEmptyString;
}
wxString strToken = m_tokensArr[m_nCurr];
m_nCurr++;
return strToken;
}
// We return the previous token, if we are already at the start, return empty string.
wxString StringTokenizer::Previous()
{
if(m_nCurr == 0)
{
return wxEmptyString;
}
if(m_tokensArr.size() == 0)
{
return wxEmptyString;
}
m_nCurr--;
return m_tokensArr[m_nCurr];
}
bool StringTokenizer::HasMore()
{
if(m_nCurr < (int)m_tokensArr.size())
{
return true;
}
return false;
}
wxString StringTokenizer::First()
{
if(m_tokensArr.size()>0)
{
m_nCurr = 1; //The next one
return m_tokensArr[0];
}
else
{
return wxEmptyString;
}
}
// This function is much similar to the 'next()' function with one difference,
// it does not advance the pointer to the next token.
wxString StringTokenizer::Current()
{
if( m_nCurr == (int)m_tokensArr.size() )
{
// We are at the end of the tokens array
return wxEmptyString;
}
return m_tokensArr[m_nCurr];
}
const int StringTokenizer::Count() const
{
return (int)m_tokensArr.size();
}
void StringTokenizer::Initialize()
{
m_tokensArr.clear();
m_nCurr = 0;
}
// Return last token
wxString StringTokenizer::Last()
{
if(m_tokensArr.size() == 0)
return wxEmptyString;
m_nCurr = (int)m_tokensArr.size()-1;
return m_tokensArr[m_tokensArr.size()-1];
}
wxString StringTokenizer::operator[](const int nIndex)
{
if(m_tokensArr.size() == 0)
return wxEmptyString;
if( nIndex>=(int)m_tokensArr.size() || nIndex<0)
return wxEmptyString;
return m_tokensArr[nIndex];
}
|
