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/DataTypeBinary.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
					// 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) {
4
					if (index != -1) {
5
						if (index == text.length() -1) {
5
						if (index == text.length() -1) {
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
							text = text.substring(0, index) + text.substring(index+1);
9
							text = text.substring(0, index) + text.substring(index+1);
10
						}
10
						}
11
						((IRestorableTextComponent)_theComponent).updateText( text);
11
						((IRestorableTextComponent)_theComponent).updateText( text);
12
						_beepHelper.beep(_theComponent);
12
						_beepHelper.beep(_theComponent);
13
					}
13
					}
14
					e.consume();
14
					e.consume();
15
				}
15
				}
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