mir/libreoffice
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
842dba9b0fa91a85e8da317eec452ff377033184
libreoffice/vcl/source/gdi/polyscan.cxx
Vladimir Glazounov 49e19c8937 INTEGRATION: CWS vclcleanup02 (1.1.1.1.386); FILE MERGED 
2003/12/10 15:59:32 mt 1.1.1.1.386.1: #i23061# VCL cleanup, removed headers, methods and types...
2004-01-06 12:52:52 +00:00

393 lines
11 KiB
C++
Raw Blame History

/*************************************************************************
*
* $RCSfile: polyscan.cxx,v $
*
* $Revision: 1.2 $
*
* last change: $Author: vg $ $Date: 2004-01-06 13:52:52 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (the "License"); You may not use this file
* except in compliance with the License. You may obtain a copy of the
* License at http://www.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
#include <string.h>
#include <tools/new.hxx>
#include "salbtype.hxx"
#include "polyscan.hxx"
#ifndef _TL_POLY_HXX
#include <tools/poly.hxx>
#endif
// ----------------
// - PolyScanline -
// ----------------
PolyScanline::PolyScanline() :
mpFirst ( NULL ),
mpLast ( NULL ),
mpAct ( NULL ),
mnLeft ( 0L ),
mnRight ( 0L )
{
}
// ------------------------------------------------------------------------
PolyScanline::~PolyScanline()
{
ImplDelete();
}
// ------------------------------------------------------------------------
void PolyScanline::ImplDelete()
{
ScanlinePoint* pAct = mpFirst;
while( pAct )
{
ScanlinePoint* pNext = pAct->mpNext;
delete pAct;
pAct = pNext;
}
mnLeft = mnRight = 0L;
mpFirst = mpAct = mpLast = NULL;
}
// ------------------------------------------------------------------------
void PolyScanline::Insert( long nX )
{
// first point to insert?
if( !mpFirst )
mpLast = mpFirst = new ScanlinePoint( mnLeft = mnRight = nX, NULL );
else
{
// insert at the beginning of the scanline
if( nX <= mpFirst->mnX )
mpFirst = new ScanlinePoint( mnLeft = nX, mpFirst );
else if( nX >= mnRight )
mpLast = mpLast->mpNext = new ScanlinePoint( mnRight = nX, NULL );
else
{
ScanlinePoint* pLast = mpFirst;
ScanlinePoint* pAct = mpFirst->mpNext;
while( pAct )
{
// insert in the midlle of the scanline?
if( nX <= pAct->mnX )
{
pLast->mpNext = new ScanlinePoint( nX, pAct );
break;
}
pLast = pAct;
pAct = pAct->mpNext;
}
}
}
}
// ------------------------------------------------------------------------
void PolyScanline::Set( long nStart, long nEnd )
{
if( mpFirst )
ImplDelete();
if( nStart <= nEnd )
mpFirst = new ScanlinePoint( mnLeft = nStart, mpLast = new ScanlinePoint( mnRight = nEnd, NULL ) );
else
mpFirst = new ScanlinePoint( mnLeft = nEnd, mpLast = new ScanlinePoint( mnRight = nStart, NULL ) );
}
// ------------------------------------------------------------------------
BOOL PolyScanline::GetFirstSegment( PolyScanSegment& rSegment )
{
BOOL bRet = GetFirstX( rSegment.mnStart );
if( bRet && !GetNextX( rSegment.mnEnd ) )
rSegment.mnEnd = rSegment.mnStart;
return bRet;
}
// ------------------------------------------------------------------------
BOOL PolyScanline::GetNextSegment( PolyScanSegment& rSegment )
{
BOOL bRet = GetNextX( rSegment.mnStart );
if( bRet && !GetNextX( rSegment.mnEnd ) )
rSegment.mnEnd = rSegment.mnStart;
return bRet;
}
// ---------------
// - PolyScanner -
// ---------------
PolyScanner::PolyScanner( const Rectangle& rRect )
{
if( !rRect.IsEmpty() )
{
Rectangle aRect( rRect );
ULONG nHeight;
aRect.Justify();
mnLeft = aRect.Left();
mnTop = aRect.Top();
mnRight = aRect.Right();
mnBottom = aRect.Bottom();
mpArray = new PolyScanline[ nHeight = Height() ];
for( ULONG i = 0UL; i < nHeight; i++ )
mpArray[ i ].Set( mnLeft, mnRight );
}
else
{
mnLeft = mnTop = mnRight = mnBottom = 0L;
mpArray = NULL;
}
}
// ------------------------------------------------------------------------
PolyScanner::PolyScanner( const Polygon& rPoly )
{
const long nCount = rPoly.GetSize();
if( nCount )
{
long nLast = nCount - 1;
Point aFirst( rPoly[ 0 ] );
Point aLast( rPoly[ (USHORT) nLast ] );
while( nLast && ( aLast == aFirst ) )
aLast = rPoly[ (USHORT) --nLast ];
if( !nLast )
{
aLast = rPoly[ 0 ];
mnLeft = mnRight = aLast.X();
mnTop = mnBottom = aLast.Y();
mpArray = new PolyScanline[ 1UL ];
mpArray[ 0 ].Set( mnLeft, mnRight );
}
else
{
const Rectangle aRect( rPoly.GetBoundRect() );
ULONG nHeight;
mnLeft = aRect.Left();
mnTop = aRect.Top();
mnRight = aRect.Right();
mnBottom = aRect.Bottom();
aLast = aFirst;
mpArray = new PolyScanline[ nHeight = Height() ];
for( long i = 1L; i <= nLast; i++ )
{
const Point& rPt = rPoly[ (USHORT) i ];
if( rPt != aLast )
{
InsertLine( aLast, rPt );
aLast = rPt;
}
}
InsertLine( aLast, aFirst );
}
}
else
mpArray = NULL;
}
// ------------------------------------------------------------------------
PolyScanner::PolyScanner( const PolyPolygon& rPolyPoly )
{
mpArray = NULL;
}
// ------------------------------------------------------------------------
PolyScanner::~PolyScanner()
{
delete[] mpArray;
}
// ------------------------------------------------------------------------
PolyScanline* PolyScanner::operator[]( ULONG nPos ) const
{
DBG_ASSERT( nPos < Count(), "nPos out of range!" );
return( mpArray ? ( mpArray + nPos ) : NULL );
}
// ------------------------------------------------------------------------
void PolyScanner::InsertLine( const Point& rStart, const Point& rEnd )
{
long nX, nY;
if( rStart.Y() == rEnd.Y() )
mpArray[ rStart.Y() - mnTop ].Insert( rStart.X() );
else if( rStart.X() == rEnd.X() )
{
// vertical line
const long nEndY = rEnd.Y();
nX = rStart.X();
nY = rStart.Y();
if( nEndY > nY )
while( nY < nEndY )
mpArray[ nY++ - mnTop ].Insert( nX );
else
while( nY > nEndY )
mpArray[ nY-- - mnTop ].Insert( nX );
}
else
{
const long nDX = labs( rEnd.X() - rStart.X() );
const long nDY = labs( rEnd.Y() - rStart.Y() );
const long nStartX = rStart.X();
const long nStartY = rStart.Y();
const long nEndX = rEnd.X();
const long nEndY = rEnd.Y();
const long nXInc = ( nStartX < nEndX ) ? 1L : -1L;
const long nYInc = ( nStartY < nEndY ) ? 1L : -1L;
long nLastX = nStartX;
long nLastY = nStartY;
BOOL bLast = FALSE;
mpArray[ nStartY - mnTop ].Insert( nStartX );
if( nDX >= nDY )
{
const long nDYX = ( nDY - nDX ) << 1;
const long nDY2 = nDY << 1;
long nD = nDY2 - nDX;
for( nX = nStartX, nY = nLastY = nStartY; nX != nEndX; )
{
if( nY != nLastY )
{
if( bLast )
mpArray[ nLastY - mnTop ].Insert( nLastX );
mpArray[ nY - mnTop ].Insert( nX );
bLast = FALSE;
}
else
bLast = TRUE;
nLastX = nX;
nLastY = nY;
if( nD < 0L )
nD += nDY2;
else
{
nD += nDYX;
nY += nYInc;
}
nX += nXInc;
}
}
else
{
const long nDYX = ( nDX - nDY ) << 1;
const long nDY2 = nDX << 1;
long nD = nDY2 - nDY;
for( nX = nStartX, nY = nStartY; nY != nEndY; )
{
if( nY != nLastY )
{
if( bLast )
mpArray[ nLastY - mnTop ].Insert( nLastX );
mpArray[ nY - mnTop ].Insert( nX );
bLast = FALSE;
}
else
bLast = TRUE;
nLastX = nX;
nLastY = nY;
if( nD < 0L )
nD += nDY2;
else
{
nD += nDYX;
nX += nXInc;
}
nY += nYInc;
}
}
if( bLast )
mpArray[ nLastY - mnTop ].Insert( nLastX );
}
}
Reference in New Issue View Git Blame Copy Permalink