File: bibles.cpp

package info (click to toggle)
bibledit-cloud 5.1.036-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 250,636 kB
  • sloc: xml: 915,934; ansic: 261,349; cpp: 92,628; javascript: 32,542; sh: 4,915; makefile: 586; php: 69
file content (272 lines) | stat: -rw-r--r-- 8,937 bytes parent folder | download | duplicates (5)
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
/*
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 <database/bibles.h>
#include <database/books.h>
#include <database/state.h>
#include <resource/logic.h>
#include <filter/url.h>
#include <filter/string.h>
#include <filter/date.h>
#include <search/logic.h>
#include <export/logic.h>


// This database stores its data in files in the filesystem.
// This is a robust and reliable way of storing data.
// Because no real database is used, no database can get corrupted.


namespace database::bibles {


static const std::string& main_folder ()
{
  static std::string folder {filter_url_create_root_path ({"bibles"})};
  return folder;
}


std::string bible_folder (const std::string& bible)
{
  return filter_url_create_path ({main_folder (), bible});
}


static std::string book_folder (const std::string& bible, const int book)
{
  return filter_url_create_path ({bible_folder (bible), std::to_string (book)});
}


static std::string chapter_folder (const std::string& bible, const int book, const int chapter)
{
  return filter_url_create_path ({book_folder (bible, book), std::to_string (chapter)});
}


// Returns a list of available Bibles.
std::vector <std::string> get_bibles ()
{
  return filter_url_scandir (main_folder ());
}


// Creates a new empty Bible. Returns its ID.
void create_bible (const std::string& name)
{
  // Create the empty system.
  const std::string& folder = bible_folder (name);
  filter_url_mkdir (folder);
  // Handle exporting it.
  Database_State::setExport (name, 0, export_logic::export_needed);
}


// Deletes a Bible.
void delete_bible (const std::string& name)
{
  const std::string& path = bible_folder (name);
  // Delete directory.
  filter_url_rmdir (path);
  // Just in case it was a regular file: Delete it too.
  filter_url_unlink (path);
  // Handle exporting it.
  Database_State::setExport (name, 0, export_logic::export_needed);
}


// Stores data of one chapter in Bible $name.
void store_chapter (const std::string& name, const int book, const int chapter_number, std::string chapter_text)
{
  const std::string& folder = chapter_folder (name, book, chapter_number);
  if (!file_or_dir_exists (folder))
    filter_url_mkdir (folder);
  
  // Ensure that the data to be stored ends with a new line.
  if (!chapter_text.empty ()) {
    const size_t pos = chapter_text.length () - 1;
    if (chapter_text.substr (pos, 1) != "\n") {
      chapter_text.append ("\n");
    }
  }

  // Increase the chapter identifier, and store the chapter data.
  int id = get_chapter_id (name, book, chapter_number);
  id++;
  const std::string file = filter_url_create_path ({folder, std::to_string (id)});
  filter_url_file_put_contents (file, chapter_text);
  
  // Update search fields.
  update_search_fields (name, book, chapter_number);

  // Set flag for the exporter.
  Database_State::setExport (name, 0, export_logic::export_needed);
}


void update_search_fields (const std::string& name, const int book, const int chapter)
{
  search_logic_index_chapter (name, book, chapter);
}


// Returns an array with the available books in a Bible.
std::vector <int> get_books (const std::string& bible)
{
  // Read the books from the database.
  const std::string folder = bible_folder (bible);
  const std::vector <std::string> files = filter_url_scandir (folder);
  std::vector <int> books {};
  for (const auto& book : files) {
    if (filter::strings::is_numeric (book)) {
      books.push_back (filter::strings::convert_to_int (book));
    }
  }
  
  // Sort the books according to the order defined in the books database.
  std::vector <int> order {};
  for (const auto book_number : books) {
    const book_id book_enum = static_cast<book_id>(book_number);
    order.push_back (database::books::get_order_from_id (book_enum));
  }
  filter::strings::quick_sort (order, books, 0, static_cast<unsigned>(order.size()));
  
  // Result.
  return books;
}


void delete_book (const std::string& bible, int book)
{
  const std::string folder = book_folder (bible, book);
  filter_url_rmdir (folder);
  Database_State::setExport (bible, 0, export_logic::export_needed);
}


// Returns an array with the available chapters in a $book in a Bible.
std::vector <int> get_chapters (const std::string& bible, const int book)
{
  // Read the chapters from the database.
  const std::string folder = book_folder (bible, book);
  std::vector <int> chapters;
  const std::vector <std::string> files = filter_url_scandir (folder);
  for (const auto& file : files) {
    if (filter::strings::is_numeric (file)) chapters.push_back (filter::strings::convert_to_int (file));
  }
  std::sort (chapters.begin (), chapters.end ());
  return chapters;
}


void delete_chapter (const std::string& bible, int book, int chapter)
{
  const std::string folder = chapter_folder (bible, book, chapter);
  filter_url_rmdir (folder);
  Database_State::setExport (bible, 0, export_logic::export_needed);
}


// Gets the chapter data as a string.
std::string get_chapter (const std::string& bible, const int book, const int chapter)
{
  // Read the chapter data from the database.
  const std::string folder = chapter_folder (bible, book, chapter);
  const std::vector <std::string> files = filter_url_scandir (folder);
  if (!files.empty ()) {
    const std::string file = files.at(files.size() - 1);
    std::string data = filter_url_file_get_contents (filter_url_create_path ({folder, file}));
    // Remove trailing new line.
    data = filter::strings::trim (data);
    return data;
  }
  return std::string();
}


// Gets the chapter id.
int get_chapter_id (const std::string& bible, const int book, const int chapter)
{
  const std::string folder = chapter_folder (bible, book, chapter);
  const std::vector <std::string> files = filter_url_scandir (folder);
  if (!files.empty ()) {
    const std::string file = files.at(files.size() - 1);
    return filter::strings::convert_to_int (file);
  }
  return 100'000'000;
}


// Gets the chapter's time stamp in seconds since the Epoch.
int get_chapter_age (const std::string& bible, const int book, const int chapter)
{
  const std::string folder = chapter_folder (bible, book, chapter);
  const std::vector <std::string> files = filter_url_scandir (folder);
  if (!files.empty ()) {
    const std::string file = files.at(files.size() - 1);
    const std::string path = filter_url_create_path ({folder, file});
    const int time = filter_url_file_modification_time (path);
    const int now = filter::date::seconds_since_epoch ();
    return now - time;
  }
  return 100'000'000;
}


void optimize ()
{
  // Go through all chapters in all books and all Ḃibles.
  const std::vector <std::string> bibles = get_bibles ();
  for (const auto& bible : bibles) {
    const std::vector <int> books = get_books (bible);
    for (const int book : books) {
      const std::vector <int> chapters = get_chapters (bible, book);
      for (const int chapter : chapters) {
        const std::string folder = chapter_folder (bible, book, chapter);
        // Read the files in the folder.
        const std::vector <std::string> files = filter_url_scandir (folder);
        // Remove files with 0 size. so that in case a chapter was emptied by accident,
        // it is removed now, effectually reverting the chapter to an earlier version.
        std::vector <std::string> files2 {};
        for (const auto& file : files) {
          const std::string path = filter_url_create_path ({folder, file});
          if (filter_url_filesize (path) == 0) {
            filter_url_unlink (path);
            Database_State::setExport (bible, 0, export_logic::export_needed);
          }
          else files2.push_back (file);
        }
        // Remove the three most recent files from the list, so they don't get deleted.
        // Because scandir sorts the files, the files to be kept are at the end.
        if (!files2.empty()) files2.pop_back ();
        if (!files2.empty()) files2.pop_back ();
        if (!files2.empty()) files2.pop_back ();
        // Remove the remaining files. These are the older versions.
        for (const auto& file : files2) {
          const std::string path = filter_url_create_path ({folder, file});
          filter_url_unlink (path);
        }
      }
    }
  }
}


}