Vector v = new Vector();
StringTokenizer st = new StringTokenizer(s, delim);
while ( st.hasMoreTokens() )
v.addElement( st.nextToken() );
String [] sa = new String [ v.size() ];
v.copyInto( sa );
return sa;
StringBuffer sb = new StringBuffer();
dump(sb);
return sb.toString();
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/StringUtil.java
|
|
File path: /jEdit-4.2/src/gnu/regexp/RE.java
|
Method name: String[] split(String, String)
|
|
Method name: String toString()
|
Number of AST nodes: 7
|
|
Number of AST nodes: 3
|
|
1 | Vector v = new Vector();↵ | | |
|
2 | StringTokenizer st = new StringTokenizer(s, delim);↵ | | 1 | StringBuffer sb = new String↵
|
3 | while ( st.hasMoreTokens() )↵ | | |
|
4 | v.addElement( st.nextToken() );↵ | | |
|
5 | String [] sa = new String [ v.size() ];↵ | | |
|
6 | v.copyInto( sa );↵ | | |
|
7 | return sa↵ | | 2 | Buffer();↵
|
| | | 3 | dump(sb);↵
|
8 | ; | | 4 | return sb.toString();
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 15 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 0 |
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 | Unknown type |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
Precondition Violations (0)
Row |
Violation |