String sequenceName = PropertiesHelper.getString( SEQUENCE_PARAM, params, DEF_SEQUENCE_NAME );
if ( sequenceName.indexOf( '.' ) < 0 ) {
String schemaName = params.getProperty( SCHEMA );
String catalogName = params.getProperty( CATALOG );
sequenceName = Table.qualify( catalogName, schemaName, sequenceName );
}
return sequenceName;
String name = PropertiesHelper.getString( TABLE_PARAM, params, DEF_TABLE );
boolean isGivenNameUnqualified = name.indexOf( '.' ) < 0;
if ( isGivenNameUnqualified ) {
// if the given name is un-qualified we may neen to qualify it
String schemaName = params.getProperty( SCHEMA );
String catalogName = params.getProperty( CATALOG );
name = Table.qualify( catalogName, schemaName, name );
}
return name;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/id/enhanced/SequenceStyleGenerator.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/id/enhanced/TableGenerator.java
|
Method name: String determineSequenceName(Properties)
|
|
Method name: String determneGeneratorTableName(Properties)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 7
|
|
1 | String sequenceName = PropertiesHelper.getString( SEQUENCE_PARAM, params, DEF_SEQUENCE_NAME );↵ | | 1 | String name = PropertiesHelper.getString( TABLE_PARAM, params, DEF_↵
|
2 | if ( sequenceName.indexOf( '.' ) < 0 ) {↵ | | 2 | TABLE );↵
|
| | | 3 | boolean isGivenNameUnqualified = name.indexOf( '.' ) < 0;↵
|
| | | 4 | if ( isGivenNameUnqualified ) {↵
|
| | | 5 | // if the given name is un-qualified we may neen to qualify it↵
|
3 | String schemaName = params.getProperty( SCHEMA );↵ | | 6 | String schemaName = params.getProperty( SCHEMA );↵
|
4 | String catalogName = params.getProperty( CATALOG );↵ | | 7 | String catalogName = params.getProperty( CATALOG );↵
|
5 | sequenceName = Table.qualify( catalogName, schemaName, sequenceName );↵ | | 8 | name = Table.qualify( catalogName, schemaName, name );↵
|
6 | }↵ | | 9 | }↵
|
7 | return sequenceName; | | 10 | return name;
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |