File path: /emf-2.4.1/src/org/eclipse/emf/common/ui/ViewerPane.java | File path: /emf-2.4.1/src/org/eclipse/emf/edit/ui/celleditor/AdapterFactoryTableTreeEditor.java | |||
Method name: Image createGradient(boolean)
|
Method name: void getGradients()
|
|||
Number of AST nodes: 9 | Number of AST nodes: 9 | |||
1 | int r = rgb1.red + k * (rgb2.red - rgb1.red) / width;↵ | 1 | int r = rgb1.red + k * (rgb2.red - rgb1.red) / width;↵ | |
2 | r = (rgb2.red > rgb1.red) ? Math.min(r, rgb2.red) : Math.max(r, rgb2.red);↵ | 2 | r = (rgb2.red > rgb1.red) ? Math.min(r, rgb2.red) : Math.max(r, rgb2.red);↵ | |
3 | int g = rgb1.green + k * (rgb2.green - rgb1.green) / width;↵ | 3 | int g = rgb1.green + k * (rgb2.green - rgb1.green) / width;↵ | |
4 | g = (rgb2.green > rgb1.green) ? Math.min(g, rgb2.green) : Math.max(g, rgb2.green);↵ | 4 | g = (rgb2.green > rgb1.green) ? Math.min(g, rgb2.green) : Math.max(g, rgb2.green);↵ | |
5 | int b = rgb1.blue + k * (rgb2.blue - rgb1.blue) / width;↵ | 5 | int b = rgb1.blue + k * (rgb2.blue - rgb1.blue) / width;↵ | |
6 | b = (rgb2.blue > rgb1.blue) ? Math.min(b, rgb2.blue) : Math.max(b, rgb2.blue);↵ | 6 | b = (rgb2.blue > rgb1.blue) ? Math.min(b, rgb2.blue) : Math.max(b, rgb2.blue);↵ | |
7 | Color color = new Color(display, r, g, b);↵ | 7 | Color color = new Color(display, r, g, b);↵ | |
8 | gc.setBackground(color);↵ | 8 | leftGC.setBackground(color);↵ | |
9 | gc.fillRectangle(width - k - 1, 0, 1, height); | 9 | leftGC.fillRectangle(width - k - 1, 0, 1, height); | |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
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 | 66 |
Number of mapped statements | 9 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
11 | int r = rgb1.red + k * (rgb2.red - rgb1.red) / width; | 13 | int r = rgb1.red + k * (rgb2.red - rgb1.red) / width; | |||||||||||
12 | r = (rgb2.red > rgb1.red) ? Math.min(r, rgb2.red) : Math.max(r, rgb2.red); | 14 | r = (rgb2.red > rgb1.red) ? Math.min(r, rgb2.red) : Math.max(r, rgb2.red); | |||||||||||
13 | int g = rgb1.green + k * (rgb2.green - rgb1.green) / width; | 15 | int g = rgb1.green + k * (rgb2.green - rgb1.green) / width; | |||||||||||
14 | g = (rgb2.green > rgb1.green) ? Math.min(g, rgb2.green) : Math.max(g, rgb2.green); | 16 | g = (rgb2.green > rgb1.green) ? Math.min(g, rgb2.green) : Math.max(g, rgb2.green); | |||||||||||
15 | int b = rgb1.blue + k * (rgb2.blue - rgb1.blue) / width; | 17 | int b = rgb1.blue + k * (rgb2.blue - rgb1.blue) / width; | |||||||||||
16 | b = (rgb2.blue > rgb1.blue) ? Math.min(b, rgb2.blue) : Math.max(b, rgb2.blue); | 18 | b = (rgb2.blue > rgb1.blue) ? Math.min(b, rgb2.blue) : Math.max(b, rgb2.blue); | |||||||||||
17 | Color color = new Color(display, r, g, b); | 19 | Color color = new Color(display, r, g, b); | |||||||||||
18 | gc.setBackground(color); |
| 20 | leftGC.setBackground(color); | ||||||||||
19 | gc.fillRectangle(width - k - 1, 0, 1, height); |
| 21 | leftGC.fillRectangle(width - k - 1, 0, 1, height); |
Row | Violation |
---|