Token tok = currentToken.next; for (int i = 0; i < maxSize; i++) { if (i != 0) retval += " "; if (tok.kind == 0) { retval += tokenImage[0]; break; } retval += add_escapes(tok.image);
Token tok = currentToken.next; for (int i = 0; i < maxSize; i++) { if (i != 0) retval += " "; if (tok.kind == 0) { retval += tokenImage[0]; break; } retval += add_escapes(tok.image);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/ParseException.java File path: /jEdit-4.2/src/bsh/ParseException.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
Token tok = currentToken.next;
1
Token tok =	currentToken.next;
2
    for (int i = 0; i < maxSize; i++) {
2
		for	(int i = 0; i <	maxSize; i++) 
3
    
3
		{
4
  if (i != 0) retval += " ";
4
		  if (i != 0) retval += " ";
5
      if (tok.kind == 0) {
5
		  if (tok.kind == 0) {
6
        retval += tokenImage[0];
6
			retval += tokenImage[0];
7
        break;
7
			break;
8
      }
8
		  }
9
      retval += add_escapes(tok.image);
9
		  retval +=	add_escapes(tok.image);
10
      
10
		  
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