for(int i = listeners.length - 2; i >= 0; i--)
{
if(listeners[i] == WorkThreadProgressListener.class)
{
((WorkThreadProgressListener)listeners[i+1])
.statusUpdate(WorkThreadPool.this,index);
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 | for(int i = listeners.length - 2; i >= 0; i--)↵ | | 1 | for(int i = listeners.length - 2; i >= 0; i--)↵
|
2 | {↵ | | 2 | {↵
|
3 | if(listeners[i] == WorkThreadProgressListener.class)↵ | | 3 | if(listeners[i] == WorkThreadProgressListener.class)↵
|
4 | {↵ | | 4 | {↵
|
5 | ((WorkThreadProgressListener)listeners[i+1])↵ | | 5 | ((WorkThreadProgressListener)listeners[i+1])↵
|
6 | .statusUpdate(WorkThreadPool.this,index);↵ | | 6 | .progressUpdate(WorkThreadPool.this,index);↵
|
7 | | | 7 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |