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
|
/**
This file is part of Kig, a KDE program for Interactive Geometry...
Copyright (C) 2002 Dominique Devriese <[email protected]>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
USA
**/
#ifndef RECT_H
#define RECT_H
#include "coordinate.h"
#include <tqrect.h>
#include <kdebug.h>
/**
* like Coordinate is a TQPoint replacement with doubles, this is a
* TQRect replacement with doubles...
*/
class Rect
{
public:
/**
* constructors...
*/
Rect( const Coordinate bottomLeft, const Coordinate topRight );
Rect( const Coordinate bottomLeft, const double width, const double height );
Rect( double xa, double ya, double width, double height );
Rect( const Rect& r );
Rect();
static Rect invalidRect();
bool valid();
void setBottomLeft( const Coordinate p );
void setTopLeft( const Coordinate p );
void setTopRight( const Coordinate p );
void setBottomRight( const Coordinate p );
void setCenter( const Coordinate p );
void setLeft( const double p);
void setRight( const double p);
void setTop( const double p );
void setBottom( const double p );
void setWidth( const double w );
void setHeight( const double h );
/**
* this makes sure width and height are > 0 ...
*/
void normalize();
/**
* this makes sure p is in the rect, extending it if necessary...
*/
void setContains( Coordinate p );
/**
* moves the rect while keeping the size constant...
*/
void moveBy( const Coordinate p );
/**
* synonym for moveBy...
*/
Rect& operator+=( const Coordinate p ) { moveBy(p); return *this; }
/**
* scale: only the size changes, topLeft is kept where it is...
*/
void scale( const double r );
/**
* synonym for scale...
*/
Rect& operator*=( const double r ) { scale(r); return *this; }
Rect& operator/=( const double r ) { scale(1/r); return *this; }
/**
* This expands the rect so that it contains r. It has friends
* '|=' and '|' below...
*/
void eat( const Rect& r );
/**
* synonym for eat..
*/
Rect& operator|=( const Rect& rhs ) { eat( rhs ); return *this; }
/**
* return a rect which is a copy of this rect, but has an aspect
* ratio equal to rhs's one.. if \p shrink is true, the rect will be
* shrunk, otherwise extended.. The center of the new rect is the
* same as this rect's center..
*/
Rect matchShape( const Rect& rhs, bool shrink = false ) const;
TQRect toTQRect() const;
Coordinate bottomLeft() const;
Coordinate bottomRight() const;
Coordinate topLeft() const;
Coordinate topRight() const;
Coordinate center() const;
double left() const;
double right() const;
double bottom() const;
double top() const;
double width() const;
double height() const;
bool contains( const Coordinate& p ) const;
bool contains( const Coordinate& p, double allowed_miss ) const;
bool intersects( const Rect& p ) const;
Rect normalized() const;
friend kdbgstream& operator<<( kdbgstream& s, const Rect& t );
static Rect fromTQRect( const TQRect& );
protected:
Coordinate mBottomLeft;
double mwidth;
double mheight;
};
bool operator==( const Rect& r, const Rect& s );
kdbgstream& operator<<( kdbgstream& s, const Rect& t );
/**
* this operator returns a Rect that contains both the given
* rects..
*/
Rect operator|( const Rect& lhs, const Rect& rhs );
#endif
|
