for (IAssociation as : c) { if (as.getServiceId().equals(SERVICE_ID) && (as.getMetaDataId() != null) && (as.getMetaDataId().equals(tag.getId()))) { return true; } }
for (int i = 0; i < input.length(); i++) { if (input.charAt(i) > 127) { return true; } }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/ui/tagging/TagCalendarMenu.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/composer/MessageComposer.java
Method name: boolean checkAssocation(String, String, ITag) Method name: boolean needQPEncoding(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (IAssociation as : c) {
1
for (
2
			if (as.getServiceId().equals(SERVICE_ID)
3
					&& (as.getMetaDataId() != null)
4
					&& (as.getMetaDataId().equals(tag.getId()))
2
int i = 0; i < input.length(); i++) {
5
) {
3
			if (input.charAt(i) > 127) {
6
				return true;
4
				return true;
7
			}
5
			}
8
		}
6
		}
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.3
Clones locationClones are in different classes
Number of node comparisons1