CrLf newInstance() { return newInstance(getValue()); } /** * Create an instance of this enumerated value based on the string value. * @param value the value to use. * @return an enumerated instance. */ public static CrLf newInstance(String value) { CrLf c = new CrLf(); c.setValue(value); return c;
AddAsisRemove newInstance() { return newInstance(getValue()); } /** * Create an instance of this enumerated value based on the string value. * @param value the value to use. * @return an enumerated instance. */ public static AddAsisRemove newInstance(String value) { AddAsisRemove a = new AddAsisRemove(); a.setValue(value); return a;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/FixCrLfFilter.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/FixCrLfFilter.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
CrLf newInstance() {
1
AddAsisRemove newInstance() {
2
            return newInstance(getValue());
2
            return newInstance(getValue());
3
        }
3
        }
4
        /**
4
        /**
5
         * Create an instance of this enumerated value based on the string value.
5
         * Create an instance of this enumerated value based on the string value.
6
         * @param value the value to use.
6
         * @param value the value to use.
7
         * @return an enumerated instance.
7
         * @return an enumerated instance.
8
         */
8
         */
9
        public static CrLf newInstance(String value) {
9
        public static AddAsisRemove newInstance(String value) {
10
            CrLf c = new CrLf();
10
            AddAsisRemove a = new AddAsisRemove();
11
            c.setValue(value);
11
            a.setValue(value);
12
            return c;
12
            return a;
13
        
13
        
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