Buffer[] buffers = new Buffer[bufferCount]; Buffer buffer = buffersFirst; for(int i = 0; i < bufferCount; i++) { buffers[i] = buffer; buffer = buffer.next; } return buffers;
try { selectAllFlag = true; bufferList.setSelectionInterval(0, bufferModel.getSize() - 1); } finally { selectAllFlag = false; } bufferList.requestFocus();
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/jEdit.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/CloseDialog.java
Method name: Buffer[] getBuffers() Method name: void actionPerformed(ActionEvent)
Number of AST nodes: 6 Number of AST nodes: 4
1
Buffer[] buffers = new Buffer[bufferCount];
2
			Buffer buffer = buffersFirst;
3
			for(int i = 0; i < bufferCount; i++)
1
try
2
				{
3
					selectAllFlag = true;
4
					bufferList.setSelectionInterval(0,
5
						bufferModel.getSize() - 1);
4
			{
6
				}
5
				buffers[i] = buffer;
7
				
6
				buffer = buffer.next
8
finally
9
				{
7
;
10
					selectAllFlag = false;
8
			}
11
				}
9
			return buffers;
12
				bufferList.requestFocus();
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