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