1 karl 1.4 //%2006////////////////////////////////////////////////////////////////////////
|
2 mike 1.2 //
3 // Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development
4 // Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems.
5 // Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.;
6 // IBM Corp.; EMC Corporation, The Open Group.
7 // Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.;
8 // IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group.
9 // Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.;
10 // EMC Corporation; VERITAS Software Corporation; The Open Group.
|
11 karl 1.4 // Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.;
12 // EMC Corporation; Symantec Corporation; The Open Group.
|
13 mike 1.2 //
14 // Permission is hereby granted, free of charge, to any person obtaining a copy
15 // of this software and associated documentation files (the "Software"), to
16 // deal in the Software without restriction, including without limitation the
17 // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
18 // sell copies of the Software, and to permit persons to whom the Software is
19 // furnished to do so, subject to the following conditions:
20 //
21 // THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN
22 // ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED
23 // "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
24 // LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
25 // PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
26 // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
27 // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
28 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
29 //
30 //==============================================================================
31 //
32 //%/////////////////////////////////////////////////////////////////////////////
33
34 mike 1.2 #ifndef Pegasus_Buffer_h
35 #define Pegasus_Buffer_h
36
37 #include <Pegasus/Common/Config.h>
38 #include <Pegasus/Common/Linkage.h>
39 #include <cstring>
40
41 PEGASUS_NAMESPACE_BEGIN
42
43 struct BufferRep
44 {
45 size_t size;
46 size_t cap;
47 char data[1];
48 };
49
50 class PEGASUS_COMMON_LINKAGE Buffer
51 {
52 public:
53
54 Buffer();
55 mike 1.2
56 Buffer(const Buffer& x);
57
58 Buffer(const char* data, size_t size);
59
60 ~Buffer();
61
62 Buffer& operator=(const Buffer& x);
63
64 void swap(Buffer& x);
65
66 size_t size() const;
67
68 size_t capacity() const;
69
|
70 kumpf 1.5 /**
71 Returns a pointer to a character buffer with the Buffer contents.
72 The character buffer is null-terminated even if the Buffer contents
73 do not include a null termination character.
74 */
|
75 mike 1.2 const char* getData() const;
76
77 char get(size_t i) const;
78
79 void set(size_t i, char x);
80
81 const char& operator[](size_t i) const;
82
83 void reserveCapacity(size_t cap);
84
85 void grow(size_t size, char x = '\0');
86
87 void append(char x);
88
89 void append(const char* data, size_t size);
90
91 void append(char c1, char c2, char c3, char c4);
92
93 void append(
|
94 kumpf 1.9 char c1, char c2, char c3, char c4, char c5, char c6, char c7, char c8);
|
95 mike 1.2
96 void insert(size_t pos, const char* data, size_t size);
97
98 void remove(size_t pos, size_t size);
99
100 void remove(size_t pos);
101
102 void clear();
103
104 private:
105
106 void _reserve_aux(size_t cap);
107
108 void _append_char_aux();
109
110 BufferRep* _rep;
111 static BufferRep _empty_rep;
112 };
113
114 inline Buffer::Buffer() : _rep(&_empty_rep)
115 {
116 mike 1.2 }
117
118 inline Buffer::~Buffer()
119 {
|
120 gs.keenan 1.6 if (_rep->cap != 0)
|
121 kumpf 1.9 free(_rep);
|
122 mike 1.2 }
123
124 inline void Buffer::swap(Buffer& x)
125 {
126 BufferRep* tmp = _rep;
127 _rep = x._rep;
128 x._rep = tmp;
129 }
130
131 inline size_t Buffer::size() const
132 {
133 return _rep->size;
134 }
135
136 inline size_t Buffer::capacity() const
137 {
138 return _rep->cap;
139 }
140
141 inline const char* Buffer::getData() const
142 {
|
143 gs.keenan 1.6 if (_rep->cap == 0)
|
144 kumpf 1.5 {
145 const_cast<Buffer*>(this)->_append_char_aux();
146 }
147
148 _rep->data[_rep->size] = '\0';
149
|
150 mike 1.2 return _rep->data;
151 }
152
153 inline char Buffer::get(size_t i) const
154 {
155 return _rep->data[i];
156 }
157
158 inline void Buffer::set(size_t i, char x)
159 {
160 _rep->data[i] = x;
161 }
162
163 inline const char& Buffer::operator[](size_t i) const
164 {
165 return _rep->data[i];
166 }
167
168 inline void Buffer::reserveCapacity(size_t cap)
169 {
170 if (cap > _rep->cap)
|
171 kumpf 1.9 _reserve_aux(cap);
|
172 mike 1.2 }
173
174 inline void Buffer::grow(size_t size, char x)
175 {
176 size_t cap = _rep->size + size;
177
178 if (cap > _rep->cap)
|
179 kumpf 1.9 _reserve_aux(cap);
|
180 mike 1.2
181 memset(_rep->data + _rep->size, x, size);
182 _rep->size += size;
183 }
184
185 inline void Buffer::append(char x)
186 {
187 if (_rep->size == _rep->cap)
|
188 kumpf 1.9 _append_char_aux();
|
189 mike 1.2
190 _rep->data[_rep->size++] = x;
191 }
192
193 inline void Buffer::append(const char* data, size_t size)
194 {
195 size_t cap = _rep->size + size;
196
197 if (cap > _rep->cap)
|
198 kumpf 1.9 _reserve_aux(cap);
|
199 mike 1.2
200 memcpy(_rep->data + _rep->size, data, size);
201 _rep->size += size;
202 }
203
204 inline void Buffer::clear()
205 {
|
206 gs.keenan 1.6 if (_rep->cap != 0)
|
207 kumpf 1.9 _rep->size = 0;
|
208 mike 1.2 }
209
210 inline void Buffer::remove(size_t pos)
211 {
212 remove(pos, 1);
213 }
214
215 inline void Buffer::append(char c1, char c2, char c3, char c4)
216 {
217 size_t cap = _rep->size + 4;
218
219 if (cap > _rep->cap)
|
220 kumpf 1.9 _reserve_aux(cap);
|
221 mike 1.2
222 char* p = _rep->data + _rep->size;
223 p[0] = c1;
224 p[1] = c2;
225 p[2] = c3;
226 p[3] = c4;
227 _rep->size += 4;
228 }
229
230 inline void Buffer::append(
231 char c1, char c2, char c3, char c4, char c5, char c6, char c7, char c8)
232 {
233 size_t cap = _rep->size + 8;
234
235 if (cap > _rep->cap)
|
236 kumpf 1.9 _reserve_aux(cap);
|
237 mike 1.2
238 char* p = _rep->data + _rep->size;
239 p[0] = c1;
240 p[1] = c2;
241 p[2] = c3;
242 p[3] = c4;
243 p[4] = c5;
244 p[5] = c6;
245 p[6] = c7;
246 p[7] = c8;
247 _rep->size += 8;
248 }
249
250 inline bool operator==(const Buffer& x, const Buffer& y)
251 {
252 return memcmp(x.getData(), y.getData(), x.size()) == 0;
253 }
254
255 PEGASUS_NAMESPACE_END
256
257 #endif /* Pegasus_Buffer_h */
|
Return to
Buffer.h
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / Common