if (c == KeyEvent.VK_TAB || c == KeyEvent.VK_ENTER) { // remove all instances of the offending char int index = text.indexOf(c); if (index != -1) { if (index == text.length() -1) { text = text.substring(0, text.length()-1); // truncate string } else { text = text.substring(0, index) + text.substring(index+1); } ((IRestorableTextComponent)_theComponent).updateText( text); _beepHelper.beep(_theComponent); } e.consume(); }
if (c == KeyEvent.VK_TAB || c == KeyEvent.VK_ENTER) { // remove all instances of the offending char int index = text.indexOf(c); if(-1 != index) { if (index == text.length() -1) { text = text.substring(0, text.length()-1); // truncate string } else { text = text.substring(0, index) + text.substring(index+1); } } ((IRestorableTextComponent)_theComponent).updateText( text); _beepHelper.beep(_theComponent); e.consume(); }
Clone fragments detected by clone detection tool
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/datasetviewer/cellcomponent/DataTypeByte.java File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/datasetviewer/cellcomponent/DataTypeInteger.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (c == KeyEvent.VK_TAB || c == KeyEvent.VK_ENTER) {
1
if (c == KeyEvent.VK_TAB || c == KeyEvent.VK_ENTER) {
2
					// remove all instances of the offending char
2
					// remove all instances of the offending char
3
					int index = text.indexOf(c);
3
					int index = text.indexOf(c);
4
					if (index != -1) {
5
						
4
               if(-1 != index)
5
               {
6
if (index == text.length() -1) {
6
                  if (index == text.length() -1) {
7
							text = text.substring(0, text.length()-1);	// truncate string
7
                     text = text.substring(0, text.length()-1);	// truncate string
8
						}
9
						else {
10
							
8
                  }
9
                  else {
11
text = text.substring(0, index) + text.substring(index+1);
10
                     text = text.substring(0, index) + text.substring(index+1);
12
						}
13
	
11
                  }
12
               }
14
					((IRestorableTextComponent)_theComponent).updateText( text);
13
					((IRestorableTextComponent)_theComponent).updateText( text);
15
						_beepHelper.beep(_theComponent);
14
					_beepHelper.beep(_theComponent);
16
					}
15
					
17
					e.consume();
16
e.consume();
18
				}
17
				}
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