Home
last modified time | relevance | path

Searched refs:points_ (Results 1 – 25 of 551) sorted by relevance

12345678910>>...23

/dports/math/poly2tri/poly2tri-e6e63dd29ef0805b3e40fe1832c2f1fe2307943a/poly2tri/common/
H A Dshapes.cc44 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
54 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
94 points_[0]=points_[1]=points_[2] = NULL; in Clear()
134 points_[1] = points_[0]; in Legalize()
135 points_[0] = points_[2]; in Legalize()
143 points_[1] = points_[0]; in Legalize()
144 points_[0] = points_[2]; in Legalize()
147 points_[2] = points_[1]; in Legalize()
148 points_[1] = points_[0]; in Legalize()
387 return (points_[1]->x - points_[0]->x) * (points_[2]->y - points_[0]->y) - in IsCounterClockwise()
[all …]
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/poly2tri/common/
H A Dshapes.cpp44 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
54 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
94 points_[0]=points_[1]=points_[2] = nullptr; in Clear()
134 points_[1] = points_[0]; in Legalize()
135 points_[0] = points_[2]; in Legalize()
143 points_[1] = points_[0]; in Legalize()
144 points_[0] = points_[2]; in Legalize()
147 points_[2] = points_[1]; in Legalize()
148 points_[1] = points_[0]; in Legalize()
387 return (points_[1]->x - points_[0]->x) * (points_[2]->y - points_[0]->y) - in IsCounterClockwise()
[all …]
/dports/graphics/qgis/qgis-3.22.3/external/poly2tri/common/
H A Dshapes.cc48 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
58 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
98 points_[0]=points_[1]=points_[2] = nullptr; in Clear()
138 points_[1] = points_[0]; in Legalize()
139 points_[0] = points_[2]; in Legalize()
147 points_[1] = points_[0]; in Legalize()
148 points_[0] = points_[2]; in Legalize()
151 points_[2] = points_[1]; in Legalize()
152 points_[1] = points_[0]; in Legalize()
391 return (points_[1]->x - points_[0]->x) * (points_[2]->y - points_[0]->y) - in IsCounterClockwise()
[all …]
/dports/graphics/qgis-ltr/qgis-3.16.16/external/poly2tri/common/
H A Dshapes.cc44 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
54 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
94 points_[0]=points_[1]=points_[2] = NULL; in Clear()
134 points_[1] = points_[0]; in Legalize()
135 points_[0] = points_[2]; in Legalize()
143 points_[1] = points_[0]; in Legalize()
144 points_[0] = points_[2]; in Legalize()
147 points_[2] = points_[1]; in Legalize()
148 points_[1] = points_[0]; in Legalize()
387 return (points_[1]->x - points_[0]->x) * (points_[2]->y - points_[0]->y) - in IsCounterClockwise()
[all …]
/dports/cad/repsnapper/repsnapper-2.5a4/libraries/poly2tri/poly2tri/poly2tri/common/
H A Dshapes.cc38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
128 points_[1] = points_[0]; in Legalize()
129 points_[0] = points_[2]; in Legalize()
137 points_[1] = points_[0]; in Legalize()
138 points_[0] = points_[2]; in Legalize()
141 points_[2] = points_[1]; in Legalize()
142 points_[1] = points_[0]; in Legalize()
145 points_[0] = points_[2]; in Legalize()
[all …]
/dports/games/spring/spring_98.0/rts/lib/assimp/contrib/poly2tri/poly2tri/common/
H A Dshapes.cc38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
132 points_[1] = points_[0]; in Legalize()
133 points_[0] = points_[2]; in Legalize()
141 points_[1] = points_[0]; in Legalize()
142 points_[0] = points_[2]; in Legalize()
145 points_[2] = points_[1]; in Legalize()
146 points_[1] = points_[0]; in Legalize()
149 points_[0] = points_[2]; in Legalize()
[all …]
/dports/devel/upp/upp/bazaar/plugin/assimp/contrib/poly2tri/poly2tri/common/
H A Dshapes.cc38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
128 points_[1] = points_[0]; in Legalize()
129 points_[0] = points_[2]; in Legalize()
137 points_[1] = points_[0]; in Legalize()
138 points_[0] = points_[2]; in Legalize()
141 points_[2] = points_[1]; in Legalize()
142 points_[1] = points_[0]; in Legalize()
145 points_[0] = points_[2]; in Legalize()
[all …]
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Assimp/contrib/poly2tri/poly2tri/common/
H A Dshapes.cc38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
132 points_[1] = points_[0]; in Legalize()
133 points_[0] = points_[2]; in Legalize()
141 points_[1] = points_[0]; in Legalize()
142 points_[0] = points_[2]; in Legalize()
145 points_[2] = points_[1]; in Legalize()
146 points_[1] = points_[0]; in Legalize()
149 points_[0] = points_[2]; in Legalize()
[all …]
/dports/graphics/wdune/wdune-1.926/src/
H A Dshapes.cpp38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
128 points_[1] = points_[0]; in Legalize()
129 points_[0] = points_[2]; in Legalize()
137 points_[1] = points_[0]; in Legalize()
138 points_[0] = points_[2]; in Legalize()
141 points_[2] = points_[1]; in Legalize()
142 points_[1] = points_[0]; in Legalize()
145 points_[0] = points_[2]; in Legalize()
[all …]
/dports/multimedia/assimp/assimp-5.1.3/contrib/poly2tri/poly2tri/common/
H A Dshapes.cc38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
128 points_[1] = points_[0]; in Legalize()
129 points_[0] = points_[2]; in Legalize()
137 points_[1] = points_[0]; in Legalize()
138 points_[0] = points_[2]; in Legalize()
141 points_[2] = points_[1]; in Legalize()
142 points_[1] = points_[0]; in Legalize()
145 points_[0] = points_[2]; in Legalize()
[all …]
/dports/games/doomsday/doomsday-2.3.1/doomsday/external/assimp/contrib/poly2tri/poly2tri/common/
H A Dshapes.cc38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
132 points_[1] = points_[0]; in Legalize()
133 points_[0] = points_[2]; in Legalize()
141 points_[1] = points_[0]; in Legalize()
142 points_[0] = points_[2]; in Legalize()
145 points_[2] = points_[1]; in Legalize()
146 points_[1] = points_[0]; in Legalize()
149 points_[0] = points_[2]; in Legalize()
[all …]
/dports/devel/qt5-location/kde-qtlocation-5.15.2p6/src/3rdparty/poly2tri/common/
H A Dshapes.cpp38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
128 points_[1] = points_[0]; in Legalize()
129 points_[0] = points_[2]; in Legalize()
137 points_[1] = points_[0]; in Legalize()
138 points_[0] = points_[2]; in Legalize()
141 points_[2] = points_[1]; in Legalize()
142 points_[1] = points_[0]; in Legalize()
145 points_[0] = points_[2]; in Legalize()
[all …]
/dports/graphics/qt5-3d/kde-qt3d-5.15.2p39/src/3rdparty/assimp/contrib/poly2tri/poly2tri/common/
H A Dshapes.cc38 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
48 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
88 points_[0]=points_[1]=points_[2] = NULL; in Clear()
128 points_[1] = points_[0]; in Legalize()
129 points_[0] = points_[2]; in Legalize()
137 points_[1] = points_[0]; in Legalize()
138 points_[0] = points_[2]; in Legalize()
141 points_[2] = points_[1]; in Legalize()
142 points_[1] = points_[0]; in Legalize()
145 points_[0] = points_[2]; in Legalize()
[all …]
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/poly2tri/common/
H A Dshapes.cc44 points_[0] = &a; points_[1] = &b; points_[2] = &c; in Triangle()
54 if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2])) in MarkNeighbor()
94 points_[0]=points_[1]=points_[2] = NULL; in Clear()
134 points_[1] = points_[0]; in Legalize()
135 points_[0] = points_[2]; in Legalize()
143 points_[1] = points_[0]; in Legalize()
144 points_[0] = points_[2]; in Legalize()
147 points_[2] = points_[1]; in Legalize()
148 points_[1] = points_[0]; in Legalize()
151 points_[0] = points_[2]; in Legalize()
[all …]
/dports/graphics/gegl/gegl-0.4.34/subprojects/poly2tri-c/poly2tri-c/p2t/common/
H A Dshapes.c163 …if ((p1 == THIS->points_[2] && p2 == THIS->points_[1]) || (p1 == THIS->points_[1] && p2 == THIS->p… in p2t_triangle_mark_neighbor_pt_pt_tr()
165 …else if ((p1 == THIS->points_[0] && p2 == THIS->points_[2]) || (p1 == THIS->points_[2] && p2 == TH… in p2t_triangle_mark_neighbor_pt_pt_tr()
167 …else if ((p1 == THIS->points_[0] && p2 == THIS->points_[1]) || (p1 == THIS->points_[1] && p2 == TH… in p2t_triangle_mark_neighbor_pt_pt_tr()
212 THIS->points_[0] = THIS->points_[1] = THIS->points_[2] = NULL; in p2t_triangle_clear()
263 THIS->points_[1] = THIS->points_[0]; in p2t_triangle_legalize_pt()
264 THIS->points_[0] = THIS->points_[2]; in p2t_triangle_legalize_pt()
275 THIS->points_[1] = THIS->points_[0]; in p2t_triangle_legalize_pt_pt()
276 THIS->points_[0] = THIS->points_[2]; in p2t_triangle_legalize_pt_pt()
371 …if ((q == THIS->points_[0] && p == THIS->points_[1]) || (q == THIS->points_[1] && p == THIS->point… in p2t_triangle_mark_constrained_edge_pt_pt()
375 …else if ((q == THIS->points_[0] && p == THIS->points_[2]) || (q == THIS->points_[2] && p == THIS-> in p2t_triangle_mark_constrained_edge_pt_pt()
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 return points_[0] < that.points_[0]; in operator <()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 return points_[0] < that.points_[0]; in operator <()
[all …]
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 points_[0] < that.points_[0]; in operator <()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 return points_[0] < that.points_[0]; in operator <()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 return points_[0] < that.points_[0]; in operator <()
[all …]
/dports/databases/xtrabackup/boost_1_59_0/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 points_[0] < that.points_[0]; in operator <()
[all …]
/dports/databases/percona57-server/boost_1_59_0/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 points_[0] < that.points_[0]; in operator <()
[all …]
/dports/databases/percona57-client/boost_1_59_0/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 points_[0] < that.points_[0]; in operator <()
[all …]
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 return points_[0] < that.points_[0]; in operator <()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/polygon/
H A Dsegment_data.hpp39 points_[0] = that.points_[0]; in segment_data()
40 points_[1] = that.points_[1]; in segment_data()
44 points_[0] = that.points_[0]; in operator =()
45 points_[1] = that.points_[1]; in operator =()
82 return (points_[0] == that.points_[0]) && in operator ==()
83 (points_[1] == that.points_[1]); in operator ==()
87 return (points_[0] != that.points_[0]) || in operator !=()
88 (points_[1] != that.points_[1]); in operator !=()
92 if (points_[0] != that.points_[0]) { in operator <()
93 return points_[0] < that.points_[0]; in operator <()
[all …]

12345678910>>...23