| 54 | } |
| 55 | |
| 56 | static bool test_rect_compaction() |
| 57 | { |
| 58 | std::set<Rect<int>> rect_set; |
| 59 | |
| 60 | if (!test_one_rect_compaction(rect_set, 0, false)) |
| 61 | { |
| 62 | LogError("zero-sized set failed"); |
| 63 | return false; |
| 64 | } |
| 65 | rect_set.clear(); |
| 66 | rect_set.insert(Rect<int>{{0, 0}, {1, 1}}); |
| 67 | if (!test_one_rect_compaction(rect_set, 1, false)) |
| 68 | { |
| 69 | LogError("one-sized set failed"); |
| 70 | return false; |
| 71 | } |
| 72 | |
| 73 | rect_set.clear(); |
| 74 | rect_set.insert(Rect<int>{{0, 0}, {1, 1}}); |
| 75 | rect_set.insert(Rect<int>{{1, 0}, {2, 1}}); |
| 76 | |
| 77 | if (!test_one_rect_compaction(rect_set, 2, true)) |
| 78 | { |
| 79 | LogError("trivial x compact set failed"); |
| 80 | return false; |
| 81 | } |
| 82 | |
| 83 | rect_set.clear(); |
| 84 | rect_set.insert(Rect<int>{{0, 0}, {1, 1}}); |
| 85 | rect_set.insert(Rect<int>{{0, 1}, {1, 2}}); |
| 86 | |
| 87 | if (!test_one_rect_compaction(rect_set, 2, true)) |
| 88 | { |
| 89 | LogError("trivial y compact set failed"); |
| 90 | return false; |
| 91 | } |
| 92 | |
| 93 | rect_set.clear(); |
| 94 | rect_set.insert(Rect<int>{{0, 0}, {1, 1}}); |
| 95 | rect_set.insert(Rect<int>{{1, 1}, {2, 2}}); |
| 96 | |
| 97 | if (!test_one_rect_compaction(rect_set, 2, false)) |
| 98 | { |
| 99 | LogError("trivial non-compactable set failed"); |
| 100 | return false; |
| 101 | } |
| 102 | |
| 103 | rect_set.clear(); |
| 104 | rect_set.insert(Rect<int>{{0, 0}, {1, 1}}); |
| 105 | rect_set.insert(Rect<int>{{1, 1}, {2, 2}}); |
| 106 | |
| 107 | if (!test_one_rect_compaction(rect_set, 2, false)) |
| 108 | { |
| 109 | LogError("trivial non-compactable set failed"); |
| 110 | return false; |
| 111 | } |
| 112 | |
| 113 | rect_set.clear(); |
no test coverage detected