if (this.extract == TableOrder.BY_ROW) { result = this.source.getValue(this.index, item); } else if (this.extract == TableOrder.BY_COLUMN) { result = this.source.getValue(item, this.index);
if (this.extract == TableOrder.BY_ROW) { result = this.source.getValue(this.index, keyIndex); } else if (this.extract == TableOrder.BY_COLUMN) { result = this.source.getValue(keyIndex, this.index);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/category/CategoryToPieDataset.java File path: /jfreechart-1.0.10/src/org/jfree/data/category/CategoryToPieDataset.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (this.extract == TableOrder.BY_ROW) {
1
if (this.extract == TableOrder.BY_ROW) {
2
            result = this.source.getValue(this.index, item);
2
                result = this.source.getValue(this.index, keyIndex);
3
        }
3
            }
4
        else if (this.extract == TableOrder.BY_COLUMN) {
4
            else if (this.extract == TableOrder.BY_COLUMN) {
5
            result = this.source.getValue(item, this.index);
5
                result = this.source.getValue(keyIndex, this.index);
6
        
6
            
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.0
Clones location
Number of node comparisons0