for (int i = 0; i < input.length(); i++) { if (input.charAt(i) > 127) { 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/composer/MessageComposer.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/print/cPrintVariable.java
Method name: boolean needQPEncoding(String) Method name: String processCodeString()
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < input.length(); i++) {
1
for (int j = 0; j < parserCount; j++) {
2
			if (input.charAt(i) > 127) {
2
						if (
3
				return true;
4
			}
3
parser[j].clock(c)) {
4
							result.append(parser[j].getValue());
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.1
Clones locationClones are in different classes
Number of node comparisons1