if (targetDescription == null) {
int pos = findTargetPosition(subNames, targetName);
subNames.insertElementAt(targetName, pos);
} else {
int pos = findTargetPosition(topNames, targetName);
topNames.insertElementAt(targetName, pos);
topDescriptions.insertElementAt(targetDescription, pos);
if (targetName.length() > maxLength) {
maxLength = targetName.length();
}
}
if (namespacePolicy.qualifyAttributes) {
String uri = getNamespaceURI(attr);
String prefix = (String) nsPrefixMap.get(uri);
if (prefix == null) {
prefix = NS + (nextPrefix++);
nsPrefixMap.put(uri, prefix);
addNSDefinition(element, uri);
}
out.write(prefix);
out.write(":");
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/Main.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/DOMElementWriter.java
|
Method name: void printTargets(Project, boolean)
|
|
Method name: void openElement(Element, Writer, int, String, boolean)
|
Number of AST nodes: 8
|
|
Number of AST nodes: 9
|
|
1 | if (targetDescription == null) {↵ | | 1 | if (namespacePolicy.qualifyAttributes) {↵
|
2 | int pos = findTargetPosition(subNames, targetName);↵ | | 2 | ↵
|
3 | subNames.insertElementAt(targetName, pos);↵ | | |
|
4 | } else {↵ | | |
|
5 | int pos = findTargetPosition(topNames, targetName↵ | | 3 | String uri = getNamespaceURI(attr);↵
|
| | | 4 | String prefix = (String) nsPrefixMap.get(uri);↵
|
| | | 5 | if (prefix == null) {↵
|
6 | );↵ | | 6 | prefix = NS + (nextPrefix++);↵
|
7 | topNames.insertElementAt(targetName, pos);↵ | | 7 | ↵
|
8 | topDescriptions.insertElementAt(targetDescription, pos);↵ | | |
|
9 | if (targetName.length() > maxLength) {↵ | | |
|
10 | maxLength = targetName.length(↵ | | 8 | nsPrefixMap.put(uri, prefix);↵
|
| | | 9 | addNSDefinition(element, uri);↵
|
| | | 10 | }↵
|
11 | );↵ | | 11 | out.write(prefix);↵
|
12 | }↵ | | 12 | out.write(":");↵
|
13 | } | | 13 | }
|
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 in different classes |
Number of node comparisons | 1 |