private void fireContentInserted(int startLine, int offset,
int numLines, int length)
{
for(int i = 0; i < bufferListeners.size(); i++)
{
try
{
getListener(i).contentInserted(this,startLine,
offset,numLines,length);
}
catch(Throwable t)
{
Log.log(Log.ERROR,this,"Exception while sending buffer event to "+getListener(i)+" :");
Log.log(Log.ERROR,this,t);
private void fireContentRemoved(int startLine, int offset,
int numLines, int length)
{
for(int i = 0; i < bufferListeners.size(); i++)
{
try
{
getListener(i).contentRemoved(this,startLine,
offset,numLines,length);
}
catch(Throwable t)
{
Log.log(Log.ERROR,this,"Exception while sending buffer event to "+getListener(i)+" :");
Log.log(Log.ERROR,this,t);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | private void fireContentInserted(int startLine, int offset,↵ | | 1 | private void fireContentRemoved(int startLine, int offset,↵
|
2 | int numLines, int length)↵ | | 2 | int numLines, int length)↵
|
3 | {↵ | | 3 | {↵
|
4 | for(int i = 0; i < bufferListeners.size(); i++)↵ | | 4 | for(int i = 0; i < bufferListeners.size(); i++)↵
|
5 | {↵ | | 5 | {↵
|
6 | try↵ | | 6 | try↵
|
7 | {↵ | | 7 | {↵
|
8 | getListener(i).contentInserted(this,startLine,↵ | | 8 | getListener(i).contentRemoved(this,startLine,↵
|
9 | offset,numLines,length);↵ | | 9 | offset,numLines,length);↵
|
10 | }↵ | | 10 | }↵
|
11 | catch(Throwable t)↵ | | 11 | catch(Throwable t)↵
|
12 | {↵ | | 12 | {↵
|
13 | Log.log(Log.ERROR,this,"Exception while sending buffer event to "+getListener(i)+" :");↵ | | 13 | Log.log(Log.ERROR,this,"Exception while sending buffer event to "+getListener(i)+" :");↵
|
14 | Log.log(Log.ERROR,this,t);↵ | | 14 | Log.log(Log.ERROR,this,t);↵
|
15 | | | 15 |
|
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 |