if ( i >= elements.size() ) {
result.add(old);
}
else {
Element elem = (Element) elements.get(i);
Object object = elementType.fromXMLNode( elem, persister.getFactory() );
if ( elementType.isDirty( old, object, getSession() ) ) result.add(old);
}
if ( persister.isVersioned() && requestedLockMode == LockMode.FORCE ) {
// todo : should we check the current isolation mode explicitly?
Object nextVersion = persister.forceVersionIncrement(
entry.getId(), entry.getVersion(), source
);
entry.forceLocked( object, nextVersion );
}
else {
persister.lock( entry.getId(), entry.getVersion(), object, requestedLockMode, source );
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentElementHolder.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/AbstractLockUpgradeEventListener.java
|
Method name: Iterator getDeletes(CollectionPersister, boolean)
|
|
Method name: void upgradeLock(Object, EntityEntry, LockMode, SessionImplementor)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 4
|
|
1 | if ( i >= elements.size() ) {↵ | | 1 | if ( ↵
|
2 | result.add(old);↵ | | |
|
3 | }↵ | | |
|
4 | else {↵ | | |
|
5 | Element elem = (Element) elements.get(i);↵ | | |
|
6 | Object object = elementType.fromXMLNode( elem, persister.getFactory() );↵ | | |
|
7 | if ( elementType.isDirty( old, object, getSession() ) ) result.add(old↵ | | 2 | persister.isVersioned() && requestedLockMode == LockMode.FORCE ) {↵
|
| | | 3 | // todo : should we check the current isolation mode explicitly?↵
|
| | | 4 | Object nextVersion = persister.forceVersionIncrement(↵
|
| | | 5 | entry.getId(), entry.getVersion(), source↵
|
| | | 6 | );↵
|
| | | 7 | entry.forceLocked( object, nextVersion );↵
|
| | | 8 | }↵
|
| | | 9 | else {↵
|
8 | );↵ | | 10 | persister.lock( entry.getId(), entry.getVersion(), object, requestedLockMode, source );↵
|
9 | } | | 11 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |