Ir al código fuente de este archivo.
Clases |
| struct | st_queue |
'defines' |
| #define | queue_top(queue) ((queue)->root[1]) |
| #define | queue_element(queue, index) ((queue)->root[index+1]) |
| #define | queue_end(queue) ((queue)->root[(queue)->elements]) |
| #define | queue_replaced(queue) _downheap(queue,1) |
| #define | queue_remove_all(queue) { (queue)->elements= 0; } |
| #define | is_queue_inited(queue) ((queue)->root != 0) |
'typedefs' |
| typedef struct st_queue | QUEUE |
| typedef int(* | queue_compare )(void *, byte *, byte *) |
Funciones |
| int | init_queue (QUEUE *queue, uint max_elements, uint offset_to_key, pbool max_at_top, queue_compare compare, void *first_cmp_arg) |
| int | reinit_queue (QUEUE *queue, uint max_elements, uint offset_to_key, pbool max_at_top, queue_compare compare, void *first_cmp_arg) |
| int | resize_queue (QUEUE *queue, uint max_elements) |
| void | delete_queue (QUEUE *queue) |
| void | queue_insert (QUEUE *queue, byte *element) |
| byte * | queue_remove (QUEUE *queue, uint idx) |
| void | _downheap (QUEUE *queue, uint idx) |
| void | queue_fix (QUEUE *queue) |
Documentación de los 'defines'
| #define is_queue_inited |
( |
|
queue | ) |
((queue)->root != 0) |
| #define queue_element |
( |
|
queue, |
|
|
|
index |
|
) |
| ((queue)->root[index+1]) |
| #define queue_remove_all |
( |
|
queue | ) |
{ (queue)->elements= 0; } |
| #define queue_replaced |
( |
|
queue | ) |
_downheap(queue,1) |
Documentación de los 'typedefs'
Documentación de las funciones
| void delete_queue |
( |
QUEUE * |
queue | ) |
|
| void queue_fix |
( |
QUEUE * |
queue | ) |
|
| void queue_insert |
( |
QUEUE * |
queue, |
|
|
byte * |
element |
|
) |
| |