for(int i = 0; i < width / 4 - 1; i++)
{
g.setColor(color1);
g.drawLine(x + i * 4 + 2,y + 3,
x + i * 4 + 2,y + 3);
g.setColor(color2);
g.drawLine(x + i * 4 + 3,y + 4,
x + i * 4 + 3,y + 4);
g.setColor(color1);
g.drawLine(x + i * 4 + 4,y + 5,
x + i * 4 + 4,y + 5);
g.setColor(color2);
g.drawLine(x + i * 4 + 5,y + 6,
x + i * 4 + 5,y + 6);
}
for(int i = 0; i < height / 4 - 1; i++)
{
g.setColor(color1);
g.drawLine(x + 3,y + i * 4 + 2,
x + 3,y + i * 4 + 2);
g.setColor(color2);
g.drawLine(x + 4,y + i * 4 + 3,
x + 4,y + i * 4 + 3);
g.setColor(color1);
g.drawLine(x + 5,y + i * 4 + 4,
x + 5,y + i * 4 + 4);
g.setColor(color2);
g.drawLine(x + 6,y + i * 4 + 5,
x + 6,y + i * 4 + 5);
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/PanelWindowContainer.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/PanelWindowContainer.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for(int i = 0; i < width / 4 - 1; i++)↵ | | 1 | for(int i = 0; i < height / 4 - 1; i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | g.setColor(color1);↵ | | 3 | g.setColor(color1);↵
|
4 | g.drawLine(x + i * 4 + 2,y + 3,↵ | | 4 | g.drawLine(x + 3,y + i * 4 + 2,↵
|
5 | x + i * 4 + 2,y + 3);↵ | | 5 | x + 3,y + i * 4 + 2);↵
|
6 | g.setColor(color2);↵ | | 6 | g.setColor(color2);↵
|
7 | g.drawLine(x + i * 4 + 3,y + 4,↵ | | 7 | g.drawLine(x + 4,y + i * 4 + 3,↵
|
8 | x + i * 4 + 3,y + 4);↵ | | 8 | x + 4,y + i * 4 + 3);↵
|
9 | g.setColor(color1);↵ | | 9 | g.setColor(color1);↵
|
10 | g.drawLine(x + i * 4 + 4,y + 5,↵ | | 10 | g.drawLine(x + 5,y + i * 4 + 4,↵
|
11 | x + i * 4 + 4,y + 5);↵ | | 11 | x + 5,y + i * 4 + 4);↵
|
12 | g.setColor(color2);↵ | | 12 | g.setColor(color2);↵
|
13 | g.drawLine(x + i * 4 + 5,y + 6,↵ | | 13 | g.drawLine(x + 6,y + i * 4 + 5,↵
|
14 | x + i * 4 + 5,y + 6);↵ | | 14 | x + 6,y + i * 4 + 5);↵
|
15 | } | | 15 | }
|
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 |