void addElement(IContactModelPartial element) {
list.add(element);
filter(lastFilter);
}
public int getSize() {
return filteredList.size();
}
public Object getElementAt(int index) {
Object returnValue;
if (index < filteredList.size()) {
returnValue = filteredList.get(index);
} else {
returnValue = null;
}
return returnValue;
void addElement(IEventInfo element) {
list.add(element);
filter(lastFilter);
}
public int getSize() {
return filteredList.size();
}
public Object getElementAt(int index) {
Object returnValue;
if (index < filteredList.size()) {
returnValue = filteredList.get(index);
} else {
returnValue = null;
}
return returnValue;
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/contact/src/main/java/org/columba/contact/gui/box/FilteringModel.java
|
|
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/ui/box/FilteringModel.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void addElement(IContactModelPartial element) {↵ | | 1 | void addElement(IEventInfo element) {↵
|
2 | list.add(element);↵ | | 2 | list.add(element);↵
|
3 | filter(lastFilter);↵ | | 3 | filter(lastFilter);↵
|
4 | }↵ | | 4 | }↵
|
|
5 | public int getSize() {↵ | | 5 | public int getSize() {↵
|
6 | return filteredList.size();↵ | | 6 | return filteredList.size();↵
|
7 | }↵ | | 7 | }↵
|
|
8 | public Object getElementAt(int index) {↵ | | 8 | public Object getElementAt(int index) {↵
|
9 | Object returnValue;↵ | | 9 | Object returnValue;↵
|
10 | if (index < filteredList.size()) {↵ | | 10 | if (index < filteredList.size()) {↵
|
11 | returnValue = filteredList.get(index);↵ | | 11 | returnValue = filteredList.get(index);↵
|
12 | } else {↵ | | 12 | } else {↵
|
13 | returnValue = null;↵ | | 13 | returnValue = null;↵
|
14 | }↵ | | 14 | }↵
|
15 | return returnValue;↵ | | 15 | return returnValue;↵
|
16 | | | 16 |
|
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 |