Set set = new HashSet( map.size() ); Iterator iter = map.entrySet().iterator(); while ( iter.hasNext() ) { Map.Entry me = (Map.Entry) iter.next(); set.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) ); } return set;
ArrayList list = new ArrayList( map.size() ); Iterator iter = map.entrySet().iterator(); while ( iter.hasNext() ) { Map.Entry me = (Map.Entry) iter.next(); list.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) ); } return list;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/IdentityMap.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/IdentityMap.java
Method name: Set entrySet() Method name: List entryList()
Number of AST nodes: 6 Number of AST nodes: 6
1
Set set = new HashSet( map.size() );
1
ArrayList list = new ArrayList( map.size() );
2
		Iterator iter = map.entrySet().iterator();
2
		Iterator iter = map.entrySet().iterator();
3
		while ( iter.hasNext() ) {
3
		while ( iter.hasNext() ) {
4
			Map.Entry me = (Map.Entry) iter.next();
4
			Map.Entry me = (Map.Entry) iter.next();
5
			set.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) );
5
			list.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) );
6
		}
6
		}
7
		return set;
7
		return list;
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.1
Clones locationClones are declared in the same class
Number of node comparisons14
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements6
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)3.0
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    Set set = new HashSet(map.size());
    1
    Set set = new HashSet(map.size());
    1
    ArrayList list = new ArrayList(map.size());
    Differences
    Expression1Expression2Difference
    java.util.Setjava.util.ArrayListSUBCLASS_TYPE_MISMATCH
    setlistVARIABLE_NAME_MISMATCH
    java.util.Setjava.util.ArrayListSUBCLASS_TYPE_MISMATCH
    java.util.HashSetjava.util.ArrayListSUBCLASS_TYPE_MISMATCH
    1
    ArrayList list = new ArrayList(map.size());
    2
    Iterator iter = map.entrySet().iterator();
    2
    Iterator iter = map.entrySet().iterator();
    3
    while (iter.hasNext())
    3
    while (iter.hasNext())
    4
    Map.Entry me = (Map.Entry)iter.next();
    4
    Map.Entry me = (Map.Entry)iter.next();
    5
    set.add(new IdentityMapEntry(((IdentityKey)me.getKey()).key, me.getValue()));
    5
    set.add(new IdentityMapEntry(((IdentityKey)me.getKey()).key, me.getValue()));
    5
    list.add(new IdentityMapEntry(((IdentityKey)me.getKey()).key, me.getValue()));
    Differences
    Expression1Expression2Difference
    setlistVARIABLE_NAME_MISMATCH
    java.util.Setjava.util.ArrayListSUBCLASS_TYPE_MISMATCH
    5
    list.add(new IdentityMapEntry(((IdentityKey)me.getKey()).key, me.getValue()));
    6
    return set;
    6
    return set;
    6
    return list;
    Differences
    Expression1Expression2Difference
    setlistVARIABLE_NAME_MISMATCH
    java.util.Setjava.util.ArrayListSUBCLASS_TYPE_MISMATCH
    6
    return list;
    Precondition Violations (0)
    Row Violation