-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.java
384 lines (350 loc) · 15.2 KB
/
Main.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
import java.io.IOException;
import java.nio.file.DirectoryIteratorException;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
/**
* Main class where the script is executed. This will look for repetions in
* folders passed for the constructor and will organize then in the Results
* folder. To know more info: https://github.com/FlyingWolFox/Duplicate-Finder
*
* @version 1.3
* @author FlyingWolFox
*/
public class Main {
private ArrayList<Directory> dirs;
private ArrayList<Path> subfolders; // subdir of the Results dir
private HashMap<Integer, Character> letters; // number -> letter, ex: 0 -> a
/**
* Script
*
* @param args String collction of paths to folders to compare
*/
public Main(String[] args) {
dirs = new ArrayList<Directory>();
subfolders = new ArrayList<Path>();
letters = new HashMap<Integer, Character>(26);
boolean internalRepetion = false;
setLetters(); // fills the HashMap
// creates Directory objects
for (String path : args) {
try {
Directory dir = new Directory(path); // exception if failed to process the directory and/or the files
dirs.add(dir);
} catch (IOException | DirectoryIteratorException x) {
System.out.println("Failed to add " + path + " for analyzing");
x.printStackTrace();
}
}
// creates the Results directory and its subfolders
createDirectories();
// this should always be true
assert subfolders.size() == dirs
.size() : "The number of Results subdirectories isn't equal to the number of scanned directories";
// process internal repetions
internalRepetion |= manageInternalFileRepetions();
internalRepetion |= manageIntenalArchiveRepetions();
System.out.println("");
if (internalRepetion) {
System.out.println("Internal repetions found:");
for (Directory dir : dirs) {
System.out.println(":.. " + dir.getNumOfInternalRepetions() + " internal repetions in "
+ dir.getPath().toString());
}
System.out.println(
": > Internal are in their respective directories. Clean then first then run the tool again");
return;
} else
System.out.println("No internal repetions found");
System.out.println("");
// find repetions and move files
int numOfRepetions = 0;
numOfRepetions += manageFileRepetions();
numOfRepetions += manageArchiveRepetions();
// prints statics
System.out.println(numOfRepetions + " repetions found:");
for (Directory dir : dirs) {
System.out.println(":.. " + dir.getNumOfRepetions() + " files in " + dir.getPath().toString());
}
System.out.println("");
System.out.println("Operation Complete");
}
/**
* fills the HashMap with letter and their position on alphabet (0 = a)
*/
private void setLetters() {
char c = 'a';
int i = 0;
for (; c <= 'z'; c++, i++) {
letters.put(i, c);
}
}
/**
* creates the Results directory and its subdirectories, which have the same
* names of the directories to analyze
*/
private void createDirectories() {
Path results = Paths.get("Results");
try {
Files.createDirectories(results);
} catch (IOException e) {
// not being able to create the Results directory is terminal
System.err.println("Error trying to create Results directory");
e.printStackTrace();
System.exit(-1);
}
// create all the subfolders
for (int i = 0; i < Directory.getX(); i++) {
Path subfolder = results.resolve(dirs.get(i).getPath().getFileName());
this.subfolders.add(subfolder);
try {
Files.createDirectories(subfolder);
} catch (IOException e) {
// a fail to ccreate a sbudirectory is terminal
System.err.println("Error trying to create directory for " + dirs.get(i).getPath().getFileName());
e.printStackTrace();
System.exit(-1);
}
}
}
/**
* finds internal repetions among files of the directories
*
* @return if exists internal repetion
*/
private boolean manageInternalFileRepetions() {
boolean internalRepetionFound = false;
for (Directory dir : dirs) {
ArrayList<FileInfo> files = dir.getFiles();
String letter = letters.get(dir.getNum()).toString();
for (int i = 0; i < files.size() - 1; i++) {
FileInfo file1 = files.get(i);
FileInfo file2 = files.get(i + 1);
if (file1.compareTo(file2) == 0) {
internalRepetionFound = true;
Path source1 = file1.getPath();
file1.setName(file1.getNum() + letter + "- " + file1.getName());
Path target1 = subfolders.get(dirs.indexOf(dir)).resolve(file1.getName());
while (file1.compareTo(file2) == 0) {
dir.increaseNumOfInternalRepetions();
Path source2 = file2.getPath();
file2.setName(file1.getNum() + letter + "- " + file2.getName());
Path target2 = subfolders.get(dirs.indexOf(dir)).resolve(file2.getName());
try {
Files.move(source2, target2);
} catch (IOException e) {
System.out.println(
"Error moving " + source2.toString() + " to " + target2.toString() + ": " + e);
} finally {
files.remove(file2);
}
try {
file2 = files.get(i + 1);
} catch (IndexOutOfBoundsException e) {
// end of ArrayList reached
break;
}
}
try {
Files.move(source1, target1);
} catch (IOException e) {
System.out
.println("Error moving " + source1.toString() + " to " + target1.toString() + ": " + e);
}
}
}
}
return internalRepetionFound;
}
/**
* finds repetions among files and will organize them. Since the collection is
* sorted, files with the same hash are togheter
*
* @return how many repetions were found
*/
private int manageFileRepetions() {
int numOfRepetions = 0;
ArrayList<FileInfo> files = new ArrayList<FileInfo>();
for (Directory dir : dirs) {
files.addAll(dir.getFiles());
}
if (files.size() == 0)
return 0;
Collections.sort(files);
for (int i = 0; i < files.size() - 1; i++) {
FileInfo file1 = files.get(i);
FileInfo file2 = files.get(i + 1);
if (file1.compareTo(file2) == 0) {
numOfRepetions++;
file1.getDir().increaseNumOfRepetions();
Path source1 = file1.getPath();
// put file id and letter in the filename
file1.setName(
file1.getNum() + letters.get(file1.getDir().getNum()).toString() + "- " + file1.getName());
Path target1 = subfolders.get(file1.getDir().getNum()).resolve(file1.getName());
// looks for more repetions
while (file1.compareTo(file2) == 0) {
file2.getDir().increaseNumOfRepetions();
Path source2 = file2.getPath();
file2.setName(
file1.getNum() + letters.get(file2.getDir().getNum()).toString() + "- " + file2.getName());
Path target2 = subfolders.get(file2.getDir().getNum()).resolve(file2.getName());
try {
Files.move(source2, target2);
} catch (IOException e) {
System.err.println("Failed to move " + file2.getName() + " from "
+ file2.getDir().getPath().toString() + " to " + target2.toString());
e.printStackTrace();
}
files.remove(file2);
try {
file2 = files.get(i + 1);
} catch (IndexOutOfBoundsException e) {
// end of ArrayList reached
break;
}
}
try {
Files.move(source1, target1);
} catch (IOException e) {
System.err.println("Failed to move " + file1.getName() + " from "
+ file1.getDir().getPath().toString() + " to " + target1.toString());
e.printStackTrace();
}
}
}
return numOfRepetions;
}
/**
* same thing of manageInternalFileRepetions, but with the archives
*
* @return if exists internal repetion
*/
public boolean manageIntenalArchiveRepetions() {
boolean internalRepetionFound = false;
for (Directory dir : dirs) {
ArrayList<Archive> archives = dir.getArchives();
if (archives.size() == 0)
break;
Archive.ArchiveComparator c = archives.get(0).new ArchiveComparator();
String letter = letters.get(dir.getNum()).toString();
for (int i = 0; i < archives.size() - 1; i++) {
Archive archive1 = archives.get(i);
Archive archive2 = archives.get(i + 1);
if (c.compare(archive1, archive2) == 0) {
internalRepetionFound = true;
Path source1 = archive1.getPath();
archive1.setName(archive1.getNum() + letter + "- " + archive1.getName());
Path target1 = subfolders.get(dirs.indexOf(dir)).resolve(archive1.getName());
while (c.compare(archive1, archive2) == 0) {
dir.increaseNumOfInternalRepetions();
Path source2 = archive2.getPath();
archive2.setName(archive1.getNum() + letter + "- " + archive2.getName());
Path target2 = subfolders.get(dirs.indexOf(dir)).resolve(archive2.getName());
try {
Files.move(source2, target2);
} catch (IOException e) {
System.out.println(
"Error moving " + source2.toString() + " to " + target2.toString() + ": " + e);
} finally {
archives.remove(archive2);
}
try {
archive2 = archives.get(i + 1);
} catch (IndexOutOfBoundsException e) {
// if this happens, the end of the collection have been reached
break;
}
}
try {
Files.move(source1, target1);
} catch (IOException e) {
System.out
.println("Error moving " + source1.toString() + " to " + target1.toString() + ": " + e);
}
}
}
}
return internalRepetionFound;
}
/**
* same thing of manageFileRepetions, but with archives
*
* @return how many repetions were found
*/
private int manageArchiveRepetions() {
int numOfRepetions = 0;
ArrayList<Archive> archives = new ArrayList<Archive>();
for (Directory dir : dirs) {
archives.addAll(dir.getArchives());
}
if (archives.size() == 0)
return 0;
Archive.ArchiveComparator c = archives.get(0).new ArchiveComparator();
Collections.sort(archives, c);
for (int i = 0; i < archives.size() - 1; i++) {
Archive archive1 = archives.get(i);
Archive archive2 = archives.get(i + 1);
if (c.compare(archive1, archive2) == 0) {
numOfRepetions++;
archive1.getDir().increaseNumOfRepetions();
archive2.getDir().increaseNumOfRepetions();
Path source1 = archive1.getPath();
archive1.setName(archive1.getNum() + letters.get(archive1.getDir().getNum()).toString() + "- "
+ archive1.getName());
Path target1 = subfolders.get(archive1.getDir().getNum()).resolve(archive1.getName());
while (c.compare(archive1, archive2) == 0) {
archive2.getDir().increaseNumOfInternalRepetions();
Path source2 = archive2.getPath();
archive2.setName(archive1.getNum() + letters.get(archive2.getDir().getNum()).toString() + "- "
+ archive2.getName());
Path target2 = subfolders.get(archive2.getDir().getNum()).resolve(archive2.getName());
try {
Files.move(source2, target2);
} catch (IOException e) {
System.err.println("Failed to move " + archive2.getName() + " from "
+ archive2.getDir().getPath().toString() + " to " + target2.toString());
e.printStackTrace();
}
archives.remove(archive2);
try {
archive2 = archives.get(i + 1);
} catch (IndexOutOfBoundsException e) {
// end of ArrayList reached
break;
}
}
try {
Files.move(source1, target1);
} catch (IOException e) {
System.err.println("Failed to move " + archive1.getName() + " from "
+ archive1.getDir().getPath().toString() + " to " + target1.toString());
e.printStackTrace();
}
}
}
return numOfRepetions;
}
/**
* the constructor script is executed and then sleep 3,5 seconds (this is done
* so its possible to read the fail messages and statistics)
*
* @param args The directories to be analyzed
*/
public static void main(String[] args) {
if (args.length < 1) {
System.out.println("usage: <dir> ...");
System.exit(0);
}
new Main(args);
try {
Thread.sleep(3500);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.exit(0);
}
}