1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
|
/**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_sw.hxx"
#ifdef DBG_UTIL
#ifndef _STREAM_HXX //autogen
#include <tools/stream.hxx>
#endif
#endif
#include <stdlib.h>
#include "swrect.hxx"
#include <math.h>
/*************************************************************************
|*
|* SwRect::SwRect()
|*
|* Ersterstellung MA 02. Feb. 93
|* Letzte Aenderung MA 05. Sep. 93
|*
|*************************************************************************/
SwRect::SwRect( const Rectangle &rRect ) :
m_Point( rRect.Left(), rRect.Top() )
{
m_Size.setWidth(rRect.Right() == RECT_EMPTY ? 0 :
rRect.Right() - rRect.Left() +1);
m_Size.setHeight(rRect.Bottom() == RECT_EMPTY ? 0 :
rRect.Bottom() - rRect.Top() + 1);
}
/*************************************************************************
|*
|* SwRect::Center()
|*
|* Ersterstellung MA 27. Jan. 93
|* Letzte Aenderung MA 27. Jan. 93
|*
|*************************************************************************/
Point SwRect::Center() const
{
return Point( Left() + Width() / 2,
Top() + Height() / 2 );
/* Wer ruft schon ein Center auf ein "falsches" Rechteck?
const long nRight = Right();
const long nBottom= Bottom();
return Point( min( Left(), nRight ) + long(abs( (nRight - Left())/2) ),
min( Top(), nBottom) + long(abs( (nBottom - Top())/2)));
*/
}
/*************************************************************************
|*
|* SwRect::Union()
|*
|* Ersterstellung MA 27. Jan. 93
|* Letzte Aenderung MA 27. Jan. 93
|*
|*************************************************************************/
SwRect& SwRect::Union( const SwRect& rRect )
{
if ( Top() > rRect.Top() )
Top( rRect.Top() );
if ( Left() > rRect.Left() )
Left( rRect.Left() );
long n = rRect.Right();
if ( Right() < n )
Right( n );
n = rRect.Bottom();
if ( Bottom() < n )
Bottom( n );
return *this;
}
/*************************************************************************
|*
|* SwRect::Intersection(), _Intersection()
|*
|* Ersterstellung MA 27. Jan. 93
|* Letzte Aenderung MA 05. Sep. 93
|*
|*************************************************************************/
SwRect& SwRect::Intersection( const SwRect& rRect )
{
//Hat das Teil ueberhaupt Gemeinsamkeiten mit mir?
if ( IsOver( rRect ) )
{
//Bestimmung der kleineren rechten sowie unteren und
// der groesseren linken sowie oberen Kante.
if ( Left() < rRect.Left() )
Left( rRect.Left() );
if ( Top() < rRect.Top() )
Top( rRect.Top() );
long n = rRect.Right();
if ( Right() > n )
Right( n );
n = rRect.Bottom();
if ( Bottom() > n )
Bottom( n );
}
else
//Def.: Bei einer leeren Intersection wird nur die SSize genullt.
SSize(0, 0);
return *this;
}
SwRect& SwRect::_Intersection( const SwRect& rRect )
{
//Bestimmung der kleineren rechten sowie unteren und
// der groesseren linken sowie oberen Kante.
if ( Left() < rRect.Left() )
Left( rRect.Left() );
if ( Top() < rRect.Top() )
Top( rRect.Top() );
long n = rRect.Right();
if ( Right() > n )
Right( n );
n = rRect.Bottom();
if ( Bottom() > n )
Bottom( n );
return *this;
}
/*************************************************************************
|*
|* SwRect::IsInside()
|*
|* Ersterstellung MA 27. Jan. 93
|* Letzte Aenderung MA 27. Jan. 93
|*
|*************************************************************************/
sal_Bool SwRect::IsInside( const SwRect& rRect ) const
{
const long nRight = Right();
const long nBottom = Bottom();
const long nrRight = rRect.Right();
const long nrBottom= rRect.Bottom();
return (Left() <= rRect.Left()) && (rRect.Left()<= nRight) &&
(Left() <= nrRight) && (nrRight <= nRight) &&
(Top() <= rRect.Top()) && (rRect.Top() <= nBottom) &&
(Top() <= nrBottom) && (nrBottom <= nBottom);
}
sal_Bool SwRect::IsInside( const Point& rPoint ) const
{
return (Left() <= rPoint.X())
&& (Top() <= rPoint.Y())
&& (Right() >= rPoint.X())
&& (Bottom()>= rPoint.Y());
}
/* -----------------------------11.04.00 15:46--------------------------------
mouse moving of table borders
---------------------------------------------------------------------------*/
sal_Bool SwRect::IsNear( const Point& rPoint, long nTolerance ) const
{
return IsInside(rPoint) ||
(((Left() - nTolerance) <= rPoint.X())
&& ((Top() - nTolerance) <= rPoint.Y())
&& ((Right() + nTolerance) >= rPoint.X())
&& ((Bottom() + nTolerance)>= rPoint.Y()));
}
/*************************************************************************
|*
|* SwRect::IsOver()
|*
|* Ersterstellung MA 25. Feb. 94
|* Letzte Aenderung MA 27. Jun. 96
|*
|*************************************************************************/
sal_Bool SwRect::IsOver( const SwRect& rRect ) const
{
return (Top() <= rRect.Bottom())
&& (Left() <= rRect.Right())
&& (Right() >= rRect.Left())
&& (Bottom()>= rRect.Top()) ? sal_True : sal_False;
}
/*************************************************************************
|*
|* SwRect::Justify()
|*
|* Ersterstellung MA 10. Oct. 94
|* Letzte Aenderung MA 23. Oct. 96
|*
|*************************************************************************/
void SwRect::Justify()
{
if ( m_Size.getHeight() < 0 )
{
m_Point.Y() += m_Size.getHeight() + 1;
m_Size.setHeight(-m_Size.getHeight());
}
if ( m_Size.getWidth() < 0 )
{
m_Point.X() += m_Size.getWidth() + 1;
m_Size.setWidth(-m_Size.getWidth());
}
}
// Similar to the inline methods, but we need the function pointers
void SwRect::_Width( const long nNew ) { m_Size.setWidth(nNew); }
void SwRect::_Height( const long nNew ) { m_Size.setHeight(nNew); }
void SwRect::_Left( const long nLeft ){ m_Size.Width() += m_Point.getX() - nLeft; m_Point.setX(nLeft); }
void SwRect::_Right( const long nRight ){ m_Size.setWidth(nRight - m_Point.getX()); }
void SwRect::_Top( const long nTop ){ m_Size.Height() += m_Point.getY() - nTop; m_Point.setY(nTop); }
void SwRect::_Bottom( const long nBottom ){ m_Size.setHeight(nBottom - m_Point.getY()); }
long SwRect::_Width() const{ return m_Size.getWidth(); }
long SwRect::_Height() const{ return m_Size.getHeight(); }
long SwRect::_Left() const{ return m_Point.getX(); }
long SwRect::_Right() const{ return m_Point.getX() + m_Size.getWidth(); }
long SwRect::_Top() const{ return m_Point.getY(); }
long SwRect::_Bottom() const{ return m_Point.getY() + m_Size.getHeight(); }
void SwRect::AddWidth( const long nAdd ) { m_Size.Width() += nAdd; }
void SwRect::AddHeight( const long nAdd ) { m_Size.Height() += nAdd; }
void SwRect::SubLeft( const long nSub ){ m_Size.Width() += nSub; m_Point.X() -= nSub; }
void SwRect::AddRight( const long nAdd ){ m_Size.Width() += nAdd; }
void SwRect::SubTop( const long nSub ){ m_Size.Height() += nSub; m_Point.Y() -= nSub; }
void SwRect::AddBottom( const long nAdd ){ m_Size.Height() += nAdd; }
void SwRect::SetPosX( const long nNew ){ m_Point.setX(nNew); }
void SwRect::SetPosY( const long nNew ){ m_Point.setY(nNew); }
const Size SwRect::_Size() const { return SSize(); }
const Size SwRect::SwappedSize() const { return Size( m_Size.getHeight(), m_Size.getWidth() ); }
const Point SwRect::TopLeft() const { return Pos(); }
const Point SwRect::TopRight() const { return Point( m_Point.getX() + m_Size.getWidth(), m_Point.getY() ); }
const Point SwRect::BottomLeft() const { return Point( m_Point.getX(), m_Point.getY() + m_Size.getHeight() ); }
const Point SwRect::BottomRight() const
{ return Point( m_Point.getX() + m_Size.getWidth(), m_Point.getY() + m_Size.getHeight() ); }
long SwRect::GetLeftDistance( long nLimit ) const { return m_Point.getX() - nLimit; }
long SwRect::GetBottomDistance( long nLim ) const { return nLim - m_Point.getY() - m_Size.getHeight();}
long SwRect::GetTopDistance( long nLimit ) const { return m_Point.getY() - nLimit; }
long SwRect::GetRightDistance( long nLim ) const { return nLim - m_Point.getX() - m_Size.getWidth(); }
sal_Bool SwRect::OverStepLeft( long nLimit ) const
{ return nLimit > m_Point.getX() && m_Point.getX() + m_Size.getWidth() > nLimit; }
sal_Bool SwRect::OverStepBottom( long nLimit ) const
{ return nLimit > m_Point.getY() && m_Point.getY() + m_Size.getHeight() > nLimit; }
sal_Bool SwRect::OverStepTop( long nLimit ) const
{ return nLimit > m_Point.getY() && m_Point.getY() + m_Size.getHeight() > nLimit; }
sal_Bool SwRect::OverStepRight( long nLimit ) const
{ return nLimit > m_Point.getX() && m_Point.getX() + m_Size.getWidth() > nLimit; }
void SwRect::SetLeftAndWidth( long nLeft, long nNew )
{
m_Point.setX(nLeft);
m_Size.setWidth(nNew);
}
void SwRect::SetTopAndHeight( long nTop, long nNew )
{
m_Point.setY(nTop);
m_Size.setHeight(nNew);
}
void SwRect::SetRightAndWidth( long nRight, long nNew )
{
m_Point.setX(nRight - nNew);
m_Size.setWidth(nNew);
}
void SwRect::SetBottomAndHeight( long nBottom, long nNew )
{
m_Point.setY(nBottom - nNew);
m_Size.setHeight(nNew);
}
void SwRect::SetUpperLeftCorner( const Point& rNew )
{ m_Point = rNew; }
void SwRect::SetUpperRightCorner( const Point& rNew )
{ m_Point = Point(rNew.nA - m_Size.getWidth(), rNew.nB); }
void SwRect::SetLowerLeftCorner( const Point& rNew )
{ m_Point = Point(rNew.nA, rNew.nB - m_Size.getHeight()); }
#ifdef DBG_UTIL
/*************************************************************************
* operator<<( ostream&, SwRect&)
*************************************************************************/
SvStream &operator<<( SvStream &rStream, const SwRect &rRect )
{
rStream << '[' << rRect.Top() << '/' << rRect.Left()
<< ',' << rRect.Width() << 'x' << rRect.Height() << "] ";
return rStream;
}
#endif
|
