if ( useBatch ) {
if ( st == null ) {
if ( callable ) {
st = session.getBatcher().prepareBatchCallableStatement( sql );
}
else {
st = session.getBatcher().prepareBatchStatement( sql );
}
}
}
else {
if ( callable ) {
st = session.getBatcher().prepareCallableStatement( sql );
}
else {
st = session.getBatcher().prepareStatement( sql );
if ( useBatch ) {
if ( st == null ) {
if ( callable ) {
st = session.getBatcher().prepareBatchCallableStatement( sql );
}
else {
st = session.getBatcher().prepareBatchStatement( sql );
}
}
}
else {
if ( callable ) {
st = session.getBatcher().prepareCallableStatement( sql );
}
else {
st = session.getBatcher().prepareStatement( sql );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/collection/BasicCollectionPersister.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/collection/OneToManyPersister.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if ( useBatch ) {↵ | | 1 | if ( useBatch ) {↵
|
2 | if ( st == null ) {↵ | | 2 | if ( st == null ) {↵
|
3 | if ( callable ) {↵ | | 3 | if ( callable ) {↵
|
4 | st = session.getBatcher().prepareBatchCallableStatement( sql );↵ | | 4 | st = session.getBatcher().prepareBatchCallableStatement( sql );↵
|
5 | }↵ | | 5 | }↵
|
6 | else {↵ | | 6 | else {↵
|
7 | st = session.getBatcher().prepareBatchStatement( sql );↵ | | 7 | st = session.getBatcher().prepareBatchStatement( sql );↵
|
8 | }↵ | | 8 | ↵
|
| | | 9 | }↵
|
9 | }↵ | | 10 | }↵
|
10 | }↵ | | 11 | ↵
|
| | | 12 | }↵
|
11 | else {↵ | | 13 | else {↵
|
12 | if ( callable ) {↵ | | 14 | if ( callable ) {↵
|
13 | st = session.getBatcher().prepareCallableStatement( sql );↵ | | 15 | st = session.getBatcher().prepareCallableStatement( sql );↵
|
14 | }↵ | | 16 | ↵
|
| | | 17 | }↵
|
15 | else {↵ | | 18 | else {↵
|
16 | st = session.getBatcher().prepareStatement( sql );↵ | | 19 | st = session.getBatcher().prepareStatement( sql );↵
|
17 | | | 20 |
|
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 | |
Number of node comparisons | 0 |