1335-1-2

public boolean inIncludeSegments() { for (Segment segment = getSegment(this.segmentStart); segment.getSegmentStart() < this.segmentEnd; segment.inc()) { if (!segment.inIncludeSegments()) { return (false); } } return true;
public boolean inExcludeSegments() { for (Segment segment = getSegment(this.segmentStart); segment.getSegmentStart() < this.segmentEnd; segment.inc()) { if (!segment.inExceptionSegments()) { return (false); } } return true;

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

1

    public boolean inIncludeSegments() {↵

1

    public boolean inExcludeSegments() {↵

2

                for (Segment segment = getSegment(this.segmentStart);↵

2

                for (Segment segment = getSegment(this.segmentStart);↵

3

                    segment.getSegmentStart() < this.segmentEnd;↵

3

                    segment.getSegmentStart() < this.segmentEnd;↵

4

                    segment.inc()) {↵

4

                    segment.inc()) {↵

5

                    if (!segment.inIncludeSegments()) {↵

5

                    if (!segment.inExceptionSegments()) {↵

6

                        return (false);↵

6

                        return (false);↵

7

                    }↵

7

                    }↵

8

                }↵

8

                }↵

9

                return true;↵

9

                return true;↵

10

10

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