if (itemsInColumn.isEmpty()) { // place in this column (truncated) anyway block.setBounds( new Rectangle2D.Double( x, y, size.width, Math.min(size.height, height - y) ) ); y = 0.0; x = x + size.width + this.horizontalGap; } else { // start new column itemsInColumn.clear(); x = x + maxWidth + this.horizontalGap; y = 0.0; maxWidth = size.width; block.setBounds( new Rectangle2D.Double( x, y, size.width, Math.min(size.height, height) ) ); y = size.height + this.verticalGap; itemsInColumn.add(block); }
if (itemsInRow.isEmpty()) { // place in this row (truncated) anyway block.setBounds( new Rectangle2D.Double( x, y, Math.min(size.width, width - x), size.height ) ); x = 0.0; y = y + size.height + this.verticalGap; } else { // start new row itemsInRow.clear(); x = 0.0; y = y + maxHeight + this.verticalGap; maxHeight = size.height; block.setBounds( new Rectangle2D.Double( x, y, Math.min(size.width, width), size.height ) ); x = size.width + this.horizontalGap; itemsInRow.add(block); }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/block/ColumnArrangement.java File path: /jfreechart-1.0.10/src/org/jfree/chart/block/FlowArrangement.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (itemsInColumn.isEmpty()) {
1
if (itemsInRow.isEmpty()) {
2
                    // place in this column (truncated) anyway
2
                    // place in this row (truncated) anyway
3
                    block.setBounds(
3
                    block.setBounds(
4
                        new Rectangle2D.Double(
4
                        new Rectangle2D.Double(
5
                            x, y, size.width, Math.min(size.height, height - y)
5
                            x, y, Math.min(size.width, width - x), size.height
6
                        )
6
                        )
7
                    );
7
                    );
8
                    y = 0.0;
8
                    x = 0.0;
9
                    x = x + size.width + this.horizontalGap;
9
                    y = y + size.height + this.verticalGap;
10
                }
10
                }
11
                else {
11
                else {
12
                    // start new column
12
                    // start new row
13
                    itemsInColumn.clear();
13
                    itemsInRow.clear();
14
                    x = x + maxWidth + this.horizontalGap;
14
                    x = 
15
                    y = 0.0
15
0.0;
16
;
16
                    y = y + maxHeight + this.verticalGap;
17
                    maxWidth = size.width;
17
                    maxHeight = size.height;
18
                    block.setBounds(
18
                    block.setBounds(
19
                        new Rectangle2D.Double(
19
                        new Rectangle2D.Double(
20
                            x, y, size.width, Math.min(size.height, height)
20
                            x, y, Math.min(size.width, width), size.height
21
                        )
21
                        )
22
                    );
22
                    );
23
                    y = size.height + this.verticalGap;
23
                    x = size.width + this.horizontalGap;
24
                    itemsInColumn.add(block);
24
                    itemsInRow.add(block);
25
                }
25
                }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0