10010-1-2

Arrays.fill(CHARS, 248, 306, (byte) -19 ); // Fill 58 of value (byte) -19 Arrays.fill(CHARS, 306, 308, (byte) 33 ); // Fill 2 of value (byte) 33 Arrays.fill(CHARS, 308, 319, (byte) -19 ); // Fill 11 of value (byte) -19 Arrays.fill(CHARS, 319, 321, (byte) 33 ); // Fill 2 of value (byte) 33 Arrays.fill(CHARS, 321, 329, (byte) -19 ); // Fill 8 of value (byte) -19 CHARS[329] = 33; Arrays.fill(CHARS, 330, 383, (byte) -19 ); // Fill 53 of value (byte) -19 CHARS[383] = 33; Arrays.fill(CHARS, 384, 452, (byte) -19 );
Arrays.fill(CHARS, 3168, 3170, (byte) -19 ); // Fill 2 of value (byte) -19 Arrays.fill(CHARS, 3170, 3174, (byte) 33 ); // Fill 4 of value (byte) 33 Arrays.fill(CHARS, 3174, 3184, (byte) -87 ); // Fill 10 of value (byte) -87 Arrays.fill(CHARS, 3184, 3202, (byte) 33 ); // Fill 18 of value (byte) 33 Arrays.fill(CHARS, 3202, 3204, (byte) -87 ); // Fill 2 of value (byte) -87 CHARS[3204] = 33; Arrays.fill(CHARS, 3205, 3213, (byte) -19 ); // Fill 8 of value (byte) -19 CHARS[3213] = 33; Arrays.fill(CHARS, 3214, 3217, (byte) -19 );

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, 248, 306, (byte) -19 ); // Fill 58 of value (byte) -19↵

1

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

2

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

2

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

3

             Arrays.fill(CHARS, 308, 319, (byte) -19 ); // Fill 11 of value (byte) -19↵

3

             Arrays.fill(CHARS, 3174, 3184, (byte) -87 ); // Fill 10 of value (byte) -87↵

4

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

4

             Arrays.fill(CHARS, 3184, 3202, (byte) 33 ); // Fill 18 of value (byte) 33↵

5

             Arrays.fill(CHARS, 321, 329, (byte) -19 ); // Fill 8 of value (byte) -19↵

5

             Arrays.fill(CHARS, 3202, 3204, (byte) -87 ); // Fill 2 of value (byte) -87↵

6

             CHARS[329] = 33;↵

6

             CHARS[3204] = 33;↵

7

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

7

             Arrays.fill(CHARS, 3205, 3213, (byte) -19 ); // Fill 8 of value (byte) -19↵

8

             CHARS[383] = 33;↵

8

             CHARS[3213] = 33;↵

9

             Arrays.fill(CHARS, 384, 452, (byte) -19 );

9

             Arrays.fill(CHARS, 3214, 3217, (byte) -19 );

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