#ifndef TUPPERWARE_VECTOR_H
#define TUPPERWARE_VECTOR_H

#include <stdbool.h>
#include <stddef.h>

struct vector {
    void *arr;
    size_t size;
    size_t nmemb;
    size_t cap;
};

bool vector_init(struct vector *v, size_t size);
bool vector_with_cap(struct vector *v, size_t size, size_t cap);
void vector_clear(struct vector *v,
        void (*dtor)(void *v, void *cookie), void *cookie);

bool vector_reserve(struct vector *v, size_t cap);

size_t vector_length(const struct vector *v);
size_t vector_capacity(const struct vector *v);
size_t vector_elem_size(const struct vector *v);
bool vector_empty(const struct vector *v);

void *vector_at(const struct vector *v, size_t i);

bool vector_push_back(struct vector *v, void *elem);
bool vector_insert_at(struct vector *v, void *elem, size_t i);

bool vector_pop_back(struct vector *v, void *output);
bool vector_pop_at(struct vector *v, void *output, size_t i);

typedef int (*vector_cmp_f)(const void *lhs, const void *rhs, void *cookie);

bool vector_is_max_heap(struct vector *v, vector_cmp_f cmp, void *cookie);
bool vector_make_heap(struct vector *v, vector_cmp_f cmp, void *cookie);
bool vector_push_heap(struct vector *v,
        void *elem, vector_cmp_f cmp, void *cookie);
bool vector_pop_heap(struct vector *v,
        void *output, vector_cmp_f cmp, void *cookie);

bool vector_is_sorted(const struct vector *v, vector_cmp_f cmp, void *cookie);
bool vector_insert_sort(struct vector *v, vector_cmp_f cmp, void *cookie);
bool vector_heap_sort(struct vector *v, vector_cmp_f cmp, void *cookie);
bool vector_merge_sort(struct vector *v, vector_cmp_f cmp, void *cookie);
bool vector_sort(struct vector *v, vector_cmp_f cmp, void *cookie);

typedef void (*vector_map_f)(void *v, void *cookie);
typedef bool (*vector_filter_f)(void *v, void *cookie);

bool vector_filter(struct vector *res,
        struct vector *v, vector_filter_f filter, void *cookie);
void vector_map(struct vector *v, vector_map_f map, void *cookie);

#endif /* !TUPPERWARE_VECTOR_H */