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: Task get(String) Method name: int getRowIndex(Comparable)
Number of AST nodes: 5 Number of AST nodes: 5
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
            }
7
        }
7
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.2
Clones locationClones are in different classes
Number of node comparisons1