final int size = this.keys.size(); final DefaultKeyedValue[] data = new DefaultKeyedValue[size]; for (int i = 0; i < size; i++) { data[i] = new DefaultKeyedValue((Comparable) this.keys.get(i), (Number) this.values.get(i)); } Comparator comparator = new KeyedValueComparator( KeyedValueComparatorType.BY_KEY, order); Arrays.sort(data, comparator); clear(); for (int i = 0; i < data.length; i++) { final DefaultKeyedValue value = data[i]; addValue(value.getKey(), value.getValue()); }
final int size = this.keys.size(); final DefaultKeyedValue[] data = new DefaultKeyedValue[size]; for (int i = 0; i < size; i++) { data[i] = new DefaultKeyedValue((Comparable) this.keys.get(i), (Number) this.values.get(i)); } Comparator comparator = new KeyedValueComparator( KeyedValueComparatorType.BY_VALUE, order); Arrays.sort(data, comparator); clear(); for (int i = 0; i < data.length; i++) { final DefaultKeyedValue value = data[i]; addValue(value.getKey(), value.getValue()); }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/DefaultKeyedValues.java File path: /jfreechart-1.0.10/src/org/jfree/data/DefaultKeyedValues.java
Method name: void sortByKeys(SortOrder) Method name: void sortByValues(SortOrder)
Number of AST nodes: 10 Number of AST nodes: 10
1
final int size = this.keys.size();
1
final int size = this.keys.size();
2
        final DefaultKeyedValue[] data = new DefaultKeyedValue[size];
2
        final DefaultKeyedValue[] data = new DefaultKeyedValue[size];
3
        for (int i = 0; i < size; i++) {
3
        for (int i = 0; i < size; i++) {
4
            data[i] = new DefaultKeyedValue((Comparable) this.keys.get(i), 
4
            data[i] = new DefaultKeyedValue((Comparable) this.keys.get(i), 
5
                    (Number) this.values.get(i));
5
                    (Number) this.values.get(i));
6
        }
6
        }
7
        Comparator comparator = new KeyedValueComparator(
7
        Comparator comparator = new KeyedValueComparator(
8
                KeyedValueComparatorType.BY_KEY, order);
8
                KeyedValueComparatorType.BY_VALUE, order);
9
        Arrays.sort(data, comparator);
9
        Arrays.sort(data, comparator);
10
        clear();
10
        clear();
11
        for (int i = 0; i < data.length; i++) {
11
        for (int i = 0; i < data.length; i++) {
12
            final DefaultKeyedValue value = data[i];
12
            final DefaultKeyedValue value = data[i];
13
            addValue(value.getKey(), value.getValue());
13
            addValue(value.getKey(), value.getValue());
14
        }
14
        }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.4
Clones locationClones are declared in the same class
Number of node comparisons37
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements10
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)4.6
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    final int size = this.keys.size();
    1
    final int size = this.keys.size();
    2
    final DefaultKeyedValue[] data = new DefaultKeyedValue[size];
    2
    final DefaultKeyedValue[] data = new DefaultKeyedValue[size];
    3
    for (int i = 0; i < size; i++)
    3
    for (int i = 0; i < size; i++)
    4
    data[i] = new DefaultKeyedValue((Comparable)this.keys.get(i), (Number)this.values.get(i));
    4
    data[i] = new DefaultKeyedValue((Comparable)this.keys.get(i), (Number)this.values.get(i));
    5
    Comparator comparator = new KeyedValueComparator(KeyedValueComparatorType.BY_KEY, order);
    5
    Comparator comparator = new KeyedValueComparator(KeyedValueComparatorType.BY_KEY, order);
    5
    Comparator comparator = new KeyedValueComparator(KeyedValueComparatorType.BY_VALUE, order);
    Differences
    Expression1Expression2Difference
    BY_KEYBY_VALUEVARIABLE_NAME_MISMATCH
    5
    Comparator comparator = new KeyedValueComparator(KeyedValueComparatorType.BY_VALUE, order);
    6
    Arrays.sort(data, comparator);
    6
    Arrays.sort(data, comparator);
    7
    clear();
    7
    clear();
    8
    for (int i = 0; i < data.length; i++)
    8
    for (int i = 0; i < data.length; i++)
    9
    final DefaultKeyedValue value = data[i];
    9
    final DefaultKeyedValue value = data[i];
    10
    addValue(value.getKey(), value.getValue());
    10
    addValue(value.getKey(), value.getValue());
    Precondition Violations (0)
    Row Violation