for ( int i = 0; i < count; i++ ) {
entities[i] = new Entity( "" + ( i + 1 ) );
s.save( entities[i] );
long expectedId = i + 1;
assertEquals( expectedId, entities[i].getId().longValue() );
assertEquals( expectedId, generator.getDatabaseStructure().getTimesAccessed() );
assertEquals( expectedId, generator.getOptimizer().getLastSourceValue() );
}
for ( int i = 0; i < count; i++ ) {
entities[i] = new Entity( "" + ( i + 1 ) );
s.save( entities[i] );
long expectedId = i + 1;
assertEquals( expectedId, entities[i].getId().longValue() );
assertEquals( expectedId, generator.getDatabaseStructure().getTimesAccessed() );
assertEquals( expectedId, generator.getOptimizer().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/forcedtable/BasicForcedTableSequenceTest.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/idgen/enhanced/sequence/BasicSequenceTest.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 < count; i++ ) {↵ | | 1 | for ( int i = 0; i < count; 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 | long expectedId = i + 1;↵ | | 4 | long expectedId = i + 1;↵
|
5 | assertEquals( expectedId, entities[i].getId().longValue() );↵ | | 5 | assertEquals( expectedId, entities[i].getId().longValue() );↵
|
6 | assertEquals( expectedId, generator.getDatabaseStructure().getTimesAccessed() );↵ | | 6 | assertEquals( expectedId, generator.getDatabaseStructure().getTimesAccessed() );↵
|
7 | assertEquals( expectedId, generator.getOptimizer().getLastSourceValue() );↵ | | 7 | assertEquals( expectedId, generator.getOptimizer().getLastSourceValue() );↵
|
8 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
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 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 7 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 2.9 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | for (int i = 0; i < count; i++) | | 8 | for (int i = 0; i < count; i++) |
9 | entities[i] = new Entity("" + (i + 1)); | | 9 | entities[i] = new Entity("" + (i + 1)); |
10 | | | 10 | |
11 | | | 11 | |
12 | assertEquals(expectedId, entities[i].getId().longValue()); | | 12 | assertEquals(expectedId, entities[i].getId().longValue()); |
13 | assertEquals(expectedId, generator.getDatabaseStructure().getTimesAccessed()); | | 13 | assertEquals(expectedId, generator.getDatabaseStructure().getTimesAccessed()); |
14 | assertEquals(expectedId, generator.getOptimizer().getLastSourceValue()); | | 14 | assertEquals(expectedId, generator.getOptimizer().getLastSourceValue()); |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variable entities with type org.hibernate.test.idgen.enhanced.forcedtable.Entity[] , while Clone fragment #2 returns variable entities with type org.hibernate.test.idgen.enhanced.sequence.Entity[] |