333-1-2

if (uclip <= 0.0) { // cases 1, 2, 3 and 4 if (value >= uclip) { return; // bar is not visible } base = uclip; if (value <= lclip) { value = lclip; } } else if (lclip <= 0.0) { // cases 5, 6, 7 and 8 if (value >= uclip) { value = uclip; } else { if (value <= lclip) { value = lclip; } } } else { // cases 9, 10, 11 and 12 if (value <= lclip) { return; // bar is not visible } base = lclip; if (value >= uclip) { value = uclip;
if (uclip <= 0.0) { // cases 1, 2, 3 and 4 if (value >= uclip) { return; // bar is not visible } base = uclip; if (value <= lclip) { value = lclip; } } else if (lclip <= 0.0) { // cases 5, 6, 7 and 8 if (value >= uclip) { value = uclip; } else { if (value <= lclip) { value = lclip; } } } else { // cases 9, 10, 11 and 12 if (value <= lclip) { return; // bar is not visible } base = getLowerClip(); if (value >= uclip) { value = uclip;

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

1

    if (uclip <= 0.0) {  // cases 1, 2, 3 and 4↵

1

    if (uclip <= 0.0) {  // cases 1, 2, 3 and 4↵

2

                if (value >= uclip) {↵

2

                if (value >= uclip) {↵

3

                    return; // bar is not visible↵

3

                    return; // bar is not visible↵

4

                }↵

4

                }↵

5

                base = uclip;↵

5

                base = uclip;↵

6

                if (value <= lclip) {↵

6

                if (value <= lclip) {↵

7

                    value = lclip;↵

7

                    value = lclip;↵

8

                }↵

8

                }↵

9

            }↵

9

            }↵

10

            else if (lclip <= 0.0) { // cases 5, 6, 7 and 8↵

10

            else if (lclip <= 0.0) { // cases 5, 6, 7 and 8↵

11

                if (value >= uclip) {↵

11

                if (value >= uclip) {↵

12

                    value = uclip;↵

12

                    value = uclip;↵

13

                }↵

13

                }↵

14

                else {↵

14

                else {↵

15

                    if (value <= lclip) {↵

15

                    if (value <= lclip) {↵

16

                        value = lclip;↵

16

                        value = lclip;↵

17

                    }↵

17

                    }↵

18

                }↵

18

                }↵

19

            }↵

19

            }↵

20

            else { // cases 9, 10, 11 and 12↵

20

            else { // cases 9, 10, 11 and 12↵

21

                if (value <= lclip) {↵

21

                if (value <= lclip) {↵

22

                    return; // bar is not visible↵

22

                    return; // bar is not visible↵

23

                }↵

23

                }↵

24

                base = lclip;↵

24

                base = getLowerClip();↵

25

                if (value >= uclip) {↵

25

                if (value >= uclip) {↵

26

                    value = uclip;↵

26

                   value = uclip;↵

27

27

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