File path: /jruby-1.4.0/src/org/jruby/runtime/builtin/InstanceVariableTable.java | File path: /jruby-1.4.0/src/org/jruby/runtime/builtin/InstanceVariableTable.java | |||
Method name: void visit(Visitor)
|
Method name: void visit(TryLockVisitor)
|
|||
Number of AST nodes: 5 | Number of AST nodes: 5 | |||
1 | Object[]table = packedVTable; ↵ | 1 | Object[]table = packedVTable; ↵ | |
2 | if (table != null) {↵ | 2 | if (table != null) {↵ | |
3 | for (int i = 0; i < vTableSize; i++) {↵ | 3 | for (int i = 0; i < vTableSize; i++) {↵ | |
4 | visitor.visit((String)table[i], table[i + MAX_PACKED]);↵ | 4 | visitor.visit((String)table[i], table[i + MAX_PACKED]);↵ | |
5 | }↵ | 5 | }↵ | |
6 | return;↵ | 6 | return;↵ | |
7 | } | 7 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
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 | 10 |
Number of mapped statements | 5 |
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) | 0.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2 | Object[] table = packedVTable; | 2 | Object[] table = packedVTable; | |||||||||||
3 | if (table != null) | 3 | if (table != null) | |||||||||||
4 | for (int i = 0; i < vTableSize; i++) | 4 | for (int i = 0; i < vTableSize; i++) | |||||||||||
5 | visitor.visit((String)table[i], table[i + MAX_PACKED]); |
| 5 | visitor.visit((String)table[i], table[i + MAX_PACKED]); | ||||||||||
6 | return; |
| 6 | return; |
Row | Violation |
---|---|
1 | Conditional return; |
2 | Conditional return; |