Home
last modified time | relevance | path

Searched refs:ds_priority_queue_node_t (Results 1 – 3 of 3) sorted by relevance

/ext-ds/src/ds/
H A Dds_priority_queue.c23 ds_priority_queue_node_t *a, in ds_priority_queue_node_compare()
24 ds_priority_queue_node_t *b in ds_priority_queue_node_compare()
44 static inline ds_priority_queue_node_t *reallocate_nodes(ds_priority_queue_node_t *nodes, uint32_t … in reallocate_nodes()
98 ds_priority_queue_node_t *nodes; in ds_priority_queue_push()
99 ds_priority_queue_node_t *node; in ds_priority_queue_push()
149 ds_priority_queue_node_t bottom; in ds_priority_queue_pop()
202 ds_priority_queue_node_t *src = queue->nodes; in copy_nodes()
204 ds_priority_queue_node_t *dst = copies; in copy_nodes()
239 (ds_priority_queue_node_t *) b, in priority_sort()
240 (ds_priority_queue_node_t *) a in priority_sort()
[all …]
H A Dds_priority_queue.h9 } ds_priority_queue_node_t; typedef
12 ds_priority_queue_node_t *nodes;
23 ds_priority_queue_node_t *_node = &_queue->nodes[0]; \
24 ds_priority_queue_node_t *_last = &_queue->nodes[queue->size - 1]; \
31 ds_priority_queue_node_t *__node = NULL; \
37 ds_priority_queue_node_t *__node = NULL; \
77 ds_priority_queue_node_t* ds_priority_queue_create_sorted_buffer(ds_priority_queue_t *queue);
/ext-ds/src/php/objects/
H A Dphp_priority_queue.c47 ds_priority_queue_node_t *nodes = ds_priority_queue_create_sorted_buffer(queue); in php_ds_priority_queue_serialize()
48 ds_priority_queue_node_t *pos = nodes; in php_ds_priority_queue_serialize()
49 ds_priority_queue_node_t *end = nodes + queue->size; in php_ds_priority_queue_serialize()

Completed in 8 milliseconds