public void clear() { if ( isClearQueueEnabled() ) { queueOperation( new Clear() ); } else { initialize( true ); if ( ! list.isEmpty() ) { list.clear(); dirty();
public void clear() { if ( isClearQueueEnabled() ) { queueOperation( new Clear() ); } else { initialize( true ); if ( !set.isEmpty() ) { set.clear(); dirty();
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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public void clear() {
1
public void clear() {
2
		if ( isClearQueueEnabled() ) {
2
		if ( isClearQueueEnabled() ) {
3
			queueOperation( new Clear() );
3
			queueOperation( new Clear() );
4
		}
4
		}
5
		else {
5
		else {
6
			initialize( true );
6
			initialize( true );
7
			if ( ! list.isEmpty() ) {
7
			if ( !set.isEmpty() ) {
8
				list.clear();
8
				set.clear();
9
				dirty();
9
				dirty();
10
			
10
			
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