133 lines
3.3 KiB
C
133 lines
3.3 KiB
C
#include <stdio.h>
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "libkeke_array.h"
|
|
#include "libkeke_utils.h"
|
|
|
|
#define ARRAY_LEN 10
|
|
|
|
void set(void *, size_t index, struct KekeArray *array) {
|
|
keke_array_set(array, ARRAY_LEN - index - 1, &index);
|
|
}
|
|
|
|
void output(void *i, size_t, struct KekeArray *) {
|
|
printf("%d, ", *(int *)i);
|
|
}
|
|
|
|
void sub4(void *i, size_t, struct KekeArray *) {
|
|
*(int *)i -= 4;
|
|
}
|
|
|
|
bool heart(void *i, size_t, struct KekeArray *) {
|
|
return *(int *)i < 3;
|
|
}
|
|
|
|
void add(void *vx, void *vacc) {
|
|
int *x = (int *)vx;
|
|
int *acc = (int *)vacc;
|
|
*acc += *x;
|
|
}
|
|
|
|
int main(void) {
|
|
struct 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");
|
|
|
|
struct 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");
|
|
|
|
struct 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,\t0");
|
|
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");
|
|
|
|
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));
|
|
|
|
struct KekeArray *array4 = keke_array_filter(array2, heart);
|
|
puts("Expected value:\n2, 2, 1, 2,");
|
|
keke_array_foreach(array4, output);
|
|
puts("\n");
|
|
|
|
j = 0;
|
|
keke_array_reduce(array4, add, &j);
|
|
printf("Expected value:\n7\n%d\n\n", j);
|
|
|
|
keke_array_free(array);
|
|
keke_array_free(array2);
|
|
keke_array_free(array4);
|
|
puts("\n");
|
|
return 0;
|
|
}
|