if ( !isOperationQueueEnabled() ) {
write();
return bag.addAll(values);
}
else {
Iterator iter = values.iterator();
while ( iter.hasNext() ) {
queueOperation( new SimpleAdd( iter.next() ) );
}
return values.size()>0;
}
if ( !isOperationQueueEnabled() ) {
write();
return list.addAll(values);
}
else {
Iterator iter = values.iterator();
while ( iter.hasNext() ) {
queueOperation( new SimpleAdd( iter.next() ) );
}
return values.size()>0;
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentBag.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentList.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if ( !isOperationQueueEnabled() ) {↵ | | 1 | if ( !isOperationQueueEnabled() ) {↵
|
2 | write();↵ | | 2 | write();↵
|
3 | return bag.addAll(values);↵ | | 3 | return list.addAll(values);↵
|
4 | }↵ | | 4 | }↵
|
5 | else {↵ | | 5 | else {↵
|
6 | Iterator iter = values.iterator();↵ | | 6 | Iterator iter = values.iterator();↵
|
7 | while ( iter.hasNext() ) {↵ | | 7 | while ( iter.hasNext() ) {↵
|
8 | queueOperation( new SimpleAdd( iter.next() ) );↵ | | 8 | queueOperation( new SimpleAdd( iter.next() ) );↵
|
9 | }↵ | | 9 | }↵
|
10 | return values.size()>0;↵ | | 10 | return values.size()>0;↵
|
11 | } | | 11 | }
|
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 | |
Number of node comparisons | 0 |