1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
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 .
22 #include "address.hxx"
25 const sal_Int32 nInt32Min
= 0x80000000;
26 const sal_Int32 nInt32Max
= 0x7fffffff;
37 ScBigAddress() : nRow(0), nCol(0), nTab(0) {}
38 ScBigAddress( sal_Int32 nColP
, sal_Int32 nRowP
, sal_Int32 nTabP
)
39 : nRow( nRowP
), nCol( nColP
), nTab( nTabP
) {}
40 ScBigAddress( const ScBigAddress
& r
)
41 : nRow( r
.nRow
), nCol( r
.nCol
), nTab( r
.nTab
) {}
42 ScBigAddress( ScBigAddress
&& ) = default;
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
& rDoc
) 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=( ScBigAddress
&& ) = default;
68 ScBigAddress
& operator=( const ScAddress
& r
)
69 { nCol
= r
.Col(); nRow
= r
.Row(); nTab
= r
.Tab(); return *this; }
70 bool operator==( const ScBigAddress
& r
) const
71 { return nCol
== r
.nCol
&& nRow
== r
.nRow
&& nTab
== r
.nTab
; }
72 bool operator!=( const ScBigAddress
& r
) const
73 { return !operator==( r
); }
76 inline ScAddress
ScBigAddress::MakeAddress() const
84 else if ( nCol
> MAXCOL
)
87 nColA
= static_cast<SCCOL
>(nCol
);
91 else if ( nRow
> MAXROW
)
94 nRowA
= static_cast<SCROW
>(nRow
);
98 else if ( nTab
> MAXTAB
)
101 nTabA
= static_cast<SCTAB
>(nTab
);
103 return ScAddress( nColA
, nRowA
, nTabA
);
113 ScBigRange() : aStart(), aEnd() {}
114 ScBigRange( const ScBigRange
& r
)
115 : aStart( r
.aStart
), aEnd( r
.aEnd
) {}
116 ScBigRange( ScBigRange
&& ) = default;
117 ScBigRange( const ScRange
& r
)
118 : aStart( r
.aStart
), aEnd( r
.aEnd
) {}
119 ScBigRange( sal_Int32 nCol1
, sal_Int32 nRow1
, sal_Int32 nTab1
,
120 sal_Int32 nCol2
, sal_Int32 nRow2
, sal_Int32 nTab2
)
121 : aStart( nCol1
, nRow1
, nTab1
),
122 aEnd( nCol2
, nRow2
, nTab2
) {}
124 void Set( sal_Int32 nCol1
, sal_Int32 nRow1
, sal_Int32 nTab1
,
125 sal_Int32 nCol2
, sal_Int32 nRow2
, sal_Int32 nTab2
)
126 { aStart
.Set( nCol1
, nRow1
, nTab1
);
127 aEnd
.Set( nCol2
, nRow2
, nTab2
); }
129 void GetVars( sal_Int32
& nCol1
, sal_Int32
& nRow1
, sal_Int32
& nTab1
,
130 sal_Int32
& nCol2
, sal_Int32
& nRow2
, sal_Int32
& nTab2
) const
131 { aStart
.GetVars( nCol1
, nRow1
, nTab1
);
132 aEnd
.GetVars( nCol2
, nRow2
, nTab2
); }
134 bool IsValid( const ScDocument
& rDoc
) const
135 { return aStart
.IsValid( rDoc
) && aEnd
.IsValid( rDoc
); }
136 ScRange
MakeRange() const
137 { return ScRange( aStart
.MakeAddress(),
138 aEnd
.MakeAddress() ); }
140 inline bool In( const ScBigAddress
& ) const; ///< is Address& in range?
141 inline bool In( const ScBigRange
& ) const; ///< is Range& in range?
142 inline bool Intersects( const ScBigRange
& ) const; ///< do two ranges overlap?
144 ScBigRange
& operator=( const ScBigRange
& r
)
145 { aStart
= r
.aStart
; aEnd
= r
.aEnd
; return *this; }
146 ScBigRange
& operator=( ScBigRange
&& ) = default;
147 bool operator==( const ScBigRange
& r
) const
148 { return (aStart
== r
.aStart
) && (aEnd
== r
.aEnd
); }
149 bool operator!=( const ScBigRange
& r
) const
150 { return !operator==( r
); }
153 inline bool ScBigRange::In( const ScBigAddress
& rAddr
) const
156 aStart
.Col() <= rAddr
.Col() && rAddr
.Col() <= aEnd
.Col() &&
157 aStart
.Row() <= rAddr
.Row() && rAddr
.Row() <= aEnd
.Row() &&
158 aStart
.Tab() <= rAddr
.Tab() && rAddr
.Tab() <= aEnd
.Tab();
161 inline bool ScBigRange::In( const ScBigRange
& r
) const
164 aStart
.Col() <= r
.aStart
.Col() && r
.aEnd
.Col() <= aEnd
.Col() &&
165 aStart
.Row() <= r
.aStart
.Row() && r
.aEnd
.Row() <= aEnd
.Row() &&
166 aStart
.Tab() <= r
.aStart
.Tab() && r
.aEnd
.Tab() <= aEnd
.Tab();
169 inline bool ScBigRange::Intersects( const ScBigRange
& r
) const
172 std::min( aEnd
.Col(), r
.aEnd
.Col() ) < std::max( aStart
.Col(), r
.aStart
.Col() )
173 || std::min( aEnd
.Row(), r
.aEnd
.Row() ) < std::max( aStart
.Row(), r
.aStart
.Row() )
174 || std::min( aEnd
.Tab(), r
.aEnd
.Tab() ) < std::max( aStart
.Tab(), r
.aStart
.Tab() )
178 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */