Simple circular integer queue. More...
|#define||q_push_ptr(q, ptr) q_push((q), (uintptr_t)(ptr))|
|#define||q_pop_ptr(q) ((void *)(q_pop((q))))|
|#define||q_push_int(q, i) q_push((q), (uintptr_t)(i))|
|typedef unsigned long||uintptr_t|
|struct queue *||q_new (size_t size)|
|int||q_len (struct queue *q)|
|void||q_push (struct queue *q, uintptr_t item)|
|uintptr_t||q_pop (struct queue *q)|
|void||q_free (struct queue *q)|
Simple circular integer queue.
Copyright (c) 2011 Erik Osheim
This work is free software; you can redistribute it and/or modify it under the terms of either:
a) the GNU General Public License as published by the Free Software Foundation, version 2, or
b) the "Angband licence": This software may be copied and distributed for educational, research, and not for profit purposes provided that this copyright and statement are included in all such copies. Other copyrights may also apply.
|typedef unsigned long uintptr_t|