for (int i = 0; i < list.length; i++) { if( list[i].isDirectory() ) { recursiveDelete(list[i]); } else { list[i].delete();
for (int i = 0; i < list.length; i++) { if( list[i].isDirectory() ) { recursiveDelete(list[i]); } else { list[i].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
for (int i = 0; i < list.length; i++) {
1
for (int i = 0; i < list.length; i++) {
2
			if( list[i].isDirectory() ) {
2
			if( list[i].isDirectory() ) {
3
				recursiveDelete(list[i]);
3
				recursiveDelete(list[i]);
4
			} else {
4
			} else {
5
				list[i].delete();				
5
				list[i].delete();				
6
			
6
			
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