for (int x = 0; x < groups; x++) {
buf.append(x);
vars.put(buf.toString(), match.group(x));
buf.setLength(pfxlen);
}
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/extractor/RegexExtractor.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/tree/JMeterTreeListener.java
|
Method name: void saveGroups(JMeterVariables, String, MatchResult)
|
|
Method name: void displayPopUp(MouseEvent, JPopupMenu)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 5
|
|
1 | for (int x = 0; x < groups; x++) {↵ | | |
|
2 | buf.append(x);↵ | | |
|
3 | vars.put(buf.toString(), match.group(x));↵ | | |
|
4 | buf.setLength(pfxlen↵ | | 1 | if (popup != null) {↵
|
| | | 2 | popup.pack();↵
|
| | | 3 | popup.show(tree, e.getX(), e.getY());↵
|
| | | 4 | popup.setVisible(true);↵
|
5 | );↵ | | 5 | popup.requestFocus();↵
|
6 | } | | 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 |