for (int i = 0; i < argument.length(); i++) {
char c = argument.charAt(i);
if (c == '$') {
subst.append('\\');
subst.append('$');
} else if (c == '\\') {
if (++i < argument.length()) {
c = argument.charAt(i);
int value = Character.digit(c, 10);
if (value > -1) {
subst.append("$").append(value);
} else {
subst.append(c);
}
} else {
// XXX - should throw an exception instead?
subst.append('\\');
}
} else {
subst.append(c);
}
}
for (int i = 0; i < argument.length(); i++) {
char c = argument.charAt(i);
if (c == '$') {
subst.append('\\');
subst.append('$');
} else if (c == '\\') {
if (++i < argument.length()) {
c = argument.charAt(i);
int value = Character.digit(c, 10);
if (value > -1) {
subst.append("$").append(value);
} else {
subst.append(c);
}
} else {
// XXX - should throw an exception instead?
subst.append('\\');
}
} else {
subst.append(c);
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/regexp/JakartaOroRegexp.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/regexp/Jdk14RegexpRegexp.java
|
Method name: String substitute(String, String, int)
|
|
Method name: String substitute(String, String, int)
|
Number of AST nodes: 14
|
|
Number of AST nodes: 14
|
|
1 | for (int i = 0; i < argument.length(); i++) {↵ | | 1 | for (int i = 0; i < argument.length(); i++) {↵
|
2 | char c = argument.charAt(i);↵ | | 2 | char c = argument.charAt(i);↵
|
3 | if (c == '$') {↵ | | 3 | if (c == '$') {↵
|
4 | subst.append('\\');↵ | | 4 | subst.append('\\');↵
|
5 | subst.append('$');↵ | | 5 | subst.append('$');↵
|
6 | } else if (c == '\\') {↵ | | 6 | } else if (c == '\\') {↵
|
7 | if (++i < argument.length()) {↵ | | 7 | if (++i < argument.length()) {↵
|
8 | c = argument.charAt(i);↵ | | 8 | c = argument.charAt(i);↵
|
9 | int value = Character.digit(c, 10);↵ | | 9 | int value = Character.digit(c, 10);↵
|
10 | if (value > -1) {↵ | | 10 | if (value > -1) {↵
|
11 | subst.append("$").append(value);↵ | | 11 | subst.append("$").append(value);↵
|
12 | } else {↵ | | 12 | } else {↵
|
13 | subst.append(c);↵ | | 13 | subst.append(c);↵
|
14 | }↵ | | 14 | }↵
|
15 | } else {↵ | | 15 | } else {↵
|
16 | // XXX - should throw an exception instead?↵ | | 16 | // XXX - should throw an exception instead?↵
|
17 | subst.append('\\');↵ | | 17 | subst.append('\\');↵
|
18 | }↵ | | 18 | }↵
|
19 | } else {↵ | | 19 | } else {↵
|
20 | subst.append(c);↵ | | 20 | subst.append(c);↵
|
21 | }↵ | | 21 | }↵
|
22 | } | | 22 | }
|
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.7 |
Clones location | Clones are in different classes |
Number of node comparisons | 42 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 14 |
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) | 19.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | for (int i = 0; i < argument.length(); i++) | | 2 | for (int i = 0; i < argument.length(); i++) |
3 | char c = argument.charAt(i); | | 3 | char c = argument.charAt(i); |
4 | | | 4 | |
5 | | | 5 | |
6 | | | 6 | |
7 | | | 7 | |
8 | if (++i < argument.length()) | | 8 | if (++i < argument.length()) |
9 | | | 9 | |
10 | int value = Character.digit(c, 10); | | 10 | int value = Character.digit(c, 10); |
11 | | | 11 | |
12 | subst.append("$").append(value); | | 12 | subst.append("$").append(value); |
| | | | |
13 | | | 13 | |
| | | | |
14 | | | 14 | |
| | | | |
15 | | | 15 | |
Precondition Violations (0)
Row |
Violation |