11348-1-2

Arrays.fill(CHARS, 3872, 3882, (byte) -87 ); // Fill 10 of value (byte) -87 Arrays.fill(CHARS, 3882, 3893, (byte) 33 ); // Fill 11 of value (byte) 33 CHARS[3893] = -87; CHARS[3894] = 33; CHARS[3895] = -87; CHARS[3896] = 33; CHARS[3897] = -87; Arrays.fill(CHARS, 3898, 3902, (byte) 33 );
Arrays.fill(CHARS, 4366, 4371, (byte) -19 ); // Fill 5 of value (byte) -19 Arrays.fill(CHARS, 4371, 4412, (byte) 33 ); // Fill 41 of value (byte) 33 CHARS[4412] = -19; CHARS[4413] = 33; CHARS[4414] = -19; CHARS[4415] = 33; CHARS[4416] = -19; Arrays.fill(CHARS, 4417, 4428, (byte) 33 );

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, 3872, 3882, (byte) -87 ); // Fill 10 of value (byte) -87↵

1

    Arrays.fill(CHARS, 4366, 4371, (byte) -19 ); // Fill 5 of value (byte) -19↵

2

             Arrays.fill(CHARS, 3882, 3893, (byte) 33 ); // Fill 11 of value (byte) 33↵

2

             Arrays.fill(CHARS, 4371, 4412, (byte) 33 ); // Fill 41 of value (byte) 33↵

3

             CHARS[3893] = -87;↵

3

             CHARS[4412] = -19;↵

4

             CHARS[3894] = 33;↵

4

             CHARS[4413] = 33;↵

5

             CHARS[3895] = -87;↵

5

             CHARS[4414] = -19;↵

6

             CHARS[3896] = 33;↵

6

             CHARS[4415] = 33;↵

7

             CHARS[3897] = -87;↵

7

             CHARS[4416] = -19;↵

8

             Arrays.fill(CHARS, 3898, 3902, (byte) 33 );

8

             Arrays.fill(CHARS, 4417, 4428, (byte) 33 );

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