LineBreakMeasurer lineBreaker = new LineBreakMeasurer(((AttributedString) it.next()).getIterator(), new FontRenderContext(null, true, true)); // for (int i = 0; i < paragraphs.size(); i++) { // LineBreakMeasurer lineBreaker = // new LineBreakMeasurer( // ((AttributedString) paragraphs.get(i)).getIterator(), // new FontRenderContext(null, true, true)); TextLayout layout;
LineBreakMeasurer lineBreaker = new LineBreakMeasurer(((AttributedString) it.next()).getIterator(), new FontRenderContext(null, true, true)); // for (int i = 0; i < paragraphs.size(); i++) { // LineBreakMeasurer lineBreaker = // new LineBreakMeasurer( // ((AttributedString) paragraphs.get(i)).getIterator(), // new FontRenderContext(null, true, true)); TextLayout layout;
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/print/cParagraph.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/print/cParagraph.java
Method name: void renderLeftAligned(Graphics2D) Method name: cSize getSize(cUnit)
Number of AST nodes: 2 Number of AST nodes: 2
1
LineBreakMeasurer lineBreaker = new LineBreakMeasurer(((AttributedString) it.next()).getIterator(),
1
LineBreakMeasurer lineBreaker = new LineBreakMeasurer(((AttributedString) it.next()).getIterator(),
2
                    new FontRenderContext(null, true, true));
2
                    new FontRenderContext(null, true, true));
3
            // for (int i = 0; i < paragraphs.size(); i++) {
3
            // for (int i = 0; i < paragraphs.size(); i++) {
4
            // LineBreakMeasurer lineBreaker =
4
            // LineBreakMeasurer lineBreaker =
5
            // new LineBreakMeasurer(
5
            // new LineBreakMeasurer(
6
            // ((AttributedString) paragraphs.get(i)).getIterator(),
6
            // ((AttributedString) paragraphs.get(i)).getIterator(),
7
            // new FontRenderContext(null, true, true));
7
            // new FontRenderContext(null, true, true));
8
            TextLayout layout;
8
            TextLayout layout;
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones locationClones are declared in the same class
Number of node comparisons1