for (int i = 0; i < parameterTypes.length; ++i) { if (!isFastIntParam(parameterTypes[i])) { return false; } }
for (int i = start; i < limit; i++) { if (!isNameCharacter(id.charAt(i))) { return false; } }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/FastIntMethodFactory.java File path: /jruby-1.4.0/src/org/jruby/util/IdUtil.java
Method name: boolean isFastIntMethod(Type, Type[]) Method name: boolean isNameString(String, int, int)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < parameterTypes.length; ++i) {
1
for (int i = start; i < limit; i++) {
2
            if (!isFastIntParam(parameterTypes[i])) {
2
            if (!isNameCharacter(id.charAt(i))) {
3
                return false;
3
                return false;
4
            }
4
            }
5
        }
5
        }
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.1
Clones locationClones are in different classes
Number of node comparisons1