for(int i = 0; i < editPanes.length; i++)
{
if(editPane == editPanes[i])
{
if(i == editPanes.length - 1)
editPanes[0].focusOnTextArea();
else
editPanes[i+1].focusOnTextArea();
break;
for(int i = 0; i < editPanes.length; i++)
{
if(editPane == editPanes[i])
{
if(i == 0)
editPanes[editPanes.length - 1].focusOnTextArea();
else
editPanes[i-1].focusOnTextArea();
break;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/View.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/View.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for(int i = 0; i < editPanes.length; i++)↵ | | 1 | for(int i = 0; i < editPanes.length; i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | if(editPane == editPanes[i])↵ | | 3 | if(editPane == editPanes[i])↵
|
4 | {↵ | | 4 | {↵
|
5 | if(i == ↵ | | 5 | if(i == 0)↵
|
6 | editPanes.length - 1)↵ | | 6 | editPanes[editPanes.length - 1↵
|
7 | editPanes[0].focusOnTextArea();↵ | | 7 | ].focusOnTextArea();↵
|
8 | else↵ | | 8 | else↵
|
9 | editPanes[i+1].focusOnTextArea();↵ | | 9 | editPanes[i-1].focusOnTextArea();↵
|
10 | break;↵ | | 10 | break;↵
|
11 | | | 11 |
|
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 | |
Number of node comparisons | 0 |