1220-2-3

public void testRowCount() { DefaultKeyedValues2D d = new DefaultKeyedValues2D(); assertEquals(0, d.getRowCount()); d.addValue(new Double(1.0), "R1", "C1"); assertEquals(1, d.getRowCount()); d.addValue(new Double(2.0), "R2", "C1"); assertEquals(2, d.getRowCount());
public void testColumnCount() { DefaultKeyedValues2D d = new DefaultKeyedValues2D(); assertEquals(0, d.getColumnCount()); d.addValue(new Double(1.0), "R1", "C1"); assertEquals(1, d.getColumnCount()); d.addValue(new Double(2.0), "R1", "C2"); assertEquals(2, d.getColumnCount());

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

1

    public void testRowCount() {↵

1

    public void testColumnCount() {↵

2

            DefaultKeyedValues2D d = new DefaultKeyedValues2D();↵

2

            DefaultKeyedValues2D d = new DefaultKeyedValues2D();↵

3

            assertEquals(0, d.getRowCount());↵

3

            assertEquals(0, d.getColumnCount());↵

4

            d.addValue(new Double(1.0), "R1", "C1");↵

4

            d.addValue(new Double(1.0), "R1", "C1");↵

5

            assertEquals(1, d.getRowCount());↵

5

            assertEquals(1, d.getColumnCount());↵

6

            d.addValue(new Double(2.0), "R2", "C1");↵

6

            d.addValue(new Double(2.0), "R1", "C2");↵

7

            assertEquals(2, d.getRowCount());↵

7

            assertEquals(2, d.getColumnCount());↵

8

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