11476-6-11

Arrays.fill(CHARS, 192, 215, (byte) -19 ); // Fill 23 of value (byte) -19 CHARS[215] = 33; Arrays.fill(CHARS, 216, 247, (byte) -19 ); // Fill 31 of value (byte) -19 CHARS[247] = 33;
Arrays.fill(CHARS, 4354, 4356, (byte) -19 ); // Fill 2 of value (byte) -19 CHARS[4356] = 33; Arrays.fill(CHARS, 4357, 4360, (byte) -19 ); // Fill 3 of value (byte) -19 CHARS[4360] = 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, 192, 215, (byte) -19 ); // Fill 23 of value (byte) -19↵

1

    Arrays.fill(CHARS, 4354, 4356, (byte) -19 ); // Fill 2 of value (byte) -19↵

2

             CHARS[215] = 33;↵

2

             CHARS[4356] = 33;↵

3

             Arrays.fill(CHARS, 216, 247, (byte) -19 ); // Fill 31 of value (byte) -19↵

3

             Arrays.fill(CHARS, 4357, 4360, (byte) -19 ); // Fill 3 of value (byte) -19↵

4

             CHARS[247] = 33;

4

             CHARS[4360] = 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