Serializable sn = getSnapshot(); return Array.get(array, i)!=null && ( i >= Array.getLength(sn) || Array.get(sn, i)==null );
Map snap = (Map) getSnapshot(); Object id = identifiers.get( new Integer(i) ); return entry!=null && ( id==null || snap.get(id)==null );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentArrayHolder.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentIdentifierBag.java
Method name: boolean needsInserting(Object, int, Type) Method name: boolean needsInserting(Object, int, Type)
Number of AST nodes: 2 Number of AST nodes: 3
1
Serializable sn = getSnapshot();
1
Map snap = (Map) getSnapshot();
2
		return Array.get(array, i)!=null && ( i >= Array.getLength(sn) || Array.get(sn, i
2
		Object id = identifiers.get( new Integer(i) );
3
)==null );
3
		return entry!=null && ( id==null || snap.get(id)==null );
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 locationClones are in different classes having the same super class
Number of node comparisons6