4
4
// open source releases of s2.
5
5
6
6
%{
7
+ #include < memory>
7
8
#include < sstream>
8
9
#include < string>
9
10
@@ -121,7 +122,7 @@ public:
121
122
SWIG_exception (SWIG_ValueError, $1 ->text ().c_str ());
122
123
}
123
124
124
- // This overload shadows the one the takes vector<uint64 >&, and it
125
+ // This overload shadows the one the takes vector<uint64_t >&, and it
125
126
// does not work anyway.
126
127
%ignore S2CellUnion::Init (std::vector<S2CellId> const & cell_ids);
127
128
@@ -636,7 +637,7 @@ public:
636
637
%unignore S2CellId::End;
637
638
%unignore S2CellId::FromDebugString(absl::string_view);
638
639
%unignore S2CellId::FromFaceIJ(int, int, int);
639
- %unignore S2CellId::FromFacePosLevel(int, uint64 , int);
640
+ %unignore S2CellId::FromFacePosLevel(int, uint64_t , int);
640
641
%unignore S2CellId::FromLatLng;
641
642
%unignore S2CellId::FromPoint;
642
643
%unignore S2CellId::FromToken(absl::string_view);
@@ -668,7 +669,7 @@ public:
668
669
%unignore S2CellId::range_min;
669
670
%unignore S2CellUnion;
670
671
%ignore S2CellUnion::operator[]; // Silence the SWIG warning.
671
- %unignore S2CellUnion::S2CellUnion;
672
+ %unignore S2CellUnion::S2CellUnion(const std::vector<uint64_t> &) ;
672
673
%unignore S2CellUnion::~S2CellUnion;
673
674
%unignore S2CellUnion::ApproxArea;
674
675
%unignore S2CellUnion::Clone;
@@ -681,7 +682,7 @@ public:
681
682
%unignore S2CellUnion::GetCapBound() const;
682
683
%unignore S2CellUnion::GetDifference;
683
684
%unignore S2CellUnion::GetRectBound;
684
- %unignore S2CellUnion::Init(std::vector<uint64 > const &);
685
+ %unignore S2CellUnion::Init(std::vector<uint64_t > const &);
685
686
%unignore S2CellUnion::Intersection;
686
687
%unignore S2CellUnion::Intersects;
687
688
%unignore S2CellUnion::IsNormalized() const;
@@ -811,6 +812,10 @@ public:
811
812
%unignore S2Loop::vertex;
812
813
%unignore S2Polygon;
813
814
%unignore S2Polygon::S2Polygon;
815
+ %ignore S2Polygon::S2Polygon(std::unique_ptr<S2Loop>, S2Debug);
816
+ %ignore S2Polygon::S2Polygon(std::unique_ptr<S2Loop>);
817
+ %ignore S2Polygon::S2Polygon(std::vector<std::unique_ptr<S2Loop>>, S2Debug);
818
+ %ignore S2Polygon::S2Polygon(std::vector<std::unique_ptr<S2Loop>>);
814
819
%unignore S2Polygon::~S2Polygon;
815
820
%unignore S2Polygon::BoundaryNear;
816
821
%unignore S2Polygon::Clone;
@@ -827,10 +832,11 @@ public:
827
832
%unignore S2Polygon::GetOverlapFractions(const S2Polygon&, const S2Polygon&);
828
833
%unignore S2Polygon::GetRectBound;
829
834
%unignore S2Polygon::Init;
835
+ %ignore S2Polygon::Init(std::unique_ptr<S2Loop>);
830
836
%unignore S2Polygon::InitNested;
837
+ %ignore S2Polygon::InitNested(std::vector<std::unique_ptr<S2Loop>>);
831
838
%unignore S2Polygon::InitToUnion;
832
839
%unignore S2Polygon::Intersects;
833
- %unignore S2Polygon::IntersectWithPolyline;
834
840
%unignore S2Polygon::IsValid;
835
841
%unignore S2Polygon::MayIntersect(const S2Cell&) const;
836
842
%unignore S2Polygon::Project;
0 commit comments