for (int i = 0; i < capas.length; i++) { if (capas[i].startsWith(string)) { return true; } }
for (int i = 0; i < input.length(); i++) { if (input.charAt(i) > 127) { return true; } }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/smtp/SMTPServer.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/composer/MessageComposer.java
Method name: boolean isSupported(String) Method name: boolean needQPEncoding(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < capas.length; i++) {
1
for (int i = 0; i < input.length(); i++) {
2
			if (capas[i].startsWith(string)) {
2
			if (input.charAt(i) > 127) {
3
				return true;
3
				return true;
4
			}
4
			}
5
		}
5
		}
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.1
Clones locationClones are in different classes
Number of node comparisons1