code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1); code.put2(8);
newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1); newCode.put2(8);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/objectweb/asm/CodeWriter.java File path: /jEdit-4.2/src/org/objectweb/asm/CodeWriter.java
Method name: void visitJumpInsn(int, Label) Method name: int[] resizeInstructions(int[], int[], int)
Number of AST nodes: 2 Number of AST nodes: 2
1
code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
1
newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
2
        code.put2(8);
2
              newCode.put2(8);
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones locationClones are declared in the same class
Number of node comparisons4
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements2
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)0.0
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    23
    code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    23
    code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    126
    newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    Differences
    Expression1Expression2Difference
    codenewCodeVARIABLE_NAME_MISMATCH
    126
    newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    24
    code.put2(8);
    24
    code.put2(8);
    127
    newCode.put2(8);
    Differences
    Expression1Expression2Difference
    codenewCodeVARIABLE_NAME_MISMATCH
    127
    newCode.put2(8);
    Precondition Violations (0)
    Row Violation