void testNonTestCaseName() {
assertEquals("I'm a foo",
JUnitVersionHelper.getTestCaseName(new Foo1()));
}
public void testNoStringReturn() {
assertEquals("unknown",
JUnitVersionHelper.getTestCaseName(new Foo2()));
}
public void testNoGetName() {
assertEquals("unknown",
JUnitVersionHelper.getTestCaseName(new Foo3()));
void testNoStringReturn() {
assertEquals("unknown",
JUnitVersionHelper.getTestCaseName(new Foo2()));
}
public void testNoGetName() {
assertEquals("unknown",
JUnitVersionHelper.getTestCaseName(new Foo3()));
}
public void testNameNotGetName() {
assertEquals("I'm a foo, too",
JUnitVersionHelper.getTestCaseName(new Foo4()));
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/optional/junit/JUnitVersionHelperTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/optional/junit/JUnitVersionHelperTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void testNonTestCaseName() {↵ | | |
|
2 | assertEquals("I'm a foo",↵ | | |
|
3 | JUnitVersionHelper.getTestCaseName(new Foo1()));↵ | | |
|
4 | }↵ | | |
|
|
5 | public void testNoStringReturn() {↵ | | 1 | void testNoStringReturn() {↵
|
6 | assertEquals("unknown",↵ | | 2 | assertEquals("unknown",↵
|
7 | JUnitVersionHelper.getTestCaseName(new Foo2()));↵ | | 3 | JUnitVersionHelper.getTestCaseName(new Foo2()));↵
|
8 | }↵ | | 4 | }↵
|
|
9 | public void testNoGetName() {↵ | | 5 | public void testNoGetName() {↵
|
10 | assertEquals("unknown",↵ | | 6 | assertEquals("unknown",↵
|
11 | JUnitVersionHelper.getTestCaseName(new Foo3()));↵ | | 7 | JUnitVersionHelper.getTestCaseName(new Foo3()));↵
|
12 | | | 8 | }↵
|
|
| | | 9 | public void testNameNotGetName() {↵
|
| | | 10 | assertEquals("I'm a foo, too",↵
|
| | | 11 | JUnitVersionHelper.getTestCaseName(new Foo4()));↵
|
| | | 12 |
|
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.0 |
Clones location | |
Number of node comparisons | 0 |