Lines Matching refs:size
16 static inline uint32_t ds_priority_queue_get_capacity_for_size(uint32_t size) in ds_priority_queue_get_capacity_for_size() argument
18 return ds_next_power_of_2(size, DS_PRIORITY_QUEUE_MIN_CAPACITY); in ds_priority_queue_get_capacity_for_size()
80 queue->size = 0; in ds_priority_queue()
101 if (queue->size == queue->capacity) { in ds_priority_queue_push()
107 for (index = queue->size; index > 0; index = parent) { in ds_priority_queue_push()
134 queue->size++; in ds_priority_queue_push()
139 …if (queue->size <= (queue->capacity / 4) && (queue->capacity / 2) >= DS_PRIORITY_QUEUE_MIN_CAPACIT… in ds_priority_queue_compact()
152 const uint32_t size = queue->size; in ds_priority_queue_pop() local
153 const uint32_t half = (size - 1) / 2; in ds_priority_queue_pop()
156 if (size == 0) { in ds_priority_queue_pop()
168 bottom = nodes[size - 1]; in ds_priority_queue_pop()
174 queue->size--; in ds_priority_queue_pop()
180 … if (swap < queue->size && ds_priority_queue_node_compare(&nodes[swap], &nodes[swap + 1]) < 0) { in ds_priority_queue_pop()
203 ds_priority_queue_node_t *end = queue->nodes + queue->size; in copy_nodes()
220 clone->size = queue->size; in ds_priority_queue_clone()
228 if (queue->size == 0) { in ds_priority_queue_peek()
246 ds_priority_queue_node_t *buffer = allocate_nodes(queue->size); in ds_priority_queue_create_sorted_buffer()
248 memcpy(buffer, queue->nodes, queue->size * sizeof(ds_priority_queue_node_t)); in ds_priority_queue_create_sorted_buffer()
249 qsort(buffer, queue->size, sizeof(ds_priority_queue_node_t), priority_sort); in ds_priority_queue_create_sorted_buffer()
264 end = buf + queue->size; in ds_priority_queue_to_array()
266 array_init_size(array, queue->size); in ds_priority_queue_to_array()
280 ds_priority_queue_node_t *end = queue->nodes + queue->size; in ds_priority_queue_clear()
287 queue->size = 0; in ds_priority_queue_clear()
