102-1-2

StringBuffer buf = new StringBuffer(); Enumeration e = selectorElements(); if (e.hasMoreElements()) { while (e.hasMoreElements()) { buf.append(e.nextElement().toString()); if (e.hasMoreElements()) { buf.append(", "); } } } return buf.toString();
StringBuffer buf = new StringBuffer(); Enumeration e = selectorElements(); if (e.hasMoreElements()) { while (e.hasMoreElements()) { buf.append(e.nextElement().toString()); if (e.hasMoreElements()) { buf.append(", "); } } } return buf.toString();

Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/BaseSelectorContainer.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/AbstractSelectorContainer.java
Method name: `String toString()` |  | Method name: `String toString()`
Number of AST nodes: 8 |  | Number of AST nodes: 8

1

    StringBuffer buf = new StringBuffer();↵

1

    StringBuffer buf = new StringBuffer();↵

2

            Enumeration e = selectorElements();↵

2

            Enumeration e = selectorElements();↵

3

            if (e.hasMoreElements()) {↵

3

            if (e.hasMoreElements()) {↵

4

                while (e.hasMoreElements()) {↵

4

                while (e.hasMoreElements()) {↵

5

                    buf.append(e.nextElement().toString());↵

5

                    buf.append(e.nextElement().toString());↵

6

                    if (e.hasMoreElements()) {↵

6

                    if (e.hasMoreElements()) {↵

7

                        buf.append(", ");↵

7

                        buf.append(", ");↵

8

                    }↵

8

                    }↵

9

                }↵

9

                }↵

10

            }↵

10

            }↵

11

            return buf.toString();

11

            return buf.toString();

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 1
Number of refactorable cases | 1
Number of non-refactorable cases | 0
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2
Clones location | Clones are in different classes having the same super class
Number of node comparisons | 14

1. {Refactorable}

   Mapping Summary
   Number of mapped statements | 8
   Number of unmapped statements in the first code fragment | 0
   Number of unmapped statements in the second code fragment | 0
   Time elapsed for statement mapping (ms) | 2.4
   Clone type | Type 1

   Mapped Statements
   ID | Statement |  | ID | Statement
   --- | --- | --- | --- | ---

   1

       StringBuffer buf = new StringBuffer();

   1

       StringBuffer buf = new StringBuffer();

   2

       Enumeration e = selectorElements();

   2

       Enumeration e = selectorElements();

   3

       if (e.hasMoreElements())

   3

       if (e.hasMoreElements())

   4

       while (e.hasMoreElements())

   4

       while (e.hasMoreElements())

   5

       buf.append(e.nextElement().toString());

   5

       buf.append(e.nextElement().toString());

   6

       if (e.hasMoreElements())

   6

       if (e.hasMoreElements())

   7

       buf.append(", ");

   7

       buf.append(", ");

   8

       return buf.toString();

   8

       return buf.toString();

   Precondition Violations (0)
   Row | Violation
   --- | ---