Object[] listeners = listenerList.getListenerList(); // Process the listeners last to first, notifying // those that are interested in this event for (int i = listeners.length - 2; i >= 0; i -= 2) { if (listeners[i] == IResultListener.class) { ((IResultListener) listeners[i + 1]).finished(e); } } } /** * Propagates an event to all registered listeners */ protected void fireClearSearch(String searchTerm) { IResultEvent e = new ResultEvent(this, searchTerm); // Guaranteed to return a non-null array Object[] listeners = listenerList.getListenerList(); // Process the listeners last to first, notifying // those that are interested in this event for (int i = listeners.length - 2; i >= 0; i -= 2) { if (listeners[i] == IResultListener.class) { ((IResultListener) listeners[i + 1]).clearSearch(e); } }
Object[] listeners = listenerList.getListenerList(); // Process the listeners last to first, notifying // those that are interested in this event for (int i = listeners.length - 2; i >= 0; i -= 2) { if (listeners[i] == IContextResultListener.class) { ((IContextResultListener) listeners[i + 1]).finished(e); } } } void fireResultArrived(final String providerName) { final IContextResultEvent e = new ContextResultEvent(this, providerName); // Guaranteed to return a non-null array final Object[] listeners = listenerList.getListenerList(); // Process the listeners last to first, notifying // those that are interested in this event for (int i = listeners.length - 2; i >= 0; i -= 2) { if (listeners[i] == IContextResultListener.class) { ((IContextResultListener) listeners[i + 1]).resultArrived(e); } }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/search/SearchManager.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/context/ContextSearchManager.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
Object[] listeners = listenerList.getListenerList();
1
Object[] listeners = listenerList.getListenerList();
2
		// Process the listeners last to first, notifying
2
		// Process the listeners last to first, notifying
3
		// those that are interested in this event
3
		// those that are interested in this event
4
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
4
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
5
			if (listeners[i] == IResultListener.class) {
5
			if (listeners[i] == IContextResultListener.class) {
6
				((IResultListener) listeners[i + 1]).finished(e);
6
				((IContextResultListener) listeners[i + 1]).finished(e);
7
			}
7
			}
8
		}
8
		}
9
	}
9
	}
10
	/**
10
	
11
	 * Propagates an event to all registered listeners
12
	 */
13
	protected void fireClearSearch(String searchTerm) {
11
void fireResultArrived(final String providerName) {
14
		IResultEvent e = new ResultEvent(this, searchTerm);
12
		final IContextResultEvent e = new ContextResultEvent(this, providerName);
15
		// Guaranteed to return a non-null array
13
		// Guaranteed to return a non-null array
16
		Object[] listeners = listenerList.getListenerList();
14
		final Object[] listeners = listenerList.getListenerList();
17
		// Process the listeners last to first, notifying
15
		// Process the listeners last to first, notifying
18
		// those that are interested in this event
16
		// those that are interested in this event
19
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
17
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
20
			if (listeners[i] == IResultListener.class) {
18
			if (listeners[i] == IContextResultListener.class) {
21
				((IResultListener) listeners[i + 1]).clearSearch(e);
19
				((IContextResultListener) listeners[i + 1]).resultArrived(e);
22
			}
20
			}
23
		}
21
		}
24
	
22
	
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