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
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* 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 .
*/
#ifndef INCLUDED_TOOLS_GEN_HXX
#define INCLUDED_TOOLS_GEN_HXX
#include <tools/toolsdllapi.h>
#include <limits.h>
#include <algorithm>
#include <ostream>
#include <cstdlib>
class SvStream;
namespace rtl
{
class OString;
}
enum TriState { TRISTATE_FALSE, TRISTATE_TRUE, TRISTATE_INDET };
// Pair
class SAL_WARN_UNUSED Pair
{
public:
Pair() : nA(0), nB(0) {}
Pair( long _nA, long _nB ) : nA(_nA), nB(_nB) {}
long A() const { return nA; }
long B() const { return nB; }
long& A() { return nA; }
long& B() { return nB; }
TOOLS_DLLPUBLIC rtl::OString toString() const;
TOOLS_DLLPUBLIC friend SvStream& ReadPair( SvStream& rIStream, Pair& rPair );
TOOLS_DLLPUBLIC friend SvStream& WritePair( SvStream& rOStream, const Pair& rPair );
protected:
long nA;
long nB;
};
namespace tools { namespace detail {
// Used to implement operator == for subclasses of Pair:
inline bool equal(Pair const & p1, Pair const & p2)
{
return p1.A() == p2.A() && p1.B() == p2.B();
}
} }
// Point
class SAL_WARN_UNUSED SAL_DLLPUBLIC_EXPORT Point : public Pair
{
public:
Point() {}
Point( long nX, long nY ) : Pair( nX, nY ) {}
long X() const { return nA; }
long Y() const { return nB; }
long& X() { return nA; }
long& Y() { return nB; }
void Move( long nHorzMove, long nVertMove );
void RotateAround( long& rX, long& rY, short nOrientation ) const;
Point& operator += ( const Point& rPoint );
Point& operator -= ( const Point& rPoint );
Point& operator *= ( const long nVal );
Point& operator /= ( const long nVal );
friend inline Point operator+( const Point &rVal1, const Point &rVal2 );
friend inline Point operator-( const Point &rVal1, const Point &rVal2 );
friend inline Point operator*( const Point &rVal1, const long nVal2 );
friend inline Point operator/( const Point &rVal1, const long nVal2 );
long getX() const { return X(); }
long getY() const { return Y(); }
void setX(long nX) { X() = nX; }
void setY(long nY) { Y() = nY; }
};
inline void Point::Move( long nHorzMove, long nVertMove )
{
nA += nHorzMove;
nB += nVertMove;
}
inline Point& Point::operator += ( const Point& rPoint )
{
nA += rPoint.nA;
nB += rPoint.nB;
return *this;
}
inline Point& Point::operator -= ( const Point& rPoint )
{
nA -= rPoint.nA;
nB -= rPoint.nB;
return *this;
}
inline Point& Point::operator *= ( const long nVal )
{
nA *= nVal;
nB *= nVal;
return *this;
}
inline Point& Point::operator /= ( const long nVal )
{
nA /= nVal;
nB /= nVal;
return *this;
}
inline Point operator+( const Point &rVal1, const Point &rVal2 )
{
return Point( rVal1.nA+rVal2.nA, rVal1.nB+rVal2.nB );
}
inline Point operator-( const Point &rVal1, const Point &rVal2 )
{
return Point( rVal1.nA-rVal2.nA, rVal1.nB-rVal2.nB );
}
inline Point operator*( const Point &rVal1, const long nVal2 )
{
return Point( rVal1.nA*nVal2, rVal1.nB*nVal2 );
}
inline Point operator/( const Point &rVal1, const long nVal2 )
{
return Point( rVal1.nA/nVal2, rVal1.nB/nVal2 );
}
inline bool operator ==(Point const & p1, Point const & p2)
{
return tools::detail::equal(p1, p2);
}
inline bool operator !=(Point const & p1, Point const & p2)
{
return !(p1 == p2);
}
template< typename charT, typename traits >
inline std::basic_ostream<charT, traits> & operator <<(
std::basic_ostream<charT, traits> & stream, const Point& point )
{
return stream << point.X() << ',' << point.Y();
}
// Size
class SAL_WARN_UNUSED Size : public Pair
{
public:
Size() {}
Size( long nWidth, long nHeight ) : Pair( nWidth, nHeight ) {}
long Width() const { return nA; }
long Height() const { return nB; }
long& Width() { return nA; }
long& Height() { return nB; }
long getWidth() const { return Width(); }
long getHeight() const { return Height(); }
void setWidth(long nWidth) { Width() = nWidth; }
void setHeight(long nHeight) { Height() = nHeight; }
};
inline bool operator ==(Size const & s1, Size const & s2)
{
return tools::detail::equal(s1, s2);
}
inline bool operator !=(Size const & s1, Size const & s2)
{
return !(s1 == s2);
}
template< typename charT, typename traits >
inline std::basic_ostream<charT, traits> & operator <<(
std::basic_ostream<charT, traits> & stream, const Size& size )
{
return stream << size.Width() << 'x' << size.Height();
}
// Range
#define RANGE_MAX LONG_MAX
class SAL_WARN_UNUSED Range : public Pair
{
public:
Range() {}
Range( long nMin, long nMax ) : Pair( nMin, nMax ) {}
long Min() const { return nA; }
long Max() const { return nB; }
long Len() const { return nB - nA + 1; }
long& Min() { return nA; }
long& Max() { return nB; }
bool IsInside( long nIs ) const;
void Justify();
};
inline bool Range::IsInside( long nIs ) const
{
return ((nA <= nIs) && (nIs <= nB ));
}
inline void Range::Justify()
{
if ( nA > nB )
{
long nHelp = nA;
nA = nB;
nB = nHelp;
}
}
inline bool operator ==(Range const & r1, Range const & r2)
{
return tools::detail::equal(r1, r2);
}
inline bool operator !=(Range const & r1, Range const & r2)
{
return !(r1 == r2);
}
template< typename charT, typename traits >
inline std::basic_ostream<charT, traits> & operator <<(
std::basic_ostream<charT, traits> & stream, const Range& range )
{
return stream << range.Min() << '-' << range.Max();
}
// Selection
#define SELECTION_MIN LONG_MIN
#define SELECTION_MAX LONG_MAX
class SAL_WARN_UNUSED Selection : public Pair
{
public:
Selection() {}
Selection( long nPos ) : Pair( nPos, nPos ) {}
Selection( long nMin, long nMax ) : Pair( nMin, nMax ) {}
long Min() const { return nA; }
long Max() const { return nB; }
long Len() const { return nB - nA; }
long& Min() { return nA; }
long& Max() { return nB; }
bool IsInside( long nIs ) const;
void Justify();
bool operator !() const { return !Len(); }
long getMin() const { return Min(); }
void setMin(long nMin) { Min() = nMin; }
void setMax(long nMax) { Max() = nMax; }
};
inline bool Selection::IsInside( long nIs ) const
{
return ((nA <= nIs) && (nIs < nB ));
}
inline void Selection::Justify()
{
if ( nA > nB )
{
long nHelp = nA;
nA = nB;
nB = nHelp;
}
}
inline bool operator ==(Selection const & s1, Selection const & s2)
{
return tools::detail::equal(s1, s2);
}
inline bool operator !=(Selection const & s1, Selection const & s2)
{
return !(s1 == s2);
}
template< typename charT, typename traits >
inline std::basic_ostream<charT, traits> & operator <<(
std::basic_ostream<charT, traits> & stream, const Selection& selection )
{
return stream << selection.Min() << '-' << selection.Max();
}
// Rectangle
#define RECT_EMPTY ((short)-32767)
#define RECT_MAX LONG_MAX
#define RECT_MIN LONG_MIN
/// Note: this class is a true marvel of engineering: because the author
/// could not decide whether it's better to have a closed or half-open
/// interval, they just implemented *both* in the same class!
///
/// If you have the misfortune of having to use this class, don't immediately
/// despair but first take note that the uppercase GetWidth() / GetHeight()
/// etc. methods interpret the interval as closed, while the lowercase
/// getWidth() / getHeight() etc. methods interpret the interval as half-open.
/// Ok, now is the time for despair.
namespace tools
{
class SAL_WARN_UNUSED TOOLS_DLLPUBLIC Rectangle
{
public:
Rectangle();
Rectangle( const Point& rLT, const Point& rRB );
Rectangle( long nLeft, long nTop,
long nRight, long nBottom );
Rectangle( const Point& rLT, const Size& rSize );
long Left() const { return nLeft; }
long Right() const { return nRight; }
long Top() const { return nTop; }
long Bottom() const { return nBottom; }
long& Left() { return nLeft; }
long& Right() { return nRight; }
long& Top() { return nTop; }
long& Bottom() { return nBottom; }
inline Point TopLeft() const;
inline Point TopRight() const;
inline Point TopCenter() const;
inline Point BottomLeft() const;
inline Point BottomRight() const;
inline Point BottomCenter() const;
inline Point LeftCenter() const;
inline Point RightCenter() const;
inline Point Center() const;
/// Move the top and left edges by a delta, preserving width and height
inline void Move( long nHorzMoveDelta, long nVertMoveDelta );
inline void SetPos( const Point& rPoint );
void SetSize( const Size& rSize );
inline Size GetSize() const;
/// Returns the difference between right and left, assuming the range is inclusive.
inline long GetWidth() const;
/// Returns the difference between bottom and top, assuming the range is inclusive.
inline long GetHeight() const;
tools::Rectangle& Union( const tools::Rectangle& rRect );
tools::Rectangle& Intersection( const tools::Rectangle& rRect );
inline tools::Rectangle GetUnion( const tools::Rectangle& rRect ) const;
inline tools::Rectangle GetIntersection( const tools::Rectangle& rRect ) const;
void Justify();
bool IsInside( const Point& rPOINT ) const;
bool IsInside( const tools::Rectangle& rRect ) const;
bool IsOver( const tools::Rectangle& rRect ) const;
void SetEmpty() { nRight = nBottom = RECT_EMPTY; }
inline bool IsEmpty() const;
inline bool operator == ( const tools::Rectangle& rRect ) const;
inline bool operator != ( const tools::Rectangle& rRect ) const;
inline tools::Rectangle& operator += ( const Point& rPt );
inline tools::Rectangle& operator -= ( const Point& rPt );
friend inline tools::Rectangle operator + ( const tools::Rectangle& rRect, const Point& rPt );
friend inline tools::Rectangle operator - ( const tools::Rectangle& rRect, const Point& rPt );
TOOLS_DLLPUBLIC friend SvStream& ReadRectangle( SvStream& rIStream, tools::Rectangle& rRect );
TOOLS_DLLPUBLIC friend SvStream& WriteRectangle( SvStream& rOStream, const tools::Rectangle& rRect );
// ONE
long getX() const { return nLeft; }
long getY() const { return nTop; }
/// Returns the difference between right and left, assuming the range includes one end, but not the other.
long getWidth() const { return nRight - nLeft; }
/// Returns the difference between bottom and top, assuming the range includes one end, but not the other.
long getHeight() const { return nBottom - nTop; }
/// Set the left edge of the rectangle to x, preserving the width
void setX( long x ) { nRight += x - nLeft; nLeft = x; }
/// Set the top edge of the rectangle to y, preserving the height
void setY( long y ) { nBottom += y - nTop; nTop = y; }
void setWidth( long n ) { nRight = nLeft + n; }
void setHeight( long n ) { nBottom = nTop + n; }
/// Returns the string representation of the rectangle, format is "x, y, width, height".
rtl::OString toString() const;
/**
* Expands the rectangle in all directions by the input value.
*/
inline void expand(long nExpandBy);
inline void shrink(long nShrinkBy);
private:
long nLeft;
long nTop;
long nRight;
long nBottom;
};
}
inline tools::Rectangle::Rectangle()
{
nLeft = nTop = 0;
nRight = nBottom = RECT_EMPTY;
}
inline tools::Rectangle::Rectangle( const Point& rLT, const Point& rRB )
{
nLeft = rLT.X();
nTop = rLT.Y();
nRight = rRB.X();
nBottom = rRB.Y();
}
inline tools::Rectangle::Rectangle( long _nLeft, long _nTop,
long _nRight, long _nBottom )
{
nLeft = _nLeft;
nTop = _nTop;
nRight = _nRight;
nBottom = _nBottom;
}
inline tools::Rectangle::Rectangle( const Point& rLT, const Size& rSize )
{
nLeft = rLT.X();
nTop = rLT.Y();
nRight = rSize.Width() ? nLeft+rSize.Width()-1 : RECT_EMPTY;
nBottom = rSize.Height() ? nTop+rSize.Height()-1 : RECT_EMPTY;
}
inline bool tools::Rectangle::IsEmpty() const
{
return (nRight == RECT_EMPTY) || (nBottom == RECT_EMPTY);
}
inline Point tools::Rectangle::TopLeft() const
{
return Point( nLeft, nTop );
}
inline Point tools::Rectangle::TopRight() const
{
return Point( (nRight == RECT_EMPTY) ? nLeft : nRight, nTop );
}
inline Point tools::Rectangle::BottomLeft() const
{
return Point( nLeft, (nBottom == RECT_EMPTY) ? nTop : nBottom );
}
inline Point tools::Rectangle::BottomRight() const
{
return Point( (nRight == RECT_EMPTY) ? nLeft : nRight,
(nBottom == RECT_EMPTY) ? nTop : nBottom );
}
inline Point tools::Rectangle::TopCenter() const
{
if ( IsEmpty() )
return Point( nLeft, nTop );
else
return Point( std::min( nLeft, nRight ) + std::abs( (nRight - nLeft)/2 ),
std::min( nTop, nBottom) );
}
inline Point tools::Rectangle::BottomCenter() const
{
if ( IsEmpty() )
return Point( nLeft, nTop );
else
return Point( std::min( nLeft, nRight ) + std::abs( (nRight - nLeft)/2 ),
std::max( nTop, nBottom) );
}
inline Point tools::Rectangle::LeftCenter() const
{
if ( IsEmpty() )
return Point( nLeft, nTop );
else
return Point( std::min( nLeft, nRight ), nTop + (nBottom - nTop)/2 );
}
inline Point tools::Rectangle::RightCenter() const
{
if ( IsEmpty() )
return Point( nLeft, nTop );
else
return Point( std::max( nLeft, nRight ), nTop + (nBottom - nTop)/2 );
}
inline Point tools::Rectangle::Center() const
{
if ( IsEmpty() )
return Point( nLeft, nTop );
else
return Point( nLeft+(nRight-nLeft)/2 , nTop+(nBottom-nTop)/2 );
}
inline void tools::Rectangle::Move( long nHorzMove, long nVertMove )
{
nLeft += nHorzMove;
nTop += nVertMove;
if ( nRight != RECT_EMPTY )
nRight += nHorzMove;
if ( nBottom != RECT_EMPTY )
nBottom += nVertMove;
}
inline void tools::Rectangle::SetPos( const Point& rPoint )
{
if ( nRight != RECT_EMPTY )
nRight += rPoint.X() - nLeft;
if ( nBottom != RECT_EMPTY )
nBottom += rPoint.Y() - nTop;
nLeft = rPoint.X();
nTop = rPoint.Y();
}
inline long tools::Rectangle::GetWidth() const
{
long n;
if ( nRight == RECT_EMPTY )
n = 0;
else
{
n = nRight - nLeft;
if( n < 0 )
n--;
else
n++;
}
return n;
}
inline long tools::Rectangle::GetHeight() const
{
long n;
if ( nBottom == RECT_EMPTY )
n = 0;
else
{
n = nBottom - nTop;
if ( n < 0 )
n--;
else
n++;
}
return n;
}
inline Size tools::Rectangle::GetSize() const
{
return Size( GetWidth(), GetHeight() );
}
inline tools::Rectangle tools::Rectangle::GetUnion( const tools::Rectangle& rRect ) const
{
tools::Rectangle aTmpRect( *this );
return aTmpRect.Union( rRect );
}
inline tools::Rectangle tools::Rectangle::GetIntersection( const tools::Rectangle& rRect ) const
{
tools::Rectangle aTmpRect( *this );
return aTmpRect.Intersection( rRect );
}
inline bool tools::Rectangle::operator == ( const tools::Rectangle& rRect ) const
{
return (nLeft == rRect.nLeft ) &&
(nTop == rRect.nTop ) &&
(nRight == rRect.nRight ) &&
(nBottom == rRect.nBottom );
}
inline bool tools::Rectangle::operator != ( const tools::Rectangle& rRect ) const
{
return (nLeft != rRect.nLeft ) ||
(nTop != rRect.nTop ) ||
(nRight != rRect.nRight ) ||
(nBottom != rRect.nBottom );
}
inline tools::Rectangle& tools::Rectangle::operator +=( const Point& rPt )
{
nLeft += rPt.X();
nTop += rPt.Y();
if ( nRight != RECT_EMPTY )
nRight += rPt.X();
if ( nBottom != RECT_EMPTY )
nBottom += rPt.Y();
return *this;
}
inline tools::Rectangle& tools::Rectangle::operator -= ( const Point& rPt )
{
nLeft -= rPt.X();
nTop -= rPt.Y();
if ( nRight != RECT_EMPTY )
nRight -= rPt.X();
if ( nBottom != RECT_EMPTY )
nBottom -= rPt.Y();
return *this;
}
namespace tools
{
inline Rectangle operator + ( const Rectangle& rRect, const Point& rPt )
{
Rectangle aRect( rRect.nLeft + rPt.X(), rRect.nTop + rPt.Y(),
(rRect.nRight == RECT_EMPTY) ? RECT_EMPTY : rRect.nRight + rPt.X(),
(rRect.nBottom == RECT_EMPTY) ? RECT_EMPTY : rRect.nBottom + rPt.Y() );
return aRect;
}
inline Rectangle operator - ( const Rectangle& rRect, const Point& rPt )
{
Rectangle aRect( rRect.nLeft - rPt.X(),
rRect.nTop - rPt.Y(),
(rRect.nRight == RECT_EMPTY) ? RECT_EMPTY : rRect.nRight - rPt.X(),
(rRect.nBottom == RECT_EMPTY) ? RECT_EMPTY : rRect.nBottom - rPt.Y() );
return aRect;
}
}
inline void tools::Rectangle::expand(long nExpandBy)
{
nLeft -= nExpandBy;
nTop -= nExpandBy;
nRight += nExpandBy;
nBottom += nExpandBy;
}
inline void tools::Rectangle::shrink(long nShrinkBy)
{
nLeft += nShrinkBy;
nTop += nShrinkBy;
nRight -= nShrinkBy;
nBottom -= nShrinkBy;
}
template< typename charT, typename traits >
inline std::basic_ostream<charT, traits> & operator <<(
std::basic_ostream<charT, traits> & stream, const tools::Rectangle& rectangle )
{
if (rectangle.IsEmpty())
return stream << "EMPTY";
else
return stream << rectangle.getWidth() << 'x' << rectangle.getHeight()
<< "@(" << rectangle.getX() << ',' << rectangle.getY() << ")";
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|