fix #27532, implementing a native type with fields

pkg/dev_compiler/test/codegen/lib/math/implement_rectangle_test.dart

Index: pkg/dev_compiler/test/codegen/lib/math/implement_rectangle_test.dart
diff --git a/pkg/dev_compiler/test/codegen/lib/math/implement_rectangle_test.dart b/pkg/dev_compiler/test/codegen/lib/math/implement_rectangle_test.dart
new file mode 100644
index 0000000000000000000000000000000000000000..ce93360e77f769224379130db27f72c69f3a7507
--- /dev/null
+++ b/pkg/dev_compiler/test/codegen/lib/math/implement_rectangle_test.dart
@@ -0,0 +1,76 @@
+import 'dart:math' hide Rectangle;
+import 'dart:math' as math show Point, Rectangle, MutableRectangle;
+import 'package:expect/expect.dart' show Expect;
+
+void main() {
+  verifyRectable(new Rectangle(1, 2, 3, 4));
+}
+
+void verifyRectable(math.Rectangle rect) {
+  Expect.equals(1.0, rect.left.toDouble());
+  Expect.equals(2.0, rect.top.toDouble());
+  Expect.equals(4.0, rect.right.toDouble());
+  Expect.equals(6.0, rect.bottom.toDouble());
+}
+
+class Rectangle<T extends num> implements math.MutableRectangle<T> {
+  T left;
+  T top;
+  T width;
+  T height;
+
+  Rectangle(this.left, this.top, this.width, this.height);
+
+  T get right => left + width;
+
+  T get bottom => top + height;
+
+  Point<T> get topLeft => new Point<T>(left, top);
+
+  Point<T> get topRight => new Point<T>(right, top);
+
+  Point<T> get bottomLeft => new Point<T>(left, bottom);
+
+  Point<T> get bottomRight => new Point<T>(right, bottom);
+
+  //---------------------------------------------------------------------------
+
+  bool contains(num px, num py) {
+    return left <= px && top <= py && right > px && bottom > py;
+  }
+
+  bool containsPoint(math.Point<num> p) {
+    return contains(p.x, p.y);
+  }
+
+  bool intersects(math.Rectangle<num> r) {
+    return left < r.right && right > r.left && top < r.bottom && bottom > r.top;
+  }
+
+  /// Returns a new rectangle which completely contains `this` and [other].
+
+  Rectangle<T> boundingBox(math.Rectangle<T> other) {
+    T rLeft = min(left, other.left);
+    T rTop = min(top, other.top);
+    T rRight = max(right, other.right);
+    T rBottom = max(bottom, other.bottom);
+    return new Rectangle<T>(rLeft, rTop, rRight - rLeft, rBottom - rTop);
+  }
+
+  /// Tests whether `this` entirely contains [another].
+
+  bool containsRectangle(math.Rectangle<num> r) {
+    return left <= r.left &&
+        top <= r.top &&
+        right >= r.right &&
+        bottom >= r.bottom;
+  }
+
+  Rectangle<T> intersection(math.Rectangle<T> rect) {
+    T rLeft = max(left, rect.left);
+    T rTop = max(top, rect.top);
+    T rRight = min(right, rect.right);
+    T rBottom = min(bottom, rect.bottom);
+    return new Rectangle<T>(rLeft, rTop, rRight - rLeft, rBottom - rTop);
+  }
+}