diff options
Diffstat (limited to 'sdext/source/pdfimport/tree/genericelements.cxx')
| -rw-r--r-- | sdext/source/pdfimport/tree/genericelements.cxx | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/sdext/source/pdfimport/tree/genericelements.cxx b/sdext/source/pdfimport/tree/genericelements.cxx index e6a50a0331db..d8696ddcb850 100644 --- a/sdext/source/pdfimport/tree/genericelements.cxx +++ b/sdext/source/pdfimport/tree/genericelements.cxx @@ -2,7 +2,7 @@ /************************************************************************* * * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. - * + * * Copyright 2000, 2010 Oracle and/or its affiliates. * * OpenOffice.org - a multi-platform office productivity suite @@ -34,7 +34,7 @@ #include "pdfiprocessor.hxx" #include "pdfihelper.hxx" #include "style.hxx" - + #include <basegfx/polygon/b2dpolypolygontools.hxx> #include <basegfx/range/b2drange.hxx> @@ -55,7 +55,7 @@ Element::~Element() Children.pop_front(); } } - + void Element::applyToChildren( ElementTreeVisitor& rVisitor ) { for( std::list< Element* >::iterator it = Children.begin(); it != Children.end(); ++it ) @@ -124,7 +124,7 @@ void HyperlinkElement::visitedBy( ElementTreeVisitor& r { rVisitor.visit(*this,rParentIt); } - + void TextElement::visitedBy( ElementTreeVisitor& rVisitor, const std::list< Element* >::const_iterator& rParentIt ) { @@ -142,8 +142,8 @@ void ImageElement::visitedBy( ElementTreeVisitor& rVisi { rVisitor.visit( *this, rParentIt); } - -PolyPolyElement::PolyPolyElement( Element* pParent, + +PolyPolyElement::PolyPolyElement( Element* pParent, sal_Int32 nGCId, const basegfx::B2DPolyPolygon& rPolyPoly, sal_Int8 nAction ) @@ -214,7 +214,7 @@ bool ParagraphElement::isSingleLined( PDFIProcessor& rProc ) const // a paragraph containing subparagraphs cannot be single lined if( dynamic_cast< ParagraphElement* >(*it) != NULL ) return false; - + pText = dynamic_cast< TextElement* >(*it); if( pText ) { @@ -232,7 +232,7 @@ bool ParagraphElement::isSingleLined( PDFIProcessor& rProc ) const } ++it; } - + // a paragraph without a single text is not considered single lined return pLastText != NULL; } @@ -281,7 +281,7 @@ PageElement::~PageElement() if( FooterElement ) delete FooterElement; } - + void PageElement::visitedBy( ElementTreeVisitor& rVisitor, const std::list< Element* >::const_iterator& rParentIt ) { @@ -323,7 +323,7 @@ bool PageElement::resolveHyperlink( std::list<Element*>::iterator link_it, std:: HyperlinkElement* pLink = dynamic_cast<HyperlinkElement*>(*link_it); if( ! pLink ) // sanity check return false; - + for( std::list<Element*>::iterator it = rElements.begin(); it != rElements.end(); ++it ) { if( (*it)->x >= pLink->x && (*it)->x + (*it)->w <= pLink->x + pLink->w && @@ -391,7 +391,7 @@ void PageElement::resolveUnderlines( PDFIProcessor& rProc ) { // FIXME: currently the algorithm used is quadratic // this could be solved by some sorting beforehand - + std::list< Element* >::iterator poly_it = Children.begin(); while( poly_it != Children.end() ) { @@ -415,7 +415,7 @@ void PageElement::resolveUnderlines( PDFIProcessor& rProc ) ++poly_it; continue; } - + bool bRemovePoly = false; basegfx::B2DPolygon aPoly = pPoly->PolyPoly.getB2DPolygon(0); if( aPoly.count() != 2 || @@ -489,7 +489,7 @@ void DocumentElement::visitedBy( ElementTreeVisitor& rV { rVisitor.visit(*this, rParentIt); } - + } |