for(int i = 0; i < letters.length; i++)
{
Iterator iter = letters[i].iterator();
while(iter.hasNext())
{
menu.add((JMenuItem)iter.next());
}
}
for(int i = 0; i < buffers.length; i++)
{
Buffer buffer = buffers[i];
if(filter.isMatch(buffer.getName()))
returnValue.add(buffer.getPath());
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/menu/PluginsProvider.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/AllBufferSet.java
|
Method name: void update(JMenu)
|
|
Method name: String[] _getFiles(Component)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for(int i = 0; i < letters.length; i++)↵ | | 1 | for(int i = 0; i < buffers.length; i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | Iterator iter = letters[i].iterator();↵ | | 3 | Buffer buffer = buffers[i];↵
|
4 | while(iter.hasNext())↵ | | 4 | ↵
|
5 | {↵ | | |
|
6 | menu.add((JMenuItem)iter.next());↵ | | |
|
7 | }↵ | | |
|
8 | ↵ | | 5 | if(filter.isMatch(buffer.getName()))↵
|
| | | 6 | returnValue.add(buffer.getPath());↵
|
9 | } | | 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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |