boolean sort = jEdit.getBooleanProperty("sortRecent");
int maxItems = jEdit.getIntegerProperty("menu.spillover",20);
boolean sort = jEdit.getBooleanProperty("sortRecent");
int maxItems = jEdit.getIntegerProperty("menu.spillover",20);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/menu/RecentDirectoriesProvider.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/menu/RecentFilesProvider.java
|
Method name: void update(JMenu)
|
|
Method name: void update(JMenu)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | boolean sort = jEdit.getBooleanProperty("sortRecent");↵ | | 1 | boolean sort = jEdit.getBooleanProperty("sortRecent");↵
|
|
2 | int maxItems = jEdit.getIntegerProperty("menu.spillover",20); | | 2 | int maxItems = jEdit.getIntegerProperty("menu.spillover",20);
|
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 4 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 2 |
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) | 0.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | boolean sort = jEdit.getBooleanProperty("sortRecent"); | | 11 | boolean sort = jEdit.getBooleanProperty("sortRecent"); |
11 | int maxItems = jEdit.getIntegerProperty("menu.spillover", 20); | | 12 | int maxItems = jEdit.getIntegerProperty("menu.spillover", 20); |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variables sort, maxItems , while Clone fragment #2 returns variables sort, maxItems |