Boolean result = efsScheme == null ? null : efsScheme.get(scheme);
if (result == null)
{
try
{
result = EFS_GET_FILE_SYSTEM_METHOD.invoke(null, scheme) != null;
}
catch (Throwable exception)
{
result = Boolean.FALSE;
}
Map<String, Boolean> map = new HashMap<String, Boolean>();
if (efsScheme != null)
{
map.putAll(efsScheme);
}
map.put(scheme, result);
efsScheme = map;
}
return result == Boolean.TRUE;
Boolean result = efsScheme == null ? null : efsScheme.get(scheme);
if (result == null)
{
try
{
result = EFS_GET_FILE_SYSTEM_METHOD.invoke(null, scheme) != null;
}
catch (Throwable exception)
{
result = Boolean.FALSE;
}
Map<String, Boolean> map = new HashMap<String, Boolean>();
if (efsScheme != null)
{
map.putAll(efsScheme);
}
map.put(scheme, result);
efsScheme = map;
}
return result == Boolean.TRUE;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/resource/impl/EFSURIHandlerImpl.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/resource/impl/URIConverterImpl.java
|
Method name: boolean canHandle(URI)
|
|
Method name: boolean isEFSScheme(String)
|
Number of AST nodes: 10
|
|
Number of AST nodes: 10
|
|
1 | Boolean result = efsScheme == null ? null : efsScheme.get(scheme);↵ | | 1 | Boolean result = efsScheme == null ? null : efsScheme.get(scheme);↵
|
2 | if (result == null)↵ | | 2 | if (result == null)↵
|
3 | {↵ | | 3 | {↵
|
4 | try↵ | | 4 | try↵
|
5 | {↵ | | 5 | {↵
|
6 | result = EFS_GET_FILE_SYSTEM_METHOD.invoke(null, scheme) != null;↵ | | 6 | result = EFS_GET_FILE_SYSTEM_METHOD.invoke(null, scheme) != null;↵
|
7 | }↵ | | 7 | }↵
|
8 | catch (Throwable exception)↵ | | 8 | catch (Throwable exception)↵
|
9 | {↵ | | 9 | {↵
|
10 | result = Boolean.FALSE;↵ | | 10 | result = Boolean.FALSE;↵
|
11 | }↵ | | 11 | }↵
|
12 | Map<String, Boolean> map = new HashMap<String, Boolean>();↵ | | 12 | Map<String, Boolean> map = new HashMap<String, Boolean>();↵
|
13 | if (efsScheme != null)↵ | | 13 | if (efsScheme != null)↵
|
14 | {↵ | | 14 | {↵
|
15 | map.putAll(efsScheme);↵ | | 15 | map.putAll(efsScheme);↵
|
16 | }↵ | | 16 | }↵
|
17 | map.put(scheme, result);↵ | | 17 | map.put(scheme, result);↵
|
18 | efsScheme = map;↵ | | 18 | efsScheme = map;↵
|
19 | }↵ | | 19 | }↵
|
20 | return result == Boolean.TRUE; | | 20 | return result == Boolean.TRUE;
|
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.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 34 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 10 |
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) | 1.9 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
4 | Boolean result = efsScheme == null ? null : efsScheme.get(scheme); | | 3 | Boolean result = efsScheme == null ? null : efsScheme.get(scheme); |
5 | if (result == null) | | 4 | if (result == null) |
6 | | | 5 | |
7 | result = EFS_GET_FILE_SYSTEM_METHOD.invoke(null, scheme) != null; | | 6 | result = EFS_GET_FILE_SYSTEM_METHOD.invoke(null, scheme) != null; |
8 | Map<String, Boolean> map = new HashMap<String, Boolean>(); | | 7 | Map<String, Boolean> map = new HashMap<String, Boolean>(); |
9 | | | 8 | |
10 | | | 9 | |
11 | | | 10 | |
12 | | | 11 | |
13 | return result == Boolean.TRUE; | | 12 | return result == Boolean.TRUE; |
Precondition Violations (0)
Row |
Violation |