StringTokenizer st = new StringTokenizer(line);
st.nextToken(); // skip '#'
_originalWord = st.nextToken();
StringTokenizer st = new StringTokenizer(line);
st.nextToken(); // skip '#'
_originalWord = st.nextToken();
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/spellcheck/cswilly/Result.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/spellcheck/cswilly/Result.java
|
Method name: void processNone(String)
|
|
Method name: void processSuggestion(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | StringTokenizer st = new StringTokenizer(line);↵ | | 1 | StringTokenizer st = new StringTokenizer(line);↵
|
2 | st.nextToken(); // skip '#'↵ | | 2 | st.nextToken(); // skip '#'↵
|
3 | _originalWord = st.nextToken(); | | 3 | _originalWord = st.nextToken();
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | StringTokenizer st = new StringTokenizer(line); | | 2 | StringTokenizer st = new StringTokenizer(line); |
4 | st.nextToken(); | | 3 | st.nextToken(); |
5 | _originalWord = st.nextToken(); | | 4 | _originalWord = st.nextToken(); |
Precondition Violations (0)
Row |
Violation |