int a = nodeArity();
mk = ((Integer)marks.pop()).intValue();
while (a-- > 0) {
Node c = popNode();
c.jjtSetParent(n);
n.jjtAddChild(c, a);
}
n.jjtClose();
pushNode(n);
node_created = true;
mk = ((Integer)marks.pop()).intValue();
while (num-- > 0) {
Node c = popNode();
c.jjtSetParent(n);
n.jjtAddChild(c, num);
}
n.jjtClose();
pushNode(n);
node_created = true;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/JJTParserState.java
|
|
File path: /jEdit-4.2/src/bsh/JJTParserState.java
|
Method name: void closeNodeScope(Node, boolean)
|
|
Method name: void closeNodeScope(Node, int)
|
Number of AST nodes: 9
|
|
Number of AST nodes: 8
|
|
1 | int a = nodeArity();↵ | | |
|
2 | mk = ((Integer)marks.pop()).intValue();↵ | | 1 | mk = ((Integer)marks.pop()).intValue();↵
|
3 | while (a-- > 0) {↵ | | 2 | while (num-- > 0) {↵
|
4 | Node c = popNode();↵ | | 3 | Node c = popNode();↵
|
5 | c.jjtSetParent(n);↵ | | 4 | c.jjtSetParent(n);↵
|
6 | n.jjtAddChild(c, a);↵ | | 5 | n.jjtAddChild(c, num);↵
|
7 | }↵ | | 6 | ↵
|
8 | ↵ | | 7 | }↵
|
9 | n.jjtClose();↵ | | 8 | n.jjtClose();↵
|
10 | pushNode(n);↵ | | 9 | pushNode(n);↵
|
11 | node_created = true; | | 10 | node_created = true;
|
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.4 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 25 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 8 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 6.2 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | int a = nodeArity(); | | | |
3 | mk = ((Integer)marks.pop()).intValue(); | | 1 | mk = ((Integer)marks.pop()).intValue(); |
4 | while (a-- > 0) | | 2 | while (num-- > 0) |
5 | | | 3 | |
6 | | | 4 | |
7 | | | 5 | |
8 | n.jjtClose(); | | 6 | n.jjtClose(); |
9 | pushNode(n); | | 7 | pushNode(n); |
10 | node_created = true; | | 8 | node_created = true; |
Precondition Violations (0)
Row |
Violation |