try
{
wait();
}
catch (InterruptedException e)
{
--waitingWriters;
Log.log(Log.ERROR,this,e);
return;
}
Buffer[] buffers = new Buffer[bufferCount];
Buffer buffer = buffersFirst;
for(int i = 0; i < bufferCount; i++)
{
buffers[i] = buffer;
buffer = buffer.next;
}
return buffers;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/util/ReadWriteLock.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/jEdit.java
|
Method name: void writeLock()
|
|
Method name: Buffer[] getBuffers()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 6
|
|
1 | try↵ | | |
|
2 | {↵ | | |
|
3 | wait();↵ | | |
|
4 | }↵ | | |
|
5 | catch (InterruptedException e)↵ | | |
|
6 | {↵ | | |
|
7 | --waitingWrit↵ | | 1 | Buffer[] buffers = new Buffer[bufferCount];↵
|
| | | 2 | Buffer buffer = buffersFirst;↵
|
| | | 3 | for(int i = 0; i < bufferCount; i++)↵
|
| | | 4 | {↵
|
8 | ers;↵ | | 5 | buffers[i] = buffer;↵
|
9 | Log.log(Log.ERROR,this,e);↵ | | 6 | ↵
|
10 | return;↵ | | |
|
11 | } | | 7 | buffer = buffer.next;↵
|
| | | 8 | }↵
|
| | | 9 | return buffers;
|
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 | Clones are in different classes |
Number of node comparisons | 1 |