final class Remove implements DelayedOperation {
private int index;
private Object old;
public Remove(int index, Object old) {
this.index = index;
this.old = old;
}
public void operate() {
list.remove(index);
}
public Object getAddedInstance() {
return null;
}
public Object getOrphan() {
return old;
final class Remove implements DelayedOperation {
private Object index;
private Object old;
public Remove(Object index, Object old) {
this.index = index;
this.old = old;
}
public void operate() {
map.remove(index);
}
public Object getAddedInstance() {
return null;
}
public Object getOrphan() {
return old;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentList.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentMap.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | final class Remove implements DelayedOperation {↵ | | 1 | final class Remove implements DelayedOperation {↵
|
2 | private int index;↵ | | 2 | private Object index;↵
|
3 | private Object old;↵ | | 3 | private Object old;↵
|
| | | 4 | ↵
|
4 | public Remove(int index, Object old) {↵ | | 5 | public Remove(Object index, Object old) {↵
|
5 | this.index = index;↵ | | 6 | this.index = index;↵
|
6 | this.old = old;↵ | | 7 | this.old = old;↵
|
7 | }↵ | | 8 | }↵
|
8 | public void operate() {↵ | | 9 | public void operate() {↵
|
9 | list.remove(index);↵ | | 10 | map.remove(index);↵
|
10 | }↵ | | 11 | }↵
|
11 | public Object getAddedInstance() {↵ | | 12 | public Object getAddedInstance() {↵
|
12 | return null;↵ | | 13 | return null;↵
|
13 | }↵ | | 14 | }↵
|
14 | public Object getOrphan() {↵ | | 15 | public Object getOrphan() {↵
|
15 | return old;↵ | | 16 | return old;↵
|
16 | | | 17 |
|
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 |