if (virtualHeader.size() > 0) { // Now we can search this folder since no mail from // this folder will come in the list Object[] srcUids = new Object[virtualHeader.size()]; // Create a src uid array for (int j = 0; j < virtualHeader.size(); j++) { srcUids[j] = ((VirtualHeader) virtualHeader.get(j)).getSrcUid(); } // search the src folder with the src uid array Object[] resultUids = sourceFolder.searchMessages(filter, srcUids); // Convert the src uids back to virtual uids if ((resultUids != null) && (resultUids.length > 0)) { Object[] virtualUids = new Object[resultUids.length]; for (int j = 0; j < resultUids.length; j++) { virtualUids[j] = srcUidToVirtualUid(sourceFolder, resultUids[j]); } // Add all found virtual uids to the result resultList.addAll(Arrays.asList(virtualUids)); } virtualHeader.clear(); }
if (h.getSrcFolder() != sourceFolder || i == uids.length - 1) { // Now we can search this folder since no mail from // this folder will come in the list Object[] srcUids = new Object[virtualHeader.size()]; // Create a src uid array for (int j = 0; j < virtualHeader.size(); j++) { srcUids[j] = ((VirtualHeader) virtualHeader.get(j)) .getSrcUid(); } // search the src folder with the src uid array Object[] resultUids = sourceFolder.searchMessages(filter, srcUids); // Convert the src uids back to virtual uids if ((resultUids != null) && (resultUids.length > 0)) { Object[] virtualUids = new Object[resultUids.length]; for (int j = 0; j < resultUids.length; j++) { virtualUids[j] = srcUidToVirtualUid(sourceFolder, resultUids[j]); } // Add all found virtual uids to the result resultList.addAll(Arrays.asList(virtualUids)); } virtualHeader.clear(); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/virtual/VirtualFolder.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/virtual/VirtualFolder.java
Method name: Object[] searchMessages(Filter, Object[]) Method name: Object[] searchMessages(Filter, Object[])
Number of AST nodes: 11 Number of AST nodes: 11
1
if (virtualHeader.size() > 0) {
1
if (h.getSrcFolder() != sourceFolder || i == uids.length - 1) {
2
			// Now we can search this folder since no mail from
2
				// Now we can search this folder since no mail from
3
			// this folder will come in the list
3
				// this folder will come in the list
4
			Object[] srcUids = new Object[virtualHeader.size()];
4
				Object[] srcUids = new Object[virtualHeader.size()];
5
			// Create a src uid array
5
				// Create a src uid array
6
			for (int j = 0; j < virtualHeader.size(); j++) {
6
				for (int j = 0; j < virtualHeader.size(); j++) {
7
				srcUids[j] = ((VirtualHeader) virtualHeader.get(j))
7
					srcUids[j] = ((VirtualHeader) virtualHeader.get(j))
8
.getSrcUid();
8
							.getSrcUid();
9
			}
9
				}
10
			// search the src folder with the src uid array
10
				// search the src folder with the src uid array
11
			Object[] resultUids = sourceFolder.searchMessages(filter, 
11
				Object[] resultUids = sourceFolder.searchMessages(filter,
12
srcUids);
12
						srcUids);
13
			// Convert the src uids back to virtual uids
13
				// Convert the src uids back to virtual uids
14
			if ((resultUids != null) && (resultUids.length > 0)) {
14
				if ((resultUids != null) && (resultUids.length > 0)) {
15
				Object[] virtualUids = new Object[resultUids.length];
15
					Object[] virtualUids = new Object[resultUids.length];
16
				for (int j = 0; j < resultUids.length; j++) {
16
					for (int j = 0; j < resultUids.length; j++) {
17
					virtualUids[j] = srcUidToVirtualUid(sourceFolder,
17
						virtualUids[j] = srcUidToVirtualUid(sourceFolder,
18
							resultUids[j]);
18
								resultUids[j]);
19
				}
19
					}
20
				// Add all found virtual uids to the result
20
					// Add all found virtual uids to the result
21
				resultList.addAll(Arrays.asList(virtualUids));
21
					resultList.addAll(Arrays.asList(virtualUids));
22
			}
22
				}
23
			virtualHeader.clear();
23
				virtualHeader.clear();
24
		}
24
			}
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)1.1
Clones locationClones are in the same method
Number of node comparisons38
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements11
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)30.4
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    28
    if (virtualHeader.size() > 0)
    28
    if (virtualHeader.size() > 0)
    15
    if (h.getSrcFolder() != sourceFolder || i == uids.length - 1)
    Differences
    Expression1Expression2Difference
    >||OPERATOR_MISMATCH
    virtualHeader.size()h.getSrcFolder() != sourceFolderINFIX_LEFT_OPERAND_MISMATCH
    0i == uids.length - 1INFIX_RIGHT_OPERAND_MISMATCH
    15
    if (h.getSrcFolder() != sourceFolder || i == uids.length - 1)
    29
    Object[] srcUids = new Object[virtualHeader.size()];
    16
    Object[] srcUids = new Object[virtualHeader.size()];
    30
    for (int j = 0; j < virtualHeader.size(); j++)
    17
    for (int j = 0; j < virtualHeader.size(); j++)
    31
    srcUids[j] = ((VirtualHeader)virtualHeader.get(j)).getSrcUid();
    18
    srcUids[j] = ((VirtualHeader)virtualHeader.get(j)).getSrcUid();
    32
    Object[] resultUids = sourceFolder.searchMessages(filter, srcUids);
    19
    Object[] resultUids = sourceFolder.searchMessages(filter, srcUids);
    33
    if ((resultUids != null) && (resultUids.length > 0))
    20
    if ((resultUids != null) && (resultUids.length > 0))
    34
    Object[] virtualUids = new Object[resultUids.length];
    21
    Object[] virtualUids = new Object[resultUids.length];
    35
    for (int j = 0; j < resultUids.length; j++)
    22
    for (int j = 0; j < resultUids.length; j++)
    36
    virtualUids[j] = srcUidToVirtualUid(sourceFolder, resultUids[j]);
    23
    virtualUids[j] = srcUidToVirtualUid(sourceFolder, resultUids[j]);
    37
    resultList.addAll(Arrays.asList(virtualUids));
    24
    resultList.addAll(Arrays.asList(virtualUids));
    38
    virtualHeader.clear();
    25
    virtualHeader.clear();
    Precondition Violations (0)
    Row Violation