int main(void) { btree_tree *tmp; uint32_t data_idx; size_t size; time_t ts; char *data; int i; char testdata[11]; // testing too large data tmp = btree_create("test.mmap", 102, 204, 10); if (!tmp) { printf("Couldn't create tree from disk image.\n"); exit(1); } for (i = 0; i < 205; i++) { if (btree_insert(tmp, i * 3, &data_idx)) { sprintf(testdata, "H: %07d", i); btree_set_data(tmp, data_idx, testdata, 10, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } } btree_dump(tmp); btree_free(tmp); return 0; }
int main(void) { btree_tree *tmp; uint32_t data_idx; size_t *size; time_t *ts; char *data; int i, tmp_key; char testdata[11]; int error = 0; /* testing too large data */ tmp = btree_create("test.mmap", 3, 6, 10, &error); if (!tmp) { printf("Couldn't create tree from disk image, errno %d.\n", error); exit(1); } for (i = 0; i < 205; i++) { tmp_key = i * 3; if (0 == btree_insert(tmp, tmp_key)) { sprintf(testdata, "H: %07d", i); btree_set_data(tmp, tmp_key, testdata, 10, time(NULL)); btree_get_data(tmp, tmp_key, &data_idx, (void **)&data, &size, &ts); printf("%s %zd\n", data, *size); btree_data_unlock(tmp, data_idx); } } btree_dump(tmp); btree_close(tmp); return 0; }
static uint32_t insert_item(btree_tree *tmp, uint64_t index) { uint32_t data_idx; size_t *size; time_t *time; void *data; btree_insert(tmp, index); btree_get_data(tmp, index, &data_idx, &data, &size, &time); printf("%u\n", data_idx); btree_data_unlock(tmp, data_idx); return data_idx; }
int main(void) { btree_tree *tmp; uint32_t data_idx; size_t size; time_t ts; char *data; // testing too large data tmp = btree_create("test.mmap", 3, 6, 10); if (!tmp) { printf("Couldn't create tree from disk image.\n"); exit(1); } if (btree_insert(tmp, 'X', &data_idx)) { btree_set_data(tmp, data_idx, "HelloWorl1", 10, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } if (btree_insert(tmp, 'Q', &data_idx)) { btree_set_data(tmp, data_idx, "HelloWorld2", 10, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } if (btree_insert(tmp, 'D', &data_idx)) { btree_set_data(tmp, data_idx, "HelloWorld3", 11, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } if (btree_insert(tmp, 'Z', &data_idx)) { btree_set_data(tmp, data_idx, "HelloWorl4", 11, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } if (btree_insert(tmp, 'A', &data_idx)) { btree_set_data(tmp, data_idx, "HelloWorl5", -1, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } if (btree_insert(tmp, 'C', &data_idx)) { btree_set_data(tmp, data_idx, "HelloWorl6", 0, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } if (btree_insert(tmp, 'G', &data_idx)) { btree_set_data(tmp, data_idx, "TooMany1", 8, time(NULL)); data = (char*) btree_get_data(tmp, data_idx, &size, &ts); printf("%s %zd\n", data, size); } btree_dump(tmp); btree_free(tmp); return 0; }