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