public void folderAdded(IFolderEvent e) { mutex.lock(); Iterator it = folderAddedList[1 - swap].iterator(); boolean found = false; while (it.hasNext() && !found) { FolderEvent event = (FolderEvent) it.next(); found = (event.getSource() == e.getSource()); } if (!found) folderAddedList[1 - swap].add(e); mutex.release();
public void messageAdded(IFolderEvent e) { mutex.lock(); Iterator it = messageAddedList[1 - swap].iterator(); boolean found = false; while (it.hasNext() && !found) { FolderEvent event = (FolderEvent) it.next(); found = (event.getSource() == e.getSource()); } if (!found) messageAddedList[1 - swap].add(e); mutex.release();
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/event/FolderEventDelegator.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/event/FolderEventDelegator.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public void folderAdded(IFolderEvent e) {
1
public void messageAdded(IFolderEvent e) {
2
		mutex.lock();
2
		mutex.lock();
3
		Iterator it = folderAddedList[1 - swap].iterator();
3
		Iterator it = messageAddedList[1 - swap].iterator();
4
		boolean found = false;
4
		boolean found = false;
5
		while (it.hasNext() && !found) {
5
		while (it.hasNext() && !found) {
6
			FolderEvent event = (FolderEvent) it.next();
6
			FolderEvent event = (FolderEvent) it.next();
7
			found = (event.getSource() == e.getSource());
7
			found = (event.getSource() == e.getSource());
8
		}
8
		}
9
		if (!found)
9
		if (!found)
10
			folderAddedList[1 - swap].add(e);
10
			messageAddedList[1 - swap].add(e);
11
		mutex.release();
11
		mutex.release();
12
	
12
	
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