private void trackNamedParameterPositions(String name) { Integer loc = new Integer( parameterCount++ ); Object o = namedParameters.get( name ); if ( o == null ) { namedParameters.put( name, loc ); } else if ( o instanceof Integer ) { ArrayList list = new ArrayList( 4 ); list.add( o ); list.add( loc ); namedParameters.put( name, list ); } else { ( ( ArrayList ) o ).add( loc );
private void addNamedParameter(String name) { Integer loc = new Integer( parameterCount++ ); Object o = namedParameterBindPoints.get( name ); if ( o == null ) { namedParameterBindPoints.put( name, loc ); } else if ( o instanceof Integer ) { ArrayList list = new ArrayList( 4 ); list.add( o ); list.add( loc ); namedParameterBindPoints.put( name, list ); } else { ( ( List ) o ).add( loc );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/HqlSqlWalker.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/loader/custom/sql/SQLQueryParser.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
private void trackNamedParameterPositions(String name) {
1
private void addNamedParameter(String name) {
2
		Integer loc = new Integer( parameterCount++ );
2
			Integer loc = new Integer( parameterCount++ );
3
		Object o = namedParameters.get( name );
3
			Object o = namedParameterBindPoints.get( name );
4
		if ( o == null ) {
4
			if ( o == null ) {
5
			namedParameters.put( name, loc );
5
				namedParameterBindPoints.put( name, loc );
6
		}
6
			}
7
		else if ( o instanceof Integer ) {
7
			else if ( o instanceof Integer ) {
8
			ArrayList list = new ArrayList( 4 );
8
				ArrayList list = new ArrayList( 4 );
9
			list.add( o );
9
				list.add( o );
10
			list.add( loc );
10
				list.add( loc );
11
			namedParameters.put( name, list );
11
				namedParameterBindPoints.put( name, list );
12
		}
12
			}
13
		else {
13
			else {
14
			( ( ArrayList ) o ).add( loc );
14
				( ( List ) o ).add( loc );
15
		
15
			
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 location
Number of node comparisons0