if(begin < p.beginsAt && 0 < in.substring(begin, p.beginsAt).trim().length())
{
ret.add(in.substring(begin, p.beginsAt).trim());
}
if(begin < p.beginsAt && 0 < in.substring(begin, p.beginsAt).trim().length())
{
ret.add(in.substring(begin, p.beginsAt).trim());
}
Clone fragments detected by clone detection tool
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/codereformat/CodeReformatorKernel.java
|
|
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/codereformat/CodeReformatorKernel.java
|
Method name: String[] toPieces(String)
|
|
Method name: String[] toPieces(String)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | if(begin < p.beginsAt && 0 < in.substring(begin, p.beginsAt).trim().length())↵ | | 1 | if(begin < p.beginsAt && 0 < in.substring(begin, p.beginsAt).trim().length())↵
|
2 | {↵ | | 2 | {↵
|
3 | ret.add(in.substring(begin, p.beginsAt).trim());↵ | | 3 | ret.add(in.substring(begin, p.beginsAt).trim());↵
|
4 | } | | 4 | }
|
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.4 |
Clones location | Clones are in the same method |
Number of node comparisons | 6 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
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) | 1.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
14 | if (begin < p.beginsAt && 0 < in.substring(begin, p.beginsAt).trim().length()) | | 36 | if (begin < p.beginsAt && 0 < in.substring(begin, p.beginsAt).trim().length()) |
15 | ret.add(in.substring(begin, p.beginsAt).trim()); | | 37 | ret.add(in.substring(begin, p.beginsAt).trim()); |
Precondition Violations (0)
Row |
Violation |