… | |
… | |
263 | |
263 | |
264 | add ('\n'); |
264 | add ('\n'); |
265 | } |
265 | } |
266 | |
266 | |
267 | template<typename T> |
267 | template<typename T> |
268 | void put_string (keyword k, const T &v) |
268 | void put_kw_string (keyword k, const T &v) |
269 | { |
269 | { |
270 | int klen = keyword_len [k]; |
270 | int klen = keyword_len [k]; |
271 | int vlen = v ? strlen (v) + 1 : 0; |
271 | int vlen = v ? strlen (v) + 1 : 0; |
272 | |
272 | |
273 | char *p = (char *)alloc (klen + vlen + 1); |
273 | char *p = (char *)alloc (klen + vlen + 1); |
… | |
… | |
283 | *p = '\n'; |
283 | *p = '\n'; |
284 | } |
284 | } |
285 | |
285 | |
286 | void put (keyword k, const char *v = 0) |
286 | void put (keyword k, const char *v = 0) |
287 | { |
287 | { |
288 | put_string (k, v); |
288 | put_kw_string (k, v); |
289 | } |
289 | } |
290 | |
290 | |
291 | void put (keyword k, const shstr &v) |
291 | void put (keyword k, const shstr &v) |
292 | { |
292 | { |
293 | put_string (k, v); |
293 | put_kw_string (k, v); |
294 | } |
294 | } |
295 | |
295 | |
296 | void put (keyword k, double v) |
296 | void put (keyword k, double v) |
297 | { |
297 | { |
298 | force (MAX_KEYWORD_LEN + 2 + 32); |
298 | force (MAX_KEYWORD_LEN + 2 + 32); |
… | |
… | |
345 | |
345 | |
346 | force (MAX_KEYWORD_LEN + 1); |
346 | force (MAX_KEYWORD_LEN + 1); |
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
348 | } |
348 | } |
349 | |
349 | |
350 | template<typename T> |
350 | void put (keyword k, archetype *v); |
|
|
351 | void put (keyword k, treasurelist *v); |
351 | void put (keyword k, const T *v) |
352 | void put (keyword k, faceinfo *v); |
352 | { |
|
|
353 | put (k, v ? &v->name : (const char *)0); |
|
|
354 | } |
|
|
355 | |
353 | |
356 | template<typename T> |
354 | template<typename T> |
357 | void put (keyword k, const refptr<T> &v) |
355 | void put (keyword k, const refptr<T> &v) |
358 | { |
356 | { |
359 | put (k, (T *)v); |
357 | put (k, (T *)v); |