// Implements c++ example: https://en.cppreference.com/w/cpp/container/priority_queue
// Example of per-instance less-function on a single priority queue type
//
// Note: i_less_functor: available for cpque types only
//       i_cmp_functor: available for csmap and csset types only
//       i_hash_functor/i_eq_functor: available for cmap and cset types only

#include <stdio.h>
#include <stdbool.h>
#include <stc/forward.h>
#include <stc/algo/crange.h>
#include <stc/cstr.h>

// predeclare
forward_cpque(ipque, int);

struct {
    ipque Q;
    bool (*less)(const int*, const int*);
} typedef IPQueue;


#define i_type ipque
#define i_val int
#define i_opt c_is_forward // needed to avoid re-type-define container type
#define i_less_functor(self, x, y) c_container_of(self, IPQueue, Q)->less(x, y)
#include <stc/cpque.h>

void print_queue(const char* name, IPQueue q) {
    // NB: make a clone because there is no way to traverse
    // priority_queue's content without erasing the queue.
    IPQueue copy = {ipque_clone(q.Q), q.less};
    
    for (printf("%s: \t", name); !ipque_empty(&copy.Q); ipque_pop(&copy.Q))
        printf("%d ", *ipque_top(&copy.Q));
    puts("");
    ipque_drop(&copy.Q);
}

static bool int_less(const int* x, const int* y) { return *x < *y; }
static bool int_greater(const int* x, const int* y) { return *x > *y; }
static bool int_lambda(const int* x, const int* y) { return (*x ^ 1) < (*y ^ 1); }

int main()
{
    const int data[] = {1,8,5,6,3,4,0,9,7,2}, n = c_ARRAYLEN(data);
    printf("data: \t");
    c_forrange (i, n) printf("%d ", data[i]);
    puts("");

    IPQueue q1 = {ipque_init(), int_less};       // Max priority queue
    IPQueue minq1 = {ipque_init(), int_greater}; // Min priority queue
    IPQueue q5 = {ipque_init(), int_lambda};     // Using lambda to compare elements.
    c_defer (ipque_drop(&q1.Q), ipque_drop(&minq1.Q), ipque_drop(&q5.Q))
    {
        c_forrange (i, n)
            ipque_push(&q1.Q, data[i]);
        print_queue("q1", q1);

        c_forrange (i, n)
            ipque_push(&minq1.Q, data[i]);
        print_queue("minq1", minq1);

        c_forrange (i, n)
            ipque_push(&q5.Q, data[i]);
        print_queue("q5", q5);
    }
}