for (Iterator i = actualMap.entrySet().iterator(); i.hasNext();) { Map.Entry entry = (Map.Entry) i.next(); String elemName = (String) entry.getKey(); Class elemClass = (Class) elemMap.get(elemName); assertNotNull("Support for " + elemName + " in IntrospectionHelperTest?", elemClass); assertEquals("Type of " + elemName, elemClass, entry.getValue()); elemMap.remove(elemName); }
for (Iterator i = actualMap.entrySet().iterator(); i.hasNext();) { Map.Entry entry = (Map.Entry) i.next(); String attrName = (String) entry.getKey(); Class attrClass = (Class) attrMap.get(attrName); assertNotNull("Support for " + attrName + " in IntrospectionHelperTest?", attrClass); assertEquals("Type of " + attrName, attrClass, entry.getValue()); attrMap.remove(attrName); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/IntrospectionHelperTest.java File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/IntrospectionHelperTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (Iterator i = actualMap.entrySet().iterator(); i.hasNext();) {
1
for (Iterator i = actualMap.entrySet().iterator(); i.hasNext();) {
2
            Map.Entry entry = (Map.Entry) i.next();
2
            Map.Entry entry = (Map.Entry) i.next();
3
            String elemName = (String) entry.getKey();
3
            String attrName = (String) entry.getKey();
4
            Class elemClass = (Class) elemMap.get(elemName);
4
            Class attrClass = (Class) attrMap.get(attrName);
5
            assertNotNull("Support for " + elemName +
5
            assertNotNull("Support for " + attrName +
6
                          " in IntrospectionHelperTest?", elemClass);
6
                          " in IntrospectionHelperTest?", attrClass);
7
            assertEquals("Type of " + elemName, elemClass, entry.getValue());
7
            assertEquals("Type of " + attrName, attrClass, entry.getValue());
8
            elemMap.remove(elemName);
8
            attrMap.remove(attrName);
9
        }
9
        }
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