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