11345-1-2

Arrays.fill(CHARS, 976, 983, (byte) -19 ); // Fill 7 of value (byte) -19 Arrays.fill(CHARS, 983, 986, (byte) 33 ); // Fill 3 of value (byte) 33 CHARS[986] = -19; CHARS[987] = 33; CHARS[988] = -19;
Arrays.fill(CHARS, 65, 91, (byte) -3 ); // Fill 26 of value (byte) -3 Arrays.fill(CHARS, 91, 93, (byte) 33 ); // Fill 2 of value (byte) 33 CHARS[93] = 1; CHARS[94] = 33; CHARS[95] = -3;

Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/DataValue.java |  | File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/DataValue.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    Arrays.fill(CHARS, 976, 983, (byte) -19 ); // Fill 7 of value (byte) -19↵

1

    Arrays.fill(CHARS, 65, 91, (byte) -3 ); // Fill 26 of value (byte) -3↵

2

             Arrays.fill(CHARS, 983, 986, (byte) 33 ); // Fill 3 of value (byte) 33↵

2

             Arrays.fill(CHARS, 91, 93, (byte) 33 ); // Fill 2 of value (byte) 33↵

3

             CHARS[986] = -19;↵

3

             CHARS[93] = 1;↵

4

             CHARS[987] = 33;↵

4

             CHARS[94] = 33;↵

5

             CHARS[988] = -19;

5

             CHARS[95] = -3;

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 0
Number of refactorable cases | 0
Number of non-refactorable cases | 0
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0
Clones location |
Number of node comparisons | 0