void fireClosed() { FrameEvent e = new FrameEvent(this); // 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] == IFrameMediatorListener.class) { ((IFrameMediatorListener) listeners[i + 1]).closed(e); } } } public void fireToolBarVisibilityChanged(boolean visible) { FrameEvent e = new FrameEvent(this, visible); // 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] == IFrameMediatorListener.class) { ((IFrameMediatorListener) listeners[i + 1]) .toolBarVisibilityChanged(e); } }
void fireTaskStatusChanged() { FrameEvent e = new FrameEvent(this); // 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] == IFrameMediatorListener.class) { ((IFrameMediatorListener) listeners[i + 1]) .taskStatusChanged(e); } } } public void fireVisibilityChanged(boolean visible) { FrameEvent e = new FrameEvent(this, visible); // 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] == IFrameMediatorListener.class) { ((IFrameMediatorListener) listeners[i + 1]) .visibilityChanged(e); } }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/frame/DefaultFrameController.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/frame/DefaultFrameController.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void fireClosed() {
1
void fireTaskStatusChanged() {
2
		FrameEvent e = new FrameEvent(this);
2
		FrameEvent e = new FrameEvent(this);
3
		// Guaranteed to return a non-null array
3
		// Guaranteed to return a non-null array
4
		Object[] listeners = listenerList.getListenerList();
4
		Object[] listeners = listenerList.getListenerList();
5
		// Process the listeners last to first, notifying
5
		// Process the listeners last to first, notifying
6
		// those that are interested in this event
6
		// those that are interested in this event
7
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
7
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
8
			if (listeners[i] == IFrameMediatorListener.class) {
8
			if (listeners[i] == IFrameMediatorListener.class) {
9
				((IFrameMediatorListener) listeners[i + 1]).clos
9
				((IFrameMediatorListener) listeners[i + 1])
10
ed(e);
10
						.taskStatusChanged(e);
11
			}
11
			}
12
		}
12
		}
13
	}
13
	}
14
	public void fireToolBarVisibilityChanged(boolean visible) {
14
	public void fireVisibilityChanged(boolean visible) {
15
		FrameEvent e = new FrameEvent(this, visible);
15
		FrameEvent e = new FrameEvent(this, visible);
16
		// Guaranteed to return a non-null array
16
		// Guaranteed to return a non-null array
17
		Object[] listeners = listenerList.getListenerList();
17
		Object[] listeners = listenerList.getListenerList();
18
		// Process the listeners last to first, notifying
18
		// Process the listeners last to first, notifying
19
		// those that are interested in this event
19
		// those that are interested in this event
20
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
20
		for (int i = listeners.length - 2; i >= 0; i -= 2) {
21
			if (listeners[i] == IFrameMediatorListener.class) {
21
			if (listeners[i] == IFrameMediatorListener.class) {
22
				((IFrameMediatorListener) listeners[i + 1])
22
				((IFrameMediatorListener) listeners[i + 1])
23
						.toolBarVisibilityChanged(e);
23
						.visibilityChanged(e);
24
			}
24
			}
25
		}
25
		}
26
	
26
	
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