for (int i = 0; i < macroHandlers.size(); i++)
{
Handler handler = (Handler)macroHandlers.get(i);
if (handler.accept(pathName))
return handler;
}
return null;
for(int i = 0; i < modes.size(); i++)
{
Mode mode = (Mode)modes.elementAt(i);
if(mode.getName().equals(name))
return mode;
}
return null;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Macros.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/jEdit.java
|
Method name: Handler getHandlerForPathName(String)
|
|
Method name: Mode getMode(String)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | for (int i = 0; i < macroHandlers.size(); i++)↵ | | 1 | for(int i = 0; i < modes.size(); i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | Handler handler = (Handler)macroHandlers.get(i);↵ | | 3 | ↵
|
4 | if (handler.accept(pathN↵ | | 4 | Mode mode = (Mode)modes.elementAt(i);↵
|
5 | ame))↵ | | 5 | if(mode.getName().equals(name))↵
|
6 | return handler;↵ | | 6 | return mode;↵
|
7 | }↵ | | 7 | }↵
|
|
8 | return null; | | 8 | return null;
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |