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(); }
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/DataTypeBigDecimal.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
int index = text.indexOf(c);
1
int index = text.indexOf(c);
2
					if (-1 != index)
3
					{
4
						
2
               if (index != -1) {
5
if (index == text.length() - 1)
3
	               if (index == text.length() -1)
6
						{
7
							
4
 {
8
text = text.substring(0, text.length() - 1);	// truncate string
5
	                  text = text.substring(0, text.length()-1);	// truncate string
9
						}
6
	
10
						else
11
						{
12
							
7
               }
8
	               else {
13
text = text.substring(0, index) + text.substring(index + 1);
9
	                  text = text.substring(0, index) + text.substring(index+1);
14
						}
10
	
15
						
11
               }
16
((IRestorableTextComponent) _theComponent).updateText(text);
12
	               ((IRestorableTextComponent)_theComponent).updateText( text);
17
						_beepHelper.beep(_theComponent);
13
	               _beepHelper.beep(_theComponent);
18
						
14
               }
19
e.consume();
15
               e.consume();
20
					}
16
            
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