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/DataTypeBoolean.java
|
|
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/datasetviewer/cellcomponent/DataTypeTimestamp.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 (index != -1)↵ | | 2 | if (index != -1)↵
|
3 | {↵ | | |
|
4 | ↵ | | 3 | {↵
|
5 | if (index == text.length() - 1)↵ | | 4 | if (index == text.length() -1)↵
|
6 | {↵ | | |
|
7 | ↵ | | 5 | {↵
|
8 | text = text.substring(0, text.length() - 1); // truncate string↵ | | 6 | text = text.substring(0, text.length()-1); // truncate string↵
|
9 | }↵ | | 7 | ↵
|
10 | else↵ | | |
|
11 | {↵ | | |
|
12 | ↵ | | 8 | }↵
|
| | | 9 | else {↵
|
13 | text = text.substring(0, index) + text.substring(index + 1);↵ | | 10 | text = text.substring(0, index) + text.substring(index+1);↵
|
14 | }↵ | | 11 | ↵
|
15 | ↵ | | 12 | }↵
|
16 | ((IRestorableTextComponent) _theComponent).updateText(text);↵ | | 13 | ((IRestorableTextComponent)_theComponent).updateText( text);↵
|
17 | _beepHelper.beep(_theComponent);↵ | | 14 | _beepHelper.beep(_theComponent);↵
|
18 | }↵ | | |
|
19 | ↵ | | 15 | }↵
|
20 | e.consume(); | | 16 | e.consume();
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 23 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 8 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 3.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
13 | int index = text.indexOf(c); | | 5 | int index = text.indexOf(c); |
14 | if (index != -1) | | 6 | if (index != -1) |
15 | if (index == text.length() - 1) | | 7 | if (index == text.length() - 1) |
16 | text = text.substring(0, text.length() - 1); | | 8 | text = text.substring(0, text.length() - 1); |
| | | | |
17 | text = text.substring(0, index) + text.substring(index + 1); | | 9 | text = text.substring(0, index) + text.substring(index + 1); |
18 | ((IRestorableTextComponent)_theComponent).updateText(text); | | 10 | ((IRestorableTextComponent)_theComponent).updateText(text); |
19 | _beepHelper.beep(_theComponent); | | 11 | _beepHelper.beep(_theComponent); |
20 | e.consume(); | | 12 | e.consume(); |
Precondition Violations (1)
Row |
Violation |
1 | The refactoring of the clones is infeasible, because classes net.sourceforge.squirrel_sql.fw.datasetviewer.cellcomponent.DataTypeBoolean.KeyTextHandler and net.sourceforge.squirrel_sql.fw.datasetviewer.cellcomponent.DataTypeTimestamp.KeyTextHandler do not have a common superclass |