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;
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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if ( exists == null ) {
1
if ( exists==null ) {
2
			initialize( true );
2
			initialize( true );
3
			if ( set.add( value ) ) {
3
			if ( set.remove( value ) ) {
4
				dirty();
4
				dirty();
5
				return true;
5
				return true;
6
			}
6
			}
7
			else {
7
			else {
8
				return false;
8
				return false;
9
			}
9
			}
10
		}
10
		}
11
		else if ( exists.booleanValue() ) {
11
		else if ( exists.booleanValue() ) {
12
			return false;
12
			
13
		}
14
		else {
15
			queueOperation( new SimpleAdd(value) );
13
queueOperation( new SimpleRemove(value) );
16
			return true;
14
			return true;
17
		
15
		}
16
		else {
17
			return false;
18
		
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