11561-1-4

CHARS[3749] = -19; CHARS[3750] = 33; CHARS[3751] = -19; Arrays.fill(CHARS, 3752, 3754, (byte) 33 ); // Fill 2 of value (byte) 33 Arrays.fill(CHARS, 3754, 3756, (byte) -19 );
CHARS[3895] = -87; CHARS[3896] = 33; CHARS[3897] = -87; Arrays.fill(CHARS, 3898, 3902, (byte) 33 ); // Fill 4 of value (byte) 33 Arrays.fill(CHARS, 3902, 3904, (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[3749] = -19;↵

1

    CHARS[3895] = -87;↵

2

             CHARS[3750] = 33;↵

2

             CHARS[3896] = 33;↵

3

             CHARS[3751] = -19;↵

3

             CHARS[3897] = -87;↵

4

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

4

             Arrays.fill(CHARS, 3898, 3902, (byte) 33 ); // Fill 4 of value (byte) 33↵

5

             Arrays.fill(CHARS, 3754, 3756, (byte) -19 );

5

             Arrays.fill(CHARS, 3902, 3904, (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