forked from artyom-beilis/cppcms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstring_key.h
More file actions
493 lines (453 loc) · 9.57 KB
/
Copy pathstring_key.h
File metadata and controls
493 lines (453 loc) · 9.57 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
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
///////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2008-2012 Artyom Beilis (Tonkikh) <[email protected]>
//
// See accompanying file COPYING.TXT file for licensing details.
//
///////////////////////////////////////////////////////////////////////////////
#ifndef CPPCMS_STRING_KEY_H
#define CPPCMS_STRING_KEY_H
#include <string>
#include <string.h>
#include <algorithm>
#include <stdexcept>
#include <ostream>
namespace cppcms {
///
/// \brief This is a special object that may hold an std::string or
/// alternatively reference to external (unowned) chunk of text
///
/// It is designed to be used for efficiency and reduce amount of
/// memory allocations and copies.
///
/// It has interface that is roughly similar to the interface of std::string,
/// but it does not provide a members that can mutate it or provide a NUL terminated
/// string c_str().
///
class string_key {
public:
///
/// Iterator type
///
typedef char const *const_iterator;
///
/// The last position of the character in the string
///
static const size_t npos = -1;
///
/// Default constructor - empty key
///
string_key() :
begin_(0),
end_(0)
{
}
///
/// Create a new string copying the \a key
///
string_key(char const *key) :
begin_(0),
end_(0),
key_(key)
{
}
///
/// Create a new string copying the \a key
///
string_key(std::string const &key) :
begin_(0),
end_(0),
key_(key)
{
}
///
/// String size in bytes
///
size_t size() const
{
return end() - begin();
}
///
/// Same as size()
///
size_t length() const
{
return size();
}
///
/// Clear the string
///
void clear()
{
begin_ = end_ = 0;
key_.clear();
}
///
/// Check if the string is empty
///
bool empty() const
{
return end() == begin();
}
///
/// Find first occurrence of a character \c in the string starting from
/// position \a pos. Returns npos if not character found.
///
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;
}
///
/// Create a substring from this string starting from character \a pos of size at most \a n
///
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()));
}
///
/// Create a substring from this string starting from character \a pos of size at most \a n
/// such that the memory is not copied but only reference by the created substring
///
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);
}
}
///
/// Get a character at position \a n
///
char const &operator[](size_t n) const
{
return *(begin() + n);
}
///
/// Get a character at position \a n, if \a n is not valid position, throws std::out_of_range exception
///
char const &at(size_t n) const
{
if(n > size())
throw std::out_of_range("cppcms::string_key::at() range error");
return *(begin() + n);
}
///
/// Create a string from \a v without copying the memory. \a v should remain valid
/// as long as this object is used
///
static string_key unowned(std::string const &v)
{
return string_key(v.c_str(),v.c_str()+v.size());
}
///
/// Create a string from \a str without copying the memory. \a str should remain valid
/// as long as this object is used
///
static string_key unowned(char const *str)
{
char const *end = str;
while(*end)
end++;
return string_key(str,end);
}
///
/// Create a string from \a characters at rang [begin,end) without copying the memory.
/// The range should remain valid as long as this object is used
///
static string_key unowned(char const *begin,char const *end)
{
return string_key(begin,end);
}
///
/// Get a pointer to the first character in the string
///
char const *begin() const
{
if(begin_)
return begin_;
return key_.c_str();
}
///
/// Get a pointer to the one past last character in the string
///
char const *end() const
{
if(begin_)
return end_;
return key_.c_str() + key_.size();
}
///
/// Compare two strings
///
bool operator<(string_key const &other) const
{
return std::lexicographical_compare( begin(),end(),
other.begin(),other.end(),
std::char_traits<char>::lt);
}
///
/// Compare two strings
///
bool operator>(string_key const &other) const
{
return other < *this;
}
///
/// Compare two strings
///
bool operator>=(string_key const &other) const
{
return !(*this < other);
}
///
/// Compare two strings
///
bool operator<=(string_key const &other) const
{
return !(*this > other);
}
///
/// Compare two strings
///
bool operator==(string_key const &other) const
{
return (end() - begin() == other.end() - other.begin())
&& memcmp(begin(),other.begin(),end()-begin()) == 0;
}
///
/// Compare two strings
///
bool operator!=(string_key const &other) const
{
return !(*this==other);
}
///
/// Get the pointer to the first character in the string. Note it should not be NUL terminated
///
char const *data() const
{
return begin();
}
///
/// Create std::string from the key
///
std::string str() const
{
if(begin_)
return std::string(begin_,end_-begin_);
else
return key_;
}
///
/// Convert the key to the std::string
///
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_;
};
///
/// Write the string to the stream
///
inline std::ostream &operator<<(std::ostream &out,string_key const &s)
{
out.write(s.data(),s.size());
return out;
}
///
/// Compare two strings
///
inline bool operator==(string_key const &l,char const *r)
{
return l==string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator==(char const *l,string_key const &r)
{
return string_key::unowned(l) == r;
}
///
/// Compare two strings
///
inline bool operator==(string_key const &l,std::string const &r)
{
return l==string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator==(std::string const &l,string_key const &r)
{
return string_key::unowned(l) == r;
}
///
/// Compare two strings
///
inline bool operator!=(string_key const &l,char const *r)
{
return l!=string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator!=(char const *l,string_key const &r)
{
return string_key::unowned(l) != r;
}
///
/// Compare two strings
///
inline bool operator!=(string_key const &l,std::string const &r)
{
return l!=string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator!=(std::string const &l,string_key const &r)
{
return string_key::unowned(l) != r;
}
///
/// Compare two strings
///
inline bool operator<=(string_key const &l,char const *r)
{
return l<=string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator<=(char const *l,string_key const &r)
{
return string_key::unowned(l) <= r;
}
///
/// Compare two strings
///
inline bool operator<=(string_key const &l,std::string const &r)
{
return l<=string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator<=(std::string const &l,string_key const &r)
{
return string_key::unowned(l) <= r;
}
///
/// Compare two strings
///
inline bool operator>=(string_key const &l,char const *r)
{
return l>=string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator>=(char const *l,string_key const &r)
{
return string_key::unowned(l) >= r;
}
///
/// Compare two strings
///
inline bool operator>=(string_key const &l,std::string const &r)
{
return l>=string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator>=(std::string const &l,string_key const &r)
{
return string_key::unowned(l) >= r;
}
///
/// Compare two strings
///
inline bool operator<(string_key const &l,char const *r)
{
return l<string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator<(char const *l,string_key const &r)
{
return string_key::unowned(l) < r;
}
///
/// Compare two strings
///
inline bool operator<(string_key const &l,std::string const &r)
{
return l<string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator<(std::string const &l,string_key const &r)
{
return string_key::unowned(l) < r;
}
///
/// Compare two strings
///
inline bool operator>(string_key const &l,char const *r)
{
return l>string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator>(char const *l,string_key const &r)
{
return string_key::unowned(l) > r;
}
///
/// Compare two strings
///
inline bool operator>(string_key const &l,std::string const &r)
{
return l>string_key::unowned(r);
}
///
/// Compare two strings
///
inline bool operator>(std::string const &l,string_key const &r)
{
return string_key::unowned(l) > r;
}
}
#endif