27         unsigned n_items, n_allocated;  member
69         assert(j < q->n_items);  in swap()
70         assert(k < q->n_items);  in swap()
87         assert(idx < q->n_items);  in shuffle_up()
113                 if (j >= q->n_items)  in shuffle_down()
124                 if (k < q->n_items &&  in shuffle_down()
150         if (q->n_items >= q->n_allocated) {  in prioq_put()
154                 n = MAX((q->n_items+1) * 2, 16u);  in prioq_put()
163         k = q->n_items++;  in prioq_put()
192         l = q->items + q->n_items - 1;  in remove_item()
196                 q->n_items--;  in remove_item()
209                 q->n_items--;  in remove_item()
221         if (q->n_items <= 0)  in find_item()
226                     *idx >= q->n_items)  in find_item()
235                 for (i = q->items; i < q->items + q->n_items; i++)  in find_item()
276         if (idx >= q->n_items)  in prioq_peek_by_index()
288         if (q->n_items <= 0)  in prioq_pop()
301         return q->n_items;  in prioq_size()
309         return q->n_items <= 0;  in prioq_isempty()