try {
while (bufsize <= index) bufsize += BUFFER_INCREMENT;
br.reset();
br.mark(bufsize);
br.skip(index-1);
} catch (IOException e) { }
try
{
wait();
}
catch (InterruptedException e)
{
--waitingWriters;
Log.log(Log.ERROR,this,e);
return;
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedReader.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/util/ReadWriteLock.java
|
Method name: char charAt(int)
|
|
Method name: void writeLock()
|
Number of AST nodes: 6
|
|
Number of AST nodes: 2
|
|
1 | try {↵ | | 1 | try↵
|
2 | while (bufsize <= index) bufsize += BUFFER_INCREMENT;↵ | | |
|
3 | br.reset();↵ | | |
|
4 | br.mark(bufsize);↵ | | |
|
5 | br.skip(index-1);↵ | | |
|
6 | } catch (IOException e) { ↵ | | |
|
| | | 2 | {↵
|
| | | 3 | wait();↵
|
| | | 4 | }↵
|
| | | 5 | catch (InterruptedException e)↵
|
| | | 6 | {↵
|
| | | 7 | --waitingWriters;↵
|
| | | 8 | Log.log(Log.ERROR,this,e);↵
|
| | | 9 | return;↵
|
7 | } | | 10 | }
|
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 |