idStack.pop(); if (baseId.lastIndexOf('.') > 0) { baseId = baseId.substring(0, baseId.lastIndexOf('.')); } return root;
idStack.pop(); if (baseId.lastIndexOf('.') > 0) { baseId = baseId.substring(0, baseId.lastIndexOf('.')); } return root;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/importer/rose/parser/RoseParser.java File path: /emf-2.4.1/src/org/eclipse/emf/importer/rose/parser/RoseParser.java
Method name: RoseNode parseObject(String) Method name: RoseNode parseValue(String)
Number of AST nodes: 4 Number of AST nodes: 4
1
idStack.pop();
1
idStack.pop();
2
    if (baseId.lastIndexOf('.') > 0)
2
    if (baseId.lastIndexOf('.') > 0)
3
    {
3
    {
4
      baseId = baseId.substring(0, baseId.lastIndexOf('.'));
4
      baseId = baseId.substring(0, baseId.lastIndexOf('.'));
5
    }
5
    }
6
    return root;
6
    return root;
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.2
Clones locationClones are declared in the same class
Number of node comparisons8
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements4
    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.6
    Clone typeType 1
    Mapped Statements
    ID Statement ID Statement
    42
    idStack.pop();
    28
    idStack.pop();
    43
    if (baseId.lastIndexOf('.') > 0)
    29
    if (baseId.lastIndexOf('.') > 0)
    44
    baseId = baseId.substring(0, baseId.lastIndexOf('.'));
    30
    baseId = baseId.substring(0, baseId.lastIndexOf('.'));
    45
    return root;
    31
    return root;
    Precondition Violations (0)
    Row Violation