1 files changed, 0 insertions, 135 deletions
diff --git a/tests/treeidxtest.cpp b/tests/treeidxtest.cpp
deleted file mode 100644
index e7bfa2b..0000000
--- a/tests/treeidxtest.cpp
+++ /dev/null
@@ -1,135 +0,0 @@
-#include <entriesblk.h>
-#include <iostream>
-#include <string>
-#include <stdio.h>
-#include <treekeyidx.h>
-
-#ifndef NO_SWORD_NAMESPACE
-using namespace sword;
-#endif
-
-void printTree(TreeKeyIdx treeKey, TreeKeyIdx *target = 0, int level = 1) {
-	if (!target)
-		target = &treeKey;
-	
-	unsigned long currentOffset = target->getOffset();
-	std::cout << ((currentOffset == treeKey.getOffset()) ? "==>" : "");
-	for (int i = 0; i < level; i++) std::cout << "\t";
-	std::cout << treeKey.getLocalName() << std::endl;
-	if (treeKey.firstChild()) {
-		printTree(treeKey, target, level+1);
-		treeKey.parent();
-	}
-	if (treeKey.nextSibling())
-		printTree(treeKey, target, level);
-
-}
-
-
-void printLocalName(TreeKeyIdx *treeKey) {
-	std::cout << "locaName: " << treeKey->getLocalName() << std::endl;
-}
-
-
-void setLocalName(TreeKeyIdx *treeKey) {
-	char buf[1023];
-	std::cout << "Enter New Node Name: ";
-	gets(buf);
-	treeKey->setLocalName(buf);
-	treeKey->save();
-}
-
-
-void appendSibbling(TreeKeyIdx *treeKey) {
-	if (treeKey->getOffset()) {
-		char buf[1023];
-		std::cout << "Enter New Sibbling Name: ";
-		gets(buf);
-		treeKey->append();
-		treeKey->setLocalName(buf);
-		treeKey->save();
-	}
-	else	std::cout << "Can't add sibling to root node\n";
-}
-
-
-void appendChild(TreeKeyIdx *treeKey) {
-	char buf[1023];
-	std::cout << "Enter New Child Name: ";
-	gets(buf);
-	treeKey->appendChild();
-	treeKey->setLocalName(buf);
-	treeKey->save();
-}
-
-
-void removeEntry(EntriesBlock *eb, int index) {
-	if (index < eb->getCount()) {
-		std::cout << "Removing entry [" << index << "]\n";
-		eb->removeEntry(index);
-	}
-	else std::cout << "Invalid entry number\n\n";
-}
-
-
-int main(int argc, char **argv) {
-
-	if (argc != 2) {
-		fprintf(stderr, "usage: %s <tree/key/data/path>\n", *argv);
-		exit(-1);
-	}
-
-	TreeKeyIdx *treeKey = new TreeKeyIdx(argv[1]);
-
-	if (treeKey->Error()) {
-		treeKey->create(argv[1]);
-		delete treeKey;
-		treeKey = new TreeKeyIdx(argv[1]);
-	}
-	TreeKeyIdx root = *treeKey;
-
-	std::string input;
-	char line[1024];
-
-	do {
-		std::cout << "[" << treeKey->getFullName() << "] > ";
-		gets(line);
-		input = line;
-		if (input.length() > 0) {
-			switch (input[0]) {
-				case 'n': printLocalName(treeKey); break;
-				case 's': setLocalName(treeKey); break;
-				case 'p':	root.root(); printTree(root, treeKey); break;
-				case 'a':	appendSibbling(treeKey); break;
-				case 'c':	appendChild(treeKey); break;
-				case 'j':	treeKey->nextSibling(); break;
-				case 'k':	treeKey->previousSibling(); break;
-				case 'h':	treeKey->parent(); break;
-				case 'l':	treeKey->firstChild(); break;
-				case 'r':	treeKey->root(); break;
-				case 'q': break;
-				case '?':
-				default:
-					std::cout << "\n p - print tree\n";
-					std::cout << " n - get local name\n";
-					std::cout << " s - set local name\n";
-					std::cout << " j - next sibbling\n";
-					std::cout << " k - previous sibbling\n";
-					std::cout << " h - parent\n";
-					std::cout << " l - first child\n";
-					std::cout << " r - root\n";
-					std::cout << " a - append sibbling\n";
-					std::cout << " c - append child\n";
-					std::cout << " u - get user data\n";
-					std::cout << " d - set user data\n";
-					std::cout << " q - quit\n\n";
-					break;
-			}
-		}
-	}
-	while (input.compare("q"));
-
-	delete treeKey;
-
-	return 0;
-}