return new Color(Math.max((int) (c.getRed() * FACTOR), 0), Math.max(
(int) (c.getGreen() * FACTOR), 0), Math.max(
(int) (c.getBlue() * FACTOR), 0));
return new Color(Math.max((int) (c.getRed() * FACTOR), 0), Math.max(
(int) (c.getGreen() * FACTOR), 0), Math.max(
(int) (c.getBlue() * FACTOR), 0));
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/ui/comp/CalendarPicker.java
|
|
File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/docking/DockingPanel.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | return new Color(Math.max((int) (c.getRed() * FACTOR), 0), Math.max(↵ | | 1 | return new Color(Math.max((int) (c.getRed() * FACTOR), 0), Math.max(↵
|
2 | (int) (c.getGreen() * FACTOR), 0), Math.max(↵ | | 2 | (int) (c.getGreen() * FACTOR), 0), Math.max(↵
|
3 | (int) (c.getBlue() * FACTOR), 0));↵ | | 3 | (int) (c.getBlue() * FACTOR), 0));↵
|
4 | | | 4 |
|
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 |