Boolean exists = isPutQueueEnabled() ? readElementExistence(value) : null;
if ( exists == null ) {
initialize( true );
if ( list.remove( value ) ) {
dirty();
return true;
}
else {
return false;
}
}
else if ( exists.booleanValue() ) {
queueOperation( new SimpleRemove(value) );
return true;
}
else {
return false;
}
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;
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentList.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentSet.java
|
Method name: boolean remove(Object)
|
|
Method name: boolean add(Object)
|
Number of AST nodes: 11
|
|
Number of AST nodes: 11
|
|
1 | Boolean exists = isPutQueueEnabled() ? readElementExistence(value) : null;↵ | | 1 | Boolean exists = isOperationQueueEnabled() ? readElementExistence( value ) : null;↵
|
2 | if ( exists == null ) {↵ | | 2 | if ( exists == null ) {↵
|
3 | initialize( true );↵ | | 3 | initialize( true );↵
|
4 | if ( list.remove( value ) ) {↵ | | 4 | if ( set.add( 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 | ↵ | | 13 | return false;↵
|
| | | 14 | }↵
|
| | | 15 | else {↵
|
14 | queueOperation( new SimpleRemove(value) );↵ | | 16 | queueOperation( new SimpleAdd(value) );↵
|
15 | return true;↵ | | 17 | return true;↵
|
16 | }↵ | | 18 | }
|
17 | else {↵ | | | |
18 | return false;↵ | | | |
19 | } | | | |
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 having the same super class |
Number of node comparisons | 1 |