if((VFSManager.getVFSForPath(path).getCapabilities()
& VFS.CASE_INSENSITIVE_CAP) != 0)
{
path = path.toLowerCase();
}
if((VFSManager.getVFSForPath(path).getCapabilities()
& VFS.CASE_INSENSITIVE_CAP) != 0)
{
path = path.toLowerCase();
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/jEdit.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/jEdit.java
|
Method name: void _closeBuffer(View, Buffer)
|
|
Method name: void updatePosition(String, Buffer)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | if((VFSManager.getVFSForPath(path).getCapabilities()↵ | | 1 | if((VFSManager.getVFSForPath(path).getCapabilities()↵
|
2 | & VFS.CASE_INSENSITIVE_CAP) != 0)↵ | | 2 | & VFS.CASE_INSENSITIVE_CAP) != 0)↵
|
3 | {↵ | | 3 | {↵
|
4 | path = path.toLowerCase();↵ | | 4 | path = path.toLowerCase();↵
|
5 | } | | 5 | }
|
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.4 |
Clones location | Clones are declared in the same class |
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.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
11 | if ((VFSManager.getVFSForPath(path).getCapabilities() & VFS.CASE_INSENSITIVE_CAP) != 0) | | 5 | if ((VFSManager.getVFSForPath(path).getCapabilities() & VFS.CASE_INSENSITIVE_CAP) != 0) |
12 | path = path.toLowerCase(); | | 6 | path = path.toLowerCase(); |
Precondition Violations (0)
Row |
Violation |