if ((store.getAssociatedItems("serviceId1", "metaDataId1") != null) && (store.getAssociatedItems("serviceId1", "metaDataId1") .size() == 1) && ((String) (store.getAssociatedItems("serviceId1", "metaDataId1").toArray()[0])).equals("itemId1")) System.out.println("Correct value 'itemId1' found"); else fail("Associated item not found " + store.getAssociatedItems("serviceId1", "metaDataId1") .size());
if ((store.getAssociatedItems("serviceId1", "metaDataId1") != null) && (store.getAssociatedItems("serviceId1", "metaDataId1") .size() == 1) && ((String) (store.getAssociatedItems("serviceId1", "metaDataId1").toArray()[0])).equals("itemId1")) System.out.println("Correct value 'itemId1' found"); else fail("Associated item not found " + store.getAssociatedItems("serviceId1", "metaDataId1") .size());
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/test/java/org/columba/core/associations/AssociationStoreCases.java File path: /columba-1.4-src/core/src/test/java/org/columba/core/associations/AssociationStoreCases.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if ((store.getAssociatedItems("serviceId1", "metaDataId1") != null)
1
if ((store.getAssociatedItems("serviceId1", "metaDataId1") != null)
2
				&& (store.getAssociatedItems("serviceId1", "metaDataId1")
2
				&& (store.getAssociatedItems("serviceId1", "metaDataId1")
3
						.size() == 1)
3
						.size() == 1)
4
				&& ((String) (store.getAssociatedItems("serviceId1",
4
				&& ((String) (store.getAssociatedItems("serviceId1",
5
						"metaDataId1").toArray()[0])).equals("itemId1"))
5
						"metaDataId1").toArray()[0])).equals("itemId1"))
6
			System.out.println("Correct value 'itemId1' found");
6
			System.out.println("Correct value 'itemId1' found");
7
		else
7
		else
8
			fail("Associated item not found "
8
			fail("Associated item not found "
9
					+ store.getAssociatedItems("serviceId1", "metaDataId1")
9
					+ store.getAssociatedItems("serviceId1", "metaDataId1")
10
							.size());
10
							.size());
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