142-15-36

DefaultHighLowDataset d1 = new DefaultHighLowDataset("Series 1", new Date[] {new Date(123L)}, new double[] {1.2}, new double[] {3.4}, new double[] {5.6}, new double[] {7.8}, new double[] {99.9}); DefaultHighLowDataset d2 = null; try { ByteArrayOutputStream buffer = new ByteArrayOutputStream(); ObjectOutput out = new ObjectOutputStream(buffer); out.writeObject(d1); out.close(); ObjectInput in = new ObjectInputStream( new ByteArrayInputStream(buffer.toByteArray())); d2 = (DefaultHighLowDataset) in.readObject(); in.close(); } catch (Exception e) { e.printStackTrace(); } assertEquals(d1, d2);
DefaultKeyedValueDataset d1 = new DefaultKeyedValueDataset("Test", new Double(25.3)); DefaultKeyedValueDataset d2 = null; try { ByteArrayOutputStream buffer = new ByteArrayOutputStream(); ObjectOutput out = new ObjectOutputStream(buffer); out.writeObject(d1); out.close(); ObjectInput in = new ObjectInputStream( new ByteArrayInputStream(buffer.toByteArray()) ); d2 = (DefaultKeyedValueDataset) in.readObject(); in.close(); } catch (Exception e) { System.out.println(e.toString()); } assertEquals(d1, d2);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/data/xy/junit/DefaultHighLowDatasetTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/data/general/junit/DefaultKeyedValueDatasetTests.java
Method name: `void testSerialization()` |  | Method name: `void testSerialization()`
Number of AST nodes: 11 |  | Number of AST nodes: 11

1

    DefaultHighLowDataset d1 = new DefaultHighLowDataset("Series 1",↵

1

    Default↵

2

       ↵

2

    KeyedValueDataset d1  ↵

3

                 new Date[] {new Date(123L)}, new double[] {1.2},↵

3

                = new D↵

4

                    new double[] {3.4}, new double[] {5.6}, new double[] {7.8},↵

5

                    new double[] {99.9});↵

4

    efaultKeyedValueDataset("Test", new Double(25.3));↵

6

            DefaultHighLowDataset d2 = null;↵

5

            DefaultKeyedValueDataset d2 = null;↵

7

            try {↵

6

            try {↵

8

                ByteArrayOutputStream buffer = new ByteArrayOutputStream();↵

7

                ByteArrayOutputStream buffer = new ByteArrayOutputStream();↵

9

                ObjectOutput out = new ObjectOutputStream(buffer);↵

8

                ObjectOutput out = new ObjectOutputStream(buffer);↵

10

                out.writeObject(d1);↵

9

                out.writeObject(d1);↵

11

                out.close();↵

10

                out.close();↵

12

                ObjectInput in = new ObjectInputStream(↵

11

                ObjectInput in = new ObjectInputStream(↵

13

                        new ByteArrayInputStream(buffer.toByteArray())↵

12

                    new ByteArrayInputStream(buffer.toByteArray())↵

14

    );↵

13

                );↵

15

                d2 = (DefaultHighLowDataset) in.readObject();↵

14

                d2 = (DefaultKeyedValueDataset) in.readObject();↵

16

                in.close();↵

15

                in.close();↵

17

            }↵

16

            }↵

18

            catch (Exception e) {↵

17

            catch (Exception e) {↵

19

                e.printStackTrace();↵

18

                System.out.println(e.toString());↵

20

            }↵

19

            }↵

21

            assertEquals(d1, d2);

20

            assertEquals(d1, d2);

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.2
Clones location | Clones are in different classes having the same super class
Number of node comparisons | 1