Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(273)

Unified Diff: sdk/lib/math/rectangle.dart

Issue 25808002: Move Rectangle and Point into dart:math. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Created 7 years, 2 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: sdk/lib/math/rectangle.dart
diff --git a/sdk/lib/math/rectangle.dart b/sdk/lib/math/rectangle.dart
new file mode 100644
index 0000000000000000000000000000000000000000..47a1ecf923f835779482264934aa784de23a2968
--- /dev/null
+++ b/sdk/lib/math/rectangle.dart
@@ -0,0 +1,169 @@
+// Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+part of dart.math;
+
+/**
+ * A base class for representing two-dimensional axis-aligned rectangles.
+ */
+abstract class RectangleBase<T extends num> {
+ const RectangleBase();
+
+ /**
+ * The x-coordinate of the left edge.
+ */
+ T get left;
+ /**
+ * The y-coordinate of the top edge.
+ */
+ T get top;
+ /** The `width` of the rectangle. */
+ T get width;
+ /** The `height` of the rectangle. */
+ T get height;
+
+ /**
+ * The number of units `right` of the origin where this rectangle's bottom
Lasse Reichstein Nielsen 2013/10/03 06:24:03 The x-coordinate of the right edge.
Emily Fortuna 2013/10/03 21:29:12 Done.
+ * right corner can be found.
+ */
+ T get right => left + width;
+ /**
+ * The number of units below the origin where this rectangle's bottom
Lasse Reichstein Nielsen 2013/10/03 06:24:03 below? How about "y-coordinate of this rectangle's
Emily Fortuna 2013/10/03 21:29:12 Done.
+ * right corner can be found.
+ */
+ T get bottom => top + height;
+
+ String toString() {
+ return 'Rectangle ($left, $top) $width x $height';
+ }
+
+ bool operator ==(other) {
+ if (other is !Rectangle) return false;
+ return left == other.left && top == other.top && width == other.width &&
+ height == other.height;
+ }
+
+ int get hashCode => _JenkinsSmiHash.hash4(left.hashCode, top.hashCode,
+ width.hashCode, height.hashCode);
+
+ /**
+ * Computes the intersection of `this` and [other].
Lasse Reichstein Nielsen 2013/10/03 06:24:03 * * The intersection of two rectangles, if any, is
Emily Fortuna 2013/10/03 21:29:12 Done.
+ *
+ * Returns null if there is no intersection.
+ */
+ Rectangle<T> intersection(Rectangle<T> other) {
+ var x0 = max(left, other.left);
+ var x1 = min(left + width, other.left + other.width);
+
+ if (x0 <= x1) {
+ var y0 = max(top, other.top);
+ var y1 = min(top + height, other.top + other.height);
+
+ if (y0 <= y1) {
+ return new Rectangle<T>(x0, y0, x1 - x0, y1 - y0);
+ }
+ }
+ return null;
+ }
+
+
+ /**
+ * Returns true if `this` intersects [other].
+ */
+ bool intersects(Rectangle<num> other) {
+ return (left <= other.left + other.width && other.left <= left + width &&
+ top <= other.top + other.height && other.top <= top + height);
Lasse Reichstein Nielsen 2013/10/03 06:24:03 Personally I'd prefer this indentation: return
Emily Fortuna 2013/10/03 21:29:12 Done.
+ }
+
+ /**
+ * Returns a new rectangle which completely contains `this` and [other].
Lasse Reichstein Nielsen 2013/10/03 06:24:03 "union" is a surprising term (to me). How about "b
Emily Fortuna 2013/10/03 21:29:12 Done.
+ */
+ Rectangle<T> union(Rectangle<T> other) {
+ var right = max(this.left + this.width, other.left + other.width);
+ var bottom = max(this.top + this.height, other.top + other.height);
+
+ var left = min(this.left, other.left);
+ var top = min(this.top, other.top);
+
+ return new Rectangle<T>(left, top, right - left, bottom - top);
+ }
+
+ /**
+ * Tests whether `this` entirely contains [another].
+ */
+ bool contains(Rectangle<num> another) {
+ return left <= another.left &&
+ left + width >= another.left + another.width &&
+ top <= another.top &&
+ top + height >= another.top + another.height;
+ }
+
+ /**
+ * Tests whether `this` contains a point.
Lasse Reichstein Nielsen 2013/10/03 06:24:03 Mention that the edges of the rectangle are consid
Emily Fortuna 2013/10/03 21:29:12 Done.
+ */
+ bool containsPoint(Point<num> another) {
+ return another.x >= left &&
+ another.x <= left + width &&
+ another.y >= top &&
+ another.y <= top + height;
+ }
+
+ Rectangle<int> ceil() => new Rectangle<int>(left.ceil(), top.ceil(),
Lasse Reichstein Nielsen 2013/10/03 06:24:03 Needs documentation.
floitsch 2013/10/03 09:33:50 I don't like ceil/floor/round/truncate on Points,
Emily Fortuna 2013/10/03 21:29:12 Left the round in but removed everything else so t
floitsch 2013/10/04 08:59:13 Let's remove it for now. We can add it later if we
+ width.ceil(), height.ceil());
+ Rectangle<int> floor() => new Rectangle<int>(left.floor(), top.floor(),
+ width.floor(), height.floor());
+ Rectangle<int> round() => new Rectangle<int>(left.round(), top.round(),
+ width.round(), height.round());
+
+ /**
+ * Truncates coordinates to integers and returns the result as a new
+ * rectangle.
+ */
+ Rectangle<int> truncate() => new Rectangle<int>(left.toInt(), top.toInt(),
+ width.toInt(), height.toInt());
+
+ Point<T> get topLeft => new Point<T>(this.left, this.top);
+ Point<T> get bottomRight => new Point<T>(this.left + this.width,
+ this.top + this.height);
Lasse Reichstein Nielsen 2013/10/03 06:24:03 Add topRight and bottomLeft getters too, just for
Emily Fortuna 2013/10/03 21:29:12 Done.
+
+ static List _calculateVerticesFromPoints(Point a, Point b) {
+ var left;
+ var width;
+ if (a.x < b.x) {
+ left = a.x;
+ width = b.x - left;
+ } else {
+ left = b.x;
+ width = a.x - left;
+ }
Lasse Reichstein Nielsen 2013/10/03 06:24:03 How about: num left = min(a.x, b.x); num width =
Emily Fortuna 2013/10/03 21:29:12 Done.
+ var top;
+ var height;
+ if (a.y < b.y) {
+ top = a.y;
+ height = b.y - top;
+ } else {
+ top = b.y;
+ height = a.y - top;
+ }
+ return [left, top, width, height];
+ }
+}
+
+
+/**
+ * A class for representing two-dimensional rectangles whose properties are
+ * immutable.
+ */
+class Rectangle<T extends num> extends RectangleBase<T> {
Lasse Reichstein Nielsen 2013/10/03 06:24:03 Why have RectangleBase? That as: What is the expec
floitsch 2013/10/03 09:33:50 Agreed with Lasse, merge the two classes.
Emily Fortuna 2013/10/03 21:29:12 I need to separate them out so that I can reuse th
floitsch 2013/10/04 08:59:13 In that case, either: - add MutableRectangle into
+ final T left;
+ final T top;
+ final T width;
+ final T height;
+
+ const Rectangle(this.left, this.top, this.width, this.height);
+
+ factory Rectangle.fromPoints(Point<T> a, Point<T> b) {
+ var list = RectangleBase._calculateVerticesFromPoints(a, b);
+ return new Rectangle<T>(list[0], list[1], list[2], list[3]);
+ }
+}

Powered by Google App Engine
This is Rietveld 408576698