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
|
// Compression on variable granularity
#include <fcntl.h>
#include <iostream>
#include <fstream>
#include <string>
#ifndef __GNUC__
#include <io.h>
#else
#include <unistd.h>
#endif
#include <ztext.h>
#include <zld.h>
#include <zcom.h>
#include <swmgr.h>
#include <lzsscomprs.h>
#include <zipcomprs.h>
#include <versekey.h>
#include <stdio.h>
void errorOutHelp(char *appName) {
cerr << appName << " - a tool to create compressed Sword modules\n";
cerr << "version 0.1\n\n";
cerr << "usage: "<< appName << " <modname> <datapath> [blockType [compressType]]\n\n";
cerr << "datapath: the directory in which to write the zModule\n";
cerr << "blockType : (default 4)\n\t2 - verses\n\t3 - chapters\n\t4 - books\n";
cerr << "compressType: (default 1):\n\t1 - LZSS\n\t2 - Zip\n";
cerr << "\n\n";
exit(-1);
}
int main(int argc, char **argv)
{
int iType = 4;
int compType = 1;
SWCompress *compressor = 0;
SWModule *inModule = 0;
SWModule *outModule = 0;
if ((argc < 3) || (argc > 5)) {
errorOutHelp(argv[0]);
}
if (argc > 3) {
iType = atoi(argv[3]);
if (argc > 4) {
compType = atoi(argv[4]);
}
}
if ((iType < 2) || (compType < 1) || (compType > 2) || (!strcmp(argv[1], "-h")) || (!strcmp(argv[1], "--help")) || (!strcmp(argv[1], "/?")) || (!strcmp(argv[1], "-?")) || (!strcmp(argv[1], "-help"))) {
errorOutHelp(argv[0]);
}
SWMgr mgr;
ModMap::iterator it = mgr.Modules.find(argv[1]);
if (it == mgr.Modules.end()) {
fprintf(stderr, "error: %s: couldn't find module: %s \n", argv[0], argv[1]);
exit(-2);
}
inModule = it->second;
// Try to initialize a default set of datafiles and indicies at our
// datapath location passed to us from the user.
#define BIBLE 1
#define LEX 2
#define COM 3
int modType = 0;
if (!strcmp(inModule->Type(), "Biblical Texts")) modType = BIBLE;
if (!strcmp(inModule->Type(), "Lexicons / Dictionaries")) modType = LEX;
if (!strcmp(inModule->Type(), "Commentaries")) modType = COM;
switch (compType) { // these are deleted by zText
case 1: compressor = new LZSSCompress(); break;
case 2: compressor = new ZipCompress(); break;
}
int result = 0;
switch (modType) {
case BIBLE:
result = zText::createModule(argv[2], iType);
break;
case LEX:
result = zLD::createModule(argv[2]);
break;
case COM:
result = zCom::createModule(argv[2], iType);
break;
}
if (result) {
fprintf(stderr, "error: %s: couldn't create module at path: %s \n", argv[0], argv[2]);
exit(-3);
}
switch (modType) {
case BIBLE:
outModule = new zText(argv[2], 0, 0, iType, compressor); // open our datapath with our RawText driver.
((VerseKey *)(SWKey *)(*inModule))->Headings(1);
break;
case LEX:
outModule = new zLD(argv[2], 0, 0, iType, compressor); // open our datapath with our RawText driver.
break;
case COM:
outModule = new zCom(argv[2], 0, 0, iType, compressor); // open our datapath with our RawText driver.
((VerseKey *)(SWKey *)(*inModule))->Headings(1);
break;
}
string lastBuffer = "Something that would never be first module entry";
SWKey bufferKey;
inModule->setSkipConsecutiveLinks(false);
(*inModule) = TOP;
while (!inModule->Error()) {
bufferKey = *(SWKey *)(*inModule);
// pseudo-check for link. Will get most common links.
if ((lastBuffer == inModule->getRawEntry()) &&(lastBuffer.length() > 0)) {
(*outModule) << &bufferKey; // link to last key
cout << "Adding [" << bufferKey << "] link to: \n";
}
else {
lastBuffer = inModule->getRawEntry();
if (lastBuffer.length() > 0) {
cout << "Adding [" << bufferKey << "] new text. \n";
outModule->SetKey(bufferKey);
(*outModule) << lastBuffer.c_str(); // save new text;
}
else {
cout << "Skipping [" << bufferKey << "] no entry in inModule. \n";
}
}
(*inModule)++;
}
delete outModule;
}
|
