void fireStatusChanged(WorkThread thread) { final Object[] listeners = listenerList.getListenerList(); if(listeners.length != 0) { int index = 0; for(int i = 0; i < threads.length; i++) { if(threads[i] == thread) { index = i; break; } } for(int i = listeners.length - 2; i >= 0; i--) { if(listeners[i] == WorkThreadProgressListener.class) { ((WorkThreadProgressListener)listeners[i+1]) .statusUpdate(WorkThreadPool.this,index);
void fireProgressChanged(WorkThread thread) { final Object[] listeners = listenerList.getListenerList(); if(listeners.length != 0) { int index = 0; for(int i = 0; i < threads.length; i++) { if(threads[i] == thread) { index = i; break; } } for(int i = listeners.length - 2; i >= 0; i--) { if(listeners[i] == WorkThreadProgressListener.class) { ((WorkThreadProgressListener)listeners[i+1]) .progressUpdate(WorkThreadPool.this,index);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/util/WorkThreadPool.java File path: /jEdit-4.2/src/org/gjt/sp/util/WorkThreadPool.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void fireStatusChanged(WorkThread thread)
1
void fireProgressChanged(WorkThread thread)
2
	{
2
	{
3
		final Object[] listeners = listenerList.getListenerList();
3
		final Object[] listeners = listenerList.getListenerList();
4
		if(listeners.length != 0)
4
		if(listeners.length != 0)
5
		{
5
		{
6
			int index = 0;
6
			int index = 0;
7
			for(int i = 0; i < threads.length; i++)
7
			for(int i = 0; i < threads.length; i++)
8
			{
8
			{
9
				if(threads[i] == thread)
9
				if(threads[i] == thread)
10
				{
10
				{
11
					index = i;
11
					index = i;
12
					break;
12
					break;
13
				}
13
				}
14
			}
14
			}
15
			for(int i = listeners.length - 2; i >= 0; i--)
15
			for(int i = listeners.length - 2; i >= 0; i--)
16
			{
16
			{
17
				if(listeners[i] == WorkThreadProgressListener.class)
17
				if(listeners[i] == WorkThreadProgressListener.class)
18
				{
18
				{
19
					((WorkThreadProgressListener)listeners[i+1])
19
					((WorkThreadProgressListener)listeners[i+1])
20
						.statusUpdate(WorkThreadPool.this,index);
20
						.progressUpdate(WorkThreadPool.this,index);
21
				
21
				
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