int CDbxKV::InitModuleNames(void)
{
m_maxModuleID = 0;
ham_key_t key = { 0 };
ham_record_t rec = { 0 };
cursor_ptr cursor(m_dbModules);
if (ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_FIRST) != HAM_SUCCESS)
return 0;
do {
DBModuleName *pmod = (DBModuleName*)rec.data;
if (pmod->dwSignature != DBMODULENAME_SIGNATURE)
DatabaseCorruption(NULL);
char *pVal = (char*)HeapAlloc(m_hModHeap, 0, pmod->cbName+1);
memcpy(pVal, pmod->name, pmod->cbName);
pVal[pmod->cbName] = 0;
int moduleId = *(int*)key.data;
AddToList(pVal, moduleId);
if (moduleId > m_maxModuleID)
m_maxModuleID = moduleId;
} while (ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_NEXT) == 0);
return 0;
}
STDMETHODIMP_(BOOL) CDbxKV::EnumContactSettings(MCONTACT contactID, DBCONTACTENUMSETTINGS* dbces)
{
if (!dbces->szModule)
return -1;
mir_cslock lck(m_csDbAccess);
DBSettingSortingKey keySearch;
keySearch.dwContactID = contactID;
keySearch.dwOfsModule = GetModuleNameOfs(dbces->szModule);
memset(keySearch.szSettingName, 0, SIZEOF(keySearch.szSettingName));
int result = -1;
ham_record_t rec = { 0 };
ham_key_t key = { sizeof(keySearch), &keySearch };
cursor_ptr cursor(m_dbSettings);
if (ham_cursor_find(cursor, &key, &rec, HAM_FIND_GEQ_MATCH) == HAM_SUCCESS) {
do {
DBSettingSortingKey *pKey = (DBSettingSortingKey*)key.data;
if (pKey->dwContactID != contactID || pKey->dwOfsModule != keySearch.dwOfsModule)
break;
char szSetting[256];
strncpy_s(szSetting, pKey->szSettingName, key.size - sizeof(DWORD) * 2);
result = (dbces->pfnEnumProc)(szSetting, dbces->lParam);
} while (ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_NEXT) == HAM_SUCCESS);
}
return result;
}
BOOL CDbxKV::MetaSplitHistory(DBCachedContact *ccMeta, DBCachedContact *ccSub)
{
DBEventSortingKey keyVal = { ccSub->contactID, 0, 0 }, delVal = { ccMeta->contactID, 0, 0 };
ham_key_t key = { sizeof(keyVal), &keyVal }, key2 = { sizeof(delVal), &delVal };
ham_record_t data = { 0 };
cursor_ptr cursor(m_dbEventsSort);
if (ham_cursor_find(cursor, &key, &data, HAM_FIND_GT_MATCH) != HAM_SUCCESS)
return 0;
do {
DBEventSortingKey *pKey = (DBEventSortingKey*)key.data;
if (pKey->dwContactId != ccSub->contactID)
break;
delVal.ts = pKey->ts;
delVal.dwEventId = pKey->dwEventId;
ham_db_erase(m_dbEventsSort, NULL, &key2, 0);
ccMeta->dbc.dwEventCount--;
} while (ham_cursor_move(cursor, &key, &data, HAM_CURSOR_NEXT) == HAM_SUCCESS);
// now update the number of events in a metacontact
ham_key_t keyc = { sizeof(int), &ccMeta->contactID };
ham_record_t datac = { sizeof(ccMeta->dbc), &ccMeta->dbc };
ham_db_insert(m_dbContacts, NULL, &keyc, &datac, HAM_OVERWRITE);
return 0;
}
void
copy_db(ham_db_t *source, ham_db_t *dest) {
ham_cursor_t *cursor; /* hamsterdb cursor object */
ham_status_t st;
ham_key_t key;
ham_record_t rec;
memset(&key, 0, sizeof(key));
memset(&rec, 0, sizeof(rec));
/* create a new cursor */
st = ham_cursor_create(&cursor, source, 0, 0);
if (st)
error("ham_cursor_create", st);
/* get a cursor to the source database */
st = ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_FIRST);
if (st == HAM_KEY_NOT_FOUND) {
printf("database is empty!\n");
return;
}
else if (st)
error("ham_cursor_move", st);
do {
/* insert this element into the new database */
st = ham_db_insert(dest, 0, &key, &rec, HAM_DUPLICATE);
if (st)
error("ham_db_insert", st);
/* give some feedback to the user */
printf(".");
/* fetch the next item, and repeat till we've reached the end
* of the database */
st = ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_NEXT);
if (st && st != HAM_KEY_NOT_FOUND)
error("ham_cursor_move", st);
} while (st == 0);
/* clean up and return */
ham_cursor_close(cursor);
}
void CDbxKV::FillContacts()
{
m_contactCount = 0;
ham_key_t key = { 0 };
ham_record_t rec = { 0 };
cursor_ptr cursor(m_dbContacts);
if (ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_FIRST) != HAM_SUCCESS) // empty table?
return;
do {
DBContact *dbc = (DBContact*)rec.data;
if (dbc->dwSignature != DBCONTACT_SIGNATURE)
DatabaseCorruption(NULL);
DBCachedContact *cc = m_cache->AddContactToCache(*(DWORD*)key.data);
cc->dbc.dwSignature = DBCONTACT_SIGNATURE;
cc->dbc.dwEventCount = dbc->dwEventCount;
cc->dbc.dwFirstUnread = dbc->dwFirstUnread;
cc->dbc.tsFirstUnread = dbc->tsFirstUnread;
CheckProto(cc, "");
m_dwMaxContactId = cc->contactID+1;
m_contactCount++;
DBVARIANT dbv; dbv.type = DBVT_DWORD;
cc->nSubs = (0 != GetContactSetting(cc->contactID, META_PROTO, "NumContacts", &dbv)) ? -1 : dbv.dVal;
if (cc->nSubs != -1) {
cc->pSubs = (MCONTACT*)mir_alloc(cc->nSubs*sizeof(MCONTACT));
for (int i = 0; i < cc->nSubs; i++) {
char setting[100];
mir_snprintf(setting, SIZEOF(setting), "Handle%d", i);
cc->pSubs[i] = (0 != GetContactSetting(cc->contactID, META_PROTO, setting, &dbv)) ? NULL : dbv.dVal;
}
}
cc->nDefault = (0 != GetContactSetting(cc->contactID, META_PROTO, "Default", &dbv)) ? -1 : dbv.dVal;
cc->parentID = (0 != GetContactSetting(cc->contactID, META_PROTO, "ParentMeta", &dbv)) ? NULL : dbv.dVal;
} while (ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_NEXT) == HAM_SUCCESS);
}
int
main(int argc, char **argv)
{
ham_status_t st; /* status variable */
ham_db_t *db; /* hamsterdb database object */
ham_cursor_t *cursor; /* a database cursor */
char line[1024*4]; /* a buffer for reading lines */
ham_key_t key;
ham_record_t record;
memset(&key, 0, sizeof(key));
memset(&record, 0, sizeof(record));
printf("This sample uses hamsterdb to list all words in the "
"original order.\n");
printf("Reading from stdin...\n");
/*
* first step: create a new hamsterdb object
*/
st=ham_new(&db);
if (st!=HAM_SUCCESS) {
printf("ham_new() failed with error %d\n", st);
return (-1);
}
/*
* second step: create a new hamsterdb "record number" Database
*
* we could create an in-memory-database to speed up the sorting.
*/
st=ham_create(db, "test.db", HAM_RECORD_NUMBER, 0664);
if (st!=HAM_SUCCESS) {
printf("ham_create() failed with error %d\n", st);
return (-1);
}
/*
* now we read each line from stdin and split it in words; then each
* word is inserted into the database
*/
while (fgets(line, sizeof(line), stdin)) {
char *start=line, *p;
/*
* strtok is not the best function because it's not threadsafe
* and not flexible, but it's good enough for this example.
*/
while ((p=strtok(start, " \t\r\n"))) {
ham_u64_t recno;
key.flags=HAM_KEY_USER_ALLOC;
key.data=&recno;
key.size=sizeof(recno);
record.data=p;
record.size=(ham_size_t)strlen(p)+1; /* also store terminating 0 */
st=ham_insert(db, 0, &key, &record, 0);
if (st!=HAM_SUCCESS && st!=HAM_DUPLICATE_KEY) {
printf("ham_insert() failed with error %d\n", st);
return (-1);
}
printf(".");
start=0;
}
}
/*
* create a cursor
*/
st=ham_cursor_create(db, 0, 0, &cursor);
if (st!=HAM_SUCCESS) {
printf("ham_cursor_create() failed with error %d\n", st);
return (-1);
}
/*
* iterate over all items and print the records
*/
while (1) {
st=ham_cursor_move(cursor, &key, &record, HAM_CURSOR_NEXT);
if (st!=HAM_SUCCESS) {
/* reached end of the database? */
if (st==HAM_KEY_NOT_FOUND)
break;
else {
printf("ham_cursor_next() failed with error %d\n", st);
return (-1);
}
}
/*
* print the record number and the word
*/
#if WIN32
printf("%I64u: %s\n", *(ham_u64_t *)key.data,
(const char *)record.data);
#else
printf("%llu: %s\n", *(unsigned long long *)key.data,
(const char *)record.data);
#endif
}
/*
* then close the database handle; the flag
* HAM_AUTO_CLEANUP will automatically close all cursors, and we
* do not need to call ham_cursor_close
*/
st=ham_close(db, HAM_AUTO_CLEANUP);
if (st!=HAM_SUCCESS) {
printf("ham_close() failed with error %d\n", st);
return (-1);
}
/*
* delete the database object to avoid memory leaks
*/
ham_delete(db);
/*
* success!
*/
return (0);
}
/** Moves the Cursor, and retrieves the key/record of the new position. */
void move(key *k, record *r, uint32_t flags = 0) {
ham_status_t st = ham_cursor_move(m_cursor, k ? k->get_handle() : 0,
r ? r->get_handle() : 0, flags);
if (st)
throw error(st);
}
int
main(int argc, char **argv)
{
int i;
ham_status_t st; /* status variable */
ham_db_t *db[MAX_DBS]; /* hamsterdb database objects */
ham_env_t *env; /* hamsterdb environment */
ham_cursor_t *cursor[MAX_DBS]; /* a cursor for each database */
ham_key_t key, cust_key, ord_key, c2o_key;
ham_record_t record, cust_record, ord_record, c2o_record;
customer_t customers[MAX_CUSTOMERS]={
{ 1, "Alan Antonov Corp." },
{ 2, "Barry Broke Inc." },
{ 3, "Carl Caesar Lat." },
{ 4, "Doris Dove Brd." }
};
order_t orders[MAX_ORDERS]={
{ 1, 1, "Joe" },
{ 2, 1, "Tom" },
{ 3, 3, "Joe" },
{ 4, 4, "Tom" },
{ 5, 3, "Ben" },
{ 6, 3, "Ben" },
{ 7, 4, "Chris" },
{ 8, 1, "Ben" }
};
memset(&key, 0, sizeof(key));
memset(&record, 0, sizeof(record));
memset(&cust_key, 0, sizeof(cust_key));
memset(&cust_record, 0, sizeof(cust_record));
memset(&ord_key, 0, sizeof(ord_key));
memset(&ord_record, 0, sizeof(ord_record));
memset(&c2o_key, 0, sizeof(c2o_key));
memset(&c2o_record, 0, sizeof(c2o_record));
/*
* first, create a new hamsterdb environment
*/
st=ham_env_new(&env);
if (st!=HAM_SUCCESS)
error("ham_env_new", st);
/*
* then create the database objects
*/
for (i=0; i<MAX_DBS; i++) {
st=ham_new(&db[i]);
if (st!=HAM_SUCCESS)
error("ham_new", st);
}
/*
* Now create a new database file for the Environment
*/
st=ham_env_create_ex(env, "test.db", 0, 0664, 0);
if (st!=HAM_SUCCESS)
error("ham_env_create", st);
/*
* Then create the two Databases in this Environment; each Database
* has a name - the first is our "customer" Database, the second
* is for the "orders"; the third manages our 1:n relation and
* therefore needs to enable duplicate keys
*/
st=ham_env_create_db(env, db[DBIDX_CUSTOMER], DBNAME_CUSTOMER, 0, 0);
if (st!=HAM_SUCCESS)
error("ham_env_create_db(customer)", st);
st=ham_env_create_db(env, db[DBIDX_ORDER], DBNAME_ORDER, 0, 0);
if (st!=HAM_SUCCESS)
error("ham_env_create_db(order)", st);
st=ham_env_create_db(env, db[DBIDX_C2O], DBNAME_C2O,
HAM_ENABLE_DUPLICATES, 0);
if (st!=HAM_SUCCESS)
error("ham_env_create_db(c2o)", st);
/*
* create a Cursor for each Database
*/
for (i=0; i<MAX_DBS; i++) {
st=ham_cursor_create(db[i], 0, 0, &cursor[i]);
if (st!=HAM_SUCCESS)
error("ham_cursor_create" , st);
}
/*
* Insert the customers in the customer table
*
* INSERT INTO customers VALUES (1, "Alan Antonov Corp.");
* INSERT INTO customers VALUES (2, "Barry Broke Inc.");
* etc
*/
for (i=0; i<MAX_CUSTOMERS; i++) {
key.size=sizeof(int);
key.data=&customers[i].id;
record.size=sizeof(customer_t);
record.data=&customers[i];
st=ham_insert(db[0], 0, &key, &record, 0);
if (st!=HAM_SUCCESS)
error("ham_insert (customer)", st);
}
/*
* And now the orders in the second Database; contrary to env1,
* we only store the assignee, not the whole structure
*
* INSERT INTO orders VALUES (1, "Joe");
* INSERT INTO orders VALUES (2, "Tom");
*/
for (i=0; i<MAX_ORDERS; i++) {
key.size=sizeof(int);
key.data=&orders[i].id;
record.size=sizeof(orders[i].assignee);
record.data=orders[i].assignee;
st=ham_insert(db[1], 0, &key, &record, 0);
if (st!=HAM_SUCCESS)
error("ham_insert (order)", st);
}
/*
* and now the 1:n relationships; the flag HAM_DUPLICATE creates
* a duplicate key, if the key already exists
*
* INSERT INTO c2o VALUES (1, 1);
* INSERT INTO c2o VALUES (2, 1);
* etc
*/
for (i=0; i<MAX_ORDERS; i++) {
key.size=sizeof(int);
key.data=&orders[i].customer_id;
record.size=sizeof(int);
record.data=&orders[i].id;
st=ham_insert(db[2], 0, &key, &record, HAM_DUPLICATE);
if (st!=HAM_SUCCESS)
error("ham_insert(c2o)", st);
}
/*
* now start the query - we want to dump each customer with his
* orders
*
* loop over the customer; for each customer, loop over the 1:n table
* and pick those orders with the customer id. then load the order
* and print it
*
* the outer loop is similar to
* SELECT * FROM customers WHERE 1;
*/
while (1) {
customer_t *customer;
st=ham_cursor_move(cursor[0], &cust_key, &cust_record, HAM_CURSOR_NEXT);
if (st!=HAM_SUCCESS) {
/* reached end of the database? */
if (st==HAM_KEY_NOT_FOUND)
break;
else
error("ham_cursor_next(customer)", st);
}
customer=(customer_t *)cust_record.data;
/* print the customer id and name */
printf("customer %d ('%s')\n", customer->id, customer->name);
/*
* loop over the 1:n table
*
* before we start the loop, we move the cursor to the
* first duplicate key
*
* SELECT * FROM customers, orders, c2o
* WHERE c2o.customer_id=customers.id AND
* c2o.order_id=orders.id;
*/
c2o_key.data=&customer->id;
c2o_key.size=sizeof(int);
st=ham_cursor_find(cursor[2], &c2o_key, 0);
if (st!=HAM_SUCCESS) {
if (st==HAM_KEY_NOT_FOUND)
continue;
error("ham_cursor_find(c2o)", st);
}
st=ham_cursor_move(cursor[2], 0, &c2o_record, 0);
if (st!=HAM_SUCCESS)
error("ham_cursor_move(c2o)", st);
do {
int order_id;
order_id=*(int *)c2o_record.data;
ord_key.data=&order_id;
ord_key.size=sizeof(int);
/*
* load the order
* SELECT * FROM orders WHERE id = order_id;
*/
st=ham_find(db[1], 0, &ord_key, &ord_record, 0);
if (st!=HAM_SUCCESS)
error("ham_find(order)", st);
printf(" order: %d (assigned to %s)\n",
order_id, (char *)ord_record.data);
/*
* the flag HAM_ONLY_DUPLICATES restricts the cursor
* movement to the duplicate list.
*/
st=ham_cursor_move(cursor[2], &c2o_key,
&c2o_record, HAM_CURSOR_NEXT|HAM_ONLY_DUPLICATES);
if (st!=HAM_SUCCESS) {
/* reached end of the database? */
if (st==HAM_KEY_NOT_FOUND)
break;
else
error("ham_cursor_next(c2o)", st);
}
} while(1);
}
/*
* Now close the Environment handle; the flag
* HAM_AUTO_CLEANUP will automatically close all Databases and
* Cursors
*/
st=ham_env_close(env, HAM_AUTO_CLEANUP);
if (st!=HAM_SUCCESS)
error("ham_env_close", st);
for (i=0; i<MAX_DBS; i++)
ham_delete(db[i]);
ham_env_delete(env);
#if UNDER_CE
error("success", 0);
#endif
printf("success!\n");
return (0);
}
static void
print_database(ham_db_t *db, ham_u16_t dbname, int full)
{
ham_btree_t *be;
ham_cursor_t *cursor;
ham_status_t st;
ham_key_t key;
ham_record_t rec;
unsigned num_items=0, ext_keys=0, min_key_size=0xffffffff,
max_key_size=0, min_rec_size=0xffffffff, max_rec_size=0,
total_key_size=0, total_rec_size=0;
be=(ham_btree_t *)db_get_backend(db);
memset(&key, 0, sizeof(key));
memset(&rec, 0, sizeof(rec));
printf("\n");
printf(" database %d (0x%x)\n", (int)dbname, (int)dbname);
printf(" max key size: %u\n",
be_get_keysize(be));
printf(" max keys per page: %u\n",
btree_get_maxkeys(be));
printf(" address of root page: %llu\n",
(long long unsigned int)btree_get_rootpage(be));
printf(" flags: 0x%04x\n",
db_get_rt_flags(db));
if (!full)
return;
st=ham_cursor_create(db, 0, 0, &cursor);
if (st!=HAM_SUCCESS)
error("ham_cursor_create", st);
while (1) {
st=ham_cursor_move(cursor, &key, &rec, HAM_CURSOR_NEXT);
if (st!=HAM_SUCCESS) {
/* reached end of the database? */
if (st==HAM_KEY_NOT_FOUND)
break;
else
error("ham_cursor_next", st);
}
num_items++;
if (key.size<min_key_size)
min_key_size=key.size;
if (key.size>max_key_size)
max_key_size=key.size;
if (rec.size<min_rec_size)
min_rec_size=rec.size;
if (rec.size>max_rec_size)
max_rec_size=rec.size;
if (key.size>db_get_keysize(db))
ext_keys++;
total_key_size+=key.size;
total_rec_size+=rec.size;
}
ham_cursor_close(cursor);
printf(" number of items: %u\n", num_items);
if (num_items==0)
return;
printf(" average key size: %u\n", total_key_size/num_items);
printf(" minimum key size: %u\n", min_key_size);
printf(" maximum key size: %u\n", max_key_size);
printf(" number of extended keys:%u\n", ext_keys);
printf(" total keys (bytes): %u\n", total_key_size);
printf(" average record size: %u\n", total_rec_size/num_items);
printf(" minimum record size: %u\n", min_rec_size);
printf(" maximum record size: %u\n", min_rec_size);
printf(" total records (bytes): %u\n", total_rec_size);
}
int
main(int argc, char **argv) {
int i;
ham_status_t st; /* status variable */
ham_db_t *db[MAX_DBS]; /* hamsterdb database objects */
ham_env_t *env; /* hamsterdb environment */
ham_cursor_t *cursor[MAX_DBS]; /* a cursor for each database */
ham_key_t key, cust_key, ord_key;
ham_record_t record, cust_record, ord_record;
customer_t customers[MAX_CUSTOMERS] = {
{ 1, "Alan Antonov Corp." },
{ 2, "Barry Broke Inc." },
{ 3, "Carl Caesar Lat." },
{ 4, "Doris Dove Brd." }
};
order_t orders[MAX_ORDERS] = {
{ 1, 1, "Joe" },
{ 2, 1, "Tom" },
{ 3, 3, "Joe" },
{ 4, 4, "Tom" },
{ 5, 3, "Ben" },
{ 6, 3, "Ben" },
{ 7, 4, "Chris" },
{ 8, 1, "Ben" }
};
memset(&key, 0, sizeof(key));
memset(&record, 0, sizeof(record));
memset(&cust_key, 0, sizeof(cust_key));
memset(&cust_record, 0, sizeof(cust_record));
memset(&ord_key, 0, sizeof(ord_key));
memset(&ord_record, 0, sizeof(ord_record));
/* Now create a new hamsterdb Environment */
st = ham_env_create(&env, "test.db", 0, 0664, 0);
if (st != HAM_SUCCESS)
error("ham_env_create", st);
/*
* Then create the two Databases in this Environment; each Database
* has a name - the first is our "customer" Database, the second
* is for the "orders"
*/
st = ham_env_create_db(env, &db[0], DBNAME_CUSTOMER, 0, 0);
if (st != HAM_SUCCESS)
error("ham_env_create_db (customer)", st);
st = ham_env_create_db(env, &db[1], DBNAME_ORDER, 0, 0);
if (st != HAM_SUCCESS)
error("ham_env_create_db (order)", st);
/* Create a Cursor for each Database */
for (i = 0; i < MAX_DBS; i++) {
st = ham_cursor_create(&cursor[i], db[i], 0, 0);
if (st != HAM_SUCCESS) {
printf("ham_cursor_create() failed with error %d\n", st);
return (-1);
}
}
/* Insert a few customers in the first database */
for (i = 0; i < MAX_CUSTOMERS; i++) {
key.size = sizeof(int);
key.data = &customers[i].id;
record.size = sizeof(customer_t);
record.data = &customers[i];
st = ham_db_insert(db[0], 0, &key, &record, 0);
if (st != HAM_SUCCESS)
error("ham_db_insert (customer)", st);
}
/* And now the orders in the second database */
for (i = 0; i < MAX_ORDERS; i++) {
key.size = sizeof(int);
key.data = &orders[i].id;
record.size = sizeof(order_t);
record.data = &orders[i];
st = ham_db_insert(db[1], 0, &key, &record, 0);
if (st != HAM_SUCCESS)
error("ham_db_insert (order)", st);
}
/*
* To demonstrate even more functions: close all objects, then
* re-open the environment and the two databases.
*
* Note that ham_env_close automatically calls ham_db_close on all
* databases.
*/
for (i = 0; i < MAX_DBS; i++) {
st = ham_cursor_close(cursor[i]);
if (st != HAM_SUCCESS)
error("ham_cursor_close", st);
}
st = ham_env_close(env, 0);
if (st != HAM_SUCCESS)
error("ham_env_close", st);
/* Now reopen the environment and the databases */
st = ham_env_open(&env, "test.db", 0, 0);
if (st != HAM_SUCCESS)
error("ham_env_open", st);
st = ham_env_open_db(env, &db[0], DBNAME_CUSTOMER, 0, 0);
if (st != HAM_SUCCESS)
error("ham_env_open_db (customer)", st);
st = ham_env_open_db(env, &db[1], DBNAME_ORDER, 0, 0);
if (st != HAM_SUCCESS)
error("ham_env_open_db (order)", st);
/* Re-create a cursor for each database */
for (i = 0; i < MAX_DBS; i++) {
st = ham_cursor_create(&cursor[i], db[i], 0, 0);
if (st != HAM_SUCCESS) {
printf("ham_cursor_create() failed with error %d\n", st);
return (-1);
}
}
/*
* Now start the query - we want to dump each customer with his
* orders
*
* We have a loop with two cursors - the first cursor looping over
* the database with customers, the second loops over the orders.
*/
while (1) {
customer_t *customer;
st = ham_cursor_move(cursor[0], &cust_key, &cust_record,
HAM_CURSOR_NEXT);
if (st != HAM_SUCCESS) {
/* reached end of the database? */
if (st == HAM_KEY_NOT_FOUND)
break;
else
error("ham_cursor_next(customer)", st);
}
customer = (customer_t *)cust_record.data;
/* print the customer id and name */
printf("customer %d ('%s')\n", customer->id, customer->name);
/*
* The inner loop prints all orders of this customer. Move the
* cursor to the first entry.
*/
st = ham_cursor_move(cursor[1], &ord_key, &ord_record,
HAM_CURSOR_FIRST);
if (st != HAM_SUCCESS) {
/* reached end of the database? */
if (st == HAM_KEY_NOT_FOUND)
continue;
else
error("ham_cursor_next(order)", st);
}
do {
order_t *order = (order_t *)ord_record.data;
/* print this order, if it belongs to the current customer */
if (order->customer_id == customer->id)
printf(" order: %d (assigned to %s)\n",
order->id, order->assignee);
st = ham_cursor_move(cursor[1], &ord_key,
&ord_record, HAM_CURSOR_NEXT);
if (st != HAM_SUCCESS) {
/* reached end of the database? */
if (st == HAM_KEY_NOT_FOUND)
break;
else
error("ham_cursor_next(order)", st);
}
} while (1);
}
/*
* Now close the environment handle; the flag HAM_AUTO_CLEANUP will
* automatically close all databases and cursors
*/
st = ham_env_close(env, HAM_AUTO_CLEANUP);
if (st != HAM_SUCCESS)
error("ham_env_close", st);
printf("success!\n");
return (0);
}
int
main(int argc, char **argv) {
ham_status_t st; /* status variable */
ham_env_t *env; /* hamsterdb environment object */
ham_db_t *db; /* hamsterdb database object */
ham_cursor_t *cursor; /* a database cursor */
char line[1024 * 4]; /* a buffer for reading lines */
ham_key_t key;
ham_record_t record;
memset(&key, 0, sizeof(key));
memset(&record, 0, sizeof(record));
printf("This sample uses hamsterdb to sort data.\n");
printf("Reading from stdin...\n");
/*
* Create a new hamsterdb Environment.
* We could create an In-Memory-Environment to speed up the sorting.
*/
st = ham_env_create(&env, "test.db", 0, 0664, 0);
if (st != HAM_SUCCESS) {
printf("ham_env_create() failed with error %d\n", st);
return (-1);
}
st = ham_env_create_db(env, &db, DATABASE_NAME,
HAM_ENABLE_EXTENDED_KEYS | HAM_ENABLE_DUPLICATES, 0);
if (st != HAM_SUCCESS) {
printf("ham_env_create_db() failed with error %d\n", st);
return (-1);
}
/*
* Since we use strings as our database keys we use our own comparison
* function based on strcmp instead of the default memcmp function.
*/
st = ham_db_set_compare_func(db, my_string_compare);
if (st) {
printf("ham_set_compare_func() failed with error %d\n", st);
return (-1);
}
/*
* Now read each line from stdin and split it in words; then each
* word is inserted into the database
*/
while (fgets(line, sizeof(line), stdin)) {
char *start = line, *p;
/*
* strtok is not the best function because it's not threadsafe
* and not flexible, but it's good enough for this example.
*/
while ((p = strtok(start, " \t\r\n"))) {
key.data = p;
key.size = (ham_size_t)strlen(p) + 1; /* also store the terminating
* 0-byte */
st = ham_db_insert(db, 0, &key, &record, 0);
if (st != HAM_SUCCESS && st!=HAM_DUPLICATE_KEY) {
printf("ham_db_insert() failed with error %d\n", st);
return (-1);
}
printf(".");
start = 0;
}
}
/* create a cursor */
st = ham_cursor_create(&cursor, db, 0, 0);
if (st != HAM_SUCCESS) {
printf("ham_cursor_create() failed with error %d\n", st);
return (-1);
}
/* iterate over all items with HAM_CURSOR_NEXT, and print the words */
while (1) {
st = ham_cursor_move(cursor, &key, &record, HAM_CURSOR_NEXT);
if (st != HAM_SUCCESS) {
/* reached end of the database? */
if (st == HAM_KEY_NOT_FOUND)
break;
else {
printf("ham_cursor_next() failed with error %d\n", st);
return (-1);
}
}
/* print the word */
printf("%s\n", (const char *)key.data);
}
/*
* Then close the handles; the flag HAM_AUTO_CLEANUP will automatically
* close all database and cursors, and we do not need to call
* ham_cursor_close and ham_db_close
*/
st = ham_env_close(env, HAM_AUTO_CLEANUP);
if (st != HAM_SUCCESS) {
printf("ham_env_close() failed with error %d\n", st);
return (-1);
}
/* success! */
return (0);
}
