| 2313 | } |
| 2314 | |
| 2315 | bool FindNext( |
| 2316 | std::vector<Edge>& unordered, const Edge& last, std::vector<Edge>::iterator& next, Edge& nextEdge) |
| 2317 | { |
| 2318 | for (auto it = unordered.begin(); it != unordered.end(); ++it) |
| 2319 | { |
| 2320 | if (last.second == it->first) |
| 2321 | { |
| 2322 | next = it; |
| 2323 | nextEdge = *it; |
| 2324 | return true; |
| 2325 | } |
| 2326 | else if (last.second == it->second) |
| 2327 | { |
| 2328 | nextEdge = Edge(it->second, it->first); |
| 2329 | next = it; |
| 2330 | return true; |
| 2331 | } |
| 2332 | } |
| 2333 | |
| 2334 | return false; |
| 2335 | } |
| 2336 | |
| 2337 | bool OrderEdgePolygon(std::vector<Edge>& unordered, std::vector<std::vector<Edge>>& ordered) |
| 2338 | { |
no test coverage detected