for (int i = 0; i < m_optionDescriptors.length; i++) {
if (m_optionDescriptors[i].getId() == id) {
return m_optionDescriptors[i];
}
}
for (int i = 0; i < m_optionDescriptors.length; i++) {
if (m_optionDescriptors[i].getName().equals(name)) {
return m_optionDescriptors[i];
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/commons/cli/avalon/CLArgsParser.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/commons/cli/avalon/CLArgsParser.java
|
Method name: CLOptionDescriptor getDescriptorFor(int)
|
|
Method name: CLOptionDescriptor getDescriptorFor(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < m_optionDescriptors.length; i++) {↵ | | 1 | for (int i = 0; i < m_optionDescriptors.length; i++) {↵
|
2 | if (m_optionDescriptors[i].getId() == id) {↵ | | 2 | if (m_optionDescriptors[i].getName().equals(name)) {↵
|
3 | return m_optionDescriptors[i];↵ | | 3 | return m_optionDescriptors[i];↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 1 |