if ( statement != null ) // not empty statement
{
Object ret = statement.eval( callstack, interpreter );
if (ret instanceof ReturnControl)
{
switch(((ReturnControl)ret).kind)
{
case RETURN:
returnControl = ret;
breakout = true;
break;
case CONTINUE:
break;
case BREAK:
breakout = true;
break;
if ( statement != null ) // not empty statement
{
// do *not* invoke special override for block... (see above)
Object ret = statement.eval( callstack, interpreter );
if (ret instanceof ReturnControl)
{
switch(((ReturnControl)ret).kind)
{
case RETURN:
returnControl = ret;
breakout = true;
break;
case CONTINUE:
break;
case BREAK:
breakout = true;
break;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/BSHEnhancedForStatement.java
|
|
File path: /jEdit-4.2/src/bsh/BSHForStatement.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if ( statement != null ) // not empty statement↵ | | 1 | if ( statement != null ) // not empty statement↵
|
2 | {↵ | | 2 | {↵
|
| | | 3 | // do *not* invoke special override for block... (see above)↵
|
3 | Object ret = statement.eval( callstack, interpreter );↵ | | 4 | Object ret = statement.eval( callstack, interpreter );↵
|
|
4 | if (ret instanceof ReturnControl)↵ | | 5 | if (ret instanceof ReturnControl)↵
|
5 | {↵ | | 6 | {↵
|
6 | switch(((ReturnControl)ret).kind)↵ | | 7 | switch(((ReturnControl)ret).kind)↵
|
7 | {↵ | | 8 | {↵
|
8 | case RETURN:↵ | | 9 | case RETURN:↵
|
9 | returnControl = ret;↵ | | 10 | returnControl = ret;↵
|
10 | breakout = true;↵ | | 11 | breakout = true;↵
|
11 | break;↵ | | 12 | break;↵
|
|
12 | case CONTINUE:↵ | | 13 | case CONTINUE:↵
|
13 | break;↵ | | 14 | break;↵
|
|
14 | case BREAK:↵ | | 15 | case BREAK:↵
|
15 | breakout = true;↵ | | 16 | breakout = true;↵
|
16 | break;↵ | | 17 | break;↵
|
17 | | | 18 |
|
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 |