aboutsummaryrefslogtreecommitdiff
path: root/src/lib/libbible.cc
blob: f3b98207c92295a2e91289362c68d3b81704196b (plain)
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
#include "libbible.h"
#include <sword/versekey.h>
#include <sword/markupfiltmgr.h>
#include <sword/swmodule.h>
#include <sword/swmgr.h>
#include <sword/osisfootnotes.h>
#include <algorithm>

using namespace sword;
using namespace std;

SWMgr library(new MarkupFilterMgr(FMT_XHTML));
OSISFootnotes filter;

vector<string> getBooksSWModule(SWModule *target) {
    vector<string> books;
    if(target == nullptr) {
        // Module doesn't exist
        return books;
    }
    VerseKey *key = (VerseKey *) target->getKey();
    for(char t = 1; t <= key->getTestamentMax(); t++) {
        key->setTestament(t);
        for(char b = 1; b <= key->getBookMax(); b++) {
            key->setBook(b);
            // Bug (whose fault??) in JPS; they CLAIM to have two testaments,
            // but they only have one, which causes repeats.
            if(std::find(books.begin(), books.end(), key->getBookName()) != books.end()) {
                continue;
            }
            // Another issue (maybe bug?) Some translations are NT only,
            // but still report OT books/chapters.
            //if(string(target->renderText()).empty()) {
            //    continue;
            //}
            books.push_back(key->getBookName());
        }
    }
    return books;
}

map<string, vector<string>> libbible::getModules() {
    library.load();
    map<string, vector<string>> mods;
    ModMap::iterator it;
    for (it = library.getModules().begin(); it != library.getModules().end(); it++) {
        string modName = (*it).second->getName();
        SWModule *target = library.getModule(modName.c_str());
        mods[modName] = getBooksSWModule(target);
    }
    return mods;
}

vector<string> libbible::getModuleNames() {
    library.load();
    vector<string> mods;
    ModMap::iterator it;
    for (it = library.getModules().begin(); it != library.getModules().end(); it++) {
        mods.push_back((*it).second->getName());
    }
    return mods;
}

vector<string> libbible::getBooks(string modName) {
    library.load();
    return getBooksSWModule(library.getModule(modName.c_str()));
}

vector<libbible::passage> libbible::getPassages(string modName, string book) {
    vector<libbible::passage> passages;
    SWModule *target = library.getModule(modName.c_str());
    if(target == nullptr) {
        // Module doesn't exist
        return passages;
    }
    target->setKey((book + " " + "1").c_str());
    VerseKey *key = (VerseKey *) target->getKey();
    int maxChapter = key->getChapterMax();
    for(int chapter = 1; chapter <= maxChapter; chapter++) {
        string ref = book + ' ' + to_string(chapter);
        target->setKey(ref.c_str());
        VerseKey *key = (VerseKey *) target->getKey();
        libbible::passage pass;
        pass.modName = modName;
        pass.book = string(key->getBookName());
        pass.bookShort = string(key->getBookAbbrev());
        pass.chapterStart = chapter;
        pass.chapterEnd = chapter;
        pass.verseStart = 1;
        pass.verseEnd = key->getVerseMax();
        passages.push_back(pass);
    }
    return passages;
}

libbible::text getEmptyText(VerseKey *key) {
    libbible::text t;
    t.chapter = key->getChapter();
    t.verse = key->getVerse();
    t.book = key->getBookName();
    t.bookShort = key->getBookAbbrev();
    return t;
}

libbible::passage libbible::getPassage(string modName, string reference) {
    libbible::passage pass;
    pass.modName = modName;
    SWModule *target = library.getModule(pass.modName.c_str());
    if(target == nullptr || reference.empty()) {
        // Bad input
        return pass;
    }
    vector<string> validBooks = getBooksSWModule(target);
    //printf("Hey, I'm inferring missing parts!\n");
    // Let's use the target to help us
    target->setKey(reference.c_str());
    VerseKey *key = (VerseKey *) target->getKey();
    pass.book = string(key->getBookName());
    // Hold on a moment, is this book even legal?
    if(find(validBooks.begin(), validBooks.end(), pass.book) == validBooks.end()) {
        key->setBookName(validBooks[0].c_str());
        pass.book = string(key->getBookName());
    }
    pass.bookShort = string(key->getBookAbbrev());
    pass.chapterStart = key->getChapter();
    pass.verseStart = key->getVerse();
    //printf("Results so far: book: %s; chapterStart: %d; verseStart: %d\n", pass.book.c_str(), pass.chapterStart, pass.verseStart);
    // And now we just need chapterEnd and verseEnd. Yippee.
    string ref = string(reference);
    ref.erase(remove(ref.begin(), ref.end(), ' '), ref.end());
    if(ref.find('-') == string::npos) {
        // There's no range!
        if(ref.find(':') == string::npos) {
            // It's a full chapter reference
            pass.chapterEnd = pass.chapterStart;
            pass.verseEnd = key->getVerseMax();
        } else {
            // It's a single verse reference
            pass.chapterEnd = pass.chapterStart;
            pass.verseEnd = pass.verseStart;
            //printf("Hey, it's a single verse reference!\n");
        }
    } else {
        if(ref.find(':') == string::npos) {
            // It's a multi-full-chapter reference
            pass.chapterEnd = stoi(ref.substr(ref.find_last_of('-')+1));
            key->setChapter(pass.chapterEnd);
            pass.verseEnd = key->getVerseMax();
        } else {
            // It falls in categories c:v-v or c:v-c:v (or, technically, c-c:v)
            string rangeEnd = ref.substr(ref.find_last_of('-')+1);
            if(rangeEnd.find(':') == string::npos) {
                // It's c:v-v
                pass.verseEnd = stoi(rangeEnd);
                pass.chapterEnd = pass.chapterStart;
            } else {
                // It's c:v-c:v (or c-c:v, but code is the same)
                pass.chapterEnd = stoi(rangeEnd.substr(0, rangeEnd.find(':')));
                pass.verseEnd = stoi(rangeEnd.substr(rangeEnd.find(':')+1));
            }
        }
    }
    return pass;
}

vector<libbible::text> libbible::getText(libbible::passage pass) {
    vector<libbible::text> texts;
    SWModule *target = library.getModule(pass.modName.c_str());
    filter.setOptionValue("Off");
    target->addOptionFilter(&filter);
    if(target == nullptr) {
        // Module doesn't exist
        return texts;
    }
    if(pass.book.empty()) {
        pass.book = pass.bookShort;
    }
    target->setKey((pass.book
                + " " + to_string(pass.chapterStart)
                + ":" + to_string(pass.verseStart)).c_str());
    VerseKey *key = (VerseKey *) target->getKey();

    bool endOfParagraph = false;

    string book = string(key->getBookName());

    /*for(; string(key->getBookName()) == book &&
            (key->getChapter() < pass.chapterEnd
            || (key->getChapter() == pass.chapterEnd && key->getVerse() <= pass.verseEnd));
            (*key)++) {*/
    while(true) {
        string text = string(target->renderText());
        //printf("Working with: %s\n", text.c_str());

        texts.push_back(getEmptyText(key));

        if(key->getVerse() == 1 || endOfParagraph) {
            if(find(texts.back().modifiers.begin(), texts.back().modifiers.end(), "paragraph") == texts.back().modifiers.end()) {
                texts.back().modifiers.push_back("paragraph");
            }
            endOfParagraph = false;
        }

        // Variable to accumulate unterminated spans
        std::vector<std::pair<std::string, std::string>> spans;
        bool spansChanged = false;
        bool hasAddedText = false;
        // Iterate over text
        for(auto i = text.begin(); i != text.end(); i++) {
            if(*i != '<') {
                if(spansChanged) {
                    spansChanged = false;
                    if(!texts.back().text.empty()) {
                        texts.push_back(getEmptyText(key));
                    }
                    for(auto& [tag, modifier] : spans) {
                        if(find(texts.back().modifiers.begin(), texts.back().modifiers.end(), modifier) == texts.back().modifiers.end()) {
                            texts.back().modifiers.push_back(modifier);
                        }
                    }
                }
                if(*i == '\n') {
                    continue; // We add newlines with <br />
                }
                if(! hasAddedText && (*i == ' ' || *i == '\t')) {
                    continue;
                }
                if(*i == "¶"[0] && i+1 != text.end() && *(i+1) == "¶"[1]) {
                    i++;
                    if(hasAddedText) {
                        texts.back().text += '\n';
                    } else {
                        // Append \n to text in previous texts (if applicable)
                        if(texts.size() > 1) {
                            texts[texts.size()-2].text += '\n';
                        }
                        texts.back().modifiers.push_back("paragraph");
                        continue;
                    }
                }
                texts.back().text += *i;
                hasAddedText = true;
            }
            else {
                string span;
                for(; i != text.end(); i++) {
                    span.push_back(*i);
                    if(*i == '>') {
                        // The end of the span will be "</tag>".
                        if(span[1] == '/') {
                            string tag = span.substr(2, span.size()-3);
                            for(auto rit = spans.rbegin(); rit != spans.rend(); rit++) {
                                if(rit->first == tag) {
                                    spans.erase(rit.base()-1);
                                    spansChanged = true;
                                    break;
                                }
                            }
                        } else if(span.find("class=\"") != string::npos) {
                            // The span will be formatted "<tag class=\"NAME\">"
                            // We want just the NAME
                            string tag = span.substr(1, span.find(" ")-1);
                            size_t start = span.find("class=\"")+7;
                            size_t end = span.find("\"", start);
                            spans.push_back(std::pair<string, string>(tag, span.substr(start, end-start)));
                            spansChanged = true;
                        } else if(span.find("preverse") != string::npos) {
                            string tag = span.substr(1, span.find(" ")-1);
                            spans.push_back(std::pair<string, string>(tag, "preverse"));
                        } else if(span == "<br />" || span == "<br/>") {
                            texts.back().text += '\n';
                        }
                        break;
                    }
                }
            }
        }
        endOfParagraph = ! text.empty() and text.back() == '\n';
        if(string(key->getBookName()) != book ||
            (key->getChapter() >= pass.chapterEnd && key->getVerse() >= pass.verseEnd)) {
            break;
        }
        (*key)++;
    }
    return texts;
}