11506-13-34

CHARS[3241] = 33; Arrays.fill(CHARS, 3242, 3252, (byte) -19 ); // Fill 10 of value (byte) -19 CHARS[3252] = 33; Arrays.fill(CHARS, 3253, 3258, (byte) -19 );
CHARS[3345] = 33; Arrays.fill(CHARS, 3346, 3369, (byte) -19 ); // Fill 23 of value (byte) -19 CHARS[3369] = 33; Arrays.fill(CHARS, 3370, 3386, (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[3241] = 33;↵

1

    CHARS[3345] = 33;↵

2

             Arrays.fill(CHARS, 3242, 3252, (byte) -19 ); // Fill 10 of value (byte) -19↵

2

             Arrays.fill(CHARS, 3346, 3369, (byte) -19 ); // Fill 23 of value (byte) -19↵

3

             CHARS[3252] = 33;↵

3

             CHARS[3369] = 33;↵

4

             Arrays.fill(CHARS, 3253, 3258, (byte) -19 );

4

             Arrays.fill(CHARS, 3370, 3386, (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