public void setFork(boolean value) {
fork = value;
}
/**
* @return the value of the fork attribute
*/
public boolean getFork() {
return fork
public void setFork(boolean value) {
fork = value;
}
/**
* Get the fork attribute.
* @return the attribute.
*/
public boolean getFork() {
return fork
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/jdepend/JDependTask.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/BaseTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public void setFork(boolean value) {↵ | | 1 | public void setFork(boolean value) {↵
|
2 | fork = value;↵ | | 2 | fork = value;↵
|
3 | }↵ | | 3 | }↵
|
|
4 | /**↵ | | 4 | /**↵
|
5 | * @return the value of the fork↵ | | 5 | * Get the fork attribute.↵
|
6 | attribute↵ | | 6 | * @return the attribute.↵
|
7 | */↵ | | 7 | */↵
|
8 | public boolean getFork() {↵ | | 8 | public boolean getFork() {↵
|
9 | return fork | | 9 | return fork
|
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 |