for (int x = 0; x < groups; x++) {
buf.append(x);
vars.put(buf.toString(), match.group(x));
buf.setLength(pfxlen);
}
while (iter.hasNext()) {
PostProcessor ex = (PostProcessor) iter.next();
TestBeanHelper.prepare((TestElement) ex);
ex.process();
}
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/threads/JMeterThread.java
|
Method name: void saveGroups(JMeterVariables, String, MatchResult)
|
|
Method name: void runPostProcessors(List)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int x = 0; x < groups; x++) {↵ | | |
|
2 | buf.append(x);↵ | | |
|
3 | vars.put(buf.toString(), match.group(↵ | | 1 | while (iter.hasNext()) {↵
|
| | | 2 | PostProcessor ex = (PostProcessor) iter.next();↵
|
4 | x));↵ | | 3 | TestBeanHelper.prepare((TestElement) ex);↵
|
5 | buf.setLength(pfxlen);↵ | | |
|
6 | ↵ | | 4 | ex.process();↵
|
7 | } | | 5 | }
|
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 |