result = HashUtilities.hashCode(result, list.getBoolean(0)); if (size > 1) { result = HashUtilities.hashCode(result, list.getBoolean(size - 1)); if (size > 2) { result = HashUtilities.hashCode(result, list.getBoolean(size / 2));
result = HashUtilities.hashCode(result, list.getPaint(0)); if (size > 1) { result = HashUtilities.hashCode(result, list.getPaint(size - 1)); if (size > 2) { result = HashUtilities.hashCode(result, list.getPaint(size / 2));
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/HashUtilities.java File path: /jfreechart-1.0.10/src/org/jfree/chart/HashUtilities.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
result = HashUtilities.hashCode(result, list.getBoolean(0));
1
result = HashUtilities.hashCode(result, list.getPaint(0));
2
            if (size > 1) {
2
            if (size > 1) {
3
                result = HashUtilities.hashCode(result, 
3
                result = HashUtilities.hashCode(result, 
4
                        list.getBoolean(size - 1));
4
                        list.getPaint(size - 1));
5
                if (size > 2) {
5
                if (size > 2) {
6
                    result = HashUtilities.hashCode(result, 
6
                    result = HashUtilities.hashCode(result, 
7
                            list.getBoolean(size / 2));
7
                            list.getPaint(size / 2));
8
                
8
                
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