Function priority_queue_copy

priority_queue/priority_queue.c:249–282

* @brief Deep-copy an existing priority queue. * * The new queue gets the same item size, comparator, and elements. * Because @p src is already a valid heap under its comparator, * preserving the underlying storage layout preserves the heap * property — no re-heapify is needed. * * @param src Source queue to clone (must be non-NULL with a valid * vector and comparator). * * @r

 *         failure).
 */
PriorityQueue* priority_queue_copy(const PriorityQueue* src) {
    PQUEUE_LOG("[priority_queue_copy]: enter src=%p", (const void*)src);

    if (!src || !src->vec || !src->compare) {
        PQUEUE_LOG("[priority_queue_copy]: NULL src / vec / compare -> NULL");
        return NULL;
    }

    PriorityQueue* dst = priority_queue_create(src->vec->itemSize, src->compare);
    if (!dst) {
        PQUEUE_LOG("[priority_queue_copy]: priority_queue_create(itemSize=%zu) failed -> NULL", src->vec->itemSize);
        return NULL;
    }

    size_t n = vector_size(src->vec);
    if (n > 0 && !vector_reserve(dst->vec, n)) {
        PQUEUE_LOG("[priority_queue_copy]: vector_reserve(%zu) failed -> NULL", n);
        priority_queue_deallocate(dst);

        return NULL;
    }
    for (size_t i = 0; i < n; ++i) {
        void* elem = vector_at(src->vec, i);
        if (!elem || !vector_push_back(dst->vec, elem)) {
            PQUEUE_LOG("[priority_queue_copy]: push_back failed at index %zu -> NULL", i);
            priority_queue_deallocate(dst);

            return NULL;
        }
    }

    PQUEUE_LOG("[priority_queue_copy]: exit ok dst=%p (%zu elements copied)", (void*)dst, n);
    return dst;
}


/**