|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
|
|
9 | * under the terms of the GNU General Public License as published by the Free |
|
|
10 | * Software Foundation; either version 2 of the License, or (at your option) |
|
|
11 | * any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, but |
|
|
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
|
|
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 | * for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License along |
|
|
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
|
|
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
|
|
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
|
|
23 | */ |
|
|
24 | |
1 | // |
25 | // |
2 | // cfperl.h perl interface |
26 | // cfperl.h perl interface |
3 | // |
27 | // |
4 | #ifndef CFPERL_H__ |
28 | #ifndef CFPERL_H__ |
5 | #define CFPERL_H__ |
29 | #define CFPERL_H__ |
… | |
… | |
294 | fadd (' '); |
318 | fadd (' '); |
295 | add (v); |
319 | add (v); |
296 | fadd ('\n'); |
320 | fadd ('\n'); |
297 | } |
321 | } |
298 | |
322 | |
299 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
300 | { |
|
|
301 | force (MAX_KEYWORD_LEN + 1); |
|
|
302 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
303 | |
|
|
304 | if (expect_true (v)) |
|
|
305 | { |
|
|
306 | add (v); |
|
|
307 | add ('\n'); |
|
|
308 | } |
|
|
309 | |
|
|
310 | force (MAX_KEYWORD_LEN + 1); |
|
|
311 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
312 | } |
|
|
313 | |
|
|
314 | void put (keyword k, float v) { put (k, (double)v); } |
323 | void put (keyword k, float v) { put (k, (double)v); } |
315 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
324 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
316 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
325 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
317 | void put (keyword k, signed short v) { put_(k, (sint32)v); } |
326 | void put (keyword k, signed short v) { put_(k, (sint32)v); } |
318 | void put (keyword k, unsigned short v) { put_(k, (sint32)v); } |
327 | void put (keyword k, unsigned short v) { put_(k, (sint32)v); } |
… | |
… | |
321 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
330 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
322 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
331 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
323 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
332 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
324 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
333 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
325 | |
334 | |
|
|
335 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
336 | { |
|
|
337 | force (MAX_KEYWORD_LEN + 1); |
|
|
338 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
339 | |
|
|
340 | if (expect_true (v)) |
|
|
341 | { |
|
|
342 | add (v); |
|
|
343 | add ('\n'); |
|
|
344 | } |
|
|
345 | |
|
|
346 | force (MAX_KEYWORD_LEN + 1); |
|
|
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
348 | } |
|
|
349 | |
326 | template<typename T> |
350 | template<typename T> |
327 | void put (keyword k, const T *v) |
351 | void put (keyword k, const T *v) |
328 | { |
352 | { |
329 | if (expect_true (v)) |
353 | if (v) |
330 | put (k, v->name); |
354 | put (k, v->name); |
331 | else |
355 | else |
332 | put (k, (const char *)0); |
356 | put (k, (const char *)0); |
333 | } |
357 | } |
334 | |
358 | |
… | |
… | |
365 | void get (attachable *obj, int oid); |
389 | void get (attachable *obj, int oid); |
366 | |
390 | |
367 | // parse next line |
391 | // parse next line |
368 | void next (); |
392 | void next (); |
369 | // skip the current key-value (usually fetch next line, for |
393 | // skip the current key-value (usually fetch next line, for |
370 | // multiline-fields, skips untilt he corresponding end-kw |
394 | // multiline-fields, skips till the corresponding end-kw |
371 | void skip (); |
395 | void skip (); |
372 | |
|
|
373 | //TODO: remove, deprecated |
|
|
374 | keyword get_kv () |
|
|
375 | { |
|
|
376 | next (); |
|
|
377 | return kw; |
|
|
378 | } |
|
|
379 | |
396 | |
380 | char *get_str () { return value; } // may be 0 |
397 | char *get_str () { return value; } // may be 0 |
381 | void get_ml (keyword kend, shstr &sh); |
398 | void get_ml (keyword kend, shstr &sh); |
382 | |
399 | |
383 | void get_ornull (shstr &sh) const { sh = value; } |
400 | void get_ornull (shstr &sh) const { sh = value; } |