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();
}
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);
}
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/DataTypeFloat.java
|
Method name: void keyTyped(KeyEvent)
|
|
Method name: void keyTyped(KeyEvent)
|
Number of AST nodes: 7
|
|
Number of AST nodes: 6
|
|
1 | if (-1 != index)↵ | | 1 | if (↵
|
2 | {↵ | | |
|
3 | ↵ | | 2 | index != -1) {↵
|
4 | if (index == text.length() - 1)↵ | | 3 | if (index == text.length() -1)↵
|
5 | {↵ | | |
|
6 | ↵ | | 4 | {↵
|
7 | text = text.substring(0, text.length() - 1); // truncate string↵ | | 5 | text = text.substring(0, text.length()-1); // truncate string↵
|
8 | }↵ | | 6 | ↵
|
9 | else↵ | | |
|
10 | {↵ | | |
|
11 | ↵ | | 7 | }↵
|
| | | 8 | else {↵
|
12 | text = text.substring(0, index) + text.substring(index + 1);↵ | | 9 | text = text.substring(0, index) + text.substring(index+1);↵
|
13 | }↵ | | 10 | ↵
|
14 | ↵ | | 11 | }↵
|
15 | ((IRestorableTextComponent) _theComponent).updateText(text);↵ | | 12 | ((IRestorableTextComponent)_theComponent).updateText( text);↵
|
16 | _beepHelper.beep(_theComponent);↵ | | 13 | _beepHelper.beep(_theComponent);↵
|
17 | e.consume();↵ | | |
|
18 | } | | 14 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.5 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 22 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 6 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 3.7 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
6 | if (-1 != index) | | 6 | if (index != -1) |
7 | if (index == text.length() - 1) | | 7 | if (index == text.length() - 1) |
8 | text = text.substring(0, text.length() - 1); | | 8 | text = text.substring(0, text.length() - 1); |
| | | | |
9 | text = text.substring(0, index) + text.substring(index + 1); | | 9 | text = text.substring(0, index) + text.substring(index + 1); |
10 | ((IRestorableTextComponent)_theComponent).updateText(text); | | 10 | ((IRestorableTextComponent)_theComponent).updateText(text); |
11 | _beepHelper.beep(_theComponent); | | 11 | _beepHelper.beep(_theComponent); |
12 | | | | |
Precondition Violations (0)
Row |
Violation |