if (m_isLong && '=' != m_tokesep){ // Long optional arg must have = as separator
addOption(m_option);
m_state = STATE_NORMAL;
return;
}
if ('-' == m_ch || 0 == m_ch) {
getChar(); // consume stray character
addOption(m_option);
m_state = STATE_NORMAL;
return;
}
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: void parseArguments()
|
|
Method name: void parseArguments()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 5
|
|
1 | if (m_isLong && '=' != m_tokesep){ // Long optional arg must have = as separato↵ | | 1 | if ('-' == m_ch || 0 == m_ch) {↵
|
2 | r↵ | | 2 | getChar(); // consume stray character↵
|
3 | addOption(m_option);↵ | | 3 | addOption(m_option);↵
|
4 | m_state = STATE_NORMAL;↵ | | 4 | m_state = STATE_NORMAL;↵
|
5 | return; ↵ | | 5 | return;↵
|
6 | } | | 6 | }
|
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 in the same method |
Number of node comparisons | 1 |