Object[] record = (Object[]) itemLabelList.get(i);
int series = ((Integer) record[0]).intValue();
Rectangle2D bar = (Rectangle2D) record[1];
boolean neg = ((Boolean) record[2]).booleanValue();
CategoryItemLabelGenerator generator
= getItemLabelGenerator(series, column);
if (generator != null && isItemLabelVisible(series, column)) {
drawItemLabel(g2, dataset, series, column, plot, generator,
bar, neg);
}
Object[] record = (Object[]) itemLabelList.get(i);
int series = ((Integer) record[0]).intValue();
Rectangle2D bar = (Rectangle2D) record[1];
boolean neg = ((Boolean) record[2]).booleanValue();
CategoryItemLabelGenerator generator
= getItemLabelGenerator(series, column);
if (generator != null && isItemLabelVisible(series, column)) {
drawItemLabel(g2, dataset, series, column, plot, generator,
bar, neg);
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/StackedBarRenderer3D.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/StackedBarRenderer3D.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | Object[] record = (Object[]) itemLabelList.get(i);↵ | | 1 | Object[] record = (Object[]) itemLabelList.get(i);↵
|
2 | int series = ((Integer) record[0]).intValue();↵ | | 2 | int series = ((Integer) record[0]).intValue();↵
|
3 | Rectangle2D bar = (Rectangle2D) record[1];↵ | | 3 | Rectangle2D bar = (Rectangle2D) record[1];↵
|
4 | boolean neg = ((Boolean) record[2]).booleanValue();↵ | | 4 | boolean neg = ((Boolean) record[2]).booleanValue();↵
|
5 | CategoryItemLabelGenerator generator↵ | | 5 | CategoryItemLabelGenerator generator↵
|
6 | = getItemLabelGenerator(series, column);↵ | | 6 | = getItemLabelGenerator(series, column);↵
|
7 | if (generator != null && isItemLabelVisible(series, column)) {↵ | | 7 | if (generator != null && isItemLabelVisible(series, column)) {↵
|
8 | drawItemLabel(g2, dataset, series, column, plot, generator,↵ | | 8 | drawItemLabel(g2, dataset, series, column, plot, generator,↵
|
9 | bar, neg);↵ | | 9 | bar, neg);↵
|
10 | } | | 10 | }
|
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 |