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 // Author: Michael E. Brasher (mike-brasher@austin.rr.com -- Inova Europe)
33 //
34 mike 1.2 //%/////////////////////////////////////////////////////////////////////////////
35
36 #ifndef Pegasus_Buffer_h
37 #define Pegasus_Buffer_h
38
39 #include <Pegasus/Common/Config.h>
40 #include <Pegasus/Common/Linkage.h>
41 #include <cstring>
42
43 PEGASUS_NAMESPACE_BEGIN
44
45 struct BufferRep
46 {
47 size_t size;
48 size_t cap;
49 char data[1];
50 };
51
52 class PEGASUS_COMMON_LINKAGE Buffer
53 {
54 public:
55 mike 1.2
56 Buffer();
57
58 Buffer(const Buffer& x);
59
60 Buffer(const char* data, size_t size);
61
62 ~Buffer();
63
64 Buffer& operator=(const Buffer& x);
65
66 void swap(Buffer& x);
67
68 size_t size() const;
69
70 size_t capacity() const;
71
|
72 gs.keenan 1.4.2.1 /**
73 Returns a pointer to a character buffer with the Buffer contents.
74 The character buffer is null-terminated even if the Buffer contents
75 do not include a null termination character.
76 */
|
77 mike 1.2 const char* getData() const;
78
79 char get(size_t i) const;
80
81 void set(size_t i, char x);
82
83 const char& operator[](size_t i) const;
84
85 void reserveCapacity(size_t cap);
86
87 void grow(size_t size, char x = '\0');
88
89 void append(char x);
90
91 void append(const char* data, size_t size);
92
93 void append(char c1, char c2, char c3, char c4);
94
95 void append(
96 char c1, char c2, char c3, char c4, char c5, char c6, char c7, char c8);
97
98 mike 1.2 void insert(size_t pos, const char* data, size_t size);
99
100 void remove(size_t pos, size_t size);
101
102 void remove(size_t pos);
103
104 void clear();
105
106 private:
107
108 void _reserve_aux(size_t cap);
109
110 void _append_char_aux();
111
112 BufferRep* _rep;
113 static BufferRep _empty_rep;
114 };
115
116 inline Buffer::Buffer() : _rep(&_empty_rep)
117 {
118 }
119 mike 1.2
120 inline Buffer::~Buffer()
121 {
|
122 gs.keenan 1.4.2.1 if (_rep->cap != 0)
|
123 mike 1.2 free(_rep);
124 }
125
126 inline void Buffer::swap(Buffer& x)
127 {
128 BufferRep* tmp = _rep;
129 _rep = x._rep;
130 x._rep = tmp;
131 }
132
133 inline size_t Buffer::size() const
134 {
135 return _rep->size;
136 }
137
138 inline size_t Buffer::capacity() const
139 {
140 return _rep->cap;
141 }
142
143 inline const char* Buffer::getData() const
144 mike 1.2 {
|
145 gs.keenan 1.4.2.1 if (_rep->cap == 0)
146 {
147 const_cast<Buffer*>(this)->_append_char_aux();
148 }
149
150 _rep->data[_rep->size] = '\0';
151
|
152 mike 1.2 return _rep->data;
153 }
154
155 inline char Buffer::get(size_t i) const
156 {
157 return _rep->data[i];
158 }
159
160 inline void Buffer::set(size_t i, char x)
161 {
162 _rep->data[i] = x;
163 }
164
165 inline const char& Buffer::operator[](size_t i) const
166 {
167 return _rep->data[i];
168 }
169
170 inline void Buffer::reserveCapacity(size_t cap)
171 {
172 if (cap > _rep->cap)
173 mike 1.2 _reserve_aux(cap);
174 }
175
176 inline void Buffer::grow(size_t size, char x)
177 {
178 size_t cap = _rep->size + size;
179
180 if (cap > _rep->cap)
181 _reserve_aux(cap);
182
183 memset(_rep->data + _rep->size, x, size);
184 _rep->size += size;
185 }
186
187 inline void Buffer::append(char x)
188 {
189 if (_rep->size == _rep->cap)
190 _append_char_aux();
191
192 _rep->data[_rep->size++] = x;
193 }
194 mike 1.2
195 inline void Buffer::append(const char* data, size_t size)
196 {
197 size_t cap = _rep->size + size;
198
199 if (cap > _rep->cap)
200 _reserve_aux(cap);
201
202 memcpy(_rep->data + _rep->size, data, size);
203 _rep->size += size;
204 }
205
206 inline void Buffer::clear()
207 {
|
208 gs.keenan 1.4.2.1 if (_rep->cap != 0)
|
209 mike 1.3 _rep->size = 0;
|
210 mike 1.2 }
211
212 inline void Buffer::remove(size_t pos)
213 {
214 remove(pos, 1);
215 }
216
217 inline void Buffer::append(char c1, char c2, char c3, char c4)
218 {
219 size_t cap = _rep->size + 4;
220
221 if (cap > _rep->cap)
222 _reserve_aux(cap);
223
224 char* p = _rep->data + _rep->size;
225 p[0] = c1;
226 p[1] = c2;
227 p[2] = c3;
228 p[3] = c4;
229 _rep->size += 4;
230 }
231 mike 1.2
232 inline void Buffer::append(
233 char c1, char c2, char c3, char c4, char c5, char c6, char c7, char c8)
234 {
235 size_t cap = _rep->size + 8;
236
237 if (cap > _rep->cap)
238 _reserve_aux(cap);
239
240 char* p = _rep->data + _rep->size;
241 p[0] = c1;
242 p[1] = c2;
243 p[2] = c3;
244 p[3] = c4;
245 p[4] = c5;
246 p[5] = c6;
247 p[6] = c7;
248 p[7] = c8;
249 _rep->size += 8;
250 }
251
252 mike 1.2 inline bool operator==(const Buffer& x, const Buffer& y)
253 {
254 return memcmp(x.getData(), y.getData(), x.size()) == 0;
255 }
256
257 PEGASUS_NAMESPACE_END
258
259 #endif /* Pegasus_Buffer_h */
|
Return to
Buffer.h
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / Common