while (iterator.hasNext()) {
Comparable key = (Comparable) iterator.next();
Paint p1 = getPaint(key);
Paint p2 = that.getPaint(key);
if (!PaintUtilities.equal(p1, p2)) {
return false;
}
}
while (iterator.hasNext()) {
Comparable key = (Comparable) iterator.next();
Stroke s1 = getStroke(key);
Stroke s2 = that.getStroke(key);
if (!ObjectUtilities.equal(s1, s2)) {
return false;
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/PaintMap.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/StrokeMap.java
|
Method name: boolean equals(Object)
|
|
Method name: boolean equals(Object)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | while (iterator.hasNext()) {↵ | | 1 | while (iterator.hasNext()) {↵
|
2 | Comparable key = (Comparable) iterator.next();↵ | | 2 | Comparable key = (Comparable) iterator.next();↵
|
3 | Paint p1 = getPaint(key);↵ | | 3 | Stroke s1 = getStroke(key);↵
|
4 | Paint p2 = that.getPaint(key);↵ | | 4 | Stroke s2 = that.getStroke(key);↵
|
5 | if (!PaintUtilities.equal(p1, p2)) {↵ | | 5 | if (!ObjectUtilities.equal(s1, s2)) {↵
|
6 | return false;↵ | | 6 | return false;↵
|
7 | }↵ | | 7 | }↵
|
8 | } | | 8 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |