1698-2-3

public void testPowerRegression1a() { double[][] data = createSampleData1(); double[] result = Regression.getPowerRegression(data); assertEquals(0.91045813, result[0], 0.0000001); assertEquals(0.88918346, result[1], 0.0000001);
public void testOLSRegression2a() { double[][] data = createSampleData2(); double[] result = Regression.getOLSRegression(data); assertEquals(53.9729697, result[0], 0.0000001); assertEquals(-4.1823030, result[1], 0.0000001);

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

1

    public void testPowerRegression1a() {↵

1

    public void testOLSRegression2a() {↵

2

            double[][] data = createSampleData1();↵

2

            double[][] data = createSampleData2();↵

3

            double[] result = Regression.getPowerRegression(data);↵

3

            double[] result = Regression.getOLSRegression(data);↵

4

            assertEquals(0.91045813, result[0], 0.0000001);↵

4

            assertEquals(53.9729697, result[0], 0.0000001);↵

5

            assertEquals(0.88918346, result[1], 0.0000001);

5

            assertEquals(-4.1823030, result[1], 0.0000001);

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