#include <stdio.h>

#define i_val int
#include <stc/cvec.h>

#define i_val int
#include <stc/csset.h>

int main()
{
    // TEST SORTED VECTOR
    {
        int key, *res;
        cvec_int vec = c_make(cvec_int, {40, 600, 1, 7000, 2, 500, 30});

        cvec_int_sort(&vec);

        key = 100;
        res = cvec_int_lower_bound(&vec, key).ref;
        if (res)
            printf("Sorted Vec %d: lower bound: %d\n", key, *res); // 500

        key = 10;
        cvec_int_iter it1 = cvec_int_lower_bound(&vec, key);
        if (it1.ref)
            printf("Sorted Vec %3d: lower_bound: %d\n", key, *it1.ref); // 30

        key = 600;
        cvec_int_iter it2 = cvec_int_binary_search(&vec, key);
        if (it2.ref)
            printf("Sorted Vec %d: bin. search: %d\n", key, *it2.ref); // 600

        c_foreach (i, cvec_int, it1, it2)
            printf("  %d\n", *i.ref);

        puts("");
        cvec_int_drop(&vec);
    }
    
    // TEST SORTED SET
    {
        int key, *res;
        csset_int set = c_make(csset_int, {40, 600, 1, 7000, 2, 500, 30});

        key = 100;
        res = csset_int_lower_bound(&set, key).ref;
        if (res)
            printf("Sorted Set %d: lower bound: %d\n", key, *res); // 500

        key = 10;
        csset_int_iter it1 = csset_int_lower_bound(&set, key);
        if (it1.ref)
            printf("Sorted Set %3d: lower bound: %d\n", key, *it1.ref); // 30

        key = 600;
        csset_int_iter it2 = csset_int_find(&set, key);
        if (it2.ref)
            printf("Sorted Set %d: find       : %d\n", key, *it2.ref); // 600

        c_foreach (i, csset_int, it1, it2)
            printf("  %d\n", *i.ref);

        csset_int_drop(&set);
    }
}