VFS vfs = VFSManager.getVFSForPath(file);
boolean ignoreCase = ((vfs.getCapabilities()
& VFS.CASE_INSENSITIVE_CAP) != 0);
VFS vfs = VFSManager.getVFSForPath(file);
boolean ignoreCase = ((vfs.getCapabilities()
& VFS.CASE_INSENSITIVE_CAP) != 0);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/BufferListSet.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/BufferListSet.java
|
Method name: String getNextFile(View, String)
|
|
Method name: String getNextFile(View, String)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | VFS vfs = VFSManager.getVFSForPath(file);↵ | | 1 | VFS vfs = VFSManager.getVFSForPath(file);↵
|
2 | boolean ignoreCase = ((vfs.getCapabilities()↵ | | 2 | boolean ignoreCase = ((vfs.getCapabilities()↵
|
3 | & VFS.CASE_INSENSITIVE_CAP) != 0); | | 3 | & VFS.CASE_INSENSITIVE_CAP) != 0);
|
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.0 |
Clones location | Clones are in the same method |
Number of node comparisons | 4 |
-
{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) | 0.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
7 | VFS vfs = VFSManager.getVFSForPath(file); | | 13 | VFS vfs = VFSManager.getVFSForPath(file); |
8 | boolean ignoreCase = ((vfs.getCapabilities() & VFS.CASE_INSENSITIVE_CAP) != 0); | | 14 | boolean ignoreCase = ((vfs.getCapabilities() & VFS.CASE_INSENSITIVE_CAP) != 0); |
Precondition Violations (0)
Row |
Violation |