StringBuffer buf = getFilledBuffer(1024*300, 'a');
for (int i = 0; i < 1000; i++) {
assertTrue(StringUtils.endsWith(buf, "aa"));
}
StringBuffer buf = getFilledBuffer(1024*300, 'a');
for (int i = 0; i < 1000; i++) {
assertTrue(buf.toString().endsWith("aa"));
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/util/StringUtilsTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/util/StringUtilsTest.java
|
Method name: void testEndsWithPerf()
|
|
Method name: void testEndsWithJDKPerf()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | StringBuffer buf = getFilledBuffer(1024*300, 'a');↵ | | 1 | StringBuffer buf = getFilledBuffer(1024*300, 'a');↵
|
2 | for (int i = 0; i < 1000; i++) {↵ | | 2 | for (int i = 0; i < 1000; i++) {↵
|
3 | assertTrue(StringUtils.endsWith(buf, "aa"));↵ | | 3 | assertTrue(buf.toString().endsWith("aa"));↵
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.6 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | StringBuffer buf = getFilledBuffer(1024 * 300, 'a'); | | 1 | StringBuffer buf = getFilledBuffer(1024 * 300, 'a'); |
2 | for (int i = 0; i < 1000; i++) | | 2 | for (int i = 0; i < 1000; i++) |
| | | 3 | assertTrue(buf.toString().endsWith("aa")); |
3 | assertTrue(StringUtils.endsWith(buf, "aa")); | | | |
Precondition Violations (0)
Row |
Violation |