e6064484fa
Conflicts: chart2/source/controller/main/UndoManager.cxx chart2/source/tools/RegressionCurveHelper.cxx sc/inc/address.hxx sc/inc/attrib.hxx sc/inc/bigrange.hxx sc/inc/callform.hxx sc/inc/cell.hxx sc/inc/chartarr.hxx sc/inc/chartlis.hxx sc/inc/chgtrack.hxx sc/inc/collect.hxx sc/inc/compiler.hxx sc/inc/detdata.hxx sc/inc/document.hxx sc/inc/fillinfo.hxx sc/inc/olinetab.hxx sc/inc/prnsave.hxx sc/inc/queryparam.hxx sc/inc/sc.hrc sc/inc/scabstdlg.hxx sc/inc/table.hxx sc/inc/validat.hxx sc/inc/zforauto.hxx sc/source/core/data/documen2.cxx sc/source/core/data/document.cxx sc/source/core/data/table1.cxx sc/source/core/tool/address.cxx sc/source/core/tool/token.cxx sc/source/filter/excel/frmbase.cxx sc/source/filter/excel/impop.cxx sc/source/filter/excel/xename.cxx sc/source/filter/inc/formel.hxx sc/source/filter/inc/xename.hxx sc/source/filter/xml/xmlexprt.cxx sc/source/filter/xml/xmlnexpi.cxx sc/source/filter/xml/xmlnexpi.hxx sc/source/ui/dbgui/filtdlg.cxx sc/source/ui/inc/docfunc.hxx sc/source/ui/inc/namedlg.hxx sc/source/ui/namedlg/namedlg.cxx sc/source/ui/src/namedlg.src
276 lines
9.1 KiB
C++
276 lines
9.1 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*************************************************************************
|
|
*
|
|
* 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
|
|
*
|
|
* This file is part of OpenOffice.org.
|
|
*
|
|
* OpenOffice.org is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser General Public License version 3
|
|
* only, as published by the Free Software Foundation.
|
|
*
|
|
* OpenOffice.org 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 version 3 for more details
|
|
* (a copy is included in the LICENSE file that accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* version 3 along with OpenOffice.org. If not, see
|
|
* <http://www.openoffice.org/license.html>
|
|
* for a copy of the LGPLv3 License.
|
|
*
|
|
************************************************************************/
|
|
|
|
#ifndef SC_BIGRANGE_HXX
|
|
#define SC_BIGRANGE_HXX
|
|
|
|
|
|
#include "global.hxx"
|
|
#include "document.hxx"
|
|
|
|
|
|
static const sal_Int32 nInt32Min = 0x80000000;
|
|
static const sal_Int32 nInt32Max = 0x7fffffff;
|
|
|
|
|
|
class ScBigAddress
|
|
{
|
|
sal_Int32 nRow;
|
|
sal_Int32 nCol;
|
|
sal_Int32 nTab;
|
|
|
|
public:
|
|
ScBigAddress() : nRow(0), nCol(0), nTab(0) {}
|
|
ScBigAddress( sal_Int32 nColP, sal_Int32 nRowP, sal_Int32 nTabP )
|
|
: nRow( nRowP ), nCol( nColP ), nTab( nTabP ) {}
|
|
ScBigAddress( const ScBigAddress& r )
|
|
: nRow( r.nRow ), nCol( r.nCol ), nTab( r.nTab ) {}
|
|
ScBigAddress( const ScAddress& r )
|
|
: nRow( r.Row() ), nCol( r.Col() ), nTab( r.Tab() ) {}
|
|
|
|
sal_Int32 Col() const { return nCol; }
|
|
sal_Int32 Row() const { return nRow; }
|
|
sal_Int32 Tab() const { return nTab; }
|
|
|
|
void Set( sal_Int32 nColP, sal_Int32 nRowP, sal_Int32 nTabP )
|
|
{ nCol = nColP; nRow = nRowP; nTab = nTabP; }
|
|
void SetCol( sal_Int32 nColP ) { nCol = nColP; }
|
|
void SetRow( sal_Int32 nRowP ) { nRow = nRowP; }
|
|
void SetTab( sal_Int32 nTabP ) { nTab = nTabP; }
|
|
void IncCol( sal_Int32 n = 1 ) { nCol += n; }
|
|
void IncRow( sal_Int32 n = 1 ) { nRow += n; }
|
|
void IncTab( sal_Int32 n = 1 ) { nTab += n; }
|
|
|
|
void GetVars( sal_Int32& nColP, sal_Int32& nRowP, sal_Int32& nTabP ) const
|
|
{ nColP = nCol; nRowP = nRow; nTabP = nTab; }
|
|
|
|
inline void PutInOrder( ScBigAddress& r );
|
|
inline sal_Bool IsValid( const ScDocument* ) const;
|
|
inline ScAddress MakeAddress() const;
|
|
|
|
ScBigAddress& operator=( const ScBigAddress& r )
|
|
{ nCol = r.nCol; nRow = r.nRow; nTab = r.nTab; return *this; }
|
|
ScBigAddress& operator=( const ScAddress& r )
|
|
{ nCol = r.Col(); nRow = r.Row(); nTab = r.Tab(); return *this; }
|
|
int operator==( const ScBigAddress& r ) const
|
|
{ return nCol == r.nCol && nRow == r.nRow && nTab == r.nTab; }
|
|
int operator!=( const ScBigAddress& r ) const
|
|
{ return !operator==( r ); }
|
|
|
|
friend inline SvStream& operator<< ( SvStream& rStream, const ScBigAddress& rAdr );
|
|
friend inline SvStream& operator>> ( SvStream& rStream, ScBigAddress& rAdr );
|
|
};
|
|
|
|
|
|
inline void ScBigAddress::PutInOrder( ScBigAddress& r )
|
|
{
|
|
sal_Int32 nTmp;
|
|
if ( r.nCol < nCol )
|
|
{
|
|
nTmp = r.nCol;
|
|
r.nCol = nCol;
|
|
nCol = nTmp;
|
|
}
|
|
if ( r.nRow < nRow )
|
|
{
|
|
nTmp = r.nRow;
|
|
r.nRow = nRow;
|
|
nRow = nTmp;
|
|
}
|
|
if ( r.nTab < nTab )
|
|
{
|
|
nTmp = r.nTab;
|
|
r.nTab = nTab;
|
|
nTab = nTmp;
|
|
}
|
|
}
|
|
|
|
|
|
inline sal_Bool ScBigAddress::IsValid( const ScDocument* pDoc ) const
|
|
{ // min/max interval bounds define whole col/row/tab
|
|
return
|
|
((0 <= nCol && nCol <= MAXCOL)
|
|
|| nCol == nInt32Min || nCol == nInt32Max) &&
|
|
((0 <= nRow && nRow <= MAXROW)
|
|
|| nRow == nInt32Min || nRow == nInt32Max) &&
|
|
((0 <= nTab && nTab < pDoc->GetTableCount())
|
|
|| nTab == nInt32Min || nTab == nInt32Max)
|
|
;
|
|
}
|
|
|
|
|
|
inline ScAddress ScBigAddress::MakeAddress() const
|
|
{
|
|
SCCOL nColA;
|
|
SCROW nRowA;
|
|
SCTAB nTabA;
|
|
|
|
if ( nCol < 0 )
|
|
nColA = 0;
|
|
else if ( nCol > MAXCOL )
|
|
nColA = MAXCOL;
|
|
else
|
|
nColA = (SCCOL) nCol;
|
|
|
|
if ( nRow < 0 )
|
|
nRowA = 0;
|
|
else if ( nRow > MAXROW )
|
|
nRowA = MAXROW;
|
|
else
|
|
nRowA = (SCROW) nRow;
|
|
|
|
if ( nTab < 0 )
|
|
nTabA = 0;
|
|
else if ( nTab > MAXTAB )
|
|
nTabA = MAXTAB;
|
|
else
|
|
nTabA = (SCTAB) nTab;
|
|
|
|
return ScAddress( nColA, nRowA, nTabA );
|
|
}
|
|
|
|
|
|
inline SvStream& operator<< ( SvStream& rStream, const ScBigAddress& rAdr )
|
|
{
|
|
rStream << rAdr.nCol << rAdr.nRow << rAdr.nTab;
|
|
return rStream;
|
|
}
|
|
|
|
|
|
inline SvStream& operator>> ( SvStream& rStream, ScBigAddress& rAdr )
|
|
{
|
|
rStream >> rAdr.nCol >> rAdr.nRow >> rAdr.nTab;
|
|
return rStream;
|
|
}
|
|
|
|
|
|
class ScBigRange
|
|
{
|
|
public:
|
|
|
|
ScBigAddress aStart;
|
|
ScBigAddress aEnd;
|
|
|
|
ScBigRange() : aStart(), aEnd() {}
|
|
ScBigRange( const ScBigAddress& s, const ScBigAddress& e )
|
|
: aStart( s ), aEnd( e ) { aStart.PutInOrder( aEnd ); }
|
|
ScBigRange( const ScBigRange& r )
|
|
: aStart( r.aStart ), aEnd( r.aEnd ) {}
|
|
ScBigRange( const ScRange& r )
|
|
: aStart( r.aStart ), aEnd( r.aEnd ) {}
|
|
ScBigRange( const ScBigAddress& r )
|
|
: aStart( r ), aEnd( r ) {}
|
|
ScBigRange( const ScAddress& r )
|
|
: aStart( r ), aEnd( r ) {}
|
|
ScBigRange( sal_Int32 nCol, sal_Int32 nRow, sal_Int32 nTab )
|
|
: aStart( nCol, nRow, nTab ), aEnd( aStart ) {}
|
|
ScBigRange( sal_Int32 nCol1, sal_Int32 nRow1, sal_Int32 nTab1,
|
|
sal_Int32 nCol2, sal_Int32 nRow2, sal_Int32 nTab2 )
|
|
: aStart( nCol1, nRow1, nTab1 ),
|
|
aEnd( nCol2, nRow2, nTab2 ) {}
|
|
|
|
void Set( sal_Int32 nCol1, sal_Int32 nRow1, sal_Int32 nTab1,
|
|
sal_Int32 nCol2, sal_Int32 nRow2, sal_Int32 nTab2 )
|
|
{ aStart.Set( nCol1, nRow1, nTab1 );
|
|
aEnd.Set( nCol2, nRow2, nTab2 ); }
|
|
|
|
void GetVars( sal_Int32& nCol1, sal_Int32& nRow1, sal_Int32& nTab1,
|
|
sal_Int32& nCol2, sal_Int32& nRow2, sal_Int32& nTab2 ) const
|
|
{ aStart.GetVars( nCol1, nRow1, nTab1 );
|
|
aEnd.GetVars( nCol2, nRow2, nTab2 ); }
|
|
|
|
sal_Bool IsValid( const ScDocument* pDoc ) const
|
|
{ return aStart.IsValid( pDoc ) && aEnd.IsValid( pDoc ); }
|
|
inline ScRange MakeRange() const
|
|
{ return ScRange( aStart.MakeAddress(),
|
|
aEnd.MakeAddress() ); }
|
|
|
|
inline sal_Bool In( const ScBigAddress& ) const; // is Address& in range?
|
|
inline sal_Bool In( const ScBigRange& ) const; // is Range& in range?
|
|
inline sal_Bool Intersects( const ScBigRange& ) const; // do two ranges overlap?
|
|
|
|
ScBigRange& operator=( const ScBigRange& r )
|
|
{ aStart = r.aStart; aEnd = r.aEnd; return *this; }
|
|
int operator==( const ScBigRange& r ) const
|
|
{ return (aStart == r.aStart) && (aEnd == r.aEnd); }
|
|
int operator!=( const ScBigRange& r ) const
|
|
{ return !operator==( r ); }
|
|
|
|
friend inline SvStream& operator<< ( SvStream& rStream, const ScBigRange& rRange );
|
|
friend inline SvStream& operator>> ( SvStream& rStream, ScBigRange& rRange );
|
|
};
|
|
|
|
|
|
inline sal_Bool ScBigRange::In( const ScBigAddress& rAddr ) const
|
|
{
|
|
return
|
|
aStart.Col() <= rAddr.Col() && rAddr.Col() <= aEnd.Col() &&
|
|
aStart.Row() <= rAddr.Row() && rAddr.Row() <= aEnd.Row() &&
|
|
aStart.Tab() <= rAddr.Tab() && rAddr.Tab() <= aEnd.Tab();
|
|
}
|
|
|
|
|
|
inline sal_Bool ScBigRange::In( const ScBigRange& r ) const
|
|
{
|
|
return
|
|
aStart.Col() <= r.aStart.Col() && r.aEnd.Col() <= aEnd.Col() &&
|
|
aStart.Row() <= r.aStart.Row() && r.aEnd.Row() <= aEnd.Row() &&
|
|
aStart.Tab() <= r.aStart.Tab() && r.aEnd.Tab() <= aEnd.Tab();
|
|
}
|
|
|
|
|
|
inline sal_Bool ScBigRange::Intersects( const ScBigRange& r ) const
|
|
{
|
|
return !(
|
|
Min( aEnd.Col(), r.aEnd.Col() ) < Max( aStart.Col(), r.aStart.Col() )
|
|
|| Min( aEnd.Row(), r.aEnd.Row() ) < Max( aStart.Row(), r.aStart.Row() )
|
|
|| Min( aEnd.Tab(), r.aEnd.Tab() ) < Max( aStart.Tab(), r.aStart.Tab() )
|
|
);
|
|
}
|
|
|
|
|
|
inline SvStream& operator<< ( SvStream& rStream, const ScBigRange& rRange )
|
|
{
|
|
rStream << rRange.aStart;
|
|
rStream << rRange.aEnd;
|
|
return rStream;
|
|
}
|
|
|
|
|
|
inline SvStream& operator>> ( SvStream& rStream, ScBigRange& rRange )
|
|
{
|
|
rStream >> rRange.aStart;
|
|
rStream >> rRange.aEnd;
|
|
return rStream;
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|