for(int i = 0; i < listeners.length; i++) { if(listeners[i] == BrowserListener.class) { BrowserListener l = (BrowserListener)listeners[i+1]; l.filesActivated(this,selectedFiles);
for(int i = 0; i < listeners.length; i++) { if(listeners[i] == BrowserListener.class) { BrowserListener l = (BrowserListener)listeners[i+1]; l.filesSelected(this,selectedFiles);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/browser/VFSBrowser.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/browser/VFSBrowser.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for(int i = 0; i < listeners.length; i++)
1
for(int i = 0; i < listeners.length; i++)
2
		{
2
		{
3
			if(listeners[i] == BrowserListener.class)
3
			if(listeners[i] == BrowserListener.class)
4
			{
4
			{
5
				BrowserListener l = (BrowserListener)listeners[i+1];
5
				BrowserListener l = (BrowserListener)listeners[i+1];
6
				l.filesActivated(this,selectedFiles);
6
				l.filesSelected(this,selectedFiles);
7
			
7
			
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