-
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Operaciones.cpp
420 lines (354 loc) · 12.8 KB
/
Operaciones.cpp
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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
// vim: set expandtab tabstop=8 shiftwidth=8 foldmethod=marker:
/** @file Operaciones.cpp
* Realiza operaciones en un índice.
*
* @package Mt77
* @author Vladimir Támara Patiño. vtamara@pasosdeJesus.org
* Dominio público. 2009. Sin garantías
* http://creativecommons.org/licenses/publicdomain/
* @version $Id: Operaciones.cpp,v 1.9 2010/01/18 16:12:50 vtamara Exp $
*/
#include <iostream>
#include <iomanip>
#include <list>
#include <vector>
#include <fstream>
#include <istream>
#include <sys/stat.h>
#include <time.h>
#include "RamDisco.hpp"
#include "Operaciones.hpp"
using namespace std;
string prefijoASitio(const char *pref)
{
ASSERT(pref != NULL);
//cout << "OJO prefijoASitio(" << pref << ")" << endl;
string o = "";
if (strlen(pref)>7 && (strncmp(pref, "https://", 8) == 0
|| strncmp(pref, "http://", 7) == 0)) {
uint32_t i = strncmp(pref, "https://", 8) == 0 ? 8 : 7;
for (; pref[i] != '\0' && i < (MAXCAD - 10) &&
//pref[i] != '.' &&
pref[i] != '/' && pref[i] != ':'; i++) {
o += pref[i];
//cout << "OJO " << i << o << endl;
}
}
if (o == "") {
o = "localhost";
}
return o;
}
string determinaFormato(string narch)
{
string f = "";
if (narch.substr(narch.length() - 4) == ".txt") {
f = "texto";
} else if (narch.substr(narch.length() - 4) == ".odt") {
f = "odf";
} else if (narch.substr(narch.length() - 6) == ".xrlat") {
f = "relato";
} else if (narch.substr(narch.length() - 4) == ".xml") {
f = "xml";
} else if (narch.substr(narch.length() - 4) == ".ogv") { // Video Theora
f = "ogv";
} else if (narch.substr(narch.length() - 4) == ".flv") {
f = "flv";
} else if (narch.substr(narch.length() - 4) == ".ogg") { // Audio OGG
f = "ogg";
} else if (narch.substr(narch.length() - 4) == ".mp3") {
f = "mp3";
} else if (narch.substr(narch.length() - 4) == ".jpg") {
f = "jpg";
} else if (narch.substr(narch.length() - 4) == ".png") {
f = "png";
} else if (narch.substr(narch.length() - 4) == ".gif") {
f = "gif";
} else if (narch.substr(narch.length() - 4) == ".pdf") {
f = "pdf";
} else if (narch.substr(narch.length() - 5) == ".html" ||
narch.substr(narch.length() - 4) == ".htm") {
f = "html";
} else {
f = "otro";
}
return f;
}
void
muestraStream(std::istream &is, string pre)
{
string cad, npre;
set<Pos> *cpos;
uint32_t hijo, her;
cad = leeCad(is);
if (cad != "")
{
her = lee128b(is);
hijo = lee128b(is);
cpos = leePos(is, NULL);
if (cpos->size()>0) {
cout << pre << cad << " " << cpos->size() << endl;
}
uint32_t pac = is.tellg();
if (hijo > 0) {
is.seekg(hijo);
npre = pre;
npre += cad;
muestraStream(is, npre);
}
is.seekg(pac);
muestraStream(is, pre);
}
}
void listaPalabras(char *noma, char *nrel) noexcept(false)
{
ASSERT(noma != NULL);
ASSERT(nrel != NULL);
vector<Doc> idocs;
leeRelacion(nrel, idocs);
for (uint32_t i = 0; i< idocs.size(); i++) {
cout << (i+1) << " " << idocs[i].URL << endl;
}
fstream is(noma, ios_base::in);
verificaIndice(is);
muestraStream(is, "");
is.close();
}
void
eliminaDoc(char *noma, char *nomind, uint32_t nd) noexcept(false)
{
ASSERT(nd > 0);
char nrel1[MAXLURL];
char nrel[MAXLURL];
verificaNombre(noma, nrel);
verificaNombre(nomind, nrel1);
if (nd <= 0) {
stringstream ss;
ss << "n debe ser mayor o igual a 1";
throw ss.str();
}
vector<Doc> docs;
vector<Doc> sdocs;
uint32_t td = leeRelacion(nrel1, docs);
if (nd > td) {
stringstream ss;
ss << "n debe ser menor o igual a " << td;
throw ss.str();
}
uint32_t i;
vector<int64_t> renum;
for(i = 0; i < nd - 1; i++) {
renum.push_back(i);
sdocs.push_back(docs[i]);
}
/* 0 1 2 3 -elim tercero -> 0 1 3
0 1 -1 2 */
renum.push_back(-1);
for(i = nd; i < td; i++) {
renum.push_back(i - 1);
sdocs.push_back(docs[i]);
}
fstream os(noma, ios_base::out);
fstream is(nomind, ios_base::in);
verificaIndice(is);
is.clear();
os << MARCAIND << endl;
escribeCopiaSubarbol(os, is, true, &renum);
is.close();
os.close();
// Escribe relación sin el borrado
escribeRelacion(nrel, sdocs);
}
void
calcRenum(uint32_t td1, uint32_t td2, uint32_t nd, vector<int64_t> *reord,
vector<int64_t> *renum1,
vector<int64_t> &renum2)
{
//clog << "OJO calcRenum(td1=" << td1 << ", td2=" << td2 << ", nd=" << nd << ", reord=" << reord << ", renum1=" << renum1 << ", renum2.size=" << renum2.size() << endl;
if (reord != NULL) {
//clog << "OJO reord.size() =" << reord->size() << endl;
}
if (renum1 != NULL) {
//clog << "OJO renum1.size() =" << renum1->size() << endl;
}
if (nd > 0 && nd <= td1) {
// renum2 0 -> 2, 1 -> 3 2 -> 4 y docs1 quedará a b c d e
// queremos renum2 en
// 0 -> 1, 1 -> 2, 2 -> 3 i->i+(nd-1)
// Los indices de docs1 final deben ser
// 0 -> 0, 1 -> 4, 2 -> 1, 3 -> 2, 4 -> 3
// que se dejan invertidos en reord
// 0 de 0, 1 de 2, 2 de 3, 3 de 4, 4 de 1
uint32_t j;
for(j = 0; j < renum2.size(); j++) {
renum2[j] = (nd - 1) + j;
}
// renum1 0 -> 0, 1->3 i->i si i<nd i->i+docs.size() si i>nd
for(j = 0; j < nd - 1; j++) {
renum1->push_back(j);
}
for(j = nd - 1 ; j < td1; j++) {
renum1->push_back(j + td2);
}
for(j = 0; j < nd - 1; j++) {
reord->push_back(j);
}
for(j = 0; j < renum2.size(); j++) {
reord->push_back(td1 + j);
}
for(j = nd - 1 ; j < td1; j++) {
reord->push_back(j);
}
}
}
void
mezclaDosDisco(const char *indsal, const char *ind1, const char *ind2,
uint32_t nd) noexcept(false)
{
ASSERT(nd >= 0);
char nrel[MAXLURL], nrel1[MAXLURL], nrel2[MAXLURL];
//clog << "OJO mezclaDosDisco(" << indsal << ", " << ind1 << ", " << ind2 << ", " << nd << ")" << endl;
verificaNombre(indsal, nrel);
verificaNombre(ind1, nrel1);
verificaNombre(ind2, nrel2);
vector<Doc> docs;
vector<Doc> sdocs;
// Leer y mezclar relación de documentos 1 y 2
vector<Doc> docs1;
vector<Doc> docs2;
uint32_t td1;
try {
td1 = leeRelacion(nrel1, docs1);
//clog << "OJO td1= " << td1 << ", docs1.size()=" << docs1.size() << endl;
} catch (char *s) {
throw s;
}
if (nd > td1 + 1) {
stringstream ss;
ss << "n debe ser menor o igual a " <<
td1 + 1 << endl;
throw ss.str();
}
leeRelacion(nrel2, docs2);
//clog << "OJO docs2.size= " << docs2.size() << endl;
vector<int64_t> *reord = NULL;
vector<int64_t> *renum1 = NULL;
vector<int64_t> renum2 = mezclaDocs(docs2, docs1);
//clog << "OJO tras mezclaDocs renum2.size= " << renum2.size() << endl;
if (nd > 0 && nd <= td1) {
renum1 = new vector<int64_t>();
reord = new vector<int64_t>();
}
calcRenum(td1, docs2.size(), nd, reord, renum1, renum2);
//clog << "OJO después de calcRenum" << endl;
if (reord != NULL) {
//clog << "OJO reord.size=" << reord->size() << ", renum1.size=" << renum1->size() << ", renum2.size=" << renum2.size() << endl;
}
fstream os(indsal, ios_base::out);
fstream is1(ind1, ios_base::in);
fstream is2(ind2, ios_base::in);
verificaIndice(is1);
//clog << "OJO después de verificaIndice 1" << endl;
is1.clear();
verificaIndice(is2);
//clog << "OJO después de verificaIndice 2" << endl;
is2.clear();
//clog << "OJO después de verificar" << endl;
os << MARCAIND << endl;
mezclaRec(is1, is2, os, true, true, renum1, &renum2);
//clog << "OJO después de mezclaRec" << endl;
is1.close();
is2.close();
os.close();
// Escribe relación de documentos de mezcla
escribeRelacion(nrel, docs1, reord);
}
/**
* La funcionalidad de este ahora está incluida en indexador
void
agregaDoc(const char *indsal, const char *inden, const char *nom,
bool metainformacion, const char *pref, long nd)
{
char nrel[MAXLURL], nrel1[MAXLURL];
//clog << "agregaDoc(indsal=" << indsal << ", inden=" << inden << ", nom=" << nom << ", metainformacion=" << metainformacion << ", pref=" << pref << ", nd=" << nd << endl;
verificaNombre(indsal, nrel);
verificaNombre(inden, nrel1);
// Leer y mezclar relación de documentos
vector<Doc> docs1;
vector<Doc> docs2;
long td1 = 0;
td1 = leeRelacion(nrel1, docs1);
//clog << "OJO docs1.size()=" << docs1.size() << endl;
if (nd > td1 + 1) {
stringstream ss;
ss << "n debe ser menor o igual a " <<
td1 + 1 << endl;
throw ss.str();
}
Doc d(nom, "", "1960-01-01");
docs2.push_back(d);
vector<long> *reord = NULL;
vector<long> *renum1 = NULL;
vector<long> renum2 =
mezclaDocs(docs2, docs1);
//clog << "OJO tras mezclaDocs docs2.size=" << docs2.size() << ", docs1.size=" << docs1.size() << ", renum2.size=" << renum2.size() << endl;
if (nd > 0 && nd <= td1) {
renum1 = new vector<long>();
reord = new vector<long>();
}
calcRenum(td1, docs2.size(), nd, reord, renum1, renum2);
//clog << "OJO tras calcRenum: ";
string sep="";
for (uint32_t i=0; i < renum2.size(); i++) {
//clog << sep << "renum2[" << i << "]=" << renum2[i];
sep=", ";
}
//clog << endl;
NodoTrieS t;
string tipo, formato;
indexa(docs1[docs1.size() - 1], 1, metainformacion, pref,
t, tipo, formato);
//clog << "OJO tras indexa tipo=" << tipo << ", formato=" << formato << endl;
fstream os(indsal, ios_base::out);
fstream is1(inden, ios_base::in);
verificaIndice(is1);
is1.clear();
os << MARCAIND << endl;
mezclaDiscoRam(is1, &t, 0, os, true, true, renum1, &renum2);
is1.close();
os.close();
// Escribe relación de documentos de mezcla
escribeRelacion(nrel, docs1, reord);
//clog << "OJO tras escribeRelacion" << endl;
}
*/
void
subindice(const char *ind, const char *salida, uint32_t nd)
{
char nrel[MAXLURL];
char nrelsal[MAXLURL];
//clog << "subindice(ind=" << ind << ", nd=" << nd << ")" << endl;
verificaNombre(ind, nrel);
verificaNombre(salida, nrelsal);
// Leer y mezclar relación de documentos
vector<Doc> docs;
vector<Doc> docsal;
uint32_t td1 = 0;
td1 = leeRelacion(nrel, docs);
//clog << "OJO docs1.size()=" << docs1.size() << endl;
if (nd > td1 + 1) {
stringstream ss;
ss << "n debe ser menor o igual a " <<
td1 + 1 << endl;
throw ss.str();
}
docsal.push_back(docs[nd - 1]);
NodoTrieS t;
string tipo, formato;
fstream is1(ind, ios_base::in);
verificaIndice(is1);
is1.clear();
subindiceDiscoaRAM(is1, &t, nd);
is1.close();
escribePlano(t, docsal, salida, nrelsal);
}