for (int x = 0; x < groups; x++) { buf.append(x); vars.put(buf.toString(), match.group(x)); buf.setLength(pfxlen); }
if (line == null) { breader.close(); breader = null; this.READER = null; // this.READER = new BufferedReader(new // FileReader(this.SOURCE)); // parse(this.READER,el); }
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/protocol/http/util/accesslog/TCLogParser.java
Method name: void saveGroups(JMeterVariables, String, MatchResult) Method name: int parse(BufferedReader, TestElement, int)
Number of AST nodes: 4 Number of AST nodes: 4
1
for (int x = 0; x < groups; x++) {
1
if (lin
2
			buf.append(x);
3
			vars.put(buf.toString(), match.group(x));
4
			buf.setLength(pfxlen
2
e == null) {
3
				breader.close();
4
				breader = null;
5
				this.READER = null;
6
				// this.READER = new BufferedReader(new
7
				// FileReader(this.SOURCE));
5
);
8
				// parse(this.READER,el);
6
		}
9
			}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones locationClones are in different classes
Number of node comparisons1