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
|
/*
* File: gtypes.cpp
* ----------------
* This file implements the classes in the gtypes.h interface.
*/
#include <string>
#include <cmath>
#include "error.h"
#include "gtypes.h"
#include "strlib.h"
using namespace std;
static const double PI = 3.14159265358979;
static const int HASH_MASK = int(unsigned(-1) >> 1);
/*
* Implementation notes: GPoint class
* ----------------------------------
* The GPoint class itself is entirely straightforward. The relational
* operators compare the x components first, followed by the y component.
* The hashCode function computes the exclusive-or of the individual words.
*/
GPoint::GPoint() {
x = 0;
y = 0;
}
GPoint::GPoint(double x, double y) {
this->x = x;
this->y = y;
}
double GPoint::getX() const {
return x;
}
double GPoint::getY() const {
return y;
}
string GPoint::toString() const {
return "(" + realToString(x) + ", " + realToString(y) + ")";
}
ostream & operator<<(ostream & os, const GPoint & pt) {
return os << pt.toString();
}
bool operator==(const GPoint & p1, const GPoint & p2) {
return p1.x == p2.x && p1.y == p2.y;
}
bool operator!=(const GPoint & p1, const GPoint & p2) {
return !(p1 == p2);
}
int hashCode(const GPoint & pt) {
int hash = 0;
for (size_t i = 0; i < sizeof(double) / sizeof(int); i++) {
hash ^= ((int *) &pt.x)[i] ^ ((int *) &pt.y)[i];
}
return HASH_MASK & hash;
}
/*
* Implementation notes: GDimension class
* --------------------------------------
* The GDimension class itself is entirely straightforward. The
* relational operators compare the width first, followed by the height.
* The hashCode function computes the exclusive-or of the individual words.
*/
GDimension::GDimension() {
width = 0;
height = 0;
}
GDimension::GDimension(double width, double height) {
this->width = width;
this->height = height;
}
double GDimension::getWidth() const {
return width;
}
double GDimension::getHeight() const {
return height;
}
string GDimension::toString() const {
return "(" + realToString(width) + ", " + realToString(height) + ")";
}
ostream & operator<<(ostream & os, const GDimension & dim) {
return os << dim.toString();
}
bool operator==(const GDimension & d1, const GDimension & d2) {
return d1.width == d2.width && d1.height == d2.height;
}
bool operator!=(const GDimension & d1, const GDimension & d2) {
return !(d1 == d2);
}
int hashCode(const GDimension & dim) {
int hash = 0;
for (size_t i = 0; i < sizeof(double) / sizeof(int); i++) {
hash ^= ((int *) &dim.width)[i] ^ ((int *) &dim.height)[i];
}
return HASH_MASK & hash;
}
/*
* Implementation notes: GRectangle class
* --------------------------------------
* The GRectangle class itself is entirely straightforward. The
* relational operators compare the components in the following order:
* x, y, width, height. The hashCode function computes the exclusive-or
* of the individual words.
*/
GRectangle::GRectangle() {
x = 0;
y = 0;
width = 0;
height = 0;
}
GRectangle::GRectangle(double x, double y, double width, double height) {
this->x = x;
this->y = y;
this->width = width;
this->height = height;
}
double GRectangle::getX() const {
return x;
}
double GRectangle::getY() const {
return y;
}
double GRectangle::getWidth() const {
return width;
}
double GRectangle::getHeight() const {
return height;
}
bool GRectangle::isEmpty() const {
return width <= 0 || height <= 0;
}
bool GRectangle::contains(double x, double y) const {
return x >= this->x && y >= this->y
&& x < this->x + width
&& y < this->y + height;
}
bool GRectangle::contains(GPoint pt) const {
return contains(pt.getX(), pt.getY());
}
string GRectangle::toString() const {
return "(" + realToString(x) + ", " + realToString(y) + ", "
+ realToString(width) + ", " + realToString(height) + ")";
}
ostream & operator<<(ostream & os, const GRectangle & rect) {
return os << rect.toString();
}
bool operator==(const GRectangle & r1, const GRectangle & r2) {
return r1.x == r2.x && r1.y == r2.y
&& r1.width == r2.width
&& r1.height == r2.height;
}
bool operator!=(const GRectangle & r1, const GRectangle & r2) {
return !(r1 == r2);
}
int hashCode(const GRectangle & r) {
int hash = 0;
for (size_t i = 0; i < sizeof(double) / sizeof(int); i++) {
hash ^= ((int *) &r.x)[i] ^ ((int *) &r.y)[i];
hash ^= ((int *) &r.width)[i] ^ ((int *) &r.height)[i];
}
return HASH_MASK & hash;
}
|
