1332-13-53

public void testHashcode() { BarRenderer r1 = new BarRenderer(); BarRenderer r2 = new BarRenderer(); assertTrue(r1.equals(r2)); int h1 = r1.hashCode(); int h2 = r2.hashCode(); assertEquals(h1, h2);
public void testHashcode() { TextTitle t1 = new TextTitle(); TextTitle t2 = new TextTitle(); assertTrue(t1.equals(t2)); int h1 = t1.hashCode(); int h2 = t2.hashCode(); assertEquals(h1, h2);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/chart/renderer/category/junit/BarRendererTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/chart/title/junit/TextTitleTests.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void testHashcode() {↵

1

    public void testHashcode() {↵

2

            BarRenderer r1 = new BarRenderer();↵

2

            ↵

3

            BarRenderer r2 = new BarRenderer↵

3

    TextTitle t1 = new TextTitle();↵

4

    ();↵

4

            TextTitle t2 = new TextTitle();↵

5

            assertTrue(r1.equals(r2));↵

5

            assertTrue(t1.equals(t2));↵

6

            int h1 = r1.hashCode();↵

6

            int h1 = t1.hashCode();↵

7

            int h2 = r2.hashCode();↵

7

            int h2 = t2.hashCode();↵

8

            assertEquals(h1, h2);↵

8

            assertEquals(h1, h2);↵

9

9

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