if( persister == null ) { s.append( "<null EntityPersister>" ); } else { s.append( persister.getEntityName() ); s.append( "#<" ); for ( int i=0; i<ids.length; i++ ) { s.append( persister.getIdentifierType().toLoggableString( ids[i], factory ) ); if ( i < ids.length-1 ) { s.append( ", " ); } } s.append( '>' ); }
if ( persister == null ) { s.append( "<unreferenced>" ); } else { s.append( persister.getRole() ); s.append( "#<" ); for ( int i = 0; i < ids.length; i++ ) { // Need to use the identifier type of the collection owner // since the incoming is value is actually the owner's id. // Using the collection's key type causes problems with // property-ref keys... s.append( persister.getOwnerEntityPersister().getIdentifierType().toLoggableString( ids[i], factory ) ); if ( i < ids.length-1 ) { s.append( ", " ); } } s.append( '>' ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/pretty/MessageHelper.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/pretty/MessageHelper.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if( persister == null ) {
1
if ( persister == null ) {
2
			s.append( "<null EntityPersister>" );
2
			s.append( "<unreferenced>" );
3
		}
3
		}
4
		else {
4
		else {
5
			s.append( persister.getEntityName() );
5
			s.append( persister.getRole() );
6
			s.append( "#<" );
6
			s.append( "#<" );
7
			for ( int i=0; i<ids.length; i++ ) {
7
			for ( int i = 0; i < ids.length; i++ ) {
8
				s.append( persister
8
				// Need to use the identifier type of the collection owner
9
				// since the incoming is value is actually the owner's id.
10
				// Using the collection's key type causes problems with
11
				// property-ref keys...
9
.getIdentifierType().toLoggableString( ids[i], factory ) );
12
				s.append( persister.getOwnerEntityPersister().getIdentifierType().toLoggableString( ids[i], factory ) );
10
				if ( i < ids.length-1 ) {
13
				if ( i < ids.length-1 ) {
11
					s.append( ", " );
14
					s.append( ", " );
12
				}
15
				}
13
			}
16
			}
14
			s.append( '>' );
17
			s.append( '>' );
15
		}
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