1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
6 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * the terms of the Affero GNU General Public License as published by the |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
10 | * option) any later version. |
10 | * |
11 | * |
11 | * This program is distributed in the hope that it will be useful, |
12 | * This program is distributed in the hope that it will be useful, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
15 | * GNU General Public License for more details. |
15 | * |
16 | * |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * You should have received a copy of the Affero GNU General Public License |
17 | * and the GNU General Public License along with this program. If not, see |
18 | * and the GNU General Public License along with this program. If not, see |
18 | * <http://www.gnu.org/licenses/>. |
19 | * <http://www.gnu.org/licenses/>. |
19 | * |
20 | * |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
22 | */ |
22 | |
23 | |
23 | #ifndef UTIL_H__ |
24 | #ifndef UTIL_H__ |
24 | #define UTIL_H__ |
25 | #define UTIL_H__ |
… | |
… | |
55 | #endif |
56 | #endif |
56 | |
57 | |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
58 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
59 | |
60 | |
60 | #if cplusplus_does_not_suck |
61 | #if cplusplus_does_not_suck /* still sucks in codesize with gcc 6, although local types work now */ |
61 | // does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm) |
62 | // does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm) |
62 | template<typename T, int N> |
63 | template<typename T, int N> |
63 | static inline int array_length (const T (&arr)[N]) |
64 | static inline int array_length (const T (&arr)[N]) |
64 | { |
65 | { |
65 | return N; |
66 | return N; |
… | |
… | |
81 | |
82 | |
82 | // in range excluding end |
83 | // in range excluding end |
83 | #define IN_RANGE_EXC(val,beg,end) \ |
84 | #define IN_RANGE_EXC(val,beg,end) \ |
84 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
85 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
85 | |
86 | |
86 | void cleanup (const char *cause, bool make_core = false); |
87 | ecb_cold void cleanup (const char *cause, bool make_core = false); |
87 | void fork_abort (const char *msg); |
88 | ecb_cold void fork_abort (const char *msg); |
88 | |
89 | |
89 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
90 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
90 | // as a is often a constant while b is the variable. it is still a bug, though. |
91 | // as a is often a constant while b is the variable. it is still a bug, though. |
91 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
92 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
92 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
93 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
93 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
94 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
94 | |
95 | |
95 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
96 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
96 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
97 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
97 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); } |
98 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); } |
… | |
… | |
114 | |
115 | |
115 | // sign0 returns -1, 0 or +1 |
116 | // sign0 returns -1, 0 or +1 |
116 | template<typename T> |
117 | template<typename T> |
117 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
118 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
118 | |
119 | |
|
|
120 | //clashes with C++0x |
119 | template<typename T, typename U> |
121 | template<typename T, typename U> |
120 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
122 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
121 | |
123 | |
122 | // div* only work correctly for div > 0 |
124 | // div* only work correctly for div > 0 |
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
125 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
… | |
… | |
236 | #if 0 |
238 | #if 0 |
237 | // and has a max. error of 6 in the range -100..+100. |
239 | // and has a max. error of 6 in the range -100..+100. |
238 | #else |
240 | #else |
239 | // and has a max. error of 9 in the range -100..+100. |
241 | // and has a max. error of 9 in the range -100..+100. |
240 | #endif |
242 | #endif |
241 | inline int |
243 | inline int |
242 | idistance (int dx, int dy) |
244 | idistance (int dx, int dy) |
243 | { |
245 | { |
244 | unsigned int dx_ = abs (dx); |
246 | unsigned int dx_ = abs (dx); |
245 | unsigned int dy_ = abs (dy); |
247 | unsigned int dy_ = abs (dy); |
246 | |
248 | |
247 | #if 0 |
249 | #if 0 |
248 | return dx_ > dy_ |
250 | return dx_ > dy_ |
… | |
… | |
251 | #else |
253 | #else |
252 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
254 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
253 | #endif |
255 | #endif |
254 | } |
256 | } |
255 | |
257 | |
|
|
258 | // can be substantially faster than floor, if your value range allows for it |
|
|
259 | template<typename T> |
|
|
260 | inline T |
|
|
261 | fastfloor (T x) |
|
|
262 | { |
|
|
263 | return std::floor (x); |
|
|
264 | } |
|
|
265 | |
|
|
266 | inline float |
|
|
267 | fastfloor (float x) |
|
|
268 | { |
|
|
269 | return sint32(x) - (x < 0); |
|
|
270 | } |
|
|
271 | |
|
|
272 | inline double |
|
|
273 | fastfloor (double x) |
|
|
274 | { |
|
|
275 | return sint64(x) - (x < 0); |
|
|
276 | } |
|
|
277 | |
256 | /* |
278 | /* |
257 | * absdir(int): Returns a number between 1 and 8, which represent |
279 | * absdir(int): Returns a number between 1 and 8, which represent |
258 | * the "absolute" direction of a number (it actually takes care of |
280 | * the "absolute" direction of a number (it actually takes care of |
259 | * "overflow" in previous calculations of a direction). |
281 | * "overflow" in previous calculations of a direction). |
260 | */ |
282 | */ |
… | |
… | |
262 | absdir (int d) |
284 | absdir (int d) |
263 | { |
285 | { |
264 | return ((d - 1) & 7) + 1; |
286 | return ((d - 1) & 7) + 1; |
265 | } |
287 | } |
266 | |
288 | |
267 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
268 | #if GCC_VERSION(3,4) |
|
|
269 | static inline int least_significant_bit (uint32_t x) |
|
|
270 | { |
|
|
271 | return __builtin_ctz (x); |
|
|
272 | } |
|
|
273 | #else |
|
|
274 | int least_significant_bit (uint32_t x); |
|
|
275 | #endif |
|
|
276 | |
|
|
277 | #define for_all_bits_sparse_32(mask, idxvar) \ |
289 | #define for_all_bits_sparse_32(mask, idxvar) \ |
278 | for (uint32_t idxvar, mask_ = mask; \ |
290 | for (uint32_t idxvar, mask_ = mask; \ |
279 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
291 | mask_ && ((idxvar = ecb_ctz32 (mask_)), mask_ &= ~(1 << idxvar), 1);) |
280 | |
292 | |
281 | extern ssize_t slice_alloc; // statistics |
293 | extern ssize_t slice_alloc; // statistics |
282 | |
294 | |
283 | void *salloc_ (int n) throw (std::bad_alloc); |
295 | void *salloc_ (int n); |
284 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
296 | void *salloc_ (int n, void *src); |
285 | |
297 | |
286 | // strictly the same as g_slice_alloc, but never returns 0 |
298 | // strictly the same as g_slice_alloc, but never returns 0 |
287 | template<typename T> |
299 | template<typename T> |
288 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
300 | inline T *salloc (int n = 1) { return (T *)salloc_ (n * sizeof (T)); } |
289 | |
301 | |
290 | // also copies src into the new area, like "memdup" |
302 | // also copies src into the new area, like "memdup" |
291 | // if src is 0, clears the memory |
303 | // if src is 0, clears the memory |
292 | template<typename T> |
304 | template<typename T> |
293 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
305 | inline T *salloc (int n, T *src) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
294 | |
306 | |
295 | // clears the memory |
307 | // clears the memory |
296 | template<typename T> |
308 | template<typename T> |
297 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
309 | inline T *salloc0(int n = 1) { return (T *)salloc_ (n * sizeof (T), 0); } |
298 | |
310 | |
299 | // for symmetry |
311 | // for symmetry |
300 | template<typename T> |
312 | template<typename T> |
301 | inline void sfree (T *ptr, int n = 1) throw () |
313 | inline void sfree (T *ptr, int n = 1) noexcept |
302 | { |
314 | { |
303 | if (expect_true (ptr)) |
315 | if (expect_true (ptr)) |
304 | { |
316 | { |
305 | slice_alloc -= n * sizeof (T); |
317 | slice_alloc -= n * sizeof (T); |
306 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
318 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
307 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
319 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
308 | assert (slice_alloc >= 0);//D |
|
|
309 | } |
320 | } |
310 | } |
321 | } |
311 | |
322 | |
312 | // nulls the pointer |
323 | // nulls the pointer |
313 | template<typename T> |
324 | template<typename T> |
314 | inline void sfree0 (T *&ptr, int n = 1) throw () |
325 | inline void sfree0 (T *&ptr, int n = 1) noexcept |
315 | { |
326 | { |
316 | sfree<T> (ptr, n); |
327 | sfree<T> (ptr, n); |
317 | ptr = 0; |
328 | ptr = 0; |
318 | } |
329 | } |
319 | |
330 | |
… | |
… | |
387 | typedef const Tp *const_pointer; |
398 | typedef const Tp *const_pointer; |
388 | typedef Tp &reference; |
399 | typedef Tp &reference; |
389 | typedef const Tp &const_reference; |
400 | typedef const Tp &const_reference; |
390 | typedef Tp value_type; |
401 | typedef Tp value_type; |
391 | |
402 | |
392 | template <class U> |
403 | template <class U> |
393 | struct rebind |
404 | struct rebind |
394 | { |
405 | { |
395 | typedef slice_allocator<U> other; |
406 | typedef slice_allocator<U> other; |
396 | }; |
407 | }; |
397 | |
408 | |
398 | slice_allocator () throw () { } |
409 | slice_allocator () noexcept { } |
399 | slice_allocator (const slice_allocator &) throw () { } |
410 | slice_allocator (const slice_allocator &) noexcept { } |
400 | template<typename Tp2> |
411 | template<typename Tp2> |
401 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
412 | slice_allocator (const slice_allocator<Tp2> &) noexcept { } |
402 | |
413 | |
403 | ~slice_allocator () { } |
414 | ~slice_allocator () { } |
404 | |
415 | |
405 | pointer address (reference x) const { return &x; } |
416 | pointer address (reference x) const { return &x; } |
406 | const_pointer address (const_reference x) const { return &x; } |
417 | const_pointer address (const_reference x) const { return &x; } |
… | |
… | |
413 | void deallocate (pointer p, size_type n) |
424 | void deallocate (pointer p, size_type n) |
414 | { |
425 | { |
415 | sfree<Tp> (p, n); |
426 | sfree<Tp> (p, n); |
416 | } |
427 | } |
417 | |
428 | |
418 | size_type max_size () const throw () |
429 | size_type max_size () const noexcept |
419 | { |
430 | { |
420 | return size_t (-1) / sizeof (Tp); |
431 | return size_t (-1) / sizeof (Tp); |
421 | } |
432 | } |
422 | |
433 | |
423 | void construct (pointer p, const Tp &val) |
434 | void construct (pointer p, const Tp &val) |
… | |
… | |
426 | } |
437 | } |
427 | |
438 | |
428 | void destroy (pointer p) |
439 | void destroy (pointer p) |
429 | { |
440 | { |
430 | p->~Tp (); |
441 | p->~Tp (); |
|
|
442 | } |
|
|
443 | }; |
|
|
444 | |
|
|
445 | // basically a memory area, but refcounted |
|
|
446 | struct refcnt_buf |
|
|
447 | { |
|
|
448 | char *data; |
|
|
449 | |
|
|
450 | refcnt_buf (size_t size = 0); |
|
|
451 | refcnt_buf (void *data, size_t size); |
|
|
452 | |
|
|
453 | refcnt_buf (const refcnt_buf &src) |
|
|
454 | { |
|
|
455 | data = src.data; |
|
|
456 | inc (); |
|
|
457 | } |
|
|
458 | |
|
|
459 | ~refcnt_buf (); |
|
|
460 | |
|
|
461 | refcnt_buf &operator =(const refcnt_buf &src); |
|
|
462 | |
|
|
463 | operator char *() |
|
|
464 | { |
|
|
465 | return data; |
|
|
466 | } |
|
|
467 | |
|
|
468 | size_t size () const |
|
|
469 | { |
|
|
470 | return _size (); |
|
|
471 | } |
|
|
472 | |
|
|
473 | protected: |
|
|
474 | enum { |
|
|
475 | overhead = sizeof (uint32_t) * 2 |
|
|
476 | }; |
|
|
477 | |
|
|
478 | uint32_t &_size () const |
|
|
479 | { |
|
|
480 | return ((unsigned int *)data)[-2]; |
|
|
481 | } |
|
|
482 | |
|
|
483 | uint32_t &_refcnt () const |
|
|
484 | { |
|
|
485 | return ((unsigned int *)data)[-1]; |
|
|
486 | } |
|
|
487 | |
|
|
488 | void _alloc (uint32_t size) |
|
|
489 | { |
|
|
490 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
|
|
491 | _size () = size; |
|
|
492 | _refcnt () = 1; |
|
|
493 | } |
|
|
494 | |
|
|
495 | void _dealloc (); |
|
|
496 | |
|
|
497 | void inc () |
|
|
498 | { |
|
|
499 | ++_refcnt (); |
|
|
500 | } |
|
|
501 | |
|
|
502 | void dec () |
|
|
503 | { |
|
|
504 | if (!--_refcnt ()) |
|
|
505 | _dealloc (); |
431 | } |
506 | } |
432 | }; |
507 | }; |
433 | |
508 | |
434 | INTERFACE_CLASS (attachable) |
509 | INTERFACE_CLASS (attachable) |
435 | struct refcnt_base |
510 | struct refcnt_base |
… | |
… | |
452 | // p if not null |
527 | // p if not null |
453 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
528 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
454 | |
529 | |
455 | void refcnt_dec () |
530 | void refcnt_dec () |
456 | { |
531 | { |
457 | if (!is_constant (p)) |
532 | if (!ecb_is_constant (p)) |
458 | --*refcnt_ref (); |
533 | --*refcnt_ref (); |
459 | else if (p) |
534 | else if (p) |
460 | --p->refcnt; |
535 | --p->refcnt; |
461 | } |
536 | } |
462 | |
537 | |
463 | void refcnt_inc () |
538 | void refcnt_inc () |
464 | { |
539 | { |
465 | if (!is_constant (p)) |
540 | if (!ecb_is_constant (p)) |
466 | ++*refcnt_ref (); |
541 | ++*refcnt_ref (); |
467 | else if (p) |
542 | else if (p) |
468 | ++p->refcnt; |
543 | ++p->refcnt; |
469 | } |
544 | } |
470 | |
545 | |
… | |
… | |
511 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
586 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
512 | // it is about twice as fast as the one-at-a-time one, |
587 | // it is about twice as fast as the one-at-a-time one, |
513 | // with good distribution. |
588 | // with good distribution. |
514 | // FNV-1a is faster on many cpus because the multiplication |
589 | // FNV-1a is faster on many cpus because the multiplication |
515 | // runs concurrently with the looping logic. |
590 | // runs concurrently with the looping logic. |
|
|
591 | // we modify the hash a bit to improve its distribution |
516 | uint32_t hash = STRHSH_NULL; |
592 | uint32_t hash = STRHSH_NULL; |
517 | |
593 | |
518 | while (*s) |
594 | while (*s) |
519 | hash = (hash ^ *s++) * 16777619U; |
595 | hash = (hash ^ *s++) * 16777619U; |
520 | |
596 | |
521 | return hash; |
597 | return hash ^ (hash >> 16); |
522 | } |
598 | } |
523 | |
599 | |
524 | static inline uint32_t |
600 | static inline uint32_t |
525 | memhsh (const char *s, size_t len) |
601 | memhsh (const char *s, size_t len) |
526 | { |
602 | { |
527 | uint32_t hash = STRHSH_NULL; |
603 | uint32_t hash = STRHSH_NULL; |
528 | |
604 | |
529 | while (len--) |
605 | while (len--) |
530 | hash = (hash ^ *s++) * 16777619U; |
606 | hash = (hash ^ *s++) * 16777619U; |
531 | |
607 | |
532 | return hash; |
608 | return hash; |
533 | } |
609 | } |
… | |
… | |
576 | } |
652 | } |
577 | }; |
653 | }; |
578 | |
654 | |
579 | // This container blends advantages of linked lists |
655 | // This container blends advantages of linked lists |
580 | // (efficiency) with vectors (random access) by |
656 | // (efficiency) with vectors (random access) by |
581 | // by using an unordered vector and storing the vector |
657 | // using an unordered vector and storing the vector |
582 | // index inside the object. |
658 | // index inside the object. |
583 | // |
659 | // |
584 | // + memory-efficient on most 64 bit archs |
660 | // + memory-efficient on most 64 bit archs |
585 | // + O(1) insert/remove |
661 | // + O(1) insert/remove |
586 | // + free unique (but varying) id for inserted objects |
662 | // + free unique (but varying) id for inserted objects |
… | |
… | |
623 | insert (&obj); |
699 | insert (&obj); |
624 | } |
700 | } |
625 | |
701 | |
626 | void erase (T *obj) |
702 | void erase (T *obj) |
627 | { |
703 | { |
628 | unsigned int pos = obj->*indexmember; |
704 | object_vector_index pos = obj->*indexmember; |
629 | obj->*indexmember = 0; |
705 | obj->*indexmember = 0; |
630 | |
706 | |
631 | if (pos < this->size ()) |
707 | if (pos < this->size ()) |
632 | { |
708 | { |
633 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
709 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
641 | { |
717 | { |
642 | erase (&obj); |
718 | erase (&obj); |
643 | } |
719 | } |
644 | }; |
720 | }; |
645 | |
721 | |
|
|
722 | ///////////////////////////////////////////////////////////////////////////// |
|
|
723 | |
|
|
724 | // something like a vector or stack, but without |
|
|
725 | // out of bounds checking |
|
|
726 | template<typename T> |
|
|
727 | struct fixed_stack |
|
|
728 | { |
|
|
729 | T *data; |
|
|
730 | int size; |
|
|
731 | int max; |
|
|
732 | |
|
|
733 | fixed_stack () |
|
|
734 | : size (0), data (0) |
|
|
735 | { |
|
|
736 | } |
|
|
737 | |
|
|
738 | fixed_stack (int max) |
|
|
739 | : size (0), max (max) |
|
|
740 | { |
|
|
741 | data = salloc<T> (max); |
|
|
742 | } |
|
|
743 | |
|
|
744 | void reset (int new_max) |
|
|
745 | { |
|
|
746 | sfree (data, max); |
|
|
747 | size = 0; |
|
|
748 | max = new_max; |
|
|
749 | data = salloc<T> (max); |
|
|
750 | } |
|
|
751 | |
|
|
752 | void free () |
|
|
753 | { |
|
|
754 | sfree (data, max); |
|
|
755 | data = 0; |
|
|
756 | } |
|
|
757 | |
|
|
758 | ~fixed_stack () |
|
|
759 | { |
|
|
760 | sfree (data, max); |
|
|
761 | } |
|
|
762 | |
|
|
763 | T &operator[](int idx) |
|
|
764 | { |
|
|
765 | return data [idx]; |
|
|
766 | } |
|
|
767 | |
|
|
768 | void push (T v) |
|
|
769 | { |
|
|
770 | data [size++] = v; |
|
|
771 | } |
|
|
772 | |
|
|
773 | T &pop () |
|
|
774 | { |
|
|
775 | return data [--size]; |
|
|
776 | } |
|
|
777 | |
|
|
778 | T remove (int idx) |
|
|
779 | { |
|
|
780 | T v = data [idx]; |
|
|
781 | |
|
|
782 | data [idx] = data [--size]; |
|
|
783 | |
|
|
784 | return v; |
|
|
785 | } |
|
|
786 | }; |
|
|
787 | |
|
|
788 | ///////////////////////////////////////////////////////////////////////////// |
|
|
789 | |
646 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
790 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
647 | // returns the number of bytes actually used (including \0) |
791 | // returns the number of bytes actually used (including \0) |
648 | int assign (char *dst, const char *src, int maxsize); |
792 | int assign (char *dst, const char *src, int maxsize); |
649 | |
793 | |
650 | // type-safe version of assign |
794 | // type-safe version of assign |
… | |
… | |
661 | |
805 | |
662 | int similar_direction (int a, int b); |
806 | int similar_direction (int a, int b); |
663 | |
807 | |
664 | // like v?sprintf, but returns a "static" buffer |
808 | // like v?sprintf, but returns a "static" buffer |
665 | char *vformat (const char *format, va_list ap); |
809 | char *vformat (const char *format, va_list ap); |
666 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
810 | char *format (const char *format, ...) ecb_attribute ((format (printf, 1, 2))); |
667 | |
811 | |
668 | // safety-check player input which will become object->msg |
812 | // safety-check player input which will become object->msg |
669 | bool msg_is_safe (const char *msg); |
813 | bool msg_is_safe (const char *msg); |
670 | |
814 | |
671 | ///////////////////////////////////////////////////////////////////////////// |
815 | ///////////////////////////////////////////////////////////////////////////// |