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