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();
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/DataTypeBinary.java File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/datasetviewer/cellcomponent/DataTypeBoolean.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 (index != -1) 
2
				if (index != -1)
3
{
3
				{
4
						if (index == text.length() -1) 
4
					if (index == text.length() - 1)
5
{
5
					{
6
							text = text.substring(0, text.length()-1);	// truncate string
6
						text = text.substring(0, text.length() - 1); // truncate string
7
						}
7
					}
8
						else {
8
					else
9
	
9
					{
10
						text = text.substring(0, index) + text.substring(index+1);
10
						text = text.substring(0, index) + text.substring(index + 1);
11
						}
11
					}
12
						((IRestorableTextComponent)_theComponent).updateText( text);
12
					((IRestorableTextComponent) _theComponent).updateText(text);
13
						_beepHelper.beep(_theComponent);
13
					_beepHelper.beep(_theComponent);
14
					}
14
				}
15
					e.consume();
15
				e.consume();
16
				
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