10150-21-23

Arrays.fill(CHARS, 330, 383, (byte) -19 ); // Fill 53 of value (byte) -19 CHARS[383] = 33; Arrays.fill(CHARS, 384, 452, (byte) -19 ); // Fill 68 of value (byte) -19 Arrays.fill(CHARS, 452, 461, (byte) 33 );
Arrays.fill(CHARS, 2305, 2308, (byte) -87 ); // Fill 3 of value (byte) -87 CHARS[2308] = 33; Arrays.fill(CHARS, 2309, 2362, (byte) -19 ); // Fill 53 of value (byte) -19 Arrays.fill(CHARS, 2362, 2364, (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, 330, 383, (byte) -19 ); // Fill 53 of value (byte) -19↵

1

    Arrays.fill(CHARS, 2305, 2308, (byte) -87 ); // Fill 3 of value (byte) -87↵

2

             CHARS[383] = 33;↵

2

             CHARS[2308] = 33;↵

3

             Arrays.fill(CHARS, 384, 452, (byte) -19 ); // Fill 68 of value (byte) -19↵

3

             Arrays.fill(CHARS, 2309, 2362, (byte) -19 ); // Fill 53 of value (byte) -19↵

4

             Arrays.fill(CHARS, 452, 461, (byte) 33 );

4

             Arrays.fill(CHARS, 2362, 2364, (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