public int[] findDirty(Object[] currentState, Object[] previousState, Object entity, SessionImplementor session)
throws HibernateException {
int[] props = TypeFactory.findDirty(
entityMetamodel.getProperties(),
currentState,
previousState,
propertyColumnUpdateable,
hasUninitializedLazyProperties( entity, session.getEntityMode() ),
session
);
if ( props == null ) {
return null;
}
else {
logDirtyProperties( props );
return props;
public int[] findModified(Object[] old, Object[] current, Object entity, SessionImplementor session)
throws HibernateException {
int[] props = TypeFactory.findModified(
entityMetamodel.getProperties(),
current,
old,
propertyColumnUpdateable,
hasUninitializedLazyProperties( entity, session.getEntityMode() ),
session
);
if ( props == null ) {
return null;
}
else {
logDirtyProperties( props );
return props;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/AbstractEntityPersister.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/AbstractEntityPersister.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public int[] findDirty(Object[] currentState, Object[] previousState, Object entity, SessionImplementor session)↵ | | 1 | public int[] findModified(Object[] old, Object[] current, Object entity, SessionImplementor session)↵
|
2 | throws HibernateException {↵ | | 2 | throws HibernateException {↵
|
3 | int[] props = TypeFactory.findDirty(↵ | | 3 | int[] props = TypeFactory.findModified(↵
|
4 | entityMetamodel.getProperties(),↵ | | 4 | entityMetamodel.getProperties(),↵
|
5 | currentState,↵ | | 5 | current,↵
|
6 | previousState,↵ | | 6 | old,↵
|
7 | propertyColumnUpdateable,↵ | | 7 | propertyColumnUpdateable,↵
|
8 | hasUninitializedLazyProperties( entity, session.getEntityMode() ),↵ | | 8 | hasUninitializedLazyProperties( entity, session.getEntityMode() ),↵
|
9 | session↵ | | 9 | session↵
|
10 | );↵ | | 10 | );↵
|
11 | if ( props == null ) {↵ | | 11 | if ( props == null ) {↵
|
12 | return null;↵ | | 12 | return null;↵
|
13 | }↵ | | 13 | }↵
|
14 | else {↵ | | 14 | else {↵
|
15 | logDirtyProperties( props );↵ | | 15 | logDirtyProperties( props );↵
|
16 | return props;↵ | | 16 | return props;↵
|
17 | | | 17 |
|
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 |