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/DataTypeShort.java
Method name: void keyTyped(KeyEvent) Method name: void keyTyped(KeyEvent)
Number of AST nodes: 8 Number of AST nodes: 8
1
int index = text.indexOf(c);
1
int index = text.indexOf(c);
2
					if (-1 != index)
2
					if (
3
					{
3
index != -1) {
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
					}
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.5
Clones locationClones are in different classes having the same super class
Number of node comparisons24
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements7
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)3.5
    Clone typeType 3
    Mapped Statements
    ID Statement ID Statement
    5
    int index = text.indexOf(c);
    8
    int index = text.indexOf(c);
    6
    if (-1 != index)
    6
    if (-1 != index)
    9
    if (index != -1)
    Differences
    Expression1Expression2Difference
    -1indexTYPE_COMPATIBLE_REPLACEMENT
    index-1TYPE_COMPATIBLE_REPLACEMENT
    Preondition Violations
    Expression index cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression index cannot be parameterized, because it has dependencies to/from statements that will be extracted
    9
    if (index != -1)
    7
    if (index == text.length() - 1)
    10
    if (index == text.length() - 1)
    8
    text = text.substring(0, text.length() - 1);
    11
    text = text.substring(0, text.length() - 1);
    else
    else
    9
    text = text.substring(0, index) + text.substring(index + 1);
    12
    text = text.substring(0, index) + text.substring(index + 1);
    10
    ((IRestorableTextComponent)_theComponent).updateText(text);
    13
    ((IRestorableTextComponent)_theComponent).updateText(text);
    11
    _beepHelper.beep(_theComponent);
    14
    _beepHelper.beep(_theComponent);
    12
    e.consume();
                                    
                                    
    15
    e.consume();
    Precondition Violations (2)
    Row Violation
    1Expression index cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression index cannot be parameterized, because it has dependencies to/from statements that will be extracted