try {
visitAll(new Visitor() {
public void visit(IRubyObject key, IRubyObject value) {
if (equalInternal(context, obj, key)) {
throw new FoundPair(key, value);
}
}
});
return context.getRuntime().getNil();
} catch (FoundPair found) {
return context.getRuntime().newArray(found.key, found.value);
}
try {
visitAll(new Visitor() {
public void visit(IRubyObject key, IRubyObject value) {
if (equalInternal(context, obj, value)) {
throw new FoundPair(key, value);
}
}
});
return context.getRuntime().getNil();
} catch (FoundPair found) {
return context.getRuntime().newArray(found.key, found.value);
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
|
Method name: IRubyObject assoc(ThreadContext, IRubyObject)
|
|
Method name: IRubyObject rassoc(ThreadContext, IRubyObject)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | try {↵ | | 1 | try {↵
|
2 | visitAll(new Visitor() {↵ | | 2 | visitAll(new Visitor() {↵
|
3 | public void visit(IRubyObject key, IRubyObject value) {↵ | | 3 | public void visit(IRubyObject key, IRubyObject value) {↵
|
4 | if (equalInternal(context, obj, key)) {↵ | | 4 | if (equalInternal(context, obj, value)) {↵
|
5 | throw new FoundPair(key, value);↵ | | 5 | throw new FoundPair(key, value);↵
|
6 | }↵ | | 6 | }↵
|
7 | }↵ | | 7 | }↵
|
8 | });↵ | | 8 | });↵
|
9 | return context.getRuntime().getNil();↵ | | 9 | return context.getRuntime().getNil();↵
|
10 | } catch (FoundPair found) {↵ | | 10 | } catch (FoundPair found) {↵
|
11 | return context.getRuntime().newArray(found.key, found.value);↵ | | 11 | return context.getRuntime().newArray(found.key, found.value);↵
|
12 | } | | 12 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1.2 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | try | | 1 | try |
2 | visitAll(new Visitor() {...}); | | 2 | visitAll(new Visitor() {...}); |
3 | return context.getRuntime().getNil(); | | 3 | return context.getRuntime().getNil(); |
Precondition Violations (0)
Row |
Violation |