public URL getWebsite() {
return websiteURL;
}
public File locate() {
/*
* If this is a unix-based system, check the 2 best-known areas for the
* aspell binary.
*/
if (OSInfo.isLinux() || OSInfo.isSolaris()) {
if (defaultLinux.exists()) {
return defaultLinux;
} else if (defaultLocalLinux.exists()) {
return defaultLocalLinux;
}
}
return null
public URL getWebsite() {
return websiteURL;
}
public File locate() {
/*
* If this is a unix-based system, check the 2 best-known areas for the
* aspell binary.
*/
if (OSInfo.isLinux() || OSInfo.isSolaris()) {
if (defaultLinux.exists()) {
return defaultLinux;
} else if (defaultLocalLinux.exists()) {
return defaultLocalLinux;
}
}
return null
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/spam/spamassassin/SALearnExternalToolPlugin.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/spam/spamassassin/SpamcExternalToolPlugin.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public URL getWebsite() {↵ | | 1 | public URL getWebsite() {↵
|
2 | return websiteURL;↵ | | 2 | return websiteURL;↵
|
3 | }↵ | | 3 | }↵
|
|
4 | public File locate() {↵ | | 4 | public File locate() {↵
|
5 | /*↵ | | 5 | /*↵
|
6 | * If this is a unix-based system, check the 2 best-known areas for the↵ | | 6 | * If this is a unix-based system, check the 2 best-known areas for the↵
|
7 | * aspell binary.↵ | | 7 | * aspell binary.↵
|
8 | */↵ | | 8 | */↵
|
9 | if (OSInfo.isLinux() || OSInfo.isSolaris()) {↵ | | 9 | if (OSInfo.isLinux() || OSInfo.isSolaris()) {↵
|
10 | if (defaultLinux.exists()) {↵ | | 10 | if (defaultLinux.exists()) {↵
|
11 | return defaultLinux;↵ | | 11 | return defaultLinux;↵
|
12 | } else if (defaultLocalLinux.exists()) {↵ | | 12 | } else if (defaultLocalLinux.exists()) {↵
|
13 | return defaultLocalLinux;↵ | | 13 | return defaultLocalLinux;↵
|
14 | }↵ | | 14 | }↵
|
15 | }↵ | | 15 | }↵
|
|
16 | return null | | 16 | return null
|
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 |