11506-3-29

CHARS[2737] = 33; Arrays.fill(CHARS, 2738, 2740, (byte) -19 ); // Fill 2 of value (byte) -19 CHARS[2740] = 33; Arrays.fill(CHARS, 2741, 2746, (byte) -19 );
CHARS[1442] = 33; Arrays.fill(CHARS, 1443, 1466, (byte) -87 ); // Fill 23 of value (byte) -87 CHARS[1466] = 33; Arrays.fill(CHARS, 1467, 1470, (byte) -87 );

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[2737] = 33;↵

1

    CHARS[1442] = 33;↵

2

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

2

             Arrays.fill(CHARS, 1443, 1466, (byte) -87 ); // Fill 23 of value (byte) -87↵

3

             CHARS[2740] = 33;↵

3

             CHARS[1466] = 33;↵

4

             Arrays.fill(CHARS, 2741, 2746, (byte) -19 );

4

             Arrays.fill(CHARS, 1467, 1470, (byte) -87 );

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