for ( int i = 0; i < increment; i++ ) {
entities[i] = new Entity( "" + ( i + 1 ) );
s.save( entities[i] );
assertEquals( 2, generator.getDatabaseStructure().getTimesAccessed() ); // initialization calls seq twice
assertEquals( increment + 1, optimizer.getLastSourceValue() ); // initialization calls seq twice
assertEquals( i + 1, optimizer.getLastValue() );
assertEquals( increment + 1, optimizer.getLastSourceValue() );
}
for ( int i = 0; i < increment; i++ ) {
entities[i] = new Entity( "" + ( i + 1 ) );
s.save( entities[i] );
assertEquals( 2, generator.getTableAccessCount() ); // initialization calls seq twice
assertEquals( increment + 1, optimizer.getLastSourceValue() ); // initialization calls seq twice
assertEquals( i + 1, optimizer.getLastValue() );
assertEquals( increment + 1, optimizer.getLastSourceValue() );
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/idgen/enhanced/sequence/PooledSequenceTest.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/idgen/enhanced/table/PooledTableTest.java
|
Method name: void testNormalBoundary()
|
|
Method name: void testNormalBoundary()
|
Number of AST nodes: 7
|
|
Number of AST nodes: 7
|
|
1 | for ( int i = 0; i < increment; i++ ) {↵ | | 1 | for ( int i = 0; i < increment; i++ ) {↵
|
2 | entities[i] = new Entity( "" + ( i + 1 ) );↵ | | 2 | entities[i] = new Entity( "" + ( i + 1 ) );↵
|
3 | s.save( entities[i] );↵ | | 3 | s.save( entities[i] );↵
|
4 | assertEquals( 2, generator.getDatabaseStructure().getTimesAccessed() ); // initialization calls seq twice↵ | | 4 | assertEquals( 2, generator.getTableAccessCount() ); // initialization calls seq twice↵
|
5 | assertEquals( increment + 1, optimizer.getLastSourceValue() ); // initialization calls seq twice↵ | | 5 | assertEquals( increment + 1, optimizer.getLastSourceValue() ); // initialization calls seq twice↵
|
6 | assertEquals( i + 1, optimizer.getLastValue() );↵ | | 6 | assertEquals( i + 1, optimizer.getLastValue() );↵
|
7 | assertEquals( increment + 1, optimizer.getLastSourceValue() );↵ | | 7 | assertEquals( increment + 1, optimizer.getLastSourceValue() );↵
|
8 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
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 having the same super class |
Number of node comparisons | 49 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 6 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 3.5 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | for (int i = 0; i < increment; i++) | | 10 | for (int i = 0; i < increment; i++) |
11 | entities[i] = new Entity("" + (i + 1)); | | 11 | entities[i] = new Entity("" + (i + 1)); |
12 | | | 12 | |
| | | 13 | assertEquals(2, generator.getTableAccessCount()); |
13 | assertEquals(2, generator.getDatabaseStructure().getTimesAccessed()); | | | |
14 | assertEquals(increment + 1, optimizer.getLastSourceValue()); | | 14 | assertEquals(increment + 1, optimizer.getLastSourceValue()); |
15 | assertEquals(i + 1, optimizer.getLastValue()); | | 15 | assertEquals(i + 1, optimizer.getLastValue()); |
16 | assertEquals(increment + 1, optimizer.getLastSourceValue()); | | 16 | assertEquals(increment + 1, optimizer.getLastSourceValue()); |
Precondition Violations (0)
Row |
Violation |