| 5 | #include "planar.h" |
| 6 | |
| 7 | bool equal_cycles(const std::vector<size_t> & a, const std::vector<size_t> & b) { |
| 8 | size_t n = a.size(); |
| 9 | if (n != b.size()) { |
| 10 | return false; |
| 11 | } |
| 12 | for (size_t begin = 0; begin < n; begin++) { |
| 13 | bool ok = true; |
| 14 | for (size_t i = 0; i < n; i++) { |
| 15 | if (a[(begin + i) % n] != b[i]) { |
| 16 | ok = false; |
| 17 | break; |
| 18 | } |
| 19 | } |
| 20 | if (ok) { |
| 21 | return true; |
| 22 | } |
| 23 | } |
| 24 | return false; |
| 25 | } |
| 26 | |
| 27 | void test_simple() { |
| 28 | std::vector<Point> p = { |
no outgoing calls
no test coverage detected