if ( type instanceof BSHAmbiguousName ) { BSHAmbiguousName name = (BSHAmbiguousName)type; if (args instanceof BSHArguments) return objectAllocation(name, (BSHArguments)args, callstack, interpreter ); else return objectArrayAllocation(name, (BSHArrayDimensions)args, callstack, interpreter ); } else return primitiveArrayAllocation((BSHPrimitiveType)type, (BSHArrayDimensions)args, callstack, interpreter );
else if(lhs instanceof Long) return longBinaryOperation((Long)lhs, (Long)rhs, kind); else if(lhs instanceof Float) return floatBinaryOperation((Float)lhs, (Float)rhs, kind); else if(lhs instanceof Double) return doubleBinaryOperation( (Double)lhs, (Double)rhs, kind); else throw new UtilEvalError("Invalid types in binary operator" );
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/BSHAllocationExpression.java File path: /jEdit-4.2/src/bsh/Primitive.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if ( type instanceof BSHAmbiguousName )
1
else if(lhs instanceof Long)
2
        {
2
        
3
            BSHAmbiguousName name = (BSHAmbiguousName)type;
3
    
4
return longBinaryOperation((Long)lhs, (Long)rhs, kind);
4
            if (args instanceof BSHArguments)
5
        else if(lhs instanceof 
5
   
6
Float)
6
             return objectAllocation(name, (BSHArguments)args, 
7
            return 
7
					callstack, interpreter );
8
   
8
floatBinaryOperation((Float)lhs, (Float)rhs, kind);
9
         else
9
        else
10
                return objectArrayAllocation(name, (BSHArrayDimensions)args, 
11
					callstack
10
 if(lhs instanceof Double)
12
, interpreter );
11
            return doubleBinaryOperation( (Double)lhs, (Double)rhs, kind);
13
        }
14
        else
12
        else
15
            return primitiveArrayAllocation((BSHPrimitiveType)type,
13
            
16
                (BSHArrayDimensions)args, callstack, interpreter );
17
    
14
throw new UtilEvalError("Invalid types in binary operator" );
15
	
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0