{ if (userObject == node.getUserObject()) { return node; } Enumeration enumNode = node.children(); while (enumNode.hasMoreElements()) { ReportTreeNode child = (ReportTreeNode) enumNode.nextElement(); ReportTreeNode result = traverseAndFind(userObject, child); if (result != null) { return result; } } return null; } public HashTree getCurrentSubTree(ReportTreeNode node) { ListedHashTree hashTree = new ListedHashTree(node); Enumeration enumNode = node.children(); while (enumNode.hasMoreElements()) { ReportTreeNode child = (ReportTreeNode) enumNode.nextElement(); hashTree.add(node, getCurrentSubTree(child)); } return hashTree; } public HashTree getReportPlan() { return getCurrentSubTree((ReportTreeNode) ((ReportTreeNode) this .getRoot()).getChildAt(0));
{ if (userObject == node.getUserObject()) { return node; } Enumeration enumNode = node.children(); while (enumNode.hasMoreElements()) { JMeterTreeNode child = (JMeterTreeNode) enumNode.nextElement(); JMeterTreeNode result = traverseAndFind(userObject, child); if (result != null) { return result; } } return null; } public HashTree getCurrentSubTree(JMeterTreeNode node) { ListedHashTree hashTree = new ListedHashTree(node); Enumeration enumNode = node.children(); while (enumNode.hasMoreElements()) { JMeterTreeNode child = (JMeterTreeNode) enumNode.nextElement(); hashTree.add(node, getCurrentSubTree(child)); } return hashTree; } public HashTree getTestPlan() { return getCurrentSubTree((JMeterTreeNode) ((JMeterTreeNode) this.getRoot()).getChildAt(0));
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/report/gui/tree/ReportTreeModel.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/tree/JMeterTreeModel.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
{
1
{
2
		if (userObject == node.getUserObject()) {
2
		if (userObject == node.getUserObject()) {
3
			return node;
3
			return node;
4
		}
4
		}
5
		Enumeration enumNode = node.children();
5
		Enumeration enumNode = node.children();
6
		while (enumNode.hasMoreElements()) {
6
		while (enumNode.hasMoreElements()) {
7
			ReportTreeNode child = (ReportTreeNode) enumNode.nextElement();
7
			JMeterTreeNode child = (JMeterTreeNode) enumNode.nextElement();
8
			ReportTreeNode result = traverseAndFind(userObject, child);
8
			JMeterTreeNode result = traverseAndFind(userObject, child);
9
			if (result != null) {
9
			if (result != null) {
10
				return result;
10
			    return result;
11
			}
11
			}
12
		}
12
		}
13
		return null;
13
		return null;
14
	}
14
	}
15
	public HashTree getCurrentSubTree(ReportTreeNode node) {
15
	public HashTree getCurrentSubTree(JMeterTreeNode node) {
16
		ListedHashTree hashTree = new ListedHashTree(node);
16
		ListedHashTree hashTree = new ListedHashTree(node);
17
		Enumeration enumNode = node.children();
17
		Enumeration enumNode = node.children();
18
		while (enumNode.hasMoreElements()) {
18
		while (enumNode.hasMoreElements()) {
19
			ReportTreeNode child = (ReportTreeNode) enumNode.nextElement();
19
			JMeterTreeNode child = (JMeterTreeNode) enumNode.nextElement();
20
			hashTree.add(node, getCurrentSubTree(child));
20
			hashTree.add(node, getCurrentSubTree(child));
21
		}
21
		}
22
		return hashTree;
22
		return hashTree;
23
	}
23
	}
24
	public HashTree getReportPlan() {
24
	public HashTree getTestPlan() {
25
		return getCurrentSubTree((ReportTreeNode) ((ReportTreeNode) this
25
		return getCurrentSubTree((JMeterTreeNode) ((JMeterTreeNode) this
26
				.getRoot()).getChildAt(0));
26
.getRoot()).getChildAt(0));
27
	
27
	
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 location
Number of node comparisons0