while (iter.hasNext()) {
Object temp = iter.next();
tree.add(temp);
tree = tree.getTree(temp);
}
while (reader.hasMoreChildren()) {
reader.moveDown();
JMeterProperty prop = (JMeterProperty) readItem(reader, context, el);
el.setProperty(prop);
reader.moveUp();
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/save/converters/TestElementConverter.java
|
Method name: HashTree addTreePath(Collection)
|
|
Method name: Object unmarshal(HierarchicalStreamReader, UnmarshallingContext)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 5
|
|
1 | while (iter.hasNext()) {↵ | | 1 | while (reader.has↵
|
2 | Object temp = iter.next(↵ | | 2 | MoreChildren()) {↵
|
| | | 3 | reader.moveDown();↵
|
3 | );↵ | | 4 | JMeterProperty prop = (JMeterProperty) readItem(reader, context, el);↵
|
4 | tree.add(temp);↵ | | 5 | el.setProperty(prop);↵
|
5 | tree = tree.getTree(temp);↵ | | 6 | reader.moveUp();↵
|
6 | } | | 7 | }
|
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 |