for (int i = 0; i < count; i++) {
Task t = (Task) this.tasks.get(i);
if (t.getDescription().equals(description)) {
result = t;
break;
for (int i = 0; i < count; i++) {
TaskSeries s = (TaskSeries) this.data.get(i);
if (s.getKey().equals(rowKey)) {
result = i;
break;
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/gantt/TaskSeries.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/gantt/TaskSeriesCollection.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int i = 0; i < count; i++) {↵ | | 1 | for (int i = 0; i < count; i++) {↵
|
2 | Task t = (Task) this.tasks.get(i);↵ | | 2 | TaskSeries s = (TaskSeries) this.data.get(i);↵
|
3 | if (t.getDescription().equals(description)) {↵ | | 3 | if (s.getKey().equals(rowKey)) {↵
|
4 | result = t;↵ | | 4 | result = i;↵
|
5 | break;↵ | | 5 | break;↵
|
6 | | | 6 |
|
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 |