Function priority_queue_create

priority_queue/priority_queue.c:202–231

* @brief Create an empty priority queue with the given element size * and comparator. * * Allocates a PriorityQueue header and an empty backing Vector. No * elements are allocated until you push. * * @param itemSize Size in bytes of one element (must be > 0). * @param compare Three-way comparator that returns `> 0` when `a` has * higher priority than `b`, `< 0` for

 *           - underlying vector_create failure
 */
PriorityQueue* priority_queue_create(size_t itemSize, PQCompareFunc compare) {
    PQUEUE_LOG("[priority_queue_create]: enter itemSize=%zu", itemSize);

    if (itemSize == 0) {
        PQUEUE_LOG("[priority_queue_create]: itemSize is zero -> NULL");
        return NULL;
    }
    if (!compare) {
        PQUEUE_LOG("[priority_queue_create]: compare is NULL -> NULL");
        return NULL;
    }

    PriorityQueue* pq = (PriorityQueue*)malloc(sizeof(PriorityQueue));
    if (!pq) {
        PQUEUE_LOG("[priority_queue_create]: malloc(PriorityQueue) failed -> NULL");
        return NULL;
    }

    pq->vec = vector_create(itemSize);
    if (!pq->vec) {
        PQUEUE_LOG("[priority_queue_create]: vector_create(%zu) failed -> NULL", itemSize);
        free(pq);

        return NULL;
    }
    pq->compare = compare;

    PQUEUE_LOG("[priority_queue_create]: exit ok pq=%p vec=%p", (void*)pq, (void*)pq->vec);
    return pq;
}


/**