You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
91 lines
1.6 KiB
91 lines
1.6 KiB
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#include "memory.h"
|
|
#include "dict.h"
|
|
|
|
|
|
|
|
void *dictionary_not_found;
|
|
|
|
|
|
dictionary *dictionary_new(void) {
|
|
|
|
static int dnf;
|
|
if (!dictionary_not_found) {
|
|
dictionary_not_found = &dnf;
|
|
}
|
|
dictionary *out = malloc(sizeof(dictionary));
|
|
if(out == NULL) {
|
|
fprintf(stderr, "Out of memory.\n");
|
|
abort();
|
|
}
|
|
*out = (dictionary) {};
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
static void dictionary_add_keyval(dictionary *in, keyval *kv) {
|
|
|
|
in->length++;
|
|
keyval **tmp = realloc(in->pairs, sizeof(keyval*) * in->length);
|
|
if(tmp == NULL) {
|
|
fprintf(stderr, "Out of memory.\n");
|
|
abort();
|
|
}
|
|
in->pairs = tmp;
|
|
tmp = NULL;
|
|
in->pairs[in->length-1] = kv;
|
|
|
|
}
|
|
|
|
|
|
void dictionary_add(dictionary *in, char *key, void *value) {
|
|
|
|
if(key == NULL) {
|
|
fprintf(stderr, "NULL is not a valid key.\n");
|
|
abort();
|
|
}
|
|
if(dictionary_find(in, key) == dictionary_not_found) {
|
|
dictionary_add_keyval(in, keyval_new(key, value));
|
|
} else {
|
|
printf("Key '%s' already exists!\n", key);
|
|
}
|
|
|
|
}
|
|
|
|
|
|
void *dictionary_find(const dictionary *in, const char *key) {
|
|
|
|
for (size_t i = 0; i < in->length; i++) {
|
|
if (keyval_matches(in->pairs[i], key)) {
|
|
return in->pairs[i]->value;
|
|
}
|
|
}
|
|
return dictionary_not_found;
|
|
|
|
}
|
|
|
|
|
|
dictionary *dictionary_copy(dictionary *in) {
|
|
|
|
dictionary *out = dictionary_new();
|
|
for (size_t i = 0; i < in->length; i++) {
|
|
dictionary_add_keyval(out, keyval_copy(in->pairs[i]));
|
|
}
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
void dictionary_free(dictionary *in) {
|
|
|
|
for (size_t i = 0; i < in->length; i++) {
|
|
keyval_free(in->pairs[i]);
|
|
}
|
|
safeFree(in->pairs);
|
|
safeFree(in);
|
|
|
|
}
|
|
|