bfs/btree/test.cpp

333 	status_t status;
334 	while ((status = iterator.GetNextEntry(key, &length, B_FILE_NAME_LENGTH,
362 	if (status != B_ENTRY_NOT_FOUND) {
363 		printf("TreeIterator::GetNext() returned: %s\n", strerror(status));
387 		status_t status = iterator.Find((uint8*)gKeys[i].data, gKeys[i].length);
389 			if (status == B_OK) {
393 		} else if (status != B_OK) {
394 			printf("TreeIterator::Find() returned: %s\n", strerror(status));
427 		status_t status = tree->Insert(transaction, (uint8*)gKeys[i].data,
429 		if (status != B_OK) {
430 			printf("BPlusTree::Insert() returned: %s\n", strerror(status));
448 			status_t status = tree->Remove(transaction, (uint8*)gKeys[i].data,
450 			if (status != B_OK) {
451 				printf("BPlusTree::Remove() returned: %s\n", strerror(status));
477 	status_t status;
488 			status = tree->Insert(transaction, (uint8*)gKeys[index].data,
490 			if (status != B_OK) {
491 				printf("BPlusTree::Insert() returned: %s\n", strerror(status));
516 			status_t status = tree->Remove(transaction,
519 			if (status != B_OK) {
520 				printf("BPlusTree::Remove() returned: %s\n", strerror(status));
553 		status_t status = tree->Insert(transaction, (uint8*)gKeys[index].data,
555 		if (status != B_OK) {
556 			printf("BPlusTree::Insert() returned: %s\n", strerror(status));
598 		status_t status = tree->Remove(transaction, (uint8*)gKeys[index].data,
600 		if (status != B_OK) {
601 			printf("BPlusTree::Remove() returned: %s\n", strerror(status));
736 	status_t status = tree.InitCheck();
737 	if (status != B_OK) {
738 		fprintf(stderr, "creating tree failed: %s\n", strerror(status));
743 	status = createKeys();
744 	if (status != B_OK) {
745 		fprintf(stderr, "creating keys failed: %s\n", strerror(status));