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
|
/******************************************************************************
*
* gbfstrongs.cpp - SWFilter descendant to hide or show Strong's number
* in a GBF module
*
* $Id: gbfstrongs.cpp 3515 2017-11-01 11:38:09Z scribe $
*
* Copyright 1999-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.
*
*/
#include <stdlib.h>
#include <stdio.h>
#include <gbfstrongs.h>
#include <swmodule.h>
#include <ctype.h>
SWORD_NAMESPACE_START
namespace {
static const char oName[] = "Strong's Numbers";
static const char oTip[] = "Toggles Strong's Numbers On and Off if they exist";
static const StringList *oValues() {
static const SWBuf choices[3] = {"Off", "On", ""};
static const StringList oVals(&choices[0], &choices[2]);
return &oVals;
}
}
GBFStrongs::GBFStrongs() : SWOptionFilter(oName, oTip, oValues()) {
}
GBFStrongs::~GBFStrongs() {
}
char GBFStrongs::processText(SWBuf &text, const SWKey *key, const SWModule *module) {
char token[2048]; // cheese. Fix.
int tokpos = 0;
bool intoken = false;
bool lastspace = false;
int word = 1;
char val[128];
char wordstr[11];
char *valto;
unsigned int textStart = 0, textEnd = 0;
bool newText = false;
SWBuf tmp;
const char *from;
SWBuf orig = text;
from = orig.c_str();
for (text = ""; *from; from++) {
if (*from == '<') {
intoken = true;
tokpos = 0;
token[0] = 0;
token[1] = 0;
token[2] = 0;
textEnd = (unsigned int)text.size();
continue;
}
if (*from == '>') { // process tokens
intoken = false;
if (*token == 'W' && (token[1] == 'G' || token[1] == 'H')) { // Strongs
if (module->isProcessEntryAttributes()) {
valto = val;
for (unsigned int i = 1; ((token[i]) && (i < 150)); i++)
*valto++ = token[i];
*valto = 0;
if (atoi((!isdigit(*val))?val+1:val) < 5627) {
// normal strongs number
sprintf(wordstr, "%03d", word++);
module->getEntryAttributes()["Word"][wordstr]["PartsCount"] = "1";
module->getEntryAttributes()["Word"][wordstr]["Lemma"] = val;
module->getEntryAttributes()["Word"][wordstr]["LemmaClass"] = "strong";
tmp = "";
tmp.append(text.c_str()+textStart, (int)(textEnd - textStart));
module->getEntryAttributes()["Word"][wordstr]["Text"] = tmp;
newText = true;
}
else {
// verb morph
sprintf(wordstr, "%03d", word-1);
module->getEntryAttributes()["Word"][wordstr]["Morph"] = val;
module->getEntryAttributes()["Word"][wordstr]["MorphClass"] = "OLBMorph";
}
}
if (!option) {
if ((from[1] == ' ') || (from[1] == ',') || (from[1] == ';') || (from[1] == '.') || (from[1] == '?') || (from[1] == '!') || (from[1] == ')') || (from[1] == '\'') || (from[1] == '\"')) {
if (lastspace)
text--;
}
if (newText) {textStart = (unsigned int)text.size(); newText = false; }
continue;
}
}
if (module->isProcessEntryAttributes()) {
if ((*token == 'W') && (token[1] == 'T')) { // Morph
valto = val;
for (unsigned int i = 2; ((token[i]) && (i < 150)); i++)
*valto++ = token[i];
*valto = 0;
sprintf(wordstr, "%03d", word-1);
module->getEntryAttributes()["Word"][wordstr]["MorphClass"] = "GBFMorph";
module->getEntryAttributes()["Word"][wordstr]["Morph"] = val;
newText = true;
}
}
// if not a strongs token, keep token in text
text += '<';
text += token;
text += '>';
if (newText) {textStart = (unsigned int)text.size(); newText = false; }
continue;
}
if (intoken) {
if (tokpos < 2045) {
token[tokpos++] = *from;
// TODO: why is this + 2 ?
token[tokpos+2] = 0;
}
}
else {
text += *from;
lastspace = (*from == ' ');
}
}
return 0;
}
SWORD_NAMESPACE_END
|
