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
|
/*
Copyright (©) 2003-2025 Teus Benschop.
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; either version 3 of the License, or
(at your option) any later version.
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.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include <resource/get.h>
#include <filter/roles.h>
#include <filter/string.h>
#include <webserver/request.h>
#include <resource/logic.h>
#include <database/config/bible.h>
#include <database/versifications.h>
#include <access/logic.h>
std::string resource_get_url ()
{
return "resource/get";
}
bool resource_get_acl (Webserver_Request& webserver_request)
{
return access_logic::privilege_view_resources (webserver_request);
}
std::string resource_get (Webserver_Request& webserver_request)
{
std::vector <std::string> bits;
std::string s_resource = webserver_request.query["resource"];
std::string s_book = webserver_request.query["book"];
std::string s_chapter = webserver_request.query["chapter"];
std::string s_verse = webserver_request.query["verse"];
if (!s_resource.empty () && !s_book.empty () && !s_chapter.empty () && !s_verse.empty ()) {
unsigned int resource = static_cast<unsigned>(filter::strings::convert_to_int (s_resource));
int book = filter::strings::convert_to_int (s_book);
int chapter = filter::strings::convert_to_int (s_chapter);
int verse = filter::strings::convert_to_int (s_verse);
// In JavaScript the resource identifier starts at 1.
// In the C++ Bibledit kernel it starts at 0.
resource--;
std::vector <std::string> resources = webserver_request.database_config_user()->get_active_resources ();
if (resource < resources.size ()) {
s_resource = resources [resource];
// Handle a divider.
if (resource_logic_is_divider (s_resource)) {
std::string text = resource_logic_get_divider (s_resource);
return text;
}
std::string bible = webserver_request.database_config_user ()->get_bible ();
std::string versification = database::config::bible::get_versification_system (bible);
Database_Versifications database_versifications;
std::vector <int> chapters = database_versifications.getChapters (versification, book);
// Whether to add extra verse numbers, for clarity in case of viewing more than one verse.
bool add_verse_numbers = false;
int context_before = webserver_request.database_config_user ()->get_resource_verses_before ();
if (context_before) add_verse_numbers = true;
int context_after = webserver_request.database_config_user ()->get_resource_verses_after ();
if (context_after) add_verse_numbers = true;
// Context before the focused verse.
std::vector <int> chapters_before;
std::vector <int> verses_before;
if (context_before > 0) {
for (int ch = chapter - 1; ch <= chapter; ch++) {
if (in_array (ch, chapters)) {
std::vector <int> verses = database_versifications.getVerses (versification, book, ch);
for (size_t vs = 0; vs < verses.size (); vs++) {
int vs2 = verses [vs];
if ((ch < chapter) || (vs2 < verse)) {
if (vs2 > 0) {
chapters_before.push_back (ch);
verses_before.push_back (verses[vs]);
}
}
}
}
}
while (static_cast<int>(chapters_before.size()) > context_before) {
chapters_before.erase (chapters_before.begin ());
verses_before.erase (verses_before.begin ());
}
}
for (unsigned int i = 0; i < chapters_before.size (); i++) {
bits.push_back (resource_logic_get_html (webserver_request, s_resource, book, chapters_before[i], verses_before[i], add_verse_numbers));
}
// Focused verse.
bits.push_back (resource_logic_get_html (webserver_request, s_resource, book, chapter, verse, add_verse_numbers));
// Context after the focused verse.
std::vector <int> chapters_after;
std::vector <int> verses_after;
if (context_after > 0) {
for (int ch = chapter; ch <= chapter + 1; ch++) {
if (in_array (ch, chapters)) {
std::vector <int> verses = database_versifications.getVerses (versification, book, ch);
for (size_t vs = 0; vs < verses.size (); vs++) {
int vs2 = verses [vs];
if ((ch > chapter) || (vs2 > verse)) {
if (vs2 > 0) {
chapters_after.push_back (ch);
verses_after.push_back (verses[vs]);
}
}
}
}
}
while (static_cast<int>(chapters_after.size()) > context_after) {
chapters_after.pop_back ();
verses_after.pop_back ();
}
}
for (unsigned int i = 0; i < chapters_after.size (); i++) {
bits.push_back (resource_logic_get_html (webserver_request, s_resource, book, chapters_after[i], verses_after[i], add_verse_numbers));
}
}
}
std::string page = filter::strings::implode (bits, ""); // <br>
return page;
}
|
