Table table = (Table) iter.next();
if ( table.isPhysicalTable() ) {
script.add(
table.sqlCreateString(
dialect,
mapping,
defaultCatalog,
defaultSchema
)
);
Iterator comments = table.sqlCommentStrings( dialect, defaultCatalog, defaultSchema );
while ( comments.hasNext() ) {
script.add( comments.next() );
}
}
if ( i >= elements.size() ) {
result.add(old);
}
else {
Element elem = (Element) elements.get(i);
Object object = elementType.fromXMLNode( elem, persister.getFactory() );
if ( elementType.isDirty( old, object, getSession() ) ) result.add(old);
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/cfg/Configuration.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentElementHolder.java
|
Method name: String[] generateSchemaCreationScript(Dialect)
|
|
Method name: Iterator getDeletes(CollectionPersister, boolean)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | Table table = (Table) iter.next();↵ | | |
|
2 | if ( table.isPhysicalTable() ) {↵ | | 1 | if ( i >= elements.size() ) {↵
|
3 | script.add(↵ | | 2 | result.add(old);↵
|
4 | ↵ | | 3 | }↵
|
5 | table.sqlCreateString(↵ | | 4 | ↵
|
6 | dialect,↵ | | |
|
7 | mapping,↵ | | |
|
8 | defaultCatalog,↵ | | |
|
9 | defaultSchema↵ | | |
|
10 | )↵ | | |
|
11 | );↵ | | |
|
12 | Iterator comments = table.sqlCommentStrings( dialect, defaultCatalog, defaultSchema );↵ | | |
|
13 | while ( comments.hasNext() ) {↵ | | |
|
14 | script.add( comments.next() );↵ | | |
|
15 | }↵ | | 5 | else {↵
|
| | | 6 | Element elem = (Element) elements.get(i);↵
|
| | | 7 | Object object = elementType.fromXMLNode( elem, persister.getFactory() );↵
|
| | | 8 | if ( elementType.isDirty( old, object, getSession() ) ) result.add(old);↵
|
16 | } | | 9 | }
|
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 |