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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
/* $Rev$ $Date$ */
#ifndef tuscany_string_hpp
#define tuscany_string_hpp
/**
* Simple and fast string type backed by a char buffer
*/
#include <assert.h>
#include <string.h>
#include <memory.h>
#include <stdio.h>
#include "gc.hpp"
namespace tuscany {
#ifdef WANT_MAINTAINER_MODE
/**
* Debug utilities. Counters used to track string copies.
*/
long countStringCopies = 0;
bool resetStringCopyCounters() {
countStringCopies = 0;
return true;
}
bool checkStringCopyCounters(long c) {
return countStringCopies == c;
}
bool printStringCopyCounters() {
printf("countStringCopies %ld\n", countStringCopies);
return true;
}
#else
#define resetStringCopyCounters()
#define checkStringCopyCounters(c) true
#define printStringCopyCounters()
#endif
/**
* Instrumented memcpy.
*/
void* string_memcpy(void* t, const void* s, const size_t n) {
#ifdef WANT_MAINTAINER_MODE
countStringCopies += 1;
#endif
return memcpy(t, s, n);
}
char stringEmptyBuffer[1] = { '\0' };
/**
* String class. The maximum string size is specified as a template parameter.
*/
class string {
public:
string() : len(0) {
buf = stringEmptyBuffer;
}
string(const char* s) {
len = strlen(s);
if (len == 0) {
buf = stringEmptyBuffer;
return;
}
buf = gc_cnew(len + 1);
string_memcpy(buf, s, len + 1);
}
string(const char* s, const size_t n) {
len = n;
if (len == 0) {
buf = stringEmptyBuffer;
return;
}
buf = gc_cnew(len + 1);
string_memcpy(buf, s, len);
buf[len] = '\0';
}
string(const size_t n, const char c) {
len = n;
if (len == 0) {
buf = stringEmptyBuffer;
return;
}
buf = gc_cnew(len + 1);
memset(buf, c, n);
buf[len] = '\0';
}
string(const string& s) {
len = s.len;
buf = s.buf;
}
const string& operator=(const string& s) {
if (&s == this)
return *this;
len = s.len;
buf = s.buf;
return *this;
}
const bool operator==(const string& s) const {
if (len != s.len)
return false;
if (buf == s.buf)
return true;
return memcmp(buf, s.buf, len) == 0;
}
const bool operator!=(const string& s) const {
return !(*this == s);
}
const bool operator==(const char* s) const {
if (buf == s)
return true;
return strcmp(buf, s) == 0;
}
const bool operator!=(const char* s) const {
return !(*this == s);
}
const bool operator<(const string& s) const {
const size_t n = len < s.len? len : s.len;
const int c = memcmp(buf, s.buf, n);
if (c < 0)
return true;
if (c == 0)
return len < s.len;
return false;
}
const bool operator>(const string& s) const {
const size_t n = len < s.len? len : s.len;
int c = memcmp(buf, s.buf, n);
if (c > 0)
return true;
if (c == 0)
return len > s.len;
return false;
}
private:
#ifdef WANT_MAINTAINER_MODE
friend class odebugstream;
#endif
friend class ostringstream;
friend const string operator+(const string& a, const string& b);
friend const string operator+(const string& a, const char* b);
friend const size_t length(const string& s);
friend const char* c_str(const string& s);
friend const size_t find(const string& s1, const char* s2, const size_t start);
friend const string substr(const string& s, const size_t pos, const size_t n);
size_t len;
char* buf;
};
/**
* Adds two strings.
*/
const string operator+(const string& a, const string& b) {
string s;
s.len = a.len + b.len;
s.buf = gc_cnew(s.len + 1);
string_memcpy(s.buf, a.buf, a.len);
string_memcpy(s.buf + a.len, b.buf, b.len);
s.buf[s.len] = '\0';
return s;
}
const string operator+(const string& a, const char* b) {
string s;
const size_t blen = strlen(b);
s.len = a.len + blen;
s.buf = gc_cnew(s.len + 1);
string_memcpy(s.buf, a.buf, a.len);
string_memcpy(s.buf + a.len, b, blen);
s.buf[s.len] = '\0';
return s;
}
/**
* Returns the length of a string.
*/
const size_t length(const string& s) {
return s.len;
}
/**
* Returns a string as a C zero terminated string.
*/
const char* c_str(const string& s) {
return s.buf;
}
/**
* Find the first occurrence of string s2 in s1, starting at the given position.
*/
const size_t find(const string& s1, const char* s2, const size_t start) {
if (start >= s1.len)
return s1.len;
const char *f = strstr(s1.buf + start, s2);
if (f == NULL)
return s1.len;
return f - s1.buf;
}
const size_t find(const string& s1, const char* s2) {
return find(s1, s2, 0);
}
/**
* Return true if string s1 contains s2.
*/
const bool contains(const string& s1, const char* s2) {
return find(s1, s2) != length(s1);
}
/**
* Find the first occurence of any character from a string in a string.
*/
const size_t find_first_of(const string& s1, const string& s2) {
return strcspn(c_str(s1), c_str(s2));
}
/**
* Find the first occurence of a character in a string.
*/
const size_t find(const string& s, const char c) {
const char* cs = c_str(s);
const char* f = strchr(cs, c);
if (f == NULL)
return length(s);
return f - cs;
}
/**
* Find the last occurence of a character in a string.
*/
const size_t find_last(const string& s, const char c) {
const char* cs = c_str(s);
const char* f = strrchr(cs, c);
if (f == NULL)
return length(s);
return f - cs;
}
/**
* Return a substring of a string.
*/
const string substr(const string& s, const size_t pos, const size_t n) {
if (pos >= s.len)
return string();
if (pos + n > s.len)
return string(s.buf + pos, s.len - pos);
return string(s.buf + pos, n);
}
const string substr(const string& s, const size_t pos) {
return substr(s, pos, length(s));
}
/**
* Common string constants.
*/
string trueString("true");
string falseString("false");
string emptyString("");
}
#endif /* tuscany_string_hpp */
|