Iterator iter = childrenNames.iterator();
while ( iter.hasNext() ) {
Object key = iter.next();
result.put(
key,
cache.get( new Fqn( regionFqn, key ), ITEM )
);
}
Iterator subIter = table.getForeignKeyIterator();
while ( subIter.hasNext() ) {
ForeignKey fk = (ForeignKey) subIter.next();
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/core/src/main/java/org/hibernate/cfg/Configuration.java
|
Method name: Map toMap()
|
|
Method name: String[] generateDropSchemaScript(Dialect)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 2
|
|
1 | Iterator iter = childrenNames.iterator();↵ | | 1 | Iterator subIter = table.getForeignKeyIterator();↵
|
2 | while ( iter.hasNext() ) {↵ | | 2 | while ( subIter.hasNext() ) {↵
|
3 | Object key = iter.next();↵ | | 3 | ↵
|
4 | result.put( ↵ | | |
|
5 | key, ↵ | | |
|
6 | cache.get( new Fqn( regionFqn, key ), ITEM )↵ | | |
|
7 | );↵ | | |
|
8 | } | | 4 | ForeignKey fk = (ForeignKey) subIter.next();
|
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 in different classes |
Number of node comparisons | 3 |