if(in != null)
{
try
{
in.close();
}
catch(IOException io)
{
}
}
buffer.setBooleanProperty(ERROR_OCCURRED,true);
while(requestCount != 0)
{
try
{
waitForAllLock.wait();
}
catch(InterruptedException ie)
{
Log.log(Log.ERROR,this,ie);
}
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/buffer/BufferIORequest.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/util/WorkThreadPool.java
|
Method name: void load()
|
|
Method name: void waitForRequests()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | if(in != null)↵ | | 1 | while(requestCount != 0)↵
|
2 | {↵ | | 2 | {↵
|
3 | try↵ | | 3 | try↵
|
4 | {↵ | | 4 | {↵
|
5 | in.close();↵ | | 5 | waitForAllLock.wait();↵
|
6 | }↵ | | 6 | }↵
|
7 | catch(IOException io)↵ | | 7 | catch(InterruptedException ie)↵
|
8 | {↵ | | 8 | {↵
|
9 | }↵ | | 9 | ↵
|
10 | }↵ | | |
|
|
11 | buffer.setBooleanProperty(ERROR_OCCURRED,true); | | 10 | Log.log(Log.ERROR,this,ie);↵
|
| | | 11 | }↵
|
| | | 12 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 0 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 0 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Unknown type |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
Precondition Violations (0)
Row |
Violation |