for (int i = 0; i < capas.length; i++) { if (capas[i].startsWith(command)) { return true; } }
for (int j = 0; j < parserCount; j++) { if (parser[j].clock(c)) { result.append(parser[j].getValue()); } }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/pop3/POP3Store.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/print/cPrintVariable.java
Method name: boolean isSupported(String) Method name: String processCodeString()
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < capas.length; i++) {
1
for (int j = 0; j < parserCount; j++) {
2
			if (capas[i].startsWith(command)) {
2
						if (parser[j].clock(c)) {
3
				return true;
3
							result.append(parser[j].getValue());
4
			}
4
				
5
		}
5
		}
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.2
Clones locationClones are in different classes
Number of node comparisons1