@sentryware/s2-node 0.0.6

package/third_party/s2geometry/src/s2/r2rect.h

@@ -0,0 +1,234 @@
+// Copyright 2012 Google Inc. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+
+// Author: ericv@google.com (Eric Veach)
+
+#ifndef S2_R2RECT_H_
+#define S2_R2RECT_H_
+
+#include <iosfwd>
+
+#include "s2/base/logging.h"
+#include "s2/_fp_contract_off.h"
+#include "s2/r1interval.h"
+#include "s2/r2.h"
+
+// An R2Rect represents a closed axis-aligned rectangle in the (x,y) plane.
+//
+// This class is intended to be copied by value as desired.  It uses
+// the default copy constructor and assignment operator, however it is
+// not a "plain old datatype" (POD) because it has virtual functions.
+class R2Rect {
+ public:
+  // Construct a rectangle from the given lower-left and upper-right points.
+  R2Rect(const R2Point& lo, const R2Point& hi);
+
+  // Construct a rectangle from the given intervals in x and y.  The two
+  // intervals must either be both empty or both non-empty.
+  R2Rect(const R1Interval& x, const R1Interval& y);
+
+  // The default constructor creates an empty R2Rect.
+  R2Rect();
+
+  // The canonical empty rectangle.  Use is_empty() to test for empty
+  // rectangles, since they have more than one representation.
+  static R2Rect Empty();
+
+  // Construct a rectangle from a center point and size in each dimension.
+  // Both components of size should be non-negative, i.e. this method cannot
+  // be used to create an empty rectangle.
+  static R2Rect FromCenterSize(const R2Point& center, const R2Point& size);
+
+  // Convenience method to construct a rectangle containing a single point.
+  static R2Rect FromPoint(const R2Point& p);
+
+  // Convenience method to construct the minimal bounding rectangle containing
+  // the two given points.  This is equivalent to starting with an empty
+  // rectangle and calling AddPoint() twice.  Note that it is different than
+  // the R2Rect(lo, hi) constructor, where the first point is always
+  // used as the lower-left corner of the resulting rectangle.
+  static R2Rect FromPointPair(const R2Point& p1, const R2Point& p2);
+
+  // Accessor methods.
+  const R1Interval& x() const { return bounds_[0]; }
+  const R1Interval& y() const { return bounds_[1]; }
+  R2Point lo() const { return R2Point(x().lo(), y().lo()); }
+  R2Point hi() const { return R2Point(x().hi(), y().hi()); }
+
+  // Methods that allow the R2Rect to be accessed as a vector.
+  const R1Interval& operator[](int i) const { return bounds_[i]; }
+  R1Interval& operator[](int i) { return bounds_[i]; }
+
+  // Return true if the rectangle is valid, which essentially just means
+  // that if the bound for either axis is empty then both must be.
+  bool is_valid() const;
+
+  // Return true if the rectangle is empty, i.e. it contains no points at all.
+  bool is_empty() const;
+
+  // Return the k-th vertex of the rectangle (k = 0,1,2,3) in CCW order.
+  // Vertex 0 is in the lower-left corner.  For convenience, the argument is
+  // reduced modulo 4 to the range [0..3].
+  R2Point GetVertex(int k) const;
+
+  // Return the vertex in direction "i" along the x-axis (0=left, 1=right) and
+  // direction "j" along the y-axis (0=down, 1=up).  Equivalently, return the
+  // vertex constructed by selecting endpoint "i" of the x-interval (0=lo,
+  // 1=hi) and vertex "j" of the y-interval.
+  R2Point GetVertex(int i, int j) const;
+
+  // Return the center of the rectangle in (x,y)-space.
+  R2Point GetCenter() const;
+
+  // Return the width and height of this rectangle in (x,y)-space.  Empty
+  // rectangles have a negative width and height.
+  R2Point GetSize() const;
+
+  // Return true if the rectangle contains the given point.  Note that
+  // rectangles are closed regions, i.e. they contain their boundary.
+  bool Contains(const R2Point& p) const;
+
+  // Return true if and only if the given point is contained in the interior
+  // of the region (i.e. the region excluding its boundary).
+  bool InteriorContains(const R2Point& p) const;
+
+  // Return true if and only if the rectangle contains the given other
+  // rectangle.
+  bool Contains(const R2Rect& other) const;
+
+  // Return true if and only if the interior of this rectangle contains all
+  // points of the given other rectangle (including its boundary).
+  bool InteriorContains(const R2Rect& other) const;
+
+  // Return true if this rectangle and the given other rectangle have any
+  // points in common.
+  bool Intersects(const R2Rect& other) const;
+
+  // Return true if and only if the interior of this rectangle intersects
+  // any point (including the boundary) of the given other rectangle.
+  bool InteriorIntersects(const R2Rect& other) const;
+
+  // Expand the rectangle to include the given point.  The rectangle is
+  // expanded by the minimum amount possible.
+  void AddPoint(const R2Point& p);
+
+  // Expand the rectangle to include the given other rectangle.  This is the
+  // same as replacing the rectangle by the union of the two rectangles, but
+  // is somewhat more efficient.
+  void AddRect(const R2Rect& other);
+
+  // Return the closest point in the rectangle to the given point "p".
+  // The rectangle must be non-empty.
+  R2Point Project(const R2Point& p) const;
+
+  // Return a rectangle that has been expanded on each side in the x-direction
+  // by margin.x(), and on each side in the y-direction by margin.y().  If
+  // either margin is empty, then shrink the interval on the corresponding
+  // sides instead.  The resulting rectangle may be empty.  Any expansion of
+  // an empty rectangle remains empty.
+  R2Rect Expanded(const R2Point& margin) const;
+  R2Rect Expanded(double margin) const;
+
+  // Return the smallest rectangle containing the union of this rectangle and
+  // the given rectangle.
+  R2Rect Union(const R2Rect& other) const;
+
+  // Return the smallest rectangle containing the intersection of this
+  // rectangle and the given rectangle.
+  R2Rect Intersection(const R2Rect& other) const;
+
+  // Return true if two rectangles contains the same set of points.
+  bool operator==(const R2Rect& other) const;
+
+  // Return true if the x- and y-intervals of the two rectangles are the same
+  // up to the given tolerance (see r1interval.h for details).
+  bool ApproxEquals(const R2Rect& other, double max_error = 1e-15) const;
+
+ private:
+  R1Interval bounds_[2];
+};
+
+inline R2Rect::R2Rect(const R2Point& lo, const R2Point& hi) {
+  bounds_[0] = R1Interval(lo.x(), hi.x());
+  bounds_[1] = R1Interval(lo.y(), hi.y());
+  S2_DCHECK(is_valid());
+}
+
+inline R2Rect::R2Rect(const R1Interval& x, const R1Interval& y) {
+  bounds_[0] = x;
+  bounds_[1] = y;
+  S2_DCHECK(is_valid());
+}
+
+inline R2Rect::R2Rect() {
+  // The default R1Interval constructor creates an empty interval.
+  S2_DCHECK(is_valid());
+}
+
+inline R2Rect R2Rect::Empty() {
+  return R2Rect(R1Interval::Empty(), R1Interval::Empty());
+}
+
+inline bool R2Rect::is_valid() const {
+  // The x/y ranges must either be both empty or both non-empty.
+  return x().is_empty() == y().is_empty();
+}
+
+inline bool R2Rect::is_empty() const {
+  return x().is_empty();
+}
+
+inline R2Rect R2Rect::FromPoint(const R2Point& p) {
+  return R2Rect(p, p);
+}
+
+inline R2Point R2Rect::GetVertex(int k) const {
+  // Twiddle bits to return the points in CCW order (lower left, lower right,
+  // upper right, upper left).
+  int j = (k >> 1) & 1;
+  return GetVertex(j ^ (k & 1), j);
+}
+
+inline R2Point R2Rect::GetVertex(int i, int j) const {
+  return R2Point(bounds_[0][i], bounds_[1][j]);
+}
+
+inline R2Point R2Rect::GetCenter() const {
+  return R2Point(x().GetCenter(), y().GetCenter());
+}
+
+inline R2Point R2Rect::GetSize() const {
+  return R2Point(x().GetLength(), y().GetLength());
+}
+
+inline bool R2Rect::Contains(const R2Point& p) const {
+  return x().Contains(p.x()) && y().Contains(p.y());
+}
+
+inline bool R2Rect::InteriorContains(const R2Point& p) const {
+  return x().InteriorContains(p.x()) && y().InteriorContains(p.y());
+}
+
+inline R2Rect R2Rect::Expanded(double margin) const {
+  return Expanded(R2Point(margin, margin));
+}
+
+inline bool R2Rect::operator==(const R2Rect& other) const {
+  return x() == other.x() && y() == other.y();
+}
+
+std::ostream& operator<<(std::ostream& os, const R2Rect& r);
+
+#endif  // S2_R2RECT_H_

package/third_party/s2geometry/src/s2/r2rect_test.cc

@@ -0,0 +1,228 @@
+// Copyright 2012 Google Inc. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+
+// Author: ericv@google.com (Eric Veach)
+//
+// Most of the R2Rect methods have trivial implementations in terms of the
+// R1Interval class, so most of the testing is done in that unit test.
+
+#include "s2/r2rect.h"
+
+#include <gtest/gtest.h>
+#include "s2/r2.h"
+
+static void TestIntervalOps(const R2Rect& x, const R2Rect& y,
+                            const char* expected_rexion,
+                            const R2Rect& expected_union,
+                            const R2Rect& expected_intersection) {
+  // Test all of the interval operations on the given pair of intervals.
+  // "expected_rexion" is a sequence of "T" and "F" characters corresponding
+  // to the expected results of Contains(), InteriorContains(), Intersects(),
+  // and InteriorIntersects() respectively.
+
+  EXPECT_EQ(expected_rexion[0] == 'T', x.Contains(y));
+  EXPECT_EQ(expected_rexion[1] == 'T', x.InteriorContains(y));
+  EXPECT_EQ(expected_rexion[2] == 'T', x.Intersects(y));
+  EXPECT_EQ(expected_rexion[3] == 'T', x.InteriorIntersects(y));
+
+  EXPECT_EQ(x.Union(y) == x, x.Contains(y));
+  EXPECT_EQ(!x.Intersection(y).is_empty(), x.Intersects(y));
+
+  EXPECT_EQ(expected_union, x.Union(y));
+  EXPECT_EQ(expected_intersection, x.Intersection(y));
+
+  R2Rect r = x;
+  r.AddRect(y);
+  EXPECT_EQ(expected_union, r);
+  if (y.GetSize() == R2Point(0, 0)) {
+    r = x;
+    r.AddPoint(y.lo());
+    EXPECT_EQ(expected_union, r);
+  }
+}
+
+TEST(R2Rect, EmptyRectangles) {
+  // Test basic properties of empty rectangles.
+  R2Rect empty = R2Rect::Empty();
+  EXPECT_TRUE(empty.is_valid());
+  EXPECT_TRUE(empty.is_empty());
+}
+
+TEST(R2Rect, ConstructorsAndAccessors) {
+  // Check various constructors and accessor methods.
+  R2Rect r = R2Rect(R2Point(0.1, 0), R2Point(0.25, 1));
+  EXPECT_EQ(0.1, r.x().lo());
+  EXPECT_EQ(0.25, r.x().hi());
+  EXPECT_EQ(0.0, r.y().lo());
+  EXPECT_EQ(1.0, r.y().hi());
+
+  EXPECT_EQ(0.1, r[0][0]);
+  EXPECT_EQ(0.25, r[0][1]);
+  EXPECT_EQ(0.0, r[1][0]);
+  EXPECT_EQ(1.0, r[1][1]);
+
+  EXPECT_EQ(R1Interval(0.1, 0.25), r.x());
+  EXPECT_EQ(R1Interval(0, 1), r.y());
+
+  EXPECT_EQ(R1Interval(0.1, 0.25), r[0]);
+  EXPECT_EQ(R1Interval(0, 1), r[1]);
+
+  r[0] = R1Interval(3, 4);
+  r[1][0] = 5;
+  r[1][1] = 6;
+  EXPECT_EQ(R1Interval(3, 4), r[0]);
+  EXPECT_EQ(R1Interval(5, 6), r[1]);
+
+  R2Rect r2;
+  EXPECT_TRUE(r2.is_empty());
+}
+
+TEST(R2Rect, FromCenterSize) {
+  // FromCenterSize()
+  EXPECT_TRUE(R2Rect::FromCenterSize(R2Point(0.3, 0.5), R2Point(0.2, 0.4)).
+              ApproxEquals(R2Rect(R2Point(0.2, 0.3), R2Point(0.4, 0.7))));
+  EXPECT_TRUE(R2Rect::FromCenterSize(R2Point(1, 0.1), R2Point(0, 2)).
+              ApproxEquals(R2Rect(R2Point(1, -0.9), R2Point(1, 1.1))));
+}
+
+TEST(R2Rect, FromPoint) {
+  // FromPoint(), FromPointPair()
+  R2Rect d1 = R2Rect(R2Point(0.1, 0), R2Point(0.25, 1));
+  EXPECT_EQ(R2Rect(d1.lo(), d1.lo()), R2Rect::FromPoint(d1.lo()));
+  EXPECT_EQ(R2Rect(R2Point(0.15, 0.3), R2Point(0.35, 0.9)),
+            R2Rect::FromPointPair(R2Point(0.15, 0.9), R2Point(0.35, 0.3)));
+  EXPECT_EQ(R2Rect(R2Point(0.12, 0), R2Point(0.83, 0.5)),
+            R2Rect::FromPointPair(R2Point(0.83, 0), R2Point(0.12, 0.5)));
+}
+
+TEST(R2Rect, SimplePredicates) {
+  // GetCenter(), GetVertex(), Contains(R2Point), InteriorContains(R2Point).
+  R2Point sw1 = R2Point(0, 0.25);
+  R2Point ne1 = R2Point(0.5, 0.75);
+  R2Rect r1(sw1, ne1);
+
+  EXPECT_EQ(R2Point(0.25, 0.5), r1.GetCenter());
+  EXPECT_EQ(R2Point(0, 0.25), r1.GetVertex(0));
+  EXPECT_EQ(R2Point(0.5, 0.25), r1.GetVertex(1));
+  EXPECT_EQ(R2Point(0.5, 0.75), r1.GetVertex(2));
+  EXPECT_EQ(R2Point(0, 0.75), r1.GetVertex(3));
+  EXPECT_TRUE(r1.Contains(R2Point(0.2, 0.4)));
+  EXPECT_FALSE(r1.Contains(R2Point(0.2, 0.8)));
+  EXPECT_FALSE(r1.Contains(R2Point(-0.1, 0.4)));
+  EXPECT_FALSE(r1.Contains(R2Point(0.6, 0.1)));
+  EXPECT_TRUE(r1.Contains(sw1));
+  EXPECT_TRUE(r1.Contains(ne1));
+  EXPECT_FALSE(r1.InteriorContains(sw1));
+  EXPECT_FALSE(r1.InteriorContains(ne1));
+
+  // Make sure that GetVertex() returns vertices in CCW order.
+  for (int k = 0; k < 4; ++k) {
+    R2Point a = r1.GetVertex(k - 1);
+    R2Point b = r1.GetVertex(k);
+    R2Point c = r1.GetVertex(k + 1);
+    EXPECT_GT((b - a).Ortho().DotProd(c - a), 0);
+  }
+}
+
+TEST(R2Rect, IntervalOperations) {
+  // Contains(R2Rect), InteriorContains(R2Rect),
+  // Intersects(), InteriorIntersects(), Union(), Intersection().
+  //
+  // Much more testing of these methods is done in s1interval_test
+  // and r1interval_test.
+
+  R2Rect empty = R2Rect::Empty();
+  R2Point sw1 = R2Point(0, 0.25);
+  R2Point ne1 = R2Point(0.5, 0.75);
+  R2Rect r1(sw1, ne1);
+  R2Rect r1_mid = R2Rect(R2Point(0.25, 0.5), R2Point(0.25, 0.5));
+  R2Rect r_sw1(sw1, sw1);
+  R2Rect r_ne1(ne1, ne1);
+
+  TestIntervalOps(r1, r1_mid, "TTTT", r1, r1_mid);
+  TestIntervalOps(r1, r_sw1, "TFTF", r1, r_sw1);
+  TestIntervalOps(r1, r_ne1, "TFTF", r1, r_ne1);
+
+  EXPECT_EQ(R2Rect(R2Point(0, 0.25), R2Point(0.5, 0.75)), r1);
+  TestIntervalOps(r1, R2Rect(R2Point(0.45, 0.1), R2Point(0.75, 0.3)), "FFTT",
+                  R2Rect(R2Point(0, 0.1), R2Point(0.75, 0.75)),
+                  R2Rect(R2Point(0.45, 0.25), R2Point(0.5, 0.3)));
+  TestIntervalOps(r1, R2Rect(R2Point(0.5, 0.1), R2Point(0.7, 0.3)), "FFTF",
+                  R2Rect(R2Point(0, 0.1), R2Point(0.7, 0.75)),
+                  R2Rect(R2Point(0.5, 0.25), R2Point(0.5, 0.3)));
+  TestIntervalOps(r1, R2Rect(R2Point(0.45, 0.1), R2Point(0.7, 0.25)), "FFTF",
+                  R2Rect(R2Point(0, 0.1), R2Point(0.7, 0.75)),
+                  R2Rect(R2Point(0.45, 0.25), R2Point(0.5, 0.25)));
+
+  TestIntervalOps(R2Rect(R2Point(0.1, 0.2), R2Point(0.1, 0.3)),
+                  R2Rect(R2Point(0.15, 0.7), R2Point(0.2, 0.8)), "FFFF",
+                  R2Rect(R2Point(0.1, 0.2), R2Point(0.2, 0.8)),
+                  empty);
+
+  // Check that the intersection of two rectangles that overlap in x but not y
+  // is valid, and vice versa.
+  TestIntervalOps(R2Rect(R2Point(0.1, 0.2), R2Point(0.4, 0.5)),
+                  R2Rect(R2Point(0, 0), R2Point(0.2, 0.1)), "FFFF",
+                  R2Rect(R2Point(0, 0), R2Point(0.4, 0.5)), empty);
+  TestIntervalOps(R2Rect(R2Point(0, 0), R2Point(0.1, 0.3)),
+                  R2Rect(R2Point(0.2, 0.1), R2Point(0.3, 0.4)), "FFFF",
+                  R2Rect(R2Point(0, 0), R2Point(0.3, 0.4)), empty);
+}
+
+TEST(R2Rect, AddPoint) {
+  // AddPoint()
+  R2Point sw1 = R2Point(0, 0.25);
+  R2Point ne1 = R2Point(0.5, 0.75);
+  R2Rect r1(sw1, ne1);
+
+  R2Rect r2 = R2Rect::Empty();
+  r2.AddPoint(R2Point(0, 0.25));
+  r2.AddPoint(R2Point(0.5, 0.25));
+  r2.AddPoint(R2Point(0, 0.75));
+  r2.AddPoint(R2Point(0.1, 0.4));
+  EXPECT_EQ(r1, r2);
+}
+
+TEST(R2Rect, Project) {
+  R2Rect r1(R1Interval(0, 0.5), R1Interval(0.25, 0.75));
+
+  EXPECT_EQ(R2Point(0, 0.25), r1.Project(R2Point(-0.01, 0.24)));
+  EXPECT_EQ(R2Point(0, 0.48), r1.Project(R2Point(-5.0, 0.48)));
+  EXPECT_EQ(R2Point(0, 0.75), r1.Project(R2Point(-5.0, 2.48)));
+  EXPECT_EQ(R2Point(0.19, 0.75), r1.Project(R2Point(0.19, 2.48)));
+  EXPECT_EQ(R2Point(0.5, 0.75), r1.Project(R2Point(6.19, 2.48)));
+  EXPECT_EQ(R2Point(0.5, 0.53), r1.Project(R2Point(6.19, 0.53)));
+  EXPECT_EQ(R2Point(0.5, 0.25), r1.Project(R2Point(6.19, -2.53)));
+  EXPECT_EQ(R2Point(0.33, 0.25), r1.Project(R2Point(0.33, -2.53)));
+  EXPECT_EQ(R2Point(0.33, 0.37), r1.Project(R2Point(0.33, 0.37)));
+}
+
+TEST(R2Rect, Expanded) {
+  // Expanded()
+  EXPECT_TRUE(R2Rect::Empty().Expanded(R2Point(0.1, 0.3)).is_empty());
+  EXPECT_TRUE(R2Rect::Empty().Expanded(R2Point(-0.1, -0.3)).is_empty());
+  EXPECT_TRUE(R2Rect(R2Point(0.2, 0.4), R2Point(0.3, 0.7)).
+              Expanded(R2Point(0.1, 0.3)).
+              ApproxEquals(R2Rect(R2Point(0.1, 0.1), R2Point(0.4, 1.0))));
+  EXPECT_TRUE(R2Rect(R2Point(0.2, 0.4), R2Point(0.3, 0.7)).
+              Expanded(R2Point(-0.1, 0.3)).is_empty());
+  EXPECT_TRUE(R2Rect(R2Point(0.2, 0.4), R2Point(0.3, 0.7)).
+              Expanded(R2Point(0.1, -0.2)).is_empty());
+  EXPECT_TRUE(R2Rect(R2Point(0.2, 0.4), R2Point(0.3, 0.7)).
+              Expanded(R2Point(0.1, -0.1)).
+              ApproxEquals(R2Rect(R2Point(0.1, 0.5), R2Point(0.4, 0.6))));
+  EXPECT_TRUE(R2Rect(R2Point(0.2, 0.4), R2Point(0.3, 0.7)).Expanded(0.1).
+              ApproxEquals(R2Rect(R2Point(0.1, 0.3), R2Point(0.4, 0.8))));
+}

package/third_party/s2geometry/src/s2/s1angle.cc

@@ -0,0 +1,54 @@
+// Copyright 2005 Google Inc. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+
+// Author: ericv@google.com (Eric Veach)
+
+#include "s2/s1angle.h"
+
+#include <cmath>
+#include <cstdio>
+#include <ostream>
+
+#include "s2/s2latlng.h"
+
+S1Angle::S1Angle(const S2Point& x, const S2Point& y)
+    : radians_(x.Angle(y)) {
+}
+
+S1Angle::S1Angle(const S2LatLng& x, const S2LatLng& y)
+    : radians_(x.GetDistance(y).radians()) {
+}
+
+S1Angle S1Angle::Normalized() const {
+  S1Angle a(radians_);
+  a.Normalize();
+  return a;
+}
+
+void S1Angle::Normalize() {
+  radians_ = remainder(radians_, 2.0 * M_PI);
+  if (radians_ <= -M_PI) radians_ = M_PI;
+}
+
+std::ostream& operator<<(std::ostream& os, S1Angle a) {
+  double degrees = a.degrees();
+  char buffer[13];
+  int sz = snprintf(buffer, sizeof(buffer), "%.7f", degrees);
+  if (sz >= 0 && sz < sizeof(buffer)) {
+    return os << buffer;
+  } else {
+    return os << degrees;
+  }
+}