public Collection<?> getCollection()
{
return collection;
}
/**
* This returns the position at which the objects will be added.
*/
public int getIndex()
{
return index;
public Collection<?> getCollection()
{
return collection;
}
/**
* This returns the index at which to reinsert the replace objects during an undo so as to achieve the original list order.
*/
public int getIndex()
{
return index;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/edit/command/AddCommand.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/edit/command/ReplaceCommand.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public Collection<?> getCollection()↵ | | 1 | public Collection<?> getCollection()↵
|
2 | {↵ | | 2 | {↵
|
3 | return collection;↵ | | 3 | return collection;↵
|
4 | }↵ | | 4 | }↵
|
|
5 | /**↵ | | 5 | /**↵
|
6 | * This returns the position at which the objects will be added.↵ | | 6 | * This returns the index at which to reinsert the replace objects during an undo so as to achieve the original list order.↵
|
7 | */↵ | | 7 | */ ↵
|
8 | public int getIndex()↵ | | 8 | public int getIndex()↵
|
9 | {↵ | | 9 | {↵
|
10 | return index; | | 10 | return index;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |