for (Enumeration e = props.keys(); e.hasMoreElements();) { String key = (String) e.nextElement(); String value = props.getProperty(key); hash.put(key, value); }
while (e.hasMoreElements()) { String strPropName = (String) e.nextElement(); String strValue = props.getProperty(strPropName); filts.addElement(new Filter(strPropName, strValue)); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/ReplaceTokens.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/FilterSet.java
Method name: void initialize() Method name: void readFiltersFromFile(File)
Number of AST nodes: 4 Number of AST nodes: 4
1
for (Enumeration e = props.keys(); e.hasMoreElements();) {
1
while (e.hasMoreElements()) {
2
                            String key = (String) e.nextElement();
2
                 String strPropName = (String) e.nextElement();
3
                            String value = props.getProperty(key);
3
                 String strValue = props.getProperty(strPropName);
4
                            hash.put(key, value);
4
                 filts.addElement(new Filter(strPropName, strValue));
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 locationClones are in different classes
Number of node comparisons1