File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java | File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java | |||
Method name: Token processNegativelookahead()
|
Method name: Token processNegativelookbehind()
|
|||
Number of AST nodes: 6 | Number of AST nodes: 6 | |||
1 | this.next();↵ | 1 | this.next();↵ | |
2 | Token tok = Token.createLook(Token.NEGATIVELOOKAHEAD, this.parseRegex());↵ | 2 | Token tok = Token.createLook(Token.NEGATIVELOOKBEHIND, this.parseRegex());↵ | |
3 | if (this.read() != T_RPAREN) throw ex("parser.factor.1", this.offset-1);↵ | 3 | if (this.read() != T_RPAREN) throw ex("parser.factor.1", this.offset-1);↵ | |
4 | this.next(); // ')'↵ | 4 | this.next(); // ')'↵ | |
5 | return tok; | 5 |
| |
See real code fragment | See real code fragment |
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.2 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 14 |
Number of mapped statements | 6 |
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) | 9.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | this.next(); | 1 | this.next(); | |||||||||||
2 | Token tok = Token.createLook(Token.NEGATIVELOOKAHEAD, this.parseRegex()); |
| 2 | Token tok = Token.createLook(Token.NEGATIVELOOKBEHIND, this.parseRegex()); | ||||||||||
3 | if (this.read() != T_RPAREN) | 3 | if (this.read() != T_RPAREN) | |||||||||||
4 | throw ex("parser.factor.1", this.offset - 1); | 4 | throw ex("parser.factor.1", this.offset - 1); | |||||||||||
5 | this.next(); | 5 | this.next(); | |||||||||||
6 | return tok; | 6 | return tok; |
Row | Violation |
---|