while (iter.hasNext()) { Argument item = (Argument) iter.next().getObjectValue(); attr = attrs.get(item.getName()); if (attr == null) { attr = getBasicAttribute(item.getName(), item.getValue()); } else { attr.add(item.getValue()); } attrs.put(attr); }
while (itr.hasNext()) { DataSet item = (DataSet)itr.next(); SamplingStatCalculator ss = item.getStatistics(this.getURL()); if (ss != null) { // we add the entry dset.add(ss); if ( getXLabel().equals(X_DATA_FILENAME_LABEL) ) { xlabels.add(item.getDataSourceName()); } else { xlabels.add(item.getMonthDayYearDate()); } } }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/protocol/ldap/sampler/LDAPExtSampler.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/testelement/BarChart.java
Method name: Attributes getUserAttributes() Method name: JComponent renderChart(List)
Number of AST nodes: 7 Number of AST nodes: 8
1
while (iter.hasNext()) {
1
while (itr.hasNext()) {
2
			Argument item = (Argument) iter.next().getObjectValue();
2
            DataSet item = (DataSet)itr.next()
3
			
3
;
4
attr = attrs.get(item.getName());
4
            SamplingStatCalculator 
5
			if (attr == null) {
6
				attr = getBasicAttribute(item.getName(), item.getValue());
7
			} else {
8
				attr.add(item.getValue());
9
			}
10
			attrs.put(attr);
11
		
5
ss = item.getStatistics(this.getURL());
6
            if (ss != null) {
7
                // we add the entry
8
                dset.add(ss);
9
                if ( getXLabel().equals(X_DATA_FILENAME_LABEL) ) {
10
                    xlabels.add(item.getDataSourceName());
11
                } else {
12
                    xlabels.add(item.getMonthDayYearDate());
13
                }
14
            }
12
}
15
        }
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.1
Clones locationClones are in different classes having the same super class
Number of node comparisons1