450-15-37

MiddlePinNeedle n1 = new MiddlePinNeedle(); MiddlePinNeedle 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 = (MiddlePinNeedle) in.readObject(); in.close(); } catch (Exception e) { e.printStackTrace(); } assertTrue(n1.equals(n2));
WindItemRenderer r1 = new WindItemRenderer(); WindItemRenderer r2 = null; try { ByteArrayOutputStream buffer = new ByteArrayOutputStream(); ObjectOutput out = new ObjectOutputStream(buffer); out.writeObject(r1); out.close(); ObjectInput in = new ObjectInputStream( new ByteArrayInputStream(buffer.toByteArray()) ); r2 = (WindItemRenderer) in.readObject(); in.close(); } catch (Exception e) { System.out.println(e.toString()); } assertEquals(r1, r2);

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

1

    MiddlePinNeedle n1 = new MiddlePinNeedle();↵

2

            MiddlePinNeedle n↵

1

    WindItemRenderer r1 = new WindItemRenderer();↵

3

    2 = null;↵

2

            WindItemRenderer r2 = null;↵

4

            try {↵

3

            try {↵

5

                ByteArrayOutputStream buffer = new ByteArrayOutputStream();↵

4

                ByteArrayOutputStream buffer = new ByteArrayOutputStream();↵

6

                ObjectOutput out = new ObjectOutputStream(buffer);↵

5

                ObjectOutput out = new ObjectOutputStream(buffer);↵

7

                out.writeObject(n1);↵

6

                out.writeObject(r1);↵

8

                out.close();↵

7

                out.close();↵

9

                ObjectInput in = new ObjectInputStream(↵

8

                ObjectInput in = new ObjectInputStream(↵

10

                    new ByteArrayInputStream(buffer.toByteArray())↵

9

                    new ByteArrayInputStream(buffer.toByteArray())↵

11

                );↵

10

                );↵

12

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

11

                r2 = (WindItemRenderer) in.readObject();↵

13

                in.close();↵

12

                in.close();↵

14

            }↵

13

            }↵

15

            catch (Exception e) {↵

14

            catch (Exception e) {↵

16

                e.printStackTrace();↵

15

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

17

            }↵

16

            }↵

18

            assertTrue(n1.equals(n2));

17

            assertEquals(r1, r2);

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