Boolean exists = isOperationQueueEnabled() ? readElementExistence( value ) : null;
if ( exists == null ) {
initialize( true );
if ( set.add( value ) ) {
dirty();
return true;
}
else {
return false;
}
}
else if ( exists.booleanValue() ) {
return false;
}
else {
queueOperation( new SimpleAdd(value) );
return true;
}
Boolean exists = isPutQueueEnabled() ? readElementExistence( value ) : null;
if ( exists==null ) {
initialize( true );
if ( set.remove( value ) ) {
dirty();
return true;
}
else {
return false;
}
}
else if ( exists.booleanValue() ) {
queueOperation( new SimpleRemove(value) );
return true;
}
else {
return false;
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentSet.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentSet.java
|
Method name: boolean add(Object)
|
|
Method name: boolean remove(Object)
|
Number of AST nodes: 11
|
|
Number of AST nodes: 11
|
|
1 | Boolean exists = isOperationQueueEnabled() ? readElementExistence( value ) : null;↵ | | 1 | Boolean exists = isPutQueueEnabled() ? readElementExistence( value ) : null;↵
|
2 | if ( exists == null ) {↵ | | 2 | if ( exists==null ) {↵
|
3 | initialize( true );↵ | | 3 | initialize( true );↵
|
4 | if ( set.add( value ) ) {↵ | | 4 | if ( set.remove( value ) ) {↵
|
5 | dirty();↵ | | 5 | dirty();↵
|
6 | return true;↵ | | 6 | return true;↵
|
7 | }↵ | | 7 | }↵
|
8 | else {↵ | | 8 | else {↵
|
9 | return false;↵ | | 9 | return false;↵
|
10 | }↵ | | 10 | }↵
|
11 | }↵ | | 11 | }↵
|
12 | else if ( exists.booleanValue() ) {↵ | | 12 | else if ( exists.booleanValue() ) {↵
|
13 | return false;↵ | | 13 | ↵
|
14 | }↵ | | |
|
15 | else {↵ | | |
|
16 | queueOperation( new SimpleAdd(value) );↵ | | 14 | queueOperation( new SimpleRemove(value) );↵
|
17 | return true;↵ | | 15 | return true;↵
|
18 | } | | 16 | }↵
|
| | | 17 | else {↵
|
| | | 18 | return false;↵
|
| | | 19 | }
|
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.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 37 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 10 |
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) | 6.2 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Boolean exists = isOperationQueueEnabled() ? readElementExistence(value) : null; | | 1 | Boolean exists = isPutQueueEnabled() ? readElementExistence(value) : null; |
2 | if (exists == null) | | 2 | if (exists == null) |
3 | | | 3 | |
4 | | | 4 | |
5 | | | 5 | |
6 | | | 6 | |
| | | | |
7 | | | 7 | |
8 | else if (exists.booleanValue()) | | 8 | else if (exists.booleanValue()) |
| | | 9 | queueOperation(new SimpleRemove(value)); |
9 | | | 10 | |
| | | | |
10 | queueOperation(new SimpleAdd(value)); | | | |
11 | | | 11 | |
Precondition Violations (0)
Row |
Violation |