region.ensureRegionRootExists();
Option opt = getDataVersionOption(currentVersion, previousVersion);
CacheHelper.put(cache, regionFqn, key, value, opt);
return true;
ASTArray array = createAstArray( factory, 3, parentType, parentText, child1 );
array.add( child2 );
return factory.make( array );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache2/src/main/java/org/hibernate/cache/jbc2/access/OptimisticTransactionalAccessDelegate.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/util/ASTUtil.java
|
Method name: boolean update(Object, Object, Object, Object)
|
|
Method name: AST createBinarySubtree(ASTFactory, int, String, AST, AST)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | region.ensureRegionRootExists();↵ | | |
|
|
2 | Option opt = getDataVersionOption(currentVersion, previousVersion);↵ | | 1 | ASTArray array = createAstArray( factory, 3, parentType, pare↵
|
3 | CacheHelper.put(cache, regionFqn, key, value, opt);↵ | | |
|
4 | return true↵ | | 2 | ntText, child1 );↵
|
| | | 3 | array.add( child2 );↵
|
5 | ; | | 4 | return factory.make( array );
|
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 | 12 |