Provide approximate type functions for SkMatrix44.

cc/base/math_util.cc

 // Copyright 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "cc/base/math_util.h"
 
 #include <algorithm>
 #include <cmath>
 #include <limits>
 
 #include "base/values.h"
 #include "ui/gfx/quad_f.h"
 #include "ui/gfx/rect.h"
 #include "ui/gfx/rect_conversions.h"
 #include "ui/gfx/rect_f.h"
 #include "ui/gfx/transform.h"
 #include "ui/gfx/vector2d_f.h"
 
 namespace cc {
+namespace {
+
+inline bool ApproximatelyEqual(SkMScalar x, SkMScalar y, SkMScalar tolerance) {

[shawnsingh, 2013/10/16 11:43:34]

I'm wondering, did you have a strong reason not to use NearlyZero or NearlyOne
as they were before?

I think that we should not encourage this version of ApproximatelyEqual that
uses an absolute threshold.  The absolute thresholds were acceptable
specifically for checking for approximately == 1 or == 0, because when we
already know one of the values being compared (i.e. 0 or 1), we can literally
convert between absolute and relative thresholds, and they are effectively the
same.  But if we ever do need a general ApproximatelyEqual comparison, we would
probably want to encourage using a relative threshold or even a relative ulps
threshold.

As a secondary advantage, in my opinion the NearlyZero/NearlyOne functions are
more readable when looking at the implementations of the approximatelyXXX
functions.  It's error-prone to see 1's and 0's hidden among so many commas and
parentheses.

[Dominik Grewe, 2013/10/16 12:46:23]

The main motivation was to avoid code duplication. ApproximatelyInteger uses
that function with arbitrary numbers, not just 0 and 1. But if we get rid of
IsApproximatelyIntegerTransform we wouldn't need it any more.

I agree that NearlyZero and NearlyOne is less error prone.

+  DCHECK_GE(tolerance, 0);
+  return std::abs(x-y) <= tolerance;
+}
+
+inline bool ApproximatelyInteger(SkMScalar x, SkMScalar tolerance) {
+  SkMScalar nearest_integer = std::floor(x + SkDoubleToMScalar(0.5));
+  return ApproximatelyEqual(x, nearest_integer, tolerance);
+}
+
+}  // namespace
 
 const double MathUtil::kPiDouble = 3.14159265358979323846;
 const float MathUtil::kPiFloat = 3.14159265358979323846f;
 
 static HomogeneousCoordinate ProjectHomogeneousPoint(
     const gfx::Transform& transform,
     gfx::PointF p) {
   // In this case, the layer we are trying to project onto is perpendicular to
   // ray (point p and z-axis direction) that we are trying to project. This
   // happens when the layer is rotated so that it is infinitesimally thin, or
@@ skipping 556 matching lines @@
 scoped_ptr<base::Value> MathUtil::AsValueSafely(double value) {
   return scoped_ptr<base::Value>(base::Value::CreateDoubleValue(
       std::min(value, std::numeric_limits<double>::max())));
 }
 
 scoped_ptr<base::Value> MathUtil::AsValueSafely(float value) {
   return scoped_ptr<base::Value>(base::Value::CreateDoubleValue(
       std::min(value, std::numeric_limits<float>::max())));
 }
 
+bool MathUtil::IsApproximatelyPureTranslation(
+    const gfx::Transform& transform, SkMScalar tolerance) {
+  return IsMatrixApproximatelyPureTranslation(transform.matrix(), tolerance);
+}
+
+bool MathUtil::IsMatrixApproximatelyPureTranslation(const SkMatrix44& matrix,
+                                                    SkMScalar tolerance) {
+  return
+      ApproximatelyEqual(matrix.get(0, 0), 1, tolerance) &&
+      ApproximatelyEqual(matrix.get(1, 0), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(2, 0), 0, tolerance) &&
+      matrix.get(3, 0) == 0 &&
+      ApproximatelyEqual(matrix.get(0, 1), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(1, 1), 1, tolerance) &&
+      ApproximatelyEqual(matrix.get(2, 1), 0, tolerance) &&
+      matrix.get(3, 1) == 0 &&
+      ApproximatelyEqual(matrix.get(0, 2), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(1, 2), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(2, 2), 1, tolerance) &&
+      matrix.get(3, 2) == 0 &&
+      matrix.get(3, 3) == 1;
+}
+
+bool MathUtil::IsApproximatelyIntegerTransform(
+    const gfx::Transform& transform, SkMScalar tolerance) {
+  return IsMatrixApproximatelyIntegerTransform(transform.matrix(), tolerance);
+}
+
+bool MathUtil::IsMatrixApproximatelyIntegerTransform(const SkMatrix44& matrix,
+                                                     SkMScalar tolerance) {
+  return
+      ApproximatelyInteger(matrix.get(0, 0), tolerance) &&
+      ApproximatelyEqual(matrix.get(0, 1), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(0, 2), 0, tolerance) &&
+      ApproximatelyInteger(matrix.get(0, 3), tolerance) &&
+
+      ApproximatelyEqual(matrix.get(1, 0), 0, tolerance) &&
+      ApproximatelyInteger(matrix.get(1, 1), tolerance) &&
+      ApproximatelyEqual(matrix.get(1, 2), 0, tolerance) &&
+      ApproximatelyInteger(matrix.get(1, 3), tolerance) &&
+
+      ApproximatelyEqual(matrix.get(2, 0), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(2, 1), 0, tolerance) &&
+
+      ApproximatelyEqual(matrix.get(3, 0), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(3, 1), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(3, 2), 0, tolerance) &&
+      ApproximatelyEqual(matrix.get(3, 3), 1, tolerance);
+}
+
 }  // namespace cc