long result = 0L;
for (int i = 0, len = chars.length(); i < len; i++)
{
char c = chars.charAt(i);
if (c >= 64 && c < 128) result |= (1L << (c - 64));
}
return result;
long result = 0L;
for (int i = 0, len = chars.length(); i < len; i++)
{
char c = chars.charAt(i);
if (c < 64) result |= (1L << c);
}
return result;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/URI.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/URI.java
|
Method name: long highBitmask(String)
|
|
Method name: long lowBitmask(String)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | long result = 0L;↵ | | 1 | long result = 0L;↵
|
2 | for (int i = 0, len = chars.length(); i < len; i++)↵ | | 2 | for (int i = 0, len = chars.length(); i < len; i++)↵
|
3 | {↵ | | 3 | {↵
|
4 | char c = chars.charAt(i);↵ | | 4 | char c = chars.charAt(i);↵
|
5 | if (c >= 64 && c < 128) result |= (1L << (c - 64));↵ | | 5 | if (c < 64) result |= (1L << c);↵
|
6 | }↵ | | 6 | }↵
|
7 | return result; | | 7 | return result;
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 1 |