File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/AntStructure.java | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java | |||
Method name: boolean areNmtokens(String[])
|
Method name: boolean isMorePowerfulThanExcludes(String, String)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | for (int i = 0; i < s.length; i++) {↵ | 1 | for (int counter = 0; counter < excludes.length; counter++) {↵ | |
2 | if (!isNmtoken(s[i])) {↵ | 2 | if (excludes[counter].equals(soughtexclude)) {↵ | |
3 | return false;↵ | 3 | return false;↵ | |
4 | }↵ | 4 | ↵ | |
5 | ↵ | 5 | }↵ | |
6 | } | 6 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
Number of mapped statements | 3 |
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 2 |
ID | Statement | ID | Statement | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | for (int i = 0; i < s.length; i++) |
| 2 | for (int counter = 0; counter < excludes.length; counter++) | |||||||||||||||||||
2 | if (!isNmtoken(s[i])) |
| 3 | if (excludes[counter].equals(soughtexclude)) | |||||||||||||||||||
3 | return false; | 4 | return false; |
Row | Violation |
---|---|
1 | Expression !isNmtoken(s[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression excludes[counter].equals(soughtexclude) cannot be parameterized, because it has dependencies to/from statements that will be extracted |