19 #include <grass/btree.h>
21 static int cmp(
const void *a,
const void *
b)
28 char key[100],
data[100];
34 fprintf(stdout,
"enter key (or RETURN if done): ");
41 fprintf(stdout,
"%s = %s\n", key, d);
43 fprintf(stdout,
"%s - not found\n", key);
45 fprintf(stdout,
"enter new value (or RETURN if none): ");
49 btree_update(&B, key, strlen(key) + 1, data, strlen(data) + 1);
52 fprintf(stdout,
"final tree\n");
55 fprintf(stdout,
"%s:%s\n", (
const char *)k, (
const char *)d);
int btree_update(BTREE *B, const void *key, int keylen, const void *data, int datalen)
int btree_rewind(BTREE *B)
int btree_find(const BTREE *B, const void *key, void **data)
int btree_next(BTREE *B, void **key, void **data)
int btree_create(BTREE *B, int(*cmp)(const void *, const void *), int incr)