| 117 | |
| 118 | |
| 119 | static size_t |
| 120 | maxchild(pqueue_t *q, size_t i) |
| 121 | { |
| 122 | size_t child_node = left(i); |
| 123 | |
| 124 | if (child_node >= q->size) |
| 125 | return 0; |
| 126 | |
| 127 | if ((child_node+1) < q->size && |
| 128 | q->cmppri(q->getpri(q->d[child_node]), q->getpri(q->d[child_node+1]))) |
| 129 | child_node++; /* use right child instead of left */ |
| 130 | |
| 131 | return child_node; |
| 132 | } |
| 133 | |
| 134 | |
| 135 | static void |
no outgoing calls
no test coverage detected