112-92-130

ContourPlot p1 = new ContourPlot(null, null, null, null); ContourPlot p2 = null; try { ByteArrayOutputStream buffer = new ByteArrayOutputStream(); ObjectOutput out = new ObjectOutputStream(buffer); out.writeObject(p1); out.close(); ObjectInput in = new ObjectInputStream( new ByteArrayInputStream(buffer.toByteArray()) ); p2 = (ContourPlot) in.readObject(); in.close(); } catch (Exception e) { System.out.println(e.toString()); } assertEquals(p1, p2);
LongNeedle n1 = new LongNeedle(); LongNeedle n2 = null; try { ByteArrayOutputStream buffer = new ByteArrayOutputStream(); ObjectOutput out = new ObjectOutputStream(buffer); out.writeObject(n1); out.close(); ObjectInput in = new ObjectInputStream( new ByteArrayInputStream(buffer.toByteArray()) ); n2 = (LongNeedle) in.readObject(); in.close(); } catch (Exception e) { e.printStackTrace(); } assertTrue(n1.equals(n2));

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/chart/plot/junit/ContourPlotTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/chart/needle/junit/LongNeedleTests.java
Method name: `void testSerialization()` |  | Method name: `void testSerialization()`
Number of AST nodes: 11 |  | Number of AST nodes: 11

1

    ContourPlot p1 = new ContourPlot(null, null, null, null);↵

1

    LongNeedle n1 = new LongNeedle();↵

2

            ContourPlot p2 = null;↵

2

            LongNeedle n2 = null;↵

3

            try {↵

3

            try {↵

4

                ByteArrayOutputStream buffer = new ByteArrayOutputStream();↵

4

                ByteArrayOutputStream buffer = new ByteArrayOutputStream();↵

5

                ObjectOutput out = new ObjectOutputStream(buffer);↵

5

                ObjectOutput out = new ObjectOutputStream(buffer);↵

6

                out.writeObject(p1);↵

6

                out.writeObject(n1);↵

7

                out.close();↵

7

                out.close();↵

8

                ObjectInput in = new ObjectInputStream(↵

8

                ObjectInput in = new ObjectInputStream(↵

9

                    new ByteArrayInputStream(buffer.toByteArray())↵

9

                    new ByteArrayInputStream(buffer.toByteArray())↵

10

                );↵

10

                );↵

11

                p2 = (ContourPlot) in.readObject();↵

11

                n2 = (LongNeedle) in.readObject();↵

12

                in.close();↵

12

                in.close();↵

13

            }↵

13

            }↵

14

            catch (Exception e) {↵

14

            catch (Exception e) {↵

15

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

15

                e.printStackTrace();↵

16

            }↵

16

            }↵

17

            assertEquals(p1, p2);

17

            assertTrue(n1.equals(n2));

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