if ( "\"".equals( token ) ) {
String t;
do {
t = tokens.nextToken();
token += t;
}
while ( !"\"".equals( t ) );
}
String t;
do {
t = tokens.nextToken();
token += t;
}
while ( !"'".equals( t ) && tokens.hasMoreTokens() );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/jdbc/util/BasicFormatterImpl.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/jdbc/util/BasicFormatterImpl.java
|
Method name: String perform()
|
|
Method name: String perform()
|
Number of AST nodes: 5
|
|
Number of AST nodes: 4
|
|
1 | if ( "\"".equals( token ) ) {↵ | | |
|
2 | String t;↵ | | 1 | String t;↵
|
3 | do {↵ | | 2 | do {↵
|
4 | t = tokens.nextToken();↵ | | 3 | t = tokens.nextToken();↵
|
5 | token += t;↵ | | 4 | token += t;↵
|
6 | }↵ | | 5 | }↵
|
7 | while ( !"\"".equals( t ) );↵ | | 6 | while ( !"'".equals( t ) ↵
|
8 | } | | 7 | && tokens.hasMoreTokens() );
|
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.1 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |