pkg/box2d: 0.2.0 release

lib/src/collision/shapes/polygon_shape.dart

 /*******************************************************************************
  * Copyright (c) 2015, Daniel Murphy, Google
  * All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without modification,
  * are permitted provided that the following conditions are met:
  *  * Redistributions of source code must retain the above copyright notice,
  *    this list of conditions and the following disclaimer.
  *  * Redistributions in binary form must reproduce the above copyright notice,
  *    this list of conditions and the following disclaimer in the documentation
@@ skipping 23 matching lines @@
 
   /**
    * Local position of the shape centroid in parent body frame.
    */
   final Vector2 centroid = new Vector2.zero();
 
   /**
    * The vertices of the shape. Note: use getVertexCount(), not _vertices.length, to get number of
    * active vertices.
    */
-  final List<Vector2> vertices =
-      new List<Vector2>(Settings.maxPolygonVertices);
+  final List<Vector2> vertices = new List<Vector2>(Settings.maxPolygonVertices);
 
   /**
    * The normals of the shape. Note: use getVertexCount(), not _normals.length, to get number of
    * active normals.
    */
-  final List<Vector2> normals =
-      new List<Vector2>(Settings.maxPolygonVertices);
+  final List<Vector2> normals = new List<Vector2>(Settings.maxPolygonVertices);
 
   /**
    * Number of active vertices in the shape.
    */
   int count = 0;
 
   // pooling
   final Vector2 _pool1 = new Vector2.zero();
   final Vector2 _pool2 = new Vector2.zero();
   final Vector2 _pool3 = new Vector2.zero();
@@ skipping 526 matching lines @@
     s.scale(1.0 / count.toDouble());
 
     final double k_inv3 = 1.0 / 3.0;
 
     final Vector2 e1 = _pool3;
     final Vector2 e2 = _pool4;
 
     for (int i = 0; i < count; ++i) {
       // Triangle vertices.
       e1.setFrom(vertices[i]).sub(s);
-      e2
-          .setFrom(s)
-          .negate()
-          .add(i + 1 < count ? vertices[i + 1] : vertices[0]);
+      e2.setFrom(s).negate().add(i + 1 < count ? vertices[i + 1] : vertices[0]);
 
       final double D = e1.cross(e2);
 
       final double triangleArea = 0.5 * D;
       area += triangleArea;
 
       // Area weighted centroid
       center.x += triangleArea * k_inv3 * (e1.x + e2.x);
       center.y += triangleArea * k_inv3 * (e1.y + e2.y);
 
@@ skipping 55 matching lines @@
   Vector2 applyToCentroid(final Transform xf) {
     return Transform.mulVec2(xf, centroid);
   }
 
   /** Get the centroid and apply the supplied transform. */
   Vector2 centroidToOut(final Transform xf, final Vector2 out) {
     Transform.mulToOutUnsafeVec2(xf, centroid, out);
     return out;
   }
 }