Loading...
Searching...
No Matches
free.c
Go to the documentation of this file.
#include <stdlib.h>
#include <grass/btree.h>
int btree_free(BTREE *B)
{
void *data, *key;
btree_rewind(B);
while (btree_next(B, &key, &data)) {
free(key);
free(data);
}
free(B->node);
return 0;
}
btree_next
int btree_next(BTREE *B, void **key, void **data)
Definition btree/next.c:3
btree_free
int btree_free(BTREE *B)
Definition free.c:5
btree_rewind
int btree_rewind(BTREE *B)
Definition rewind.c:3