138 auto inXCandid = {32, 256, 512};
139 auto inYCandid = {32, 256, 512, 513};
140 auto patchXCandid = {5, 64, 367, 512};
141 auto patchYCandid = {5, 64, 367, 512};
142 auto borderXCandid = {0, 5};
143 auto borderYCandid = {0, 5};
144 auto overlapCandid = {0.f, 0.2f, 0.9f};
147 for (
auto inX : inXCandid) {
148 for (
auto inY : inYCandid) {
149 for (
auto patchX : patchXCandid) {
150 if (patchX > inX)
continue;
151 for (
auto patchY : patchYCandid) {
152 if (patchY > inY)
continue;
153 for (
auto borderX : borderXCandid) {
154 if (patchX + 2 * borderX > inX)
continue;
155 for (
auto borderY : borderYCandid) {
156 if (patchY + 2 * borderY > inY)
continue;
157 counter = (counter + 1) % overlapCandid.size();
162 *(overlapCandid.begin() + counter));
void test_window(const std::pair< size_t, size_t > &borders, const Dimensions µgraph, const Dimensions &patch, float overlap)