set_utils.hpp

Go to the documentation of this file.

#pragma once

#include <algorithm>
#include <iterator>
#include <set>

namespace cras
{

template<typename T>
bool isSetIntersectionEmpty(const ::std::set<T>& set1, const ::std::set<T>& set2)
{
  ::std::set<T> tmpSet;
  ::std::set_intersection(
      set1.begin(), set1.end(),
      set2.begin(), set2.end(),
      ::std::inserter(tmpSet, tmpSet.end()));
  return tmpSet.empty();
}

}