if ((c==KeyEvent.VK_BACK_SPACE) || (c == KeyEvent.VK_DELETE)) { // delete when null => original value DataTypeShort.this._textComponent.restoreText(); e.consume(); } else { // non-delete when null => clear field and add text DataTypeShort.this._textComponent.updateText(""); // fall through to normal processing of this key stroke }
if ((c == KeyEvent.VK_BACK_SPACE) || (c == KeyEvent.VK_DELETE)) { // delete when null => original value DerbyClobDataTypeComponent.this._textComponent.restoreText(); e.consume(); } else { // non-delete when null => clear field and add text DerbyClobDataTypeComponent.this._textComponent.updateText(""); // fall through to normal processing of this key stroke }
Clone fragments detected by clone detection tool
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/datasetviewer/cellcomponent/DataTypeShort.java File path: /sql12/plugins/derby/src/net/sourceforge/squirrel_sql/plugins/derby/types/DerbyClobDataTypeComponent.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if ((c==KeyEvent.VK_BACK_SPACE) || (c == KeyEvent.VK_DELETE)) {
1
if ((c == KeyEvent.VK_BACK_SPACE) || (c == KeyEvent.VK_DELETE)) {
2
							// delete when null => original value
2
                  // delete when null => original value
3
							DataTypeShort.this._textComponent.restoreText();
4
							e.consume();
5
						}
6
						else {
7
							
3
                  DerbyClobDataTypeComponent.this._textComponent.restoreText();
4
                  e.consume();
5
               } else {
8
// non-delete when null => clear field and add text
6
                  // non-delete when null => clear field and add text
9
							DataTypeShort.this._textComponent.updateText("");
7
                  DerbyClobDataTypeComponent.this._textComponent.updateText("");
10
							// fall through to normal processing of this key stroke
8
                  // fall through to normal processing of this key stroke
11
						}
9
               }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0