while (next != null) {
fileLines.append(next);
fileLines.append("\n");
next = reader.readLine();
}
super.setScriptToTokenize(script);
expandFileIncludes(DERBY_SCRIPT_INCLUDE_PREFIX);
_queryIterator = _queries.iterator();
Clone fragments detected by clone detection tool
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/sql/QueryTokenizer.java
|
|
File path: /sql12/plugins/derby/src/net/sourceforge/squirrel_sql/plugins/derby/tokenizer/DerbyQueryTokenizer.java
|
Method name: List getStatementsFromIncludeFile(String)
|
|
Method name: void setScriptToTokenize(String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | while (next != null) {↵ | | |
|
2 | fileLines.append(next);↵ | | 1 | super.setScriptToTokenize(script);↵
|
3 | ↵ | | 2 | ↵
|
4 | fileLines.append("\n");↵ | | 3 | expandFileIncludes(DERBY_SCRIPT_INCLUDE_PREFIX);↵
|
5 | ↵ | | 4 | ↵
|
6 | next = reader.readLine();↵ | | 5 | ↵
|
7 | } | | 6 | _queryIterator = _queries.iterator();
|
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 having the same super class |
Number of node comparisons | 9 |