Lines Matching defs:in
5 * you may not use this file except in compliance with the License.
10 * Unless required by applicable law or agreed to in writing, software
74 void separate_rects(const std::vector<Rect<TNum>> &in,
78 // The sweep stops at each vertical edge of each input rectangle in sorted
79 // order of x-coordinate. At each stop, the sweep line is examined in order of
83 // that set is recorded in along with the the y-coordinate it happened at in a
88 if (in.size() > IdSet<TId>::max_elements) {
109 for (TId i = 0; i < in.size(); i++) {
110 const Rect<TNum> &rect = in[i];
132 const Rect<TNum> &rect = in[h_evt.rect_id];
230 // already started rectangle, but the set of rectangle IDs differs. In that
232 // will not be marked as seen ("true" in the std::pair) and will get ended
243 // of rectangles applies is bounded at the bottom by the next (in the
261 // event's x-coordinate. We are interested in continuing the started
284 /* inc in body */) {
300 // Remember this for loop has no built in increment step. We do it here.
307 void separate_frects_64(const std::vector<Rect<float>> &in,
309 separate_rects(in, out);
312 void separate_rects_64(const std::vector<Rect<int>> &in,
314 separate_rects(in, out);
330 std::vector<Rect> in;
334 in.push_back({0, 0, 4, 5});
335 in.push_back({2, 0, 6, 6});
336 in.push_back({4, 0, 8, 5});
337 in.push_back({0, 7, 8, 9});
339 in.push_back({10, 0, 18, 5});
340 in.push_back({12, 0, 16, 5});
342 in.push_back({20, 11, 24, 17});
343 in.push_back({22, 13, 26, 21});
344 in.push_back({32, 33, 36, 37});
345 in.push_back({30, 31, 38, 39});
347 in.push_back({40, 43, 48, 45});
348 in.push_back({44, 41, 46, 47});
350 in.push_back({50, 51, 52, 53});
351 in.push_back({50, 51, 52, 53});
352 in.push_back({50, 51, 52, 53});
354 in.push_back({0, 0, 0, 10});
355 in.push_back({0, 0, 10, 0});
356 in.push_back({10, 0, 0, 10});
357 in.push_back({0, 10, 10, 0});
361 separate_rects(in, &out);
