for(int i = 0; i < selection.size(); i++) { Selection s = (Selection)selection.elementAt(i); if(offset >= s.start && offset <= s.end) return s; }
for(int i = 0; i < listeners.size(); i++) { ListDataListener listener = (ListDataListener) listeners.elementAt(i); listener.intervalAdded(new ListDataEvent(this, ListDataEvent.INTERVAL_ADDED, index1,index2)); }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/JEditTextArea.java File path: /jEdit-4.2/src/org/gjt/sp/util/Log.java
Method name: Selection getSelectionAtOffset(int) Method name: void fireIntervalAdded(int, int)
Number of AST nodes: 4 Number of AST nodes: 3
1
for(int i = 0; i < selection.size(); i++)
1
for(int i = 0; i < listeners.size(); i++)
2
			{
2
			{
3
				Selection s = (Selection)selection.elementAt(i);
3
				
4
				if(offset >= s.start && offset <= s.end)
5
					return s
4
ListDataListener listener = (ListDataListener)
5
					listeners.elementAt(i);
6
				listener.intervalAdded(new ListDataEvent(this,
7
					ListDataEvent.INTERVAL_ADDED,
6
;
8
					index1,index2));
7
			}
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.1
Clones locationClones are in different classes
Number of node comparisons1