while (iter.hasPrevious()) {
PostProcessor ex = (PostProcessor) iter.previous();
TestBeanHelper.prepare((TestElement) ex);
ex.process();
}
if (popup != null) {
popup.pack();
popup.show(tree, e.getX(), e.getY());
popup.setVisible(true);
popup.requestFocus();
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/threads/JMeterThread.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/report/gui/tree/ReportTreeListener.java
|
Method name: void runPostProcessors(List)
|
|
Method name: void displayPopUp(MouseEvent, JPopupMenu)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 5
|
|
1 | while (iter.hasPrevious()) {↵ | | 1 | if (popup != null) {↵
|
2 | PostProcessor ex = (PostProcessor) iter.previous↵ | | 2 | popup.pack();↵
|
3 | ();↵ | | 3 | popup.show(tree, e.getX(), e.getY());↵
|
4 | TestBeanHelper.prepare((TestElement) ex);↵ | | |
|
5 | ex.proces↵ | | 4 | popup.setVisible(true);↵
|
6 | s();↵ | | 5 | popup.requestFocus();↵
|
7 | } | | 6 | }
|
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 | Clones are in different classes |
Number of node comparisons | 1 |