11699-1-2

CHARS[903] = -87; Arrays.fill(CHARS, 904, 907, (byte) -19 ); // Fill 3 of value (byte) -19 CHARS[907] = 33; CHARS[908] = -19; CHARS[909] = 33; Arrays.fill(CHARS, 910, 930, (byte) -19 ); // Fill 20 of value (byte) -19 CHARS[930] = 33; Arrays.fill(CHARS, 931, 975, (byte) -19 ); // Fill 44 of value (byte) -19 CHARS[975] = 33; Arrays.fill(CHARS, 976, 983, (byte) -19 );
CHARS[2692] = 33; Arrays.fill(CHARS, 2693, 2700, (byte) -19 ); // Fill 7 of value (byte) -19 CHARS[2700] = 33; CHARS[2701] = -19; CHARS[2702] = 33; Arrays.fill(CHARS, 2703, 2706, (byte) -19 ); // Fill 3 of value (byte) -19 CHARS[2706] = 33; Arrays.fill(CHARS, 2707, 2729, (byte) -19 ); // Fill 22 of value (byte) -19 CHARS[2729] = 33; Arrays.fill(CHARS, 2730, 2737, (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

    CHARS[903] = -87;↵

1

    CHARS[2692] = 33;↵

2

             Arrays.fill(CHARS, 904, 907, (byte) -19 ); // Fill 3 of value (byte) -19↵

2

             Arrays.fill(CHARS, 2693, 2700, (byte) -19 ); // Fill 7 of value (byte) -19↵

3

             CHARS[907] = 33;↵

3

             CHARS[2700] = 33;↵

4

             CHARS[908] = -19;↵

4

             CHARS[2701] = -19;↵

5

             CHARS[909] = 33;↵

5

             CHARS[2702] = 33;↵

6

             Arrays.fill(CHARS, 910, 930, (byte) -19 ); // Fill 20 of value (byte) -19↵

6

             Arrays.fill(CHARS, 2703, 2706, (byte) -19 ); // Fill 3 of value (byte) -19↵

7

             CHARS[930] = 33;↵

7

             CHARS[2706] = 33;↵

8

             Arrays.fill(CHARS, 931, 975, (byte) -19 ); // Fill 44 of value (byte) -19↵

8

             Arrays.fill(CHARS, 2707, 2729, (byte) -19 ); // Fill 22 of value (byte) -19↵

9

             CHARS[975] = 33;↵

9

             CHARS[2729] = 33;↵

10

             Arrays.fill(CHARS, 976, 983, (byte) -19 );

10

             Arrays.fill(CHARS, 2730, 2737, (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