Font labelFont = marker.getLabelFont();
g2.setFont(labelFont);
g2.setPaint(marker.getLabelPaint());
Point2D coordinates = calculateDomainMarkerTextAnchorPoint(
g2, orientation, dataArea, bounds, marker.getLabelOffset(),
marker.getLabelOffsetType(), anchor);
TextUtilities.drawAlignedString(label, g2,
(float) coordinates.getX(), (float) coordinates.getY(),
marker.getLabelTextAnchor());
Font labelFont = marker.getLabelFont();
g2.setFont(labelFont);
g2.setPaint(marker.getLabelPaint());
Point2D coordinates = calculateRangeMarkerTextAnchorPoint(
g2, orientation, dataArea, rect,
marker.getLabelOffset(), marker.getLabelOffsetType(),
anchor);
TextUtilities.drawAlignedString(label, g2,
(float) coordinates.getX(), (float) coordinates.getY(),
marker.getLabelTextAnchor());
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/AbstractCategoryItemRenderer.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/AbstractXYItemRenderer.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | Font labelFont = marker.getLabelFont();↵ | | 1 | Font labelFont = marker.getLabelFont();↵
|
2 | g2.setFont(labelFont);↵ | | 2 | g2.setFont(labelFont);↵
|
3 | g2.setPaint(marker.getLabelPaint());↵ | | 3 | g2.setPaint(marker.getLabelPaint());↵
|
4 | Point2D coordinates = calculateDomainMarkerTextAnchorPoint(↵ | | 4 | Point2D coordinates = calculateRangeMarkerTextAnchorPoint(↵
|
5 | g2, orientation, dataArea, bounds,↵ | | 5 | g2, orientation, dataArea, rect,↵
|
6 | marker.getLabelOffset(),↵ | | 6 | marker.getLabelOffset(),↵
|
7 | marker.getLabelOffsetType(),↵ | | 7 | marker.getLabelOffsetType(),↵
|
8 | anchor);↵ | | 8 | anchor);↵
|
9 | TextUtilities.drawAlignedString(label, g2,↵ | | 9 | TextUtilities.drawAlignedString(label, g2,↵
|
10 | (float) coordinates.getX(), (float) coordinates.getY(),↵ | | 10 | (float) coordinates.getX(), (float) coordinates.getY(),↵
|
11 | marker.getLabelTextAnchor());↵ | | 11 | marker.getLabelTextAnchor());↵
|
12 | | | 12 |
|
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 |