A wrapper around std::set_intersection; copying is intended
| 10 | |
| 11 | /// A wrapper around std::set_intersection; copying is intended |
| 12 | static vector<Label> set_intersect(vector<Label> v1, vector<Label> v2) |
| 13 | { |
| 14 | /// set_intersection requires the resulting set to be |
| 15 | /// at least as large as the smallest of the two sets |
| 16 | vector<Label> res(std::min(v1.size(), v2.size())); |
| 17 | |
| 18 | std::sort(begin(v1), end(v1)); |
| 19 | std::sort(begin(v2), end(v2)); |
| 20 | |
| 21 | auto it = std::set_intersection(begin(v1), end(v1), begin(v2), end(v2), |
| 22 | begin(res)); |
| 23 | res.resize(it - begin(res)); |
| 24 | |
| 25 | return res; |
| 26 | } |
| 27 | |
| 28 | /// A wrapper around std::set_symemtric_diff; copying is intended |
| 29 | static vector<Label> set_symmetric_diff(vector<Label> v1, vector<Label> v2) |
no test coverage detected