super(subIndex);
this.token = token;
this.min = min;
this.max = max;
super(stream);
this.stream = new CharIndexedReader(stream,0);
this.expr = expr;
this.replace = replace;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/RETokenRepeated.java
|
|
File path: /jEdit-4.2/src/gnu/regexp/REFilterReader.java
|
Method name: void RETokenRepeated(int, REToken, int, int)
|
|
Method name: void REFilterReader(Reader, RE, String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | super(subIndex);↵ | | 1 | super(s↵
|
2 | this.token = token;↵ | | |
|
3 | this.min = min;↵ | | |
|
4 | this.max = max↵ | | 2 | tream);↵
|
| | | 3 | this.stream = new CharIndexedReader(stream,0);↵
|
| | | 4 | this.expr = expr;↵
|
5 | ; | | 5 | this.replace = replace;
|
See real code fragment |
|
See real code fragment |
Summary
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 12 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 3 |
Number of unmapped statements in the second code fragment | 3 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
| | | 1 | super(stream); |
1 | super(subIndex); | | | |
| | | 2 | this.stream = new CharIndexedReader(stream, 0); |
2 | this.token = token; | | 3 | this.expr = expr; |
3 | this.min = min; | | | |
| | | 4 | this.replace = replace; |
4 | this.max = max; | | | |
Precondition Violations (2)
Row |
Violation |
1 | Expression this.token is a field being modified, and thus it cannot be parameterized |
2 | Expression this.expr is a field being modified, and thus it cannot be parameterized |