while(_view != null) { EditPane[] panes = _view.getEditPanes(); for(int i = 0; i < panes.length; i++) { panes[i].saveCaretInfo(); } _view = _view.next; }
while(_view != null) { EditPane[] editPanes = _view.getEditPanes(); for(int i = 0; i < editPanes.length; i++) { editPanes[i].saveCaretInfo(); } _view = _view.next; }
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/jEdit.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
while(_view != null)
1
while(_view != null)
2
		{
2
		{
3
			EditPane[] panes = _view.getEditPanes();
3
			EditPane[] editPanes = _view.getEditPanes();
4
			for(int i = 0; i < panes.length; i++)
4
			for(int i = 0; i < editPanes.length; i++)
5
			{
5
			{
6
				panes[i].saveCaretInfo();
6
				editPanes[i].saveCaretInfo();
7
			}
7
			}
8
			_view = _view.next;
8
			_view = _view.next;
9
		}
9
		}
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