Menu

[r1902]: / framework / trunk / cppcms / string_key.h  Maximize  Restore  History

Download this file

331 lines (289 with data), 7.1 kB

  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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
///////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2008-2010 Artyom Beilis (Tonkikh) <artyomtnk@yahoo.com>
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//
///////////////////////////////////////////////////////////////////////////////
#ifndef CPPCMS_STRING_KEY_H
#define CPPCMS_STRING_KEY_H
#include <string>
#include <string.h>
#include <algorithm>
#include <stdexcept>
#include <ostream>
namespace cppcms {
class string_key {
public:
typedef char const *const_iterator;
static const size_t npos = std::string::npos;
string_key() :
begin_(0),
end_(0)
{
}
string_key(char const *key) :
begin_(0),
end_(0),
key_(key)
{
}
string_key(std::string const &key) :
begin_(0),
end_(0),
key_(key)
{
}
size_t size() const
{
return end() - begin();
}
size_t length() const
{
return size();
}
void clear()
{
begin_ = end_ = 0;
key_.clear();
}
bool empty() const
{
return end() == begin();
}
size_t find(char c,size_t pos = 0) const
{
size_t s = size();
if(pos >= s)
return npos;
char const *p=begin() + pos;
while(pos <= s && *p!=c) {
pos++;
p++;
}
if(pos >= s)
return npos;
return pos;
}
string_key substr(size_t pos = 0,size_t n=npos) const
{
string_key tmp = unowned_substr(pos,n);
return string_key(std::string(tmp.begin(),tmp.end()));
}
string_key unowned_substr(size_t pos = 0,size_t n=npos) const
{
if(pos >= size()) {
return string_key();
}
char const *p=begin() + pos;
char const *e=end();
if(n > size_t(e-p)) {
return string_key(p,e);
}
else {
return string_key(p,p+n);
}
}
char const &operator[](size_t n) const
{
return *(begin() + n);
}
char const &at(size_t n) const
{
if(n > size())
throw std::out_of_range("cppcms::string_key::at() range error");
return *(begin() + n);
}
static string_key unowned(std::string const &v)
{
return string_key(v.c_str(),v.c_str()+v.size());
}
static string_key unowned(char const *str)
{
char const *end = str;
while(*end)
end++;
return string_key(str,end);
}
static string_key unowned(char const *begin,char const *end)
{
return string_key(begin,end);
}
char const *begin() const
{
if(begin_)
return begin_;
return key_.c_str();
}
char const *end() const
{
if(begin_)
return end_;
return key_.c_str() + key_.size();
}
bool operator<(string_key const &other) const
{
return std::lexicographical_compare( begin(),end(),
other.begin(),other.end(),
std::char_traits<char>::lt);
}
bool operator>(string_key const &other) const
{
return other < *this;
}
bool operator>=(string_key const &other) const
{
return !(*this < other);
}
bool operator<=(string_key const &other) const
{
return !(*this > other);
}
bool operator==(string_key const &other) const
{
return (end() - begin() == other.end() - other.begin())
&& memcmp(begin(),other.begin(),end()-begin()) == 0;
}
bool operator!=(string_key const &other) const
{
return !(*this!=other);
}
char const *data() const
{
return begin();
}
std::string str() const
{
if(begin_)
return std::string(begin_,end_-begin_);
else
return key_;
}
operator std::string() const
{
return str();
}
private:
string_key(char const *b,char const *e) :
begin_(b),
end_(e)
{
}
char const *begin_;
char const *end_;
std::string key_;
};
inline std::ostream &operator<<(std::ostream &out,string_key const &s)
{
out.write(s.data(),s.size());
return out;
}
inline bool operator==(string_key const &l,char const *r)
{
return l==string_key::unowned(r);
}
inline bool operator==(char const *l,string_key const &r)
{
return string_key::unowned(l) == r;
}
inline bool operator==(string_key const &l,std::string const &r)
{
return l==string_key::unowned(r);
}
inline bool operator==(std::string const &l,string_key const &r)
{
return string_key::unowned(l) == r;
}
inline bool operator!=(string_key const &l,char const *r)
{
return l!=string_key::unowned(r);
}
inline bool operator!=(char const *l,string_key const &r)
{
return string_key::unowned(l) != r;
}
inline bool operator!=(string_key const &l,std::string const &r)
{
return l!=string_key::unowned(r);
}
inline bool operator!=(std::string const &l,string_key const &r)
{
return string_key::unowned(l) != r;
}
inline bool operator<=(string_key const &l,char const *r)
{
return l<=string_key::unowned(r);
}
inline bool operator<=(char const *l,string_key const &r)
{
return string_key::unowned(l) <= r;
}
inline bool operator<=(string_key const &l,std::string const &r)
{
return l<=string_key::unowned(r);
}
inline bool operator<=(std::string const &l,string_key const &r)
{
return string_key::unowned(l) <= r;
}
inline bool operator>=(string_key const &l,char const *r)
{
return l>=string_key::unowned(r);
}
inline bool operator>=(char const *l,string_key const &r)
{
return string_key::unowned(l) >= r;
}
inline bool operator>=(string_key const &l,std::string const &r)
{
return l>=string_key::unowned(r);
}
inline bool operator>=(std::string const &l,string_key const &r)
{
return string_key::unowned(l) >= r;
}
inline bool operator<(string_key const &l,char const *r)
{
return l<string_key::unowned(r);
}
inline bool operator<(char const *l,string_key const &r)
{
return string_key::unowned(l) < r;
}
inline bool operator<(string_key const &l,std::string const &r)
{
return l<string_key::unowned(r);
}
inline bool operator<(std::string const &l,string_key const &r)
{
return string_key::unowned(l) < r;
}
inline bool operator>(string_key const &l,char const *r)
{
return l>string_key::unowned(r);
}
inline bool operator>(char const *l,string_key const &r)
{
return string_key::unowned(l) > r;
}
inline bool operator>(string_key const &l,std::string const &r)
{
return l>string_key::unowned(r);
}
inline bool operator>(std::string const &l,string_key const &r)
{
return string_key::unowned(l) > r;
}
}
#endif
MongoDB Logo MongoDB