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
|
// file : xsde/cxx/string-sequence-stl.cxx
// copyright : Copyright (c) 2005-2011 Code Synthesis Tools CC
// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
#include <xsde/cxx/string-sequence-stl.hxx>
#ifdef XSDE_CUSTOM_ALLOCATOR
# include <xsde/cxx/allocator.hxx>
#endif
namespace xsde
{
namespace cxx
{
void string_sequence::
clear ()
{
typedef std::string type;
for (size_t i = 0; i < size_; ++i)
static_cast<std::string*> (data_)[i].~type ();
size_ = 0;
}
#ifdef XSDE_EXCEPTIONS
void string_sequence::
copy (string_sequence& c) const
{
if (c.size_ != 0)
c.clear ();
c.reserve (size_);
for (; c.size_ < size_; ++c.size_)
{
new (static_cast<std::string*> (c.data_) + c.size_) std::string (
static_cast<std::string*> (data_)[c.size_]);
}
}
struct string_sequence_guard
{
string_sequence_guard (string_sequence* p) : p_ (p) {}
~string_sequence_guard ()
{
#ifndef XSDE_CUSTOM_ALLOCATOR
delete p_;
#else
if (p_ != 0)
{
p_->~string_sequence ();
cxx::free (p_);
}
#endif
}
void
release () { p_ = 0; }
private:
string_sequence* p_;
};
string_sequence* string_sequence::
_clone () const
{
#ifndef XSDE_CUSTOM_ALLOCATOR
string_sequence* c = new string_sequence;
#else
// Default string_sequence c-tor cannot throw so we don't need
// alloc_guard.
//
string_sequence* c = static_cast<string_sequence*> (
cxx::alloc (sizeof (string_sequence)));
new (c) string_sequence;
#endif
string_sequence_guard g (c);
_copy (*c);
g.release ();
return c;
}
#else
sequence_base::error string_sequence::
copy (string_sequence& c) const
{
if (c.size_ != 0)
c.clear ();
if (error r = c.reserve (size_))
return r;
for (; c.size_ < size_; ++c.size_)
{
new (static_cast<std::string*> (c.data_) + c.size_) std::string (
static_cast<std::string*> (data_)[c.size_]);
}
return error_none;
}
string_sequence* string_sequence::
_clone () const
{
#ifndef XSDE_CUSTOM_ALLOCATOR
string_sequence* c = new string_sequence;
#else
string_sequence* c = static_cast<string_sequence*> (
cxx::alloc (sizeof (string_sequence)));
#endif
if (c == 0)
return 0;
#ifdef XSDE_CUSTOM_ALLOCATOR
new (c) string_sequence;
#endif
if (!_copy (*c))
{
#ifndef XSDE_CUSTOM_ALLOCATOR
delete c;
#else
c->~string_sequence ();
cxx::free (c);
#endif
return 0;
}
return c;
}
#endif
#ifdef XSDE_EXCEPTIONS
struct guard
{
guard (std::string* p, size_t& n) : p_ (p), n_ (n) {}
~guard ()
{
typedef std::string type;
if (p_)
for (; n_ > 0; --n_)
p_[n_ - 1].~type ();
}
void
release () { p_ = 0; }
private:
std::string* p_;
size_t& n_;
};
void string_sequence::
move_ (void* dst, void* src, size_t n)
{
std::string* d = static_cast<std::string*> (dst);
std::string* s = static_cast<std::string*> (src);
// The copy c-tor can throw in which case we need to destroy
// whatever objects we already copied into d.
//
size_t i = 0;
guard g (d, i);
for (; i < n; i++)
new (d + i) std::string (s[i]);
g.release ();
typedef std::string type;
for (size_t j = 0; j < n; j++)
s[j].~type ();
}
#else
void string_sequence::
move_ (void* dst, void* src, size_t n)
{
std::string* d = static_cast<std::string*> (dst);
std::string* s = static_cast<std::string*> (src);
for (size_t i = 0; i < n; i++)
{
typedef std::string type;
new (d + i) std::string (s[i]);
s[i].~type ();
}
}
#endif
void string_sequence::
move_forward_ (void* p, size_t n)
{
// We are moving a sequence of elements one position to the left.
// The tricky part is to make sure we are in at least destructable
// state if things turn bad. We assume that there is a valid
// element at position p.
//
std::string* d = static_cast<std::string*> (p);
for (size_t i = 0; i < n; i++)
d[i] = d[i + 1];
typedef std::string type;
d[n].~type ();
}
#ifdef XSDE_EXCEPTIONS
void string_sequence::
move_backward_ (void* p, size_t n, size_t& size)
{
// We are moving a sequence of elements one position to the right.
// The tricky part is to make sure we are in at least destructable
// state if things turn bad.
//
std::string* d = static_cast<std::string*> (p);
std::string* e = d + n;
new (e) std::string;
size++;
for (size_t i = n; i > 0; i--)
d[i] = d[i - 1];
}
#else
void string_sequence::
move_backward_ (void* p, size_t n)
{
// We are moving a sequence of elements one position to the right.
//
std::string* d = static_cast<std::string*> (p);
std::string* e = d + n;
new (e) std::string;
for (size_t i = n; i > 0; i--)
d[i] = d[i - 1];
}
#endif
bool
operator== (const string_sequence& x, const string_sequence& y)
{
if (x.size () != y.size ())
return false;
for (string_sequence::const_iterator
xi (x.begin ()), yi (y.begin ()), xe (x.end ());
xi != xe; ++xi, ++yi)
{
if (*xi != *yi)
return false;
}
return true;
}
}
}
|
