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);
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
int index = 0;
1
int index = 0;
2
			for(int i = 0; i < threads.length; i++)
2
			for(int i = 0; i < threads.length; i++)
3
			{
3
			{
4
				if(threads[i] == thread)
4
				if(threads[i] == thread)
5
				{
5
				{
6
					index = i;
6
					index = i;
7
					break;
7
					break;
8
				}
8
				}
9
			}
9
			}
10
			for(int i = listeners.length - 2; i >= 0; i--)
10
			for(int i = listeners.length - 2; i >= 0; i--)
11
			{
11
			{
12
				if(listeners[i] == WorkThreadProgressListener.class)
12
				if(listeners[i] == WorkThreadProgressListener.class)
13
				{
13
				{
14
					((WorkThreadProgressListener)listeners[i+1])
14
					((WorkThreadProgressListener)listeners[i+1])
15
						.statusUpdate(WorkThreadPool.this,index);
15
						.progressUpdate(WorkThreadPool.this,index);
16
				
16
				
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