Object[] paths = bufferList.getSelectedValues(); for(int i = 0; i < paths.length; i++) { String path = (String)paths[i]; Buffer buffer = jEdit.getBuffer(path); if(!buffer.save(view,null,true)) return; VFSManager.waitForRequests(); if(buffer.getBooleanProperty(BufferIORequest .ERROR_OCCURRED)) return; jEdit._closeBuffer(view,buffer); bufferModel.removeElement(path); } if(bufferModel.getSize() == 0) { ok = true; dispose(); } else { bufferList.setSelectedIndex(0); bufferList.requestFocus(); }
Object[] paths = bufferList.getSelectedValues(); for(int i = 0; i < paths.length; i++) { String path = (String)paths[i]; Buffer buffer = jEdit.getBuffer(path); jEdit._closeBuffer(view,buffer); bufferModel.removeElement(path); } if(bufferModel.getSize() == 0) { ok = true; dispose(); } else { bufferList.setSelectedIndex(0); bufferList.requestFocus(); }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/CloseDialog.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/CloseDialog.java
Method name: void actionPerformed(ActionEvent) Method name: void actionPerformed(ActionEvent)
Number of AST nodes: 16 Number of AST nodes: 11
1
Object[] paths = bufferList.getSelectedValues();
1
Object[] paths = bufferList.getSelectedValues();
2
				for(int i = 0; i < paths.length; i++)
2
				for(int i = 0; i < paths.length; i++)
3
				{
3
				{
4
					String path = (String)paths[i];
4
					String path = (String)paths[i];
5
					Buffer buffer = jEdit.getBuffer(path);
5
					Buffer buffer = jEdit.getBuffer(path);
6
					if(!buffer.save(view,null,true))
6
					
7
						return;
8
					VFSManager.waitForRequests();
9
					if(buffer.getBooleanProperty(BufferIORequest
10
						.ERROR_OCCURRED))
11
						return;
12
					jEdit._closeBuffer(view,buffer);
7
jEdit._closeBuffer(view,buffer);
13
					bufferModel.removeElement(path);
8
					bufferModel.removeElement(path);
14
				}
9
				}
15
				if(bufferModel.getSize() == 0)
10
				if(bufferModel.getSize() == 0)
16
				{
11
				{
17
					ok = true;
12
					ok = true;
18
					dispose();
13
					dispose();
19
				}
14
				}
20
				else
15
				else
21
				{
16
				{
22
					bufferList.setSelectedIndex(0);
17
					bufferList.setSelectedIndex(0);
23
					bufferList.requestFocus();
18
					bufferList.requestFocus();
24
				}
19
				}
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.5
Clones locationClones are in the same method
Number of node comparisons4