public boolean addAll(Collection values) { if ( values.size()==0 ) return false; if ( !isOperationQueueEnabled() ) { write(); return bag.addAll(values); } else { Iterator iter = values.iterator(); while ( iter.hasNext() ) { queueOperation( new SimpleAdd( iter.next() ) ); } return values.size()>0;
public boolean addAll(Collection values) { if ( values.size()==0 ) { return false; } 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
public boolean addAll(Collection values) {
1
public boolean addAll(Collection values) {
2
		if ( values.size()==0 ) 
2
		if ( values.size()==0 ) {
3
return false;
3
			return false;
4
		
4
		}
5
if ( !isOperationQueueEnabled() ) {
5
		if ( !isOperationQueueEnabled() ) {
6
			write();
6
			write();
7
			return bag.addAll(values);
7
			return list.addAll(values);
8
		}
8
		}
9
		else {
9
		else {
10
			Iterator iter = values.iterator();
10
			Iterator iter = values.iterator();
11
			while ( iter.hasNext() ) {
11
			while ( iter.hasNext() ) {
12
				queueOperation( new SimpleAdd( iter.next() ) );
12
				queueOperation( new SimpleAdd( iter.next() ) );
13
			}
13
			}
14
			return values.size()>0;
14
			return values.size()>0;
15
		
15
		
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0