194 lines
5.2 KiB
C
194 lines
5.2 KiB
C
#define SEP(SIZE) { for (size_t i = 0; i < SIZE; i++) { printf("="); }; puts("\n"); }
|
|
|
|
#include <stdio.h>
|
|
|
|
#include "src/vector.h"
|
|
#include "src/map.h"
|
|
|
|
static int vector_usage();
|
|
static int map_usage();
|
|
|
|
int main(void) {
|
|
int st;
|
|
|
|
st = vector_usage();
|
|
if (st) { return st; }
|
|
|
|
SEP(50)
|
|
|
|
st = map_usage();
|
|
if (st) { return st; }
|
|
|
|
return 0;
|
|
}
|
|
|
|
int vector_usage() {
|
|
// Create a vector of 5 integers
|
|
vector_result_t res = vector_new(5, sizeof(int));
|
|
if (res.status != VECTOR_OK) {
|
|
printf("Error while creating vector: %s\n", res.message);
|
|
|
|
return 1;
|
|
}
|
|
|
|
vector_t *vector = res.value.vector;
|
|
|
|
// Push some values
|
|
for (int idx = 0; idx <= 5; idx++) {
|
|
vector_result_t add_res = vector_push(vector, &idx);
|
|
if (add_res.status != VECTOR_OK) {
|
|
printf("Error while adding elements: %s\n", add_res.message);
|
|
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
// Print vector size and capacity
|
|
printf("Vector size (should be 5): %zu\n", vector_size(vector));
|
|
printf("Vector capacity (should be >= 5): %zu\n\n", vector_capacity(vector));
|
|
|
|
// Print the whole vector
|
|
for (size_t idx = 0; idx < vector_size(vector); idx++) {
|
|
vector_result_t get_res = vector_get(vector, idx);
|
|
if (get_res.status != VECTOR_OK) {
|
|
printf("Cannot retrieve vec[%zu]: %s\n", idx, get_res.message);
|
|
|
|
return 1;
|
|
} else {
|
|
int val = *(int *)get_res.value.element;
|
|
printf("vec[%zu] (should be '%zu') = %d\n", idx, idx, val);
|
|
}
|
|
}
|
|
|
|
// Set an element at index 2
|
|
int new_val = 0xBABE;
|
|
vector_result_t set_res = vector_set(vector, 2, &new_val);
|
|
if (set_res.status == VECTOR_OK) {
|
|
printf("vec[2] (should be updated to 'BABE'): %X\n\n", new_val);
|
|
}
|
|
|
|
// Pop last element
|
|
vector_result_t pop_res = vector_pop(vector);
|
|
if (pop_res.status == VECTOR_OK) {
|
|
int val = *(int *)pop_res.value.element;
|
|
printf("Popped value (should be 5) : %d\n\n", val);
|
|
}
|
|
|
|
// Clear vector
|
|
vector_result_t clear_res = vector_clear(vector);
|
|
if (clear_res.status != VECTOR_OK) {
|
|
printf("Cannot clear vector: %s\n", clear_res.message);
|
|
|
|
return 1;
|
|
} else {
|
|
printf("Vector cleared (size should be 0): %zu\n\n", vector_size(vector));
|
|
}
|
|
|
|
// Free vector
|
|
vector_result_t del_res = vector_destroy(vector);
|
|
if (del_res.status != VECTOR_OK) {
|
|
printf("Error while destroying the vector: %s\n", del_res.message);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int map_usage() {
|
|
// Create a new map
|
|
map_result_t res = map_new();
|
|
if (res.status != MAP_OK) {
|
|
printf("Error while creating map: %s\n", res.message);
|
|
|
|
return 1;
|
|
}
|
|
|
|
map_t *map = res.value.map;
|
|
|
|
// Add some values
|
|
const int x = 0xB00B5;
|
|
const char *y = "Hello";
|
|
|
|
map_result_t add_res = map_add(map, "x", (void*)&x);
|
|
if (add_res.status != MAP_OK) {
|
|
printf("Error while adding elements: %s\n", add_res.message);
|
|
|
|
return 1;
|
|
}
|
|
|
|
add_res = map_add(map, "y", (void*)y);
|
|
if (add_res.status != MAP_OK) {
|
|
printf("Error while adding elements: %s\n", add_res.message);
|
|
|
|
return 1;
|
|
}
|
|
|
|
// Print size and capacity
|
|
printf("Map size (should be 2): %zu\n", map_size(map));
|
|
printf("Map capacity (should be >=2): %zu\n\n", map_capacity(map));
|
|
|
|
// Retrieve keys
|
|
map_result_t get_res = map_get(map, "x");
|
|
if (get_res.status != MAP_OK) {
|
|
printf("Cannot retrieve map element 'x': %s\n", get_res.message);
|
|
|
|
return 1;
|
|
} else {
|
|
const int *val = (const int*)get_res.value.element;
|
|
printf("Key 'x' contains (should be 'B00B5'): %X\n", *val);
|
|
}
|
|
|
|
get_res = map_get(map, "y");
|
|
if (get_res.status != MAP_OK) {
|
|
printf("Cannot retrieve map element 'y': %s\n", get_res.message);
|
|
|
|
return 1;
|
|
} else {
|
|
const char *val = (const char*)get_res.value.element;
|
|
printf("Key 'y' contains (should be 'Hello') : %s\n\n", val);
|
|
}
|
|
|
|
// Update key
|
|
const int new_x = 0xC0FFEE;
|
|
map_result_t up_res = map_add(map, "x", (void*)&new_x);
|
|
|
|
up_res = map_get(map, "x");
|
|
if (get_res.status != MAP_OK) {
|
|
printf("Cannot retrieve map element 'x': %s\n", get_res.message);
|
|
|
|
return 1;
|
|
} else {
|
|
const int *val = (const int*)up_res.value.element;
|
|
printf("Key 'x' (should be updated to 'C0FFEE'): %X\n\n", *val);
|
|
}
|
|
|
|
// Remove an element
|
|
map_result_t rm_res = map_remove(map, "y");
|
|
if (rm_res.status != MAP_OK) {
|
|
printf("Cannot remove map element 'y': %s\n", rm_res.message);
|
|
|
|
return 1;
|
|
} else {
|
|
printf("Map element 'y' removed (size should be 1): %zu\n\n", map_size(map));
|
|
}
|
|
|
|
// Clear the map
|
|
map_result_t clear_res = map_clear(map);
|
|
if (clear_res.status != MAP_OK) {
|
|
printf("Cannot clear map: %s\n", clear_res.message);
|
|
|
|
return 1;
|
|
} else {
|
|
printf("Map cleared (size should be 0): %zu\n", map_size(map));
|
|
}
|
|
|
|
// Delete the map
|
|
map_result_t del_res = map_destroy(map);
|
|
if (del_res.status != MAP_OK) {
|
|
printf("Error while destroying the map: %s\n", del_res.message);
|
|
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|