for ( int i=0; i<array.length; i++ ) {
if ( !array[i] ) return false;
}
return true;
for ( int i=0; i<array.length; i++ ) {
if ( array[i] >=0 ) return false;
}
return true;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/ArrayHelper.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/ArrayHelper.java
|
Method name: boolean isAllTrue(boolean[])
|
|
Method name: boolean isAllNegative(int[])
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for ( int i=0; i<array.length; i++ ) {↵ | | 1 | for ( int i=0; i<array.length; i++ ) {↵
|
2 | if ( !array[i] ) return false;↵ | | 2 | if ( array[i] >=0 ) return false;↵
|
3 | }↵ | | 3 | }↵
|
4 | return true; | | 4 | return true;
|
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 | Clones are declared in the same class |
Number of node comparisons | 1 |