if (other instanceof Map.Entry) { Map.Entry ent = (Map.Entry) other; return getKey() == ent.getKey() && valueEquals(getValue(), ent.getValue()); } else { return false; }
if (other instanceof Map.Entry) { Map.Entry ent = (Map.Entry) other; return keyEquals(getKey(), ent.getKey()) && valueEquals(getValue(), ent.getValue()); } else { return false; }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/util/WeakIdentityHashMap.java File path: /jruby-1.4.0/src/org/jruby/util/GenericMap.java
Method name: boolean equals(Object) Method name: boolean equals(Object)
Number of AST nodes: 4 Number of AST nodes: 4
1
if (other instanceof Map.Entry) {
1
if (other instanceof Map.Entry) {
2
                Map.Entry ent = (Map.Entry) other;
2
				Map.Entry ent = (Map.Entry) other;
3
                return getKey() == ent.getKey()
3
				return keyEquals(getKey(), ent.getKey()
4
                        
4
)
5
&& valueEquals(getValue(), ent.getValue());
5
						&& valueEquals(getValue(), ent.getValue());
6
            } else {
7
                
6
			} else {
8
return false;
7
				return false;
9
            }
8
			}
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.2
Clones locationClones are in different classes
Number of node comparisons16
  1. {Non-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)1.2
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    if (other instanceof Map.Entry)
    1
    if (other instanceof Map.Entry)
    2
    Map.Entry ent = (Map.Entry)other;
    2
    Map.Entry ent = (Map.Entry)other;
    3
    return getKey() == ent.getKey() && valueEquals(getValue(), ent.getValue());
    3
    return getKey() == ent.getKey() && valueEquals(getValue(), ent.getValue());
    3
    return keyEquals(getKey(), ent.getKey()) && valueEquals(getValue(), ent.getValue());
    Differences
    Expression1Expression2Difference
    getKey() == ent.getKey()keyEquals(getKey(),ent.getKey())INFIX_LEFT_OPERAND_MISMATCH
    Preondition Violations
    Expression getKey() == ent.getKey() cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression keyEquals(getKey(),ent.getKey()) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    3
    return keyEquals(getKey(), ent.getKey()) && valueEquals(getValue(), ent.getValue());
    else
    else
    4
    return false;
    4
    return false;
    Precondition Violations (2)
    Row Violation
    1Expression getKey() == ent.getKey() cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression keyEquals(getKey(),ent.getKey()) cannot be parameterized, because it has dependencies to/from statements that will be extracted