Searched refs:outerNode (Results 1 – 3 of 3) sorted by relevance
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/earcut/ |
| H A D | earcut.hpp | 89 template <typename Polygon> Node* eliminateHoles(const Polygon& points, Node* outerNode);
90 void eliminateHole(Node* hole, Node* outerNode);
91 Node* findHoleBridge(Node* hole, Node* outerNode);
180 Node* outerNode = linkedList(points[0], true); in operator ()() local
181 if (!outerNode || outerNode->prev == outerNode->next) return; in operator ()()
183 if (points.size() > 1) outerNode = eliminateHoles(points, outerNode); in operator ()()
188 Node* p = outerNode->next; in operator ()()
189 minX = maxX = outerNode->x; in operator ()()
190 minY = maxY = outerNode->y; in operator ()()
199 } while (p != outerNode); in operator ()()
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/earcut/0.12.4/include/mapbox/ |
| H A D | earcut.hpp | 65 template <typename Polygon> Node* eliminateHoles(const Polygon& points, Node* outerNode);
66 void eliminateHole(Node* hole, Node* outerNode);
67 Node* findHoleBridge(Node* hole, Node* outerNode);
150 Node* outerNode = linkedList(points[0], true); in operator ()() local
151 if (!outerNode) return; in operator ()()
153 if (points.size() > 1) outerNode = eliminateHoles(points, outerNode); in operator ()()
158 Node* p = outerNode->next; in operator ()()
169 } while (p != outerNode); in operator ()()
176 earcutLinked(outerNode); in operator ()()
419 Earcut<N>::eliminateHoles(const Polygon& points, Node* outerNode) { in eliminateHoles() argument
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/clipper/ |
| H A D | clipper.cpp | 3938 PolyNode* outerNode = solution.Childs[0]; in Execute() local
3939 solution.Childs.reserve(outerNode->ChildCount()); in Execute()
3940 solution.Childs[0] = outerNode->Childs[0]; in Execute()
3941 solution.Childs[0]->Parent = outerNode->Parent; in Execute()
3942 for (int i = 1; i < outerNode->ChildCount(); ++i) in Execute()
3943 solution.AddChild(*outerNode->Childs[i]); in Execute()
|