for ( int i = 0; i < span; i++ ) {
final boolean dirty = currentState[i] != LazyPropertyInitializer.UNFETCHED_PROPERTY
&& properties[i].isDirtyCheckable( anyUninitializedProperties )
&& properties[i].getType().isDirty( previousState[i], currentState[i], includeColumns[i], session );
if ( dirty ) {
if ( results == null ) {
results = new int[span];
}
results[count++] = i;
for ( int i = 0; i < span; i++ ) {
final boolean modified = currentState[i]!=LazyPropertyInitializer.UNFETCHED_PROPERTY
&& properties[i].isDirtyCheckable(anyUninitializedProperties)
&& properties[i].getType().isModified( previousState[i], currentState[i], includeColumns[i], session );
if ( modified ) {
if ( results == null ) {
results = new int[span];
}
results[count++] = i;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/TypeFactory.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/TypeFactory.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for ( int i = 0; i < span; i++ ) {↵ | | 1 | for ( int i = 0; i < span; i++ ) {↵
|
2 | final boolean dirty = currentState[i] != LazyPropertyInitializer.UNFETCHED_PROPERTY↵ | | 2 | final boolean modified = currentState[i]!=LazyPropertyInitializer.UNFETCHED_PROPERTY↵
|
3 | && properties[i].isDirtyCheckable( anyUninitializedProperties )↵ | | 3 | && properties[i].isDirtyCheckable(anyUninitializedProperties)↵
|
4 | && properties[i].getType().isDirty( previousState[i], currentState[i], includeColumns[i], session );↵ | | 4 | && properties[i].getType().isModified( previousState[i], currentState[i], includeColumns[i], session );↵
|
|
5 | if ( dirty ) {↵ | | 5 | if ( modified ) {↵
|
6 | if ( results == null ) {↵ | | 6 | if ( results == null ) {↵
|
7 | results = new int[span];↵ | | 7 | results = new int[span];↵
|
8 | }↵ | | 8 | }↵
|
9 | results[count++] = i;↵ | | 9 | results[count++] = i;↵
|
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 |