Entry entry = (Entry)iter.next();
if(entry.factory.plugin == plugin)
{
returnValue.add(entry);
iter.remove();
}
Entry entry = (Entry)iter.next();
if(entry.factory.plugin == plugin)
{
returnValue.add(entry);
if(remove)
iter.remove();
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/DockableWindowManager.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/DockableWindowManager.java
|
Method name: Iterator getAllPluginEntries(PluginJAR, boolean)
|
|
Method name: Iterator getAllPluginEntries(PluginJAR, boolean)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 5
|
|
1 | Entry entry = (Entry)iter.next();↵ | | 1 | Entry entry = (Entry)iter.next();↵
|
2 | if(entry.factory.plugin == plugin)↵ | | 2 | if(entry.factory.plugin == plugin)↵
|
3 | {↵ | | 3 | {↵
|
4 | returnValue.add(entry);↵ | | 4 | returnValue.add(entry);↵
|
5 | ↵ | | 5 | if(remove)↵
|
6 | iter.remove();↵ | | 6 | iter.remove();↵
|
7 | } | | 7 | }
|
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.1 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |