while (it.hasNext()) { Namespace pN = (Namespace) it.next(); ListInfo[] list = store.list("", pN.getPrefix() + '%'); result.addAll(Arrays.asList(list)); }
while (it.hasNext()) { Namespace pN = (Namespace) it.next(); ListInfo[] list = store.list("", pN.getPrefix() + '%'); result.addAll(Arrays.asList(list)); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/config/subscribe/SynchronizeFolderListCommand.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/config/subscribe/SynchronizeFolderListCommand.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
while (it.hasNext()) {
1
while (it.hasNext()) {
2
				Namespace pN = (Namespace) it.next();
2
				Namespace pN = (Namespace) it.next();
3
				ListInfo[] list = store.list("", pN.getPrefix() + '%');
3
				ListInfo[] list = store.list("", pN.getPrefix() + '%');
4
				result.addAll(Arrays.asList(list));
4
				result.addAll(Arrays.asList(list));
5
			}
5
			}
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