1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
/******************************************************************************
*
* treeidxutil.cpp -
*
* $Id: treeidxutil.cpp 2833 2013-06-29 06:40:28Z chrislit $
*
* Copyright 2002-2013 CrossWire Bible Society (http://www.crosswire.org)
* CrossWire Bible Society
* P. O. Box 2528
* Tempe, AZ 85280-2528
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation version 2.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
*/
#ifdef _MSC_VER
#pragma warning( disable: 4251 )
#endif
#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], *c;
std::cout << "Enter New Node Name: ";
c = fgets(buf, 1000, stdin);
if (c == NULL)
std::cerr << "ERROR: fgets failed in setLocalName\n";
treeKey->setLocalName(buf);
treeKey->save();
}
void assurePath(TreeKeyIdx *treeKey) {
char buf[1023], *c;
std::cout << "Enter path: ";
c = fgets(buf, 1000, stdin);
if (c == NULL)
std::cerr << "ERROR: fgets failed in assurePath\n";
treeKey->assureKeyPath(buf);
}
void appendSibbling(TreeKeyIdx *treeKey) {
if (treeKey->getOffset()) {
char buf[1023], *c;
std::cout << "Enter New Sibbling Name: ";
c = fgets(buf, 1000, stdin);
if (c == NULL)
std::cerr << "ERROR: fgets failed in appendSibbling\n";
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], *c;
std::cout << "Enter New Child Name: ";
c = fgets(buf, 1000, stdin);
if (c == NULL)
std::cerr << "ERROR: fgets failed in appendChild\n";
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->popError()) {
treeKey->create(argv[1]);
delete treeKey;
treeKey = new TreeKeyIdx(argv[1]);
}
TreeKeyIdx root = *treeKey;
std::string input;
char line[1024], *c;
do {
std::cout << "[" << treeKey->getText() << "] > ";
c = fgets(line, 1000, stdin);
if (c == NULL)
std::cerr << "ERROR: fgets failed in main\n";
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 'g': assurePath(treeKey); 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 << " g - goto path; create if it doesn't exist\n";
std::cout << " q - quit\n\n";
break;
}
}
}
while (input.compare("q"));
delete treeKey;
return 0;
}
|
