HEAP_NODE_SMALLER  285 lib/q.c            } while(HEAP_NODE_SMALLER(h, h->elements[parent], node_p));
HEAP_NODE_SMALLER  299 lib/q.c                if(child+1 < h->size && HEAP_NODE_SMALLER(h,h->elements[child],h->elements[child+1])) // search for bigger child
HEAP_NODE_SMALLER  303 lib/q.c            } while(HEAP_NODE_SMALLER(h,node_p, h->elements[child]));