super(subIndex);
this.where = where;
this.negated = negated;
setMessage(s);
this.node = node;
// freeze the callstack for the stack trace.
if ( callstack != null )
this.callstack = callstack.copy();
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/RETokenWordBoundary.java
|
|
File path: /jEdit-4.2/src/bsh/EvalError.java
|
Method name: void RETokenWordBoundary(int, int, boolean)
|
|
Method name: void EvalError(String, SimpleNode, CallStack)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | super(subIndex);↵ | | 1 | setMessage(s);↵
|
2 | this.where = where;↵ | | 2 | this.↵
|
3 | this.negated = negated↵ | | 3 | node = node;↵
|
| | | 4 | // freeze the callstack for the stack trace.↵
|
| | | 5 | if ( callstack != null )↵
|
4 | ; | | 6 | this.callstack = callstack.copy();
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 6 |