Version 6.1.0.2, tag libreoffice-6.1.0.2
[LibreOffice.git] / sc / inc / bigrange.hxx
blob995b03d1a36a91c96ba8cde22ce01faf032c148e
1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 /*
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
20 #ifndef INCLUDED_SC_INC_BIGRANGE_HXX
21 #define INCLUDED_SC_INC_BIGRANGE_HXX
23 #include "address.hxx"
24 #include <algorithm>
26 static const sal_Int32 nInt32Min = 0x80000000;
27 static const sal_Int32 nInt32Max = 0x7fffffff;
29 class ScDocument;
31 class ScBigAddress
33 sal_Int32 nRow;
34 sal_Int32 nCol;
35 sal_Int32 nTab;
37 public:
38 ScBigAddress() : nRow(0), nCol(0), nTab(0) {}
39 ScBigAddress( sal_Int32 nColP, sal_Int32 nRowP, sal_Int32 nTabP )
40 : nRow( nRowP ), nCol( nColP ), nTab( nTabP ) {}
41 ScBigAddress( const ScBigAddress& r )
42 : nRow( r.nRow ), nCol( r.nCol ), nTab( r.nTab ) {}
43 ScBigAddress( const ScAddress& r )
44 : nRow( r.Row() ), nCol( r.Col() ), nTab( r.Tab() ) {}
46 sal_Int32 Col() const { return nCol; }
47 sal_Int32 Row() const { return nRow; }
48 sal_Int32 Tab() const { return nTab; }
50 void Set( sal_Int32 nColP, sal_Int32 nRowP, sal_Int32 nTabP )
51 { nCol = nColP; nRow = nRowP; nTab = nTabP; }
52 void SetCol( sal_Int32 nColP ) { nCol = nColP; }
53 void SetRow( sal_Int32 nRowP ) { nRow = nRowP; }
54 void SetTab( sal_Int32 nTabP ) { nTab = nTabP; }
55 void IncCol( sal_Int32 n = 1 ) { nCol += n; }
56 void IncRow( sal_Int32 n = 1 ) { nRow += n; }
57 void IncTab( sal_Int32 n = 1 ) { nTab += n; }
59 void GetVars( sal_Int32& nColP, sal_Int32& nRowP, sal_Int32& nTabP ) const
60 { nColP = nCol; nRowP = nRow; nTabP = nTab; }
62 bool IsValid( const ScDocument* pDoc ) const;
63 inline ScAddress MakeAddress() const;
65 ScBigAddress& operator=( const ScBigAddress& r )
66 { nCol = r.nCol; nRow = r.nRow; nTab = r.nTab; return *this; }
67 ScBigAddress& operator=( const ScAddress& r )
68 { nCol = r.Col(); nRow = r.Row(); nTab = r.Tab(); return *this; }
69 bool operator==( const ScBigAddress& r ) const
70 { return nCol == r.nCol && nRow == r.nRow && nTab == r.nTab; }
71 bool operator!=( const ScBigAddress& r ) const
72 { return !operator==( r ); }
75 inline ScAddress ScBigAddress::MakeAddress() const
77 SCCOL nColA;
78 SCROW nRowA;
79 SCTAB nTabA;
81 if ( nCol < 0 )
82 nColA = 0;
83 else if ( nCol > MAXCOL )
84 nColA = MAXCOL;
85 else
86 nColA = static_cast<SCCOL>(nCol);
88 if ( nRow < 0 )
89 nRowA = 0;
90 else if ( nRow > MAXROW )
91 nRowA = MAXROW;
92 else
93 nRowA = static_cast<SCROW>(nRow);
95 if ( nTab < 0 )
96 nTabA = 0;
97 else if ( nTab > MAXTAB )
98 nTabA = MAXTAB;
99 else
100 nTabA = static_cast<SCTAB>(nTab);
102 return ScAddress( nColA, nRowA, nTabA );
105 class ScBigRange
107 public:
109 ScBigAddress aStart;
110 ScBigAddress aEnd;
112 ScBigRange() : aStart(), aEnd() {}
113 ScBigRange( const ScBigRange& r )
114 : aStart( r.aStart ), aEnd( r.aEnd ) {}
115 ScBigRange( const ScRange& r )
116 : aStart( r.aStart ), aEnd( r.aEnd ) {}
117 ScBigRange( sal_Int32 nCol1, sal_Int32 nRow1, sal_Int32 nTab1,
118 sal_Int32 nCol2, sal_Int32 nRow2, sal_Int32 nTab2 )
119 : aStart( nCol1, nRow1, nTab1 ),
120 aEnd( nCol2, nRow2, nTab2 ) {}
122 void Set( sal_Int32 nCol1, sal_Int32 nRow1, sal_Int32 nTab1,
123 sal_Int32 nCol2, sal_Int32 nRow2, sal_Int32 nTab2 )
124 { aStart.Set( nCol1, nRow1, nTab1 );
125 aEnd.Set( nCol2, nRow2, nTab2 ); }
127 void GetVars( sal_Int32& nCol1, sal_Int32& nRow1, sal_Int32& nTab1,
128 sal_Int32& nCol2, sal_Int32& nRow2, sal_Int32& nTab2 ) const
129 { aStart.GetVars( nCol1, nRow1, nTab1 );
130 aEnd.GetVars( nCol2, nRow2, nTab2 ); }
132 bool IsValid( const ScDocument* pDoc ) const
133 { return aStart.IsValid( pDoc ) && aEnd.IsValid( pDoc ); }
134 ScRange MakeRange() const
135 { return ScRange( aStart.MakeAddress(),
136 aEnd.MakeAddress() ); }
138 inline bool In( const ScBigAddress& ) const; ///< is Address& in range?
139 inline bool In( const ScBigRange& ) const; ///< is Range& in range?
140 inline bool Intersects( const ScBigRange& ) const; ///< do two ranges overlap?
142 ScBigRange& operator=( const ScBigRange& r )
143 { aStart = r.aStart; aEnd = r.aEnd; return *this; }
144 bool operator==( const ScBigRange& r ) const
145 { return (aStart == r.aStart) && (aEnd == r.aEnd); }
146 bool operator!=( const ScBigRange& r ) const
147 { return !operator==( r ); }
150 inline bool ScBigRange::In( const ScBigAddress& rAddr ) const
152 return
153 aStart.Col() <= rAddr.Col() && rAddr.Col() <= aEnd.Col() &&
154 aStart.Row() <= rAddr.Row() && rAddr.Row() <= aEnd.Row() &&
155 aStart.Tab() <= rAddr.Tab() && rAddr.Tab() <= aEnd.Tab();
158 inline bool ScBigRange::In( const ScBigRange& r ) const
160 return
161 aStart.Col() <= r.aStart.Col() && r.aEnd.Col() <= aEnd.Col() &&
162 aStart.Row() <= r.aStart.Row() && r.aEnd.Row() <= aEnd.Row() &&
163 aStart.Tab() <= r.aStart.Tab() && r.aEnd.Tab() <= aEnd.Tab();
166 inline bool ScBigRange::Intersects( const ScBigRange& r ) const
168 return !(
169 std::min( aEnd.Col(), r.aEnd.Col() ) < std::max( aStart.Col(), r.aStart.Col() )
170 || std::min( aEnd.Row(), r.aEnd.Row() ) < std::max( aStart.Row(), r.aStart.Row() )
171 || std::min( aEnd.Tab(), r.aEnd.Tab() ) < std::max( aStart.Tab(), r.aStart.Tab() )
175 #endif
177 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */