for (int i = 1; i < length; i++) {
c = ianaEncoding.charAt(i);
if ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') &&
(c < '0' || c > '9') && c != '.' && c != '_' &&
c != '-') {
return false;
}
}
return true;
for (int i = 1; i < length; i++) {
char c = javaEncoding.charAt(i);
if ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') &&
(c < '0' || c > '9') && c != '.' && c != '_' &&
c != '-') {
return false;
}
}
return true;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/DataValue.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/DataValue.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int i = 1; i < length; i++) {↵ | | 1 | for (int i = 1; i < length; i++) {↵
|
2 | c = ianaEncoding.charAt(i);↵ | | 2 | char c = javaEncoding.charAt(i);↵
|
3 | if ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') &&↵ | | 3 | if ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') &&↵
|
4 | (c < '0' || c > '9') && c != '.' && c != '_' &&↵ | | 4 | (c < '0' || c > '9') && c != '.' && c != '_' &&↵
|
5 | c != '-') {↵ | | 5 | c != '-') {↵
|
6 | return false;↵ | | 6 | return false;↵
|
7 | }↵ | | 7 | ↵
|
8 | ↵ | | 8 | }↵
|
9 | }↵ | | 9 | ↵
|
10 | ↵ | | 10 | }↵
|
11 | return true;↵ | | 11 | return true;↵
|
12 | | | 12 |
|
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 |