Iterator iter = childrenNames.iterator();
while ( iter.hasNext() ) {
Object key = iter.next();
result.put(
key,
cache.get( new Fqn( regionFqn, key ), ITEM )
);
}
Iterator iter = childrenNames.iterator();
while ( iter.hasNext() ) {
Object key = iter.next();
result.put(
key,
cache.get( new Fqn( regionFqn, key ), ITEM )
);
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache/src/main/java/org/hibernate/cache/OptimisticTreeCache.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache/src/main/java/org/hibernate/cache/TreeCache.java
|
Method name: Map toMap()
|
|
Method name: Map toMap()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | Iterator iter = childrenNames.iterator();↵ | | 1 | Iterator iter = childrenNames.iterator();↵
|
2 | while ( iter.hasNext() ) {↵ | | 2 | while ( iter.hasNext() ) {↵
|
3 | Object key = iter.next();↵ | | 3 | Object key = iter.next();↵
|
4 | result.put(↵ | | 4 | result.put( ↵
|
5 | key,↵ | | 5 | key, ↵
|
6 | cache.get( new Fqn( regionFqn, key ), ITEM )↵ | | 6 | cache.get( new Fqn( regionFqn, key ), ITEM )↵
|
7 | );↵ | | 7 | );↵
|
8 | } | | 8 | }
|
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 | 11 |
-
{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) | 1.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
5 | Iterator iter = childrenNames.iterator(); | | 5 | Iterator iter = childrenNames.iterator(); |
6 | while (iter.hasNext()) | | 6 | while (iter.hasNext()) |
7 | Object key = iter.next(); | | 7 | Object key = iter.next(); |
8 | result.put(key, cache.get(new Fqn(regionFqn, key), ITEM)); | | 8 | result.put(key, cache.get(new Fqn(regionFqn, key), ITEM)); |
Precondition Violations (0)
Row |
Violation |