protected boolean invokeDeleteLifecycle(EventSource session, Object entity, EntityPersister persister) {
if ( persister.implementsLifecycle( session.getEntityMode() ) ) {
log.debug( "calling onDelete()" );
if ( ( ( Lifecycle ) entity ).onDelete( session ) ) {
log.debug( "deletion vetoed by onDelete()" );
return true;
}
}
return false;
protected boolean invokeUpdateLifecycle(Object entity, EntityPersister persister, EventSource source) {
if ( persister.implementsLifecycle( source.getEntityMode() ) ) {
log.debug( "calling onUpdate()" );
if ( ( ( Lifecycle ) entity ).onUpdate( source ) ) {
log.debug( "update vetoed by onUpdate()" );
return true;
}
}
return false;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/DefaultDeleteEventListener.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/DefaultSaveOrUpdateEventListener.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | protected boolean invokeDeleteLifecycle(EventSource session, Object entity, EntityPersister persister) {↵ | | 1 | protected boolean invokeUpdateLifecycle(Object entity, EntityPersister persister, EventSource source) {↵
|
2 | if ( persister.implementsLifecycle( session.getEntityMode() ) ) {↵ | | 2 | if ( persister.implementsLifecycle( source.getEntityMode() ) ) {↵
|
3 | log.debug( "calling onDelete()" );↵ | | 3 | log.debug( "calling onUpdate()" );↵
|
4 | if ( ( ( Lifecycle ) entity ).onDelete( session ) ) {↵ | | 4 | if ( ( ( Lifecycle ) entity ).onUpdate( source ) ) {↵
|
5 | log.debug( "deletion vetoed by onDelete()" );↵ | | 5 | log.debug( "update vetoed by onUpdate()" );↵
|
6 | return true;↵ | | 6 | return true;↵
|
7 | }↵ | | 7 | }↵
|
8 | }↵ | | 8 | }↵
|
9 | return false;↵ | | 9 | return false;↵
|
10 | | | 10 |
|
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 |