blob: 4867161a160e1daeaeae283cb6ae67ef8c82f43e (
plain) (
blame)
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
|
#include <entriesblk.h>
#include <iostream>
#include <string>
#include <stdio.h>
#include <treekeyidx.h>
#include <rawgenbook.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() << "/\n";
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() << "\n";
}
void setLocalName(TreeKeyIdx *treeKey) {
char buf[1023];
std::cout << "Enter New Node Name: ";
gets(buf);
treeKey->setLocalName(buf);
treeKey->save();
}
void gotoPath(TreeKeyIdx *treeKey) {
char buf[1023];
std::cout << "Enter Path: ";
gets(buf);
(*treeKey) = buf;
}
void viewEntryText(RawGenBook *book) {
std::cout << "\n";
std::cout << book->RenderText();
std::cout << "\n";
}
void setEntryText(RawGenBook *book) {
std::string body;
TreeKeyIdx *treeKey = (TreeKeyIdx *)(SWKey *)(*book);
if (treeKey->getOffset()) {
char buf[1023];
std::cout << "Enter New Entry Text ('.' on a line by itself to end): \n";
do {
gets(buf);
if ((buf[0] == '.') && (buf[1] == 0))
break;
body += buf;
body += "\n";
} while (true);
(*book) << body.c_str();
}
else std::cout << "Can't add entry text to root node\n";
}
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()) {
RawGenBook::createModule(argv[1]);
}
delete treeKey;
RawGenBook *book = new RawGenBook(argv[1]);
TreeKeyIdx root = *((TreeKeyIdx *)((SWKey *)(*book)));
treeKey = (TreeKeyIdx *)(SWKey *)(*book);
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 'g': gotoPath(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 't': setEntryText(book); break;
case 'v': viewEntryText(book); 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 << " g - goto path\n";
std::cout << " a - append sibbling\n";
std::cout << " c - append child\n";
std::cout << " v - view entry text\n";
std::cout << " t - set entry text\n";
std::cout << " q - quit\n\n";
break;
}
}
}
while (input.compare("q"));
delete treeKey;
return 0;
}
|
