#include <stdlib.h>
#include <stdio.h>
#include "dslib.h"
Functions | |
void | list_linked_destroy (list_linked_t **_l) |
list_t * | list_linked_create (void) |
void | list_array_iterator_reset (list_array_t *l) |
void * | list_array_iterator_next (list_array_t *l) |
void | list_array_destroy (list_array_t **_l) |
list_t * | list_array_create (size_t size) |
table_t * | table_create (size_t size) |
void | table_destroy (table_t **_table) |
int | table_add (table_t *table, bstr *key, void *element) |
int | table_addn (table_t *table, bstr *key, void *element) |
void * | table_get_c (const table_t *table, const char *cstr) |
void * | table_get (const table_t *table, const bstr *key) |
void | table_iterator_reset (table_t *table) |
bstr * | table_iterator_next (table_t *t, void **data) |
size_t | table_size (const table_t *table) |
void | table_clear (table_t *table) |
list_t* list_array_create | ( | size_t | size | ) |
Create new array-based list.
size |
void list_array_destroy | ( | list_array_t ** | _l | ) |
Free the memory occupied by this list. This function assumes the data elements were freed beforehand.
l |
void* list_array_iterator_next | ( | list_array_t * | l | ) |
Advance to the next list value.
l |
void list_array_iterator_reset | ( | list_array_t * | l | ) |
Reset the list iterator.
l |
list_t* list_linked_create | ( | void | ) |
Create a new linked list.
void list_linked_destroy | ( | list_linked_t ** | _l | ) |
Destroy list. This function will not destroy any of the data stored in it. You'll have to do that manually beforehand.
l |
Add a new table element. This function currently makes a copy of the key, which is inefficient.
table | ||
key | ||
element |
void table_clear | ( | table_t * | table | ) |
Remove all elements from the table.
table |
table_t* table_create | ( | size_t | size | ) |
Create a new table structure.
size |
void table_destroy | ( | table_t ** | _table | ) |
Destroy a table.
table |
Retrieve the first element in the table with the given key.
table | ||
key |
void* table_get_c | ( | const table_t * | table, | |
const char * | cstr | |||
) |
table | ||
key | Retrieve the first element in the table with the given key (as a NUL-terminated string). | |
table | ||
cstr |
Advance to the next table element.
t | ||
data |
void table_iterator_reset | ( | table_t * | table | ) |
Reset the table iterator.
table |
size_t table_size | ( | const table_t * | table | ) |
Returns the size of the table.
table |