1387-1-2

public void testFindMinimumRangeValue() { CategoryDataset d1 = createCategoryDataset1(); Number min1 = DatasetUtilities.findMinimumRangeValue(d1); assertEquals(new Double(1.0), min1); XYDataset d2 = createXYDataset1(); Number min2 = DatasetUtilities.findMinimumRangeValue(d2); assertEquals(new Double(100.0), min2);
public void testFindMaximumRangeValue() { CategoryDataset d1 = createCategoryDataset1(); Number max1 = DatasetUtilities.findMaximumRangeValue(d1); assertEquals(new Double(6.0), max1); XYDataset dataset = createXYDataset1(); Number maximum = DatasetUtilities.findMaximumRangeValue(dataset); assertEquals(new Double(105.0), maximum);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/data/general/junit/DatasetUtilitiesTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/data/general/junit/DatasetUtilitiesTests.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void testFindMinimumRangeValue() {↵

1

    public void testFindMaximumRangeValue() {↵

2

            CategoryDataset d1 = createCategoryDataset1();↵

2

            CategoryDataset d1 = createCategoryDataset1();↵

3

            Number min1 = DatasetUtilities.findMinimumRangeValue(d1);↵

3

            Number max1 = DatasetUtilities.findMaximumRangeValue(d1);↵

4

            assertEquals(new Double(1.0), min1);↵

4

            assertEquals(new Double(6.0), max1);↵

5

            ↵

6

            XYDataset d2 = createXYDataset1();↵

5

            XYDataset dataset = createXYDataset1();↵

7

            Number min2 = DatasetUtilities.findMinimumRangeValue(d2);↵

6

            Number maximum = DatasetUtilities.findMaximumRangeValue(dataset);↵

8

            assertEquals(new Double(100.0), min2);        ↵

7

            assertEquals(new Double(105.0), maximum);↵

9

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.0
Clones location |
Number of node comparisons | 0