CollectionCacheEntry entry = (CollectionCacheEntry) item; Serializable[] state = entry.getState(); Map map = new HashMap(state.length); for ( int i=0; i<state.length; ) { map.put( state[i++], state[i++] ); } return map;
Map result = new HashMap( tuple.length ); for ( int i = 0; i < tuple.length; i++ ) { String alias = aliases[i]; if ( alias != null ) { result.put( alias.toUpperCase(), tuple[i] ); } } return result;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/cache/entry/StructuredMapCacheEntry.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/sql/hand/query/NativeSQLQueriesTest.java
Method name: Object structure(Object) Method name: Object transformTuple(Object[], String[])
Number of AST nodes: 6 Number of AST nodes: 6
1
CollectionCacheEntry entry = (CollectionCacheEntry) item;
2
		Serializable[] state = entry.getState();
3
		Map map = new HashMap(state.length);
1
Map result = new HashMap( tuple.length );
4
		for ( int i=0; i<state.length; ) {
2
			for ( int i = 0; i < tuple.length; i++ ) {
5
			map.put( state[i++], stat
3
				String alias = aliases[i];
4
				if ( alias != null ) {
6
e[i++] );
5
					result.put( alias.toUpperCase(), tuple[i] );
7
		}
6
				}
8
		
7
			}
9
return map;
8
			return result;
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.1
Clones locationClones are in different classes
Number of node comparisons9