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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
|
/******************************************************************************
* VerseTreeKey.cpp - code for class 'VerseTreeKey'- versekey using treekey
* for data retrieval
*
*
* Copyright 2009 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.
*
*/
#include <versetreekey.h>
#include <ctype.h>
SWORD_NAMESPACE_START
static const char *classes[] = {"VerseTreeKey", "VerseKey", "SWKey", "SWObject", 0};
SWClass VerseTreeKey::classdef(classes);
/******************************************************************************
* VerseTreeKey Constructor - initializes instance of VerseTreeKey
*
* ENT: ikey - base key (will take various forms of 'BOOK CH:VS'. See
* VerseTreeKey::parse for more detailed information)
*/
VerseTreeKey::VerseTreeKey(TreeKey *treeKey, const SWKey *ikey) : VerseKey(ikey)
{
init(treeKey);
if (ikey)
parse();
}
/******************************************************************************
* VerseTreeKey Constructor - initializes instance of VerseTreeKey
*
* ENT: ikey - text key (will take various forms of 'BOOK CH:VS'. See
* VerseTreeKey::parse for more detailed information)
*/
VerseTreeKey::VerseTreeKey(TreeKey *treeKey, const char *ikey) : VerseKey(ikey)
{
init(treeKey);
if (ikey)
parse();
}
VerseTreeKey::VerseTreeKey(VerseTreeKey const &k) : VerseKey(k)
{
init(k.treeKey);
}
VerseTreeKey::VerseTreeKey(TreeKey *treeKey, const char *min, const char *max) : VerseKey(min, max)
{
init(treeKey);
}
void VerseTreeKey::init(TreeKey *treeKey)
{
myclass = &classdef;
this->treeKey = (TreeKey *)treeKey->clone();
this->treeKey->setPositionChangeListener(this);
internalPosChange = false;
}
SWKey *VerseTreeKey::clone() const
{
return new VerseTreeKey(*this);
}
int VerseTreeKey::getBookAbbrev(const char *iabbr)
{
int bookno = VerseKey::getBookAbbrev(iabbr);
if (bookno < 0) {
/*
vector<struct sbook>::iterator it = find(books, iabbr);
if (it == books.end()) {
TreeKey *tkey = this->treeKey;
int saveError = tkey->Error();
long bookmark = tkey->getOffset();
SWBuf segment;
internalPosChange = true;
do {
segment = (SWBuf)tkey->getLocalName();
} while (tkey->parent());
segment << 1;
if (saveError) {
error = saveError;
}
tkey->setOffset(bookmark);
}
books.push_back(sbook(iabbr));
*/
}
return bookno;
}
/******************************************************************************
* VerseTreeKey Destructor - cleans up instance of VerseTreeKey
*
* ENT: ikey - text key
*/
VerseTreeKey::~VerseTreeKey() {
delete treeKey;
}
void VerseTreeKey::decrement(int steps) {
int treeError = 0;
if (!error) lastGoodOffset = getTreeKey()->getOffset();
do {
treeKey->decrement();
treeError = treeKey->Error();
// iterate until 3 levels and no versekey parse errors
} while (!treeError && ((treeKey->getLevel() < 3) || error));
if (error && !treeError) {
int saveError = error;
increment();
error = saveError;
}
if (treeError) {
treeKey->setOffset(lastGoodOffset);
error = treeError;
}
if (_compare(UpperBound()) > 0) {
positionFrom(UpperBound());
error = KEYERR_OUTOFBOUNDS;
}
if (_compare(LowerBound()) < 0) {
positionFrom(LowerBound());
error = KEYERR_OUTOFBOUNDS;
}
}
void VerseTreeKey::increment(int steps) {
int treeError = 0;
if (!error) lastGoodOffset = getTreeKey()->getOffset();
do {
treeKey->increment();
treeError = treeKey->Error();
// iterate until 3 levels and no versekey parse errors
} while (!treeError && ((treeKey->getLevel() < 3) || error));
if (error && !treeError) {
int saveError = error;
decrement();
error = saveError;
}
if (treeError) {
treeKey->setOffset(lastGoodOffset);
error = treeError;
}
// bounds
if (_compare(UpperBound()) > 0) {
positionFrom(UpperBound());
error = KEYERR_OUTOFBOUNDS;
}
if (_compare(LowerBound()) < 0) {
positionFrom(LowerBound());
error = KEYERR_OUTOFBOUNDS;
}
}
void VerseTreeKey::positionChanged() {
if (!internalPosChange) {
TreeKey *tkey = this->TreeKey::PositionChangeListener::getTreeKey();
int saveError = tkey->Error();
long bookmark = tkey->getOffset();
SWBuf seg[4];
internalPosChange = true;
int legs = 0;
do {
seg[legs] = tkey->getLocalName();
legs++;
} while (tkey->parent() && (legs < 4));
legs--;
if ((legs < 2) && (!seg[0].length() || seg[0] == "/")) { //"[ Module Heading ]";
testament = 0;
book = 0;
chapter = 0;
setVerse(0);
}
else if ((legs < 2)
&& ((!strncmp(seg[0].c_str(), "[ Testament ", 12)) && //"[ Testament n Heading ]";
(isdigit(seg[0][12])) &&
(!strcmp(seg[0].c_str()+13, " Heading ]")))) {
testament = (seg[0][12]-48);
book = 0;
chapter = 0;
setVerse(0);
} //path = "[ Module Heading ]";
else {
setBookName(seg[--legs]);
chapter = (legs > 0) ? atoi(seg[--legs]) : 0;
setVerse((legs > 0) ? atoi(seg[--legs]) : 0);
}
// setText(path);
if (saveError) {
error = saveError;
}
tkey->setOffset(bookmark);
tkey->setError(saveError);
internalPosChange = false;
}
}
void VerseTreeKey::syncVerseToTree() {
internalPosChange = true;
SWBuf path;
if (!Testament()) path = "/"; // "[ Module Heading ]";
else if (!Book()) path.setFormatted("/[ Testament %d Heading ]", Testament());
else path.setFormatted("/%s/%d/%d", getOSISBookName(), getChapter(), getVerse());
if (getSuffix()) path += getSuffix();
long bookmark = treeKey->getOffset();
treeKey->setText(path);
// if our module has jacked inconsistencies, then let's put our tree back to where it was
if (treeKey->Error()) {
treeKey->setOffset(bookmark);
}
internalPosChange = false;
}
TreeKey *VerseTreeKey::getTreeKey() {
syncVerseToTree();
return treeKey;
}
// can autonormalize yet (ever?)
void VerseTreeKey::Normalize(char autocheck) {
error = 0;
}
long VerseTreeKey::NewIndex() const {
return treeKey->getOffset();
}
void VerseTreeKey::setPosition(SW_POSITION p) {
if (isBoundSet()) {
return VerseKey::setPosition(p);
}
switch (p) {
case POS_TOP:
Error();
treeKey->setPosition(p);
increment();
decrement();
Error();
break;
case POS_BOTTOM:
Error();
treeKey->setPosition(p);
decrement();
increment();
Error();
break;
case POS_MAXVERSE:
case POS_MAXCHAPTER:
VerseKey::setPosition(p);
break;
}
}
/******************************************************************************
* VerseTreeKey::copyFrom - Equates this VerseTreeKey to another VerseTreeKey
void VerseTreeKey::copyFrom(const VerseTreeKey &ikey) {
VerseKey::copyFrom(ikey);
}
*/
SWORD_NAMESPACE_END
|
