#include <stdio.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include "libkeke_array.h"
#include "libkeke_utils.h"

#define ARRAY_LEN 10
#define ARRAY_ALT_LEN 512

void set(void *, size_t index, KekeArray *array) {
    keke_array_set(array, ARRAY_LEN - index - 1, &index);
}

void set_alt(void *, size_t index, KekeArray *array) {
    keke_array_set(array, ARRAY_ALT_LEN - index - 1, &index);
}

void output(void *i, size_t, KekeArray *) {
    printf("%d, ", *(int *)i);
}

void output_hex(void *i, size_t, KekeArray *) {
    printf("%x, ", *(int *)i);
}

void sub4(void *i, size_t, KekeArray *) {
	*(int *)i -= 4;
}

void add250(void *i, size_t, KekeArray *) {
	*(int *)i += 250;
}

void sub250(void *i, size_t, KekeArray *) {
	*(int *)i -= 250;
}

bool heart(void *i, size_t, KekeArray *) {
	return *(int *)i < 3;
}

bool lt2(void *i, size_t, KekeArray *) {
	return *(int *)i < 2;
}

void add(void *vx, void *vacc) {
	int *x = (int *)vx;
	int *acc = (int *)vacc;
	*acc += *x;
}

int rng(int x) {
	return rand() % x;
}

int main(void) {
	KekeArray *array = keke_array_alloc(ARRAY_LEN, sizeof(int));

    puts("Expected value:\n0");
    printf("%d", *(int *)keke_array_get(array, 0)); //initialized to 0
	puts("\n");
    
    keke_array_foreach(array, set);
    puts("Expected value:\n9, 8, 7, 6, 5, 4, 3, 2, 1, 0,");
    keke_array_foreach(array, output);
	puts("\n");

	KekeArray *array2 = keke_array_yoink(array, 2, 4);
    puts("Expected value:\n7, 6, 5, 4,");
    keke_array_foreach(array2, output);
	puts("\n");
    puts("Expected value:\n9, 8, 3, 2, 1, 0,");
    keke_array_foreach(array, output);
	puts("\n");

    const int k = 100;
    keke_array_insert(array2, 2, &k);
    puts("Expected value:\n7, 6, 100, 5, 4,");
    keke_array_foreach(array2, output);
	puts("\n");

    int j;
    keke_array_remove(array2, 2, &j);
    puts("Expected value:\n7, 6, 5, 0,\t100");
    keke_array_foreach(array2, output);
    printf("\t%d", j);
	puts("\n");

    keke_array_delete(array2, 3);
    puts("Expected value:\n7, 6, 5");
    keke_array_foreach(array2, output);
	puts("\n");

    KekeArray *array3 = keke_array_clone(array2);
    keke_array_plop(array2, 1, array3); //array3 is freed
    puts("Expected value:\n7, 7, 6, 5, 6, 5,");
    keke_array_foreach(array2, output);
	puts("\n");

    keke_array_pop(array2, &j);
    puts("Expected value:\n7, 7, 6, 5, 6,\t5");
    keke_array_foreach(array2, output);
    printf("\t%d", j);
	puts("\n");

    keke_array_copy(array2, 2, &j);
    keke_array_push(array2, &j);
    puts("Expected value:\n7, 7, 6, 5, 6, 6,");
    keke_array_foreach(array2, output);
	puts("\n");

    keke_array_set_len(array, 2);
    puts("Expected value:\n9, 8,");
    keke_array_foreach(array, output);
	puts("\n");

    keke_array_set(array, 4, &j);
    puts("Expected value:\n9, 8, 0, 0, 6,");
    keke_array_foreach(array, output);
	puts("\n");

    keke_array_fill(array, &j);
    puts("Expected value:\n6, 6, 6, 6, 6,");
    keke_array_foreach(array, output);
	puts("\n");

    keke_array_reverse(array2);
    puts("Expected value:\n6, 6, 5, 6, 7, 7,");
    keke_array_foreach(array2, output);
	puts("\n");

	keke_array_foreach(array2, sub4);
    puts("Expected value:\n2, 2, 1, 2, 3, 3,");
	keke_array_foreach(array2, output);
	puts("\n");

	keke_array_qsort(array2);
    puts("Expected value:\n1, 2, 2, 2, 3, 3,");
	keke_array_foreach(array2, output);
	puts("\n");

	bool h = keke_array_some(array2, heart);
	bool g = keke_array_all(array2, heart);
    puts("Expected value:\nTrue, False");
    printf("%s, %s\n\n", BOOL_PRETTY(h), BOOL_PRETTY(g));

	KekeArray *array4 = keke_array_filter(array2, heart);
    puts("Expected value:\n1, 2, 2, 2,");
	keke_array_foreach(array4, output);
	puts("\n");

	int *l = keke_array_find(array2, lt2);
    puts("Expected value:\n1");
    printf("%d\n\n", *l);
    
	l = keke_array_find_start(array2, l, sizeof(*l));
    puts("Expected value:\n1");
    printf("%d\n\n", *l);

	j = 0;
	keke_array_reduce(array4, add, &j);
	printf("Expected value:\n7\n%d\n\n", j);

	keke_array_foreach(array, set);
	keke_array_qsort(array);
	KekeArray *array5 = keke_array_merge(array, array2);
	printf("Expected value:\n0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 5, 6, 7, 8, 9,\n");
	keke_array_foreach(array5, output);
	puts("\n");

	keke_array_shuffle(array5, rng);
	printf("Expected value:\n2, 0, 3, 7, 3, 1, 8, 2, 2, 1, 3, 5, 6, 2, 9, 4,\n");
	keke_array_foreach(array5, output);
	puts("\n");

	keke_array_foreach(array5, add250);
	keke_array_qsort_header(array5, sizeof(int));
	printf("Expected value:\n250, 251, 251, 252, 252, 252, 252, 253, 253, 253, 254, 255, 256, 257, 258, 259,\n");
	keke_array_foreach(array5, output);
	puts("\n");

    keke_array_free(array);
    keke_array_free(array2);
    keke_array_free(array4);
    keke_array_free(array5);
	return 0;
}