11576-2-4

CHARS[3781] = 33; CHARS[3782] = -87; CHARS[3783] = 33; Arrays.fill(CHARS, 3784, 3790, (byte) -87 ); // Fill 6 of value (byte) -87 Arrays.fill(CHARS, 3790, 3792, (byte) 33 );
CHARS[3990] = 33; CHARS[3991] = -87; CHARS[3992] = 33; Arrays.fill(CHARS, 3993, 4014, (byte) -87 ); // Fill 21 of value (byte) -87 Arrays.fill(CHARS, 4014, 4017, (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

    CHARS[3781] = 33;↵

1

    CHARS[3990] = 33;↵

2

             CHARS[3782] = -87;↵

2

             CHARS[3991] = -87;↵

3

             CHARS[3783] = 33;↵

3

             CHARS[3992] = 33;↵

4

             Arrays.fill(CHARS, 3784, 3790, (byte) -87 ); // Fill 6 of value (byte) -87↵

4

             Arrays.fill(CHARS, 3993, 4014, (byte) -87 ); // Fill 21 of value (byte) -87↵

5

             Arrays.fill(CHARS, 3790, 3792, (byte) 33 );

5

             Arrays.fill(CHARS, 4014, 4017, (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