92 lines
1.6 KiB
Dart
92 lines
1.6 KiB
Dart
// Dart has a habit of using double-inclusive bounds,
|
|
// and I strongly prefer half-open bounds
|
|
//
|
|
// So: Here's a reimplementation of the geometry I need
|
|
import 'package:dartterm/skreek.dart';
|
|
|
|
class Size {
|
|
final int dx;
|
|
final int dy;
|
|
|
|
Size(this.dx, this.dy) {
|
|
assert(dx >= 0);
|
|
assert(dy >= 0);
|
|
}
|
|
|
|
@override
|
|
String toString() {
|
|
return "$dx x $dy";
|
|
}
|
|
|
|
@override
|
|
bool operator ==(Object other) =>
|
|
other is Size && other.dx == dx && other.dy == dy;
|
|
|
|
@override
|
|
int get hashCode => (dx, dy).hashCode;
|
|
}
|
|
|
|
class Offset {
|
|
final int x;
|
|
final int y;
|
|
|
|
const Offset(this.x, this.y);
|
|
|
|
@override
|
|
String toString() {
|
|
return "@($x, $y)";
|
|
}
|
|
|
|
@override
|
|
bool operator ==(Object other) =>
|
|
other is Offset && other.x == x && other.y == y;
|
|
|
|
@override
|
|
int get hashCode => (x, y).hashCode;
|
|
}
|
|
|
|
class Rect {
|
|
final int x0;
|
|
final int y0;
|
|
final int dx;
|
|
final int dy;
|
|
|
|
int get x1 => x0 + dx;
|
|
int get y1 => y0 + dy;
|
|
|
|
Rect(this.x0, this.y0, this.dx, this.dy) {
|
|
assert(dx >= 0);
|
|
assert(dy >= 0);
|
|
}
|
|
|
|
Size get size => Size(dx, dy);
|
|
|
|
bool contains(int x, int y) {
|
|
return x0 <= x && x < x1 && y0 <= y && y < y1;
|
|
}
|
|
|
|
bool containsPoint(Offset xy) {
|
|
return contains(xy.x, xy.y);
|
|
}
|
|
|
|
bool containsRect(Rect rect) {
|
|
return x0 <= rect.x0 && y0 <= rect.y0 && rect.x1 <= x1 && rect.y1 <= y1;
|
|
}
|
|
|
|
@override
|
|
String toString() {
|
|
return "@($x0, $y0) $size";
|
|
}
|
|
|
|
@override
|
|
bool operator ==(Object other) =>
|
|
other is Rect &&
|
|
other.x0 == x0 &&
|
|
other.y0 == y0 &&
|
|
other.dx == dx &&
|
|
other.dy == dy;
|
|
|
|
@override
|
|
int get hashCode => (x0, y0, dx, dy).hashCode;
|
|
}
|