1 mike 1.2 //%2005////////////////////////////////////////////////////////////////////////
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 //
12 // Permission is hereby granted, free of charge, to any person obtaining a copy
13 // of this software and associated documentation files (the "Software"), to
14 // deal in the Software without restriction, including without limitation the
15 // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
16 // sell copies of the Software, and to permit persons to whom the Software is
17 // furnished to do so, subject to the following conditions:
18 //
19 // THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN
20 // ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED
21 // "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
22 mike 1.2 // LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
23 // PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
24 // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
25 // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
26 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
27 //
28 //==============================================================================
29 //
30 // Author: Michael E. Brasher (mike-brasher@austin.rr.com -- Inova Europe)
31 //
32 //%/////////////////////////////////////////////////////////////////////////////
33
34 #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 mike 1.2 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
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 mike 1.2 void swap(Buffer& x);
65
66 size_t size() const;
67
68 size_t capacity() const;
69
70 const char* getData() const;
71
72 char get(size_t i) const;
73
74 void set(size_t i, char x);
75
76 const char& operator[](size_t i) const;
77
78 void reserveCapacity(size_t cap);
79
80 void grow(size_t size, char x = '\0');
81
82 void append(char x);
83
84 void append(const char* data, size_t size);
85 mike 1.2
86 void append(char c1, char c2, char c3, char c4);
87
88 void append(
89 char c1, char c2, char c3, char c4, char c5, char c6, char c7, char c8);
90
91 void insert(size_t pos, const char* data, size_t size);
92
93 void remove(size_t pos, size_t size);
94
95 void remove(size_t pos);
96
97 void clear();
98
99 private:
100
101 void _reserve_aux(size_t cap);
102
103 void _append_char_aux();
104
105 BufferRep* _rep;
106 mike 1.2 static BufferRep _empty_rep;
107 };
108
109 inline Buffer::Buffer() : _rep(&_empty_rep)
110 {
111 }
112
113 inline Buffer::~Buffer()
114 {
115 if (_rep != &_empty_rep)
116 free(_rep);
117 }
118
119 inline void Buffer::swap(Buffer& x)
120 {
121 BufferRep* tmp = _rep;
122 _rep = x._rep;
123 x._rep = tmp;
124 }
125
126 inline size_t Buffer::size() const
127 mike 1.2 {
128 return _rep->size;
129 }
130
131 inline size_t Buffer::capacity() const
132 {
133 return _rep->cap;
134 }
135
136 inline const char* Buffer::getData() const
137 {
138 return _rep->data;
139 }
140
141 inline char Buffer::get(size_t i) const
142 {
143 return _rep->data[i];
144 }
145
146 inline void Buffer::set(size_t i, char x)
147 {
148 mike 1.2 _rep->data[i] = x;
149 }
150
151 inline const char& Buffer::operator[](size_t i) const
152 {
153 return _rep->data[i];
154 }
155
156 inline void Buffer::reserveCapacity(size_t cap)
157 {
158 if (cap > _rep->cap)
159 _reserve_aux(cap);
160 }
161
162 inline void Buffer::grow(size_t size, char x)
163 {
164 size_t cap = _rep->size + size;
165
166 if (cap > _rep->cap)
167 _reserve_aux(cap);
168
169 mike 1.2 memset(_rep->data + _rep->size, x, size);
170 _rep->size += size;
171 }
172
173 inline void Buffer::append(char x)
174 {
175 if (_rep->size == _rep->cap)
176 _append_char_aux();
177
178 _rep->data[_rep->size++] = x;
179 }
180
181 inline void Buffer::append(const char* data, size_t size)
182 {
183 size_t cap = _rep->size + size;
184
185 if (cap > _rep->cap)
186 _reserve_aux(cap);
187
188 memcpy(_rep->data + _rep->size, data, size);
189 _rep->size += size;
190 mike 1.2 }
191
192 inline void Buffer::clear()
193 {
|
196 mike 1.2 }
197
198 inline void Buffer::remove(size_t pos)
199 {
200 remove(pos, 1);
201 }
202
203 inline void Buffer::append(char c1, char c2, char c3, char c4)
204 {
205 size_t cap = _rep->size + 4;
206
207 if (cap > _rep->cap)
208 _reserve_aux(cap);
209
210 char* p = _rep->data + _rep->size;
211 p[0] = c1;
212 p[1] = c2;
213 p[2] = c3;
214 p[3] = c4;
215 _rep->size += 4;
216 }
217 mike 1.2
218 inline void Buffer::append(
219 char c1, char c2, char c3, char c4, char c5, char c6, char c7, char c8)
220 {
221 size_t cap = _rep->size + 8;
222
223 if (cap > _rep->cap)
224 _reserve_aux(cap);
225
226 char* p = _rep->data + _rep->size;
227 p[0] = c1;
228 p[1] = c2;
229 p[2] = c3;
230 p[3] = c4;
231 p[4] = c5;
232 p[5] = c6;
233 p[6] = c7;
234 p[7] = c8;
235 _rep->size += 8;
236 }
237
238 mike 1.2 inline bool operator==(const Buffer& x, const Buffer& y)
239 {
240 return memcmp(x.getData(), y.getData(), x.size()) == 0;
241 }
242
243 PEGASUS_NAMESPACE_END
244
245 #endif /* Pegasus_Buffer_h */
|
Return to
Buffer.h
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / Common