/* MIT License
 *
 * Copyright (c) 2020 Tyge Løvset, NORCE, www.norceresearch.no
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

/*  Priority Queue using heap, with adapter class (normally cvec).

    #include <stc/crandom.h>
    #include <stc/cqueue.h>
    using_clist(i, int);
    using_cqueue(i, clist_i); // min-heap (increasing values)

    int main() {
        int n = 10000000;
        crand_rng32_t gen = crand_rng32_init(1234);
        crand_uniform_i32_t dist = crand_uniform_i32_init(gen, 0, n);

        cqueue_i queue = cqueue_i_init();

        // Push ten million random numbers onto the queue.
        for (int i=0; i<n; ++i)
            cqueue_i_push(&queue, crand_uniform_i32(&dist));

        // Push or pop on the queue ten million times
        printf("%d\n", n);
        for (int i=n; i>0; --i) {
            int r = crand_uniform_i32(&dist);
            if (r & 1)
                ++n, cqueue_i_push(&queue, r);
            else
                --n, cqueue_i_pop(&queue);
        }
        printf("%d\n", n);
        cqueue_i_del(&queue);
    }
*/

#ifndef CQUEUE__H__
#define CQUEUE__H__

#include "clist.h"

#define using_cqueue(X, ctype) \
\
    typedef struct ctype cqueue_##X; \
    typedef ctype##_value_t cqueue_##X##_value_t; \
    typedef ctype##_rawvalue_t cqueue_##X##_rawvalue_t; \
    typedef ctype##_input_t cqueue_##X##_input_t; \
    STC_INLINE cqueue_##X \
    cqueue_##X##_init() {return ctype##_init();} \
    STC_INLINE void \
    cqueue_##X##_del(cqueue_##X* self) {ctype##_del(self);} \
    STC_INLINE size_t \
    cqueue_##X##_size(cqueue_##X pq) {return ctype##_size(pq);} \
    STC_INLINE bool \
    cqueue_##X##_empty(cqueue_##X pq) {return ctype##_empty(pq);} \
    STC_INLINE cqueue_##X##_value_t* \
    cqueue_##X##_front(cqueue_##X* self) {return ctype##_front(self);} \
    STC_INLINE cqueue_##X##_value_t* \
    cqueue_##X##_back(cqueue_##X* self) {return ctype##_back(self);} \
    STC_INLINE void \
    cqueue_##X##_pop(cqueue_##X* self) {ctype##_pop_front(self);} \
    STC_API void \
    cqueue_##X##_push(cqueue_##X* self, ctype##_value_t value) { \
        ctype##_push_back(self, value); \
    } \
    STC_INLINE void \
    cqueue_##X##_emplace(cqueue_##X* self, cqueue_##X##_rawvalue_t rawValue) { \
        ctype##_emplace_back(self, rawValue); \
    } \
    STC_API void \
    cqueue_##X##_push_n(cqueue_##X *self, const cqueue_##X##_input_t in[], size_t size) { \
        ctype##_push_n(self, in, size); \
    } \
    typedef ctype##_iter_t cqueue_##X##_iter_t; \
    STC_INLINE cqueue_##X##_iter_t \
    cqueue_##X##_begin(cqueue_##X* self) {return ctype##_begin(self);} \
    STC_INLINE cqueue_##X##_iter_t \
    cqueue_##X##_end(cqueue_##X* self) {return ctype##_end(self);} \
    STC_INLINE void \
    cqueue_##X##_next(cqueue_##X##_iter_t* it) {ctype##_next(it);} \
    STC_INLINE cqueue_##X##_value_t* \
    cqueue_##X##_itval(cqueue_##X##_iter_t it) {return ctype##_itval(it);} \
\
    typedef int cqueue_##X##_dud

#endif