| 194 | |
| 195 | namespace { |
| 196 | std::string intersect(std::set<std::string> const& s1, |
| 197 | std::set<std::string> const& s2) |
| 198 | { |
| 199 | std::set<std::string> intersect; |
| 200 | std::set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), |
| 201 | std::inserter(intersect, intersect.begin())); |
| 202 | if (!intersect.empty()) { |
| 203 | return *intersect.begin(); |
| 204 | } |
| 205 | return ""; |
| 206 | } |
| 207 | |
| 208 | std::string intersect(std::set<std::string> const& s1, |
| 209 | std::set<std::string> const& s2, |
no test coverage detected
searching dependent graphs…