public static ConnectionReleaseMode parse(String modeName) throws HibernateException {
if ( AFTER_STATEMENT.name.equals( modeName ) ) {
return AFTER_STATEMENT;
}
else if ( AFTER_TRANSACTION.name.equals( modeName ) ) {
return AFTER_TRANSACTION;
}
else if ( ON_CLOSE.name.equals( modeName ) ) {
return ON_CLOSE;
}
throw new HibernateException( "could not determine appropriate connection release mode [" + modeName + "]" );
private Object readResolve() throws ObjectStreamException {
if ( name.equals( NONE.name ) ) {
return NONE;
}
else if ( name.equals( FULL.name ) ) {
return FULL;
}
else if ( name.equals( PARTIAL.name ) ) {
return PARTIAL;
}
else {
throw new StreamCorruptedException( "unrecognized value inclusion [" + name + "]" );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/ConnectionReleaseMode.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/engine/ValueInclusion.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public static ConnectionReleaseMode parse(String modeName) throws HibernateException {↵ | | 1 | private Object readResolve() throws ObjectStreamException {
↵
|
2 | if ( AFTER_STATEMENT.name.equals( modeName ) ) {↵ | | 2 | if ( name.equals( NONE.name ) ) {
↵
|
3 | return AFTER_STATEMENT;↵ | | 3 | return NONE;
↵
|
4 | }↵ | | 4 | }
↵
|
5 | else if ( AFTER_TRANSACTION.name.equals( modeName ) ) {↵ | | 5 | else if ( name.equals( FULL.name ) ) {
↵
|
6 | return AFTER_TRANSACTION;↵ | | 6 | return FULL;
↵
|
7 | }↵ | | 7 | }
↵
|
8 | else if ( ON_CLOSE.name.equals( modeName ) ) {↵ | | 8 | else if ( name.equals( PARTIAL.name ) ) {
↵
|
9 | return ON_CLOSE;↵ | | 9 | return PARTIAL;
↵
|
10 | }↵ | | 10 | }
↵
|
11 | throw new Hiberna↵ | | 11 | else {↵
|
12 | teException( "could not determine appropriate connection release mode [" + modeName + "]" );↵ | | 12 | throw new StreamCorruptedException( "unrecognized value inclusion [" + name + "]" );
↵
|
13 | | | 13 |
|
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 |