boolean[] result = new boolean[ getColumnSpan(mapping) ];
if (value!=null) Arrays.fill(result, true);
return result;
boolean[] result = new boolean[ getColumnSpan(mapping) ];
if (value!=null) Arrays.fill(result, true);
return result;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/CustomType.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/AnyType.java
|
Method name: boolean[] toColumnNullness(Object, Mapping)
|
|
Method name: boolean[] toColumnNullness(Object, Mapping)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | boolean[] result = new boolean[ getColumnSpan(mapping) ];↵ | | 1 | boolean[] result = new boolean[ getColumnSpan(mapping) ];↵
|
2 | if (value!=null) Arrays.fill(result, true);↵ | | 2 | if (value!=null) Arrays.fill(result, true);↵
|
3 | return result; | | 3 | return result;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 8 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.7 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | boolean[] result = new boolean[getColumnSpan(mapping)]; | | 1 | boolean[] result = new boolean[getColumnSpan(mapping)]; |
2 | if (value != null) | | 2 | if (value != null) |
3 | Arrays.fill(result, true); | | 3 | Arrays.fill(result, true); |
4 | return result; | | 4 | return result; |
Precondition Violations (0)
Row |
Violation |