private void recursiveDelete(File folder) { // delete all files in folder File[] list = folder.listFiles(); for (int i = 0; i < list.length; i++) { if( list[i].isDirectory() ) { recursiveDelete(list[i]); } else { list[i].delete(); } } folder.delete();
private void recursiveDelete(File folder) { // delete all files in folder File[] list = folder.listFiles(); for (int i = 0; i < list.length; i++) { if( list[i].isDirectory() ) { recursiveDelete(list[i]); } else { list[i].delete(); } } folder.delete();
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/filter/plugins/AbstractFilterTst.java File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/folder/AbstractFolderTst.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
private void recursiveDelete(File folder) {
1
private void recursiveDelete(File folder) {
2
		// delete all files in folder
2
		// delete all files in folder
3
		File[] list = folder.listFiles();
3
		File[] list = folder.listFiles();
4
		for (int i = 0; i < list.length; i++) {
4
		for (int i = 0; i < list.length; i++) {
5
			if( list[i].isDirectory() ) {
5
			if( list[i].isDirectory() ) {
6
				recursiveDelete(list[i]);
6
				recursiveDelete(list[i]);
7
			} else {
7
			} else {
8
				list[i].delete();				
8
				list[i].delete();				
9
			}
9
			}
10
		}
10
		}
11
		
11
		
12
		folder.delete();
12
		folder.delete();
13
	
13
	
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0