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