-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathReadHTM.java
593 lines (540 loc) · 11 KB
/
ReadHTM.java
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
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
/**
*
*/
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.ArrayList;
/**
* Read all htm files to find out the hyperlinks and offset
*
* @version 2013/3/28
* @author Yuchao Zhou
*/
public class ReadHTM
{
FileInputStream input;
InputStreamReader inputreader;
BufferedReader br;
private int offset;
private int index; //index of each hyperlinks in all htm files
private int backindex;
private ArrayList<Path> htmref; //refereneced files contain in htm files
private Path htmrefpath; //the path of referenced hyperlinks in htm files
static RefileList queue;
static ArrayList<Path> ref_htm_path;
//ArrayList<Path> ref_htm_path;
public ReadHTM()
{
htmref = new ArrayList<Path>();
queue = new RefileList();
}
/**
* readhtm: read the content of all htm files
* @param file: htm file
*/
public void readhtm(File file) throws IOException
{
//读取原始字节流
input = new FileInputStream(file);
inputreader = new InputStreamReader(input);
//用bufferedreader包装了inputstreamreader,更有效率
br = new BufferedReader(inputreader);
String info=br.readLine();
int line = 1;
int currentlength = 0;
int prelength = 0;
while(info!=null)
{
//System.out.println("line: " + line);
//System.out.println(info);
//System.out.println("sunm of one line: " + info.length());
index = info.indexOf(">file:///");
backindex = info.lastIndexOf("</a>");
//System.out.println("index: " + index);
currentlength = info.length();
if (index != -1)
{
//System.out.println(info.substring(index + 9,backindex));
htmrefpath = Paths.get(info.substring(index + 9,backindex));
htmref.add(Paths.get(info.substring(index + 9,backindex)));
index = prelength + index;
System.out.println("where: " + file.toString());
System.out.println("totle index: " + index);
System.out.println(htmrefpath);
//System.out.println(filePath2fileName(htmrefpath.toString()));
String htrefile = filePath2fileName(htmrefpath.toString());
System.out.println("here(htrefile): " + htrefile);
queue.add(htrefile, file.toPath());
System.out.println("here(htmpath): " + file.toPath());
//queue.add(file.toPath());
System.out.println("~~");
//queue.traverse();
//queue.equal(htmrefpath);
}
info = br.readLine();
prelength = prelength + currentlength;
line++;
}
br.close();
input.close();
inputreader.close();
}
public String filePath2fileName(String linecontent)
{
int index = linecontent.lastIndexOf('\\') + 1;
//System.out.println(index);
String name = linecontent.substring(index);
return name;
}
/**
* startread: use the path of htm file to create file instance to read
* @param
*/
public void startread() throws IOException
{
System.out.println("ReadHTM.java htm文件:~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
for (int i = 0; i < ReadPIMTree.htmpath.size(); i++)
{
//System.out.println(ReadPIMTree.htmpath.get(i));
Path filepath = ReadPIMTree.htmpath.get(i);
File htmfile = new File(filepath.toString());
readhtm(htmfile);
}
System.out.println("RefileQueue: ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
queue.traverse();
System.out.println("HtmQueue: ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
queue.traversehtm();
System.out.println("~~~~~~~test~~~~~~");
}
}
class Node
{
private String refile;
private Node1 htmnode;
private Node next;
HtmQueue htmqueue;
public Node(String file)
{
htmqueue = new HtmQueue();
this.refile = file;
this.htmnode = null;
this.next = null;
}
public void setRefile(String file)
{
this.refile = file;
}
public void setHtmnode(Node1 n)
{
this.htmnode = n;
}
public void setNext(Node n)
{
this.next = n;
}
public String getrefile()
{
return refile;
}
public Node getNext()
{
return next;
}
public Node1 getHtmnode()
{
return htmnode;
}
}
class RefileList
{
Node first;
//ArrayList<Path> ref_htm_path;
//Node rear;
//private HtmQueue htmqueue;
public RefileList()
{
this.first = null;
//htmqueue = new HtmQueue();
}
public RefileList(String file)
{
first = new Node(file);
}
public boolean isEmpty()
{
boolean result = false;
if (first == null)
{
result = true;
}
else
{
result = false;
}
return result;
}
public void add(String file, Path path)
{
boolean fileequal = false;
boolean htmequal = false;
Node c,n;
Node1 c1,n1;
n = new Node(file);
n1 = new Node1(path);
//refile队列的节点为空
if (isEmpty())
{
first = n;
first.htmqueue.front = n1;
}
//refile队列中没有该节点&refile队列中有该节点
else
{
c = first;
//refile队列中的第一个节点等于要插入的refile节点
if (first.getrefile().equals(file))
{
//fileequal = true;
//if (fileequal == true)
//{
//refile节点已经存在,在htmqueue中插入htmpath节点
if (c.htmqueue.isEmpty())
{
c.htmqueue.front = n1;
}
else
{
c1 = c.htmqueue.front;
if (c.htmqueue.front.getData().equals(path))
{
htmequal = true;
}
while (c1.getNext() != null)
{
if (c1.getNext().getData().equals(path))
{
htmequal = true;
}
c1 = c1.getNext();
}
if (htmequal == false)
{
c1.setNext(n1);
}
}
//}
}
else
{
while (c.getNext() != null)
{
if (c.getNext().getrefile().equals(file))
{
fileequal = true;
}
c = c.getNext();
if (fileequal == true)
{
//refile节点已经存在,在htmqueue中插入htmpath节点
if (c.htmqueue.isEmpty())
{
c.htmqueue.front = n1;
}
else
{
c1 = c.htmqueue.front;
if (c.htmqueue.front.getData().equals(path))
{
htmequal = true;
}
while (c1.getNext() != null)
{
if (c1.getNext().getData().equals(path))
{
htmequal = true;
}
c1 = c1.getNext();
}
if (htmequal == false)
{
c1.setNext(n1);
}
break;
}
}
}
//refile节点没有存在,插入一个refile节点并且在htmqueue中插入htmpath节点
if (fileequal == false)
{
c.setNext(n);
//加入htmqueue的节点
if (n.htmqueue.isEmpty())
{
n.htmqueue.front = n1;
}
else
{
c1 = n.htmqueue.front;
if (n.htmqueue.front.getData().equals(path))
{
htmequal = true;
}
while (c1.getNext() != null)
{
if (c1.getNext().getData().equals(path))
{
htmequal = true;
}
c1 = c1.getNext();
}
if (htmequal == false)
{
c1.setNext(n1);
}
}
}
}
}
}
public void equal(String file)
{
Node c,n;
boolean result = false;
if (first == null)
{
result = false;
}
else
{
n = first;
while (n.getNext() != null)
{
if (n.getrefile().equals(file))
{
result = true;
break;
}
n = n.getNext();
}
}
}
public void traverse()
{
Node c;
if (isEmpty())
{
System.out.println("the RefileQueue is empty!");
}
else
{
c = first;
System.out.println(c.getrefile());
//traversehtm();
while (c.getNext() != null)
{
c = c.getNext();
System.out.println(c.getrefile());
//traversehtm();
}
}
}
public ArrayList outPutPath(String file)
{
//ArrayList<Path> ref_htm_path;
ReadHTM.ref_htm_path = new ArrayList<Path>();
boolean contain = false;
Node c;
Node1 c1;
String refile = file;
//如果Refile队列为空
if (isEmpty())
{
System.out.println("the RefileQueue is empty!");
}
else
{
c = first;
//Refile队列的第一项匹配
if (c.getrefile().equals(refile))
{
contain = true;
//Refile队列的第一项的htm队列为空
if (c.htmqueue.isEmpty())
{
System.out.println("No htm path!");
}
else //Refile队列的第一项的htm队列不为空
{
c1 = c.htmqueue.front;
//System.out.println(c1.getData());
ReadHTM.ref_htm_path.add(c1.getData());
while (c1.getNext() != null)
{
c1 = c1.getNext();
//System.out.println(c1.getData());
ReadHTM.ref_htm_path.add(c1.getData());
}
}
}
else //Refile队列不是第一项匹配
{
while (c.getNext() != null)
{
c = c.getNext();
if (c.getrefile().equals(refile))
{
contain = true;
if (c.htmqueue.isEmpty())
{
System.out.println("No htm path!");
}
else
{
c1 = c.htmqueue.front;
//System.out.println(c1.getData());
ReadHTM.ref_htm_path.add(c1.getData());
while (c1.getNext() != null)
{
c1 = c1.getNext();
//System.out.println(c1.getData());
ReadHTM.ref_htm_path.add(c1.getData());
}
}
}
}
}
}
/* for (int i = 0; i < ref_htm_path.size(); i ++)
{
System.out.println("!!!!" + ref_htm_path.get(i));
}*/
System.out.println("!!!ref_htm_path: ");
for (int i = 0; i < ReadHTM.ref_htm_path.size(); i++)
{
System.out.println(ReadHTM.ref_htm_path.get(i));
}
return ReadHTM.ref_htm_path;
}
public void traversehtm()
{
Node c;
Node1 c1;
if (isEmpty())
{
System.out.println("refile node is empty!");
}
else
{
c = first;
System.out.println("Node: " + c.getrefile() + "~~~");
if (c.htmqueue.isEmpty())
{
System.out.println("No htm path!");
}
else
{
c1 = c.htmqueue.front;
System.out.println(c1.getData());
while (c1.getNext() != null)
{
c1 = c1.getNext();
System.out.println(c1.getData());
}
}
while (c.getNext() != null)
{
c = c.getNext();
System.out.println(" ~~~ Node: " + c.getrefile() + "~~~");
if (c.htmqueue.isEmpty())
{
System.out.println("No htm path!");
}
else
{
c1 = c.htmqueue.front;
System.out.println(c1.getData());
while (c1.getNext() != null)
{
c1 = c1.getNext();
System.out.println(c1.getData());
}
}
}
}
}
}
class Node1
{
private Path htmpath;
private Node1 next;
public Node1(Path path)
{
htmpath = path;
next = null;
}
public void setData(Path path)
{
htmpath = path;
}
public void setNext(Node1 n)
{
next = n;
}
public Path getData()
{
return htmpath;
}
public Node1 getNext()
{
return next;
}
}
class HtmQueue
{
Node1 front;
public HtmQueue()
{
front = null;
}
public HtmQueue(Path path)
{
front = new Node1(path);
}
public boolean isEmpty()
{
boolean result = false;
if (front == null)
{
result = true;
}
else
{
result = false;
}
return result;
}
public void add(Path path)
{
Node1 c,n;
n = new Node1(path);
if (isEmpty())
{
front = n;
}
else
{
c = front;
while (c.getNext() != null)
{
c = c.getNext();
}
c.setNext(n);
}
}
}