public void undo(JEditTextArea textArea) { if(undoMgr == null) return; if(!isEditable()) { textArea.getToolkit().beep(); return; } try { writeLock(); setFlag(UNDO_IN_PROGRESS,true); int caret = undoMgr.undo(); if(caret == -1) textArea.getToolkit().beep(); else textArea.setCaretPosition(caret); fireTransactionComplete(); } finally { setFlag(UNDO_IN_PROGRESS,false); writeUnlock();
public void redo(JEditTextArea textArea) { if(undoMgr == null) return; if(!isEditable()) { Toolkit.getDefaultToolkit().beep(); return; } try { writeLock(); setFlag(UNDO_IN_PROGRESS,true); int caret = undoMgr.redo(); if(caret == -1) textArea.getToolkit().beep(); else textArea.setCaretPosition(caret); fireTransactionComplete(); } finally { setFlag(UNDO_IN_PROGRESS,false); writeUnlock();
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public void undo(JEditTextArea textArea)
1
public void redo(JEditTextArea textArea)
2
	{
2
	{
3
		if(undoMgr == null)
3
		if(undoMgr == null)
4
			return;
4
			return;
5
		if(!isEditable())
5
		if(!isEditable())
6
		{
6
		{
7
			textArea.getToolkit().beep();
7
			Toolkit.getDefaultToolkit().beep();
8
			return;
8
			return;
9
		}
9
		}
10
		try
10
		try
11
		{
11
		{
12
			writeLock();
12
			writeLock();
13
			setFlag(UNDO_IN_PROGRESS,true);
13
			setFlag(UNDO_IN_PROGRESS,true);
14
			int caret = undoMgr.undo();
14
			int caret = undoMgr.redo();
15
			if(caret == -1)
15
			if(caret == -1)
16
				textArea.getToolkit().beep();
16
				textArea.getToolkit().beep();
17
			else
17
			else
18
				textArea.setCaretPosition(caret);
18
				textArea.setCaretPosition(caret);
19
			fireTransactionComplete();
19
			fireTransactionComplete();
20
		}
20
		}
21
		finally
21
		finally
22
		{
22
		{
23
			setFlag(UNDO_IN_PROGRESS,false);
23
			setFlag(UNDO_IN_PROGRESS,false);
24
			writeUnlock();
24
			writeUnlock();
25
		
25
		
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