try {
Set children = cache.getChildrenNames( regionFqn );
return children == null ? 0 : children.size();
}
catch (Exception e) {
throw new CacheException(e);
}
try {
Set children = cache.getChildrenNames( regionFqn );
return children == null ? 0 : children.size();
}
catch (Exception e) {
throw new CacheException(e);
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache/src/main/java/org/hibernate/cache/TreeCache.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache/src/main/java/org/hibernate/cache/OptimisticTreeCache.java
|
Method name: long getElementCountInMemory()
|
|
Method name: long getElementCountInMemory()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | try {↵ | | 1 | try {↵
|
2 | Set children = cache.getChildrenNames( regionFqn );↵ | | 2 | Set children = cache.getChildrenNames( regionFqn );↵
|
3 | return children == null ? 0 : children.size();↵ | | 3 | return children == null ? 0 : children.size();↵
|
4 | }↵ | | 4 | }↵
|
5 | catch (Exception e) {↵ | | 5 | catch (Exception e) {↵
|
6 | throw new CacheException(e);↵ | | 6 | throw new CacheException(e);↵
|
7 | } | | 7 | }
|
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 |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
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.8 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | try | | 1 | try |
2 | Set children = cache.getChildrenNames(regionFqn); | | 2 | Set children = cache.getChildrenNames(regionFqn); |
3 | return children == null ? 0 : children.size(); | | 3 | return children == null ? 0 : children.size(); |
Precondition Violations (0)
Row |
Violation |