Fix STL to Godot type convertion of polypartition
(cherry picked from commit d16bef8b55
)
This commit is contained in:
parent
738d0b7f63
commit
20dfa4ceaa
|
@ -1166,7 +1166,7 @@ int TriangulatorPartition::MonotonePartition(List<TriangulatorPoly> *inpolys, Li
|
||||||
newedge.p1 = v->p;
|
newedge.p1 = v->p;
|
||||||
newedge.p2 = v->p;
|
newedge.p2 = v->p;
|
||||||
edgeIter = edgeTree.lower_bound(newedge);
|
edgeIter = edgeTree.lower_bound(newedge);
|
||||||
if(edgeIter == edgeTree.front()) {
|
if(edgeIter == nullptr || edgeIter == edgeTree.front()) {
|
||||||
error = true;
|
error = true;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -1202,7 +1202,7 @@ int TriangulatorPartition::MonotonePartition(List<TriangulatorPoly> *inpolys, Li
|
||||||
newedge.p1 = v->p;
|
newedge.p1 = v->p;
|
||||||
newedge.p2 = v->p;
|
newedge.p2 = v->p;
|
||||||
edgeIter = edgeTree.lower_bound(newedge);
|
edgeIter = edgeTree.lower_bound(newedge);
|
||||||
if(edgeIter == edgeTree.front()) {
|
if(edgeIter == nullptr || edgeIter == edgeTree.front()) {
|
||||||
error = true;
|
error = true;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -1241,7 +1241,7 @@ int TriangulatorPartition::MonotonePartition(List<TriangulatorPoly> *inpolys, Li
|
||||||
newedge.p1 = v->p;
|
newedge.p1 = v->p;
|
||||||
newedge.p2 = v->p;
|
newedge.p2 = v->p;
|
||||||
edgeIter = edgeTree.lower_bound(newedge);
|
edgeIter = edgeTree.lower_bound(newedge);
|
||||||
if(edgeIter == edgeTree.front()) {
|
if(edgeIter == nullptr || edgeIter == edgeTree.front()) {
|
||||||
error = true;
|
error = true;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue