| … | |
… | |
| 3 | * |
3 | * |
| 4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 | * |
7 | * |
| 8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
| 9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
| 10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
| 11 | * (at your option) any later version. |
11 | * option) any later version. |
| 12 | * |
12 | * |
| 13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
| 17 | * |
17 | * |
| 18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
| 19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
| 20 | * |
21 | * |
| 21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
23 | */ |
| 23 | |
24 | |
| 24 | #ifndef DYNBUF_H__ |
25 | #ifndef DYNBUF_H__ |
| … | |
… | |
| 48 | }; |
49 | }; |
| 49 | |
50 | |
| 50 | char *ptr, *end; |
51 | char *ptr, *end; |
| 51 | int _size; |
52 | int _size; |
| 52 | |
53 | |
| 53 | int extend; |
54 | int extend, cextend; |
| 54 | chunk *first, *last; |
55 | chunk *first, *last; |
| 55 | |
56 | |
| 56 | void reserve (int size); |
57 | void reserve (int size); |
| 57 | void init (int initial); // allocate sinitial chunk |
58 | void init (int initial); // allocate sinitial chunk |
| 58 | void free (chunk *&chain); // free chain of chunks |
59 | void free (chunk *&chain); // free chain of chunks |
| … | |
… | |
| 132 | void add (const char *s) |
133 | void add (const char *s) |
| 133 | { |
134 | { |
| 134 | add (s, strlen (s)); |
135 | add (s, strlen (s)); |
| 135 | } |
136 | } |
| 136 | |
137 | |
| 137 | void add (const shstr &s) |
138 | void add (shstr_tmp s) |
| 138 | { |
139 | { |
| 139 | add (s.s, s.length ()); |
140 | add (s.s, s.length ()); |
| 140 | } |
141 | } |
| 141 | |
142 | |
| 142 | //TODO |
143 | //TODO |
| 143 | //void add_destructive (dynbuf &buf); |
144 | //void add_destructive (dynbuf &buf); |
| 144 | |
145 | |
| 145 | dynbuf &operator << (char c) { add (c); return *this; } |
146 | dynbuf &operator << (char c) { add (c); return *this; } |
| 146 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
147 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
| 147 | dynbuf &operator << (const char *s) { add (s); return *this; } |
148 | dynbuf &operator << (const char *s) { add (s); return *this; } |
| 148 | dynbuf &operator << (const shstr &s) { add (s); return *this; } |
149 | dynbuf &operator << (shstr_tmp s) { add (s); return *this; } |
| 149 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
150 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
| 150 | |
151 | |
| 151 | operator std::string (); |
152 | operator std::string (); |
| 152 | }; |
153 | }; |
| 153 | |
154 | |
| … | |
… | |
| 161 | void add (sint32 i); |
162 | void add (sint32 i); |
| 162 | void add (sint64 i); |
163 | void add (sint64 i); |
| 163 | |
164 | |
| 164 | //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often |
165 | //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often |
| 165 | |
166 | |
| 166 | //using dynbuf::operator <<; // doesn't work, sometiems C++ just suxx |
167 | //using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx |
| 167 | // instead we use an ugly template function |
168 | // instead we use an ugly template function |
| 168 | template<typename T> |
169 | template<typename T> |
| 169 | dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; } |
170 | dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; } |
| 170 | |
171 | |
| 171 | dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; } |
172 | dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; } |
