158-47-50

try { super.processBuffer(); } catch (IOException e) { // impossible since *our* processLine doesn't throw an IOException throw new RuntimeException("Impossible IOException caught: " + e); }
try { super.testParagraphCharacter(); fail("Should trigger once fixed. {@since JDK 1.4RC1}"); } catch (AssertionFailedError e){ }

Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/LogOutputStream.java |  | File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/util/regexp/Jdk14RegexpMatcherTest.java
Method name: `void processBuffer()` |  | Method name: `void testParagraphCharacter()`
Number of AST nodes: 2 |  | Number of AST nodes: 3

1

    try {↵

1

    try {↵

2

                super.processBuffer();↵

2

                super.↵

3

            } catch (IOException e) {↵

4

                // impossible since *our* processLine doesn't throw an IOException↵

5

                throw new RuntimeException("Impossible IOException caught: " +↵

3

    testParagraphCharacter();↵

4

                fail("Should trigger once fixed. {@since JDK 1.4RC1}");↵

6

     e);↵

5

            } catch (AssertionFailedError e){↵

7

            }

6

            }

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.1
Clones location | Clones are in different classes
Number of node comparisons | 1