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
|
// @file str.h
/* Copyright 2010 10gen Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#pragma once
/* Things in the mongoutils namespace
(1) are not database specific, rather, true utilities
(2) are cross platform
(3) may require boost headers, but not libs
(4) are clean and easy to use in any c++ project without pulling in lots of other stuff
Note: within this module, we use int for all offsets -- there are no unsigned offsets
and no size_t's. If you need 3 gigabyte long strings, don't use this module.
*/
#include <string>
#include <sstream>
#include "../../bson/util/builder.h"
namespace mongoutils {
namespace str {
typedef std::string string;
/** the idea here is to make one liners easy. e.g.:
return str::stream() << 1 << ' ' << 2;
since the following doesn't work:
(stringstream() << 1).str();
*/
class stream {
public:
mongo::StringBuilder ss;
template<class T>
stream& operator<<(const T& v) {
ss << v;
return *this;
}
operator std::string () const { return ss.str(); }
};
inline bool startsWith(const char *str, const char *prefix) {
const char *s = str;
const char *p = prefix;
while( *p ) {
if( *p != *s ) return false;
p++; s++;
}
return true;
}
inline bool startsWith(string s, string p) { return startsWith(s.c_str(), p.c_str()); }
inline bool endsWith(string s, string p) {
int l = p.size();
int x = s.size();
if( x < l ) return false;
return strncmp(s.c_str()+x-l, p.c_str(), l) == 0;
}
inline bool equals( const char * a , const char * b ) { return strcmp( a , b ) == 0; }
/** find char x, and return rest of string thereafter, or "" if not found */
inline const char * after(const char *s, char x) {
const char *p = strchr(s, x);
return (p != 0) ? p+1 : ""; }
inline string after(const string& s, char x) {
const char *p = strchr(s.c_str(), x);
return (p != 0) ? string(p+1) : ""; }
/** find string x, and return rest of string thereafter, or "" if not found */
inline const char * after(const char *s, const char *x) {
const char *p = strstr(s, x);
return (p != 0) ? p+strlen(x) : ""; }
inline string after(string s, string x) {
const char *p = strstr(s.c_str(), x.c_str());
return (p != 0) ? string(p+x.size()) : ""; }
/** @return true if s contains x */
inline bool contains(string s, string x) {
return strstr(s.c_str(), x.c_str()) != 0; }
inline bool contains(string s, char x) {
return strchr(s.c_str(), x) != 0; }
/** @return everything befor the character x, else entire string */
inline string before(const string& s, char x) {
const char *p = strchr(s.c_str(), x);
return (p != 0) ? s.substr(0, p-s.c_str()) : s; }
/** check if if strings share a common starting prefix
@return offset of divergence (or length if equal). 0=nothing in common. */
inline int shareCommonPrefix(const char *p, const char *q) {
int ofs = 0;
while( 1 ) {
if( *p == 0 || *q == 0 )
break;
if( *p != *q )
break;
p++; q++; ofs++;
}
return ofs; }
inline int shareCommonPrefix(const string &a, const string &b)
{ return shareCommonPrefix(a.c_str(), b.c_str()); }
/** string to unsigned. zero if not a number. can end with non-num chars */
inline unsigned toUnsigned(const string& a) {
unsigned x = 0;
const char *p = a.c_str();
while( 1 ) {
if( !isdigit(*p) )
break;
x = x * 10 + (*p - '0');
p++;
}
return x;
}
/** split a string on a specific char. We don't split N times, just once
on the first occurrence. If char not present entire string is in L
and R is empty.
@return true if char found
*/
inline bool splitOn(const string &s, char c, string& L, string& R) {
const char *start = s.c_str();
const char *p = strchr(start, c);
if( p == 0 ) {
L = s; R.clear();
return false;
}
L = string(start, p-start);
R = string(p+1);
return true;
}
/** split scanning reverse direction. Splits ONCE ONLY. */
inline bool rSplitOn(const string &s, char c, string& L, string& R) {
const char *start = s.c_str();
const char *p = strrchr(start, c);
if( p == 0 ) {
L = s; R.clear();
return false;
}
L = string(start, p-start);
R = string(p+1);
return true;
}
/** @return umber of occurrences of c in s */
inline unsigned count( const string& s , char c ){
unsigned n=0;
for ( unsigned i=0; i<s.size(); i++ )
if ( s[i] == c )
n++;
return n;
}
/** remove trailing chars in place */
inline bool stripTrailing(string& s, const char *chars) {
string::iterator i = s.end();
while( s.begin() != i ) {
i--;
if( contains(chars, *i) ) {
s.erase(i);
}
}
}
}
}
|
