String lastFilter = ""; public FilteringModel() { list = new ArrayList<IEventInfo>(); filteredList = new ArrayList<IEventInfo>(); } public 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;
String lastFilter = ""; public FilteringModel() { list = new ArrayList<IContactModelPartial>(); filteredList = new ArrayList<IContactModelPartial>(); } public 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;
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/ui/box/FilteringModel.java File path: /columba-1.4-src/contact/src/main/java/org/columba/contact/gui/box/FilteringModel.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
String lastFilter = "";
1
String lastFilter = "";
2
	public FilteringModel() {
2
	public FilteringModel() {
3
		list = new ArrayList<IEventInfo>();
3
		list = new ArrayList<IContactModelPartial>();
4
		filteredList = new ArrayList<IEventInfo>();
4
		filteredList = new ArrayList<IContactModelPartial>();
5
	}
5
	}
6
	public void addElement(IEventInfo element) {
6
	public void addElement(IContactModelPartial element) {
7
		list.add(element);
7
		list.add(element);
8
		filter(lastFilter);
8
		filter(lastFilter);
9
	}
9
	}
10
	public int getSize() {
10
	public int getSize() {
11
		return filteredList.size();
11
		return filteredList.size();
12
	}
12
	}
13
	public Object getElementAt(int index) {
13
	public Object getElementAt(int index) {
14
		Object returnValue;
14
		Object returnValue;
15
		if (index < filteredList.size()) {
15
		if (index < filteredList.size()) {
16
			returnValue = filteredList.get(index);
16
			returnValue = filteredList.get(index);
17
		} else {
17
		} else {
18
			returnValue = null;
18
			returnValue = null;
19
		}
19
		}
20
		return returnValue;
20
		return returnValue;
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0