for (int index = 0 ; index < size ; index++) {
String propertyName = descritors[index].getName();
if ( connectionProviderInjectionData.containsKey( propertyName ) ) {
Method method = descritors[index].getWriteMethod();
method.invoke( connections, new Object[] { connectionProviderInjectionData.get( propertyName ) } );
}
}
CaseFragment cases = getFactory().getDialect().createCaseFragment();
for ( int i=0; i<discriminatorValues.length; i++ ) {
cases.addWhenColumnNotNull(
generateTableAlias( alias, notNullColumnTableNumbers[i] ),
notNullColumnNames[i],
discriminatorValues[i]
);
}
return cases;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/connection/ConnectionProviderFactory.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/JoinedSubclassEntityPersister.java
|
Method name: ConnectionProvider newConnectionProvider(Properties, Map)
|
|
Method name: CaseFragment discriminatorFragment(String)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 4
|
|
1 | for (int index = 0 ; index < size ; index++) {↵ | | |
|
2 | String propertyName = descritors[index].getName();↵ | | 1 | CaseFragment cases = getFactory().getDialect().createCaseFragment();↵
|
3 | ↵ | | |
|
4 | if ( connectionProviderInjectionData.containsKey( propertyName ) ) {↵ | | 2 | ↵
|
5 | Method method = descritors[index].getWriteMethod();↵ | | |
|
6 | method.invoke( connections, new Object[] { connectionProviderInjectionData.get( propertyName ) } );↵ | | 3 | for ( int i=0; i<discriminatorValues.length; i++ ) {↵
|
| | | 4 | cases.addWhenColumnNotNull(↵
|
| | | 5 | generateTableAlias( alias, notNullColumnTableNumbers[i] ),↵
|
| | | 6 | notNullColumnNames[i],↵
|
| | | 7 | discriminatorValues[i]↵
|
7 | ↵ | | 8 | );↵
|
8 | }↵ | | 9 | }↵
|
|
9 | } | | 10 | return cases;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |