set.hh

Go to the documentation of this file.

#pragma once

#include <algorithm> // set_intersection
#include <set>

#include <vcsn/misc/attributes.hh>
#include <vcsn/misc/functional.hh>

namespace std
{

  /*---------------.
  | hash(set<T>).  |
  `---------------*/

  template <typename T, typename Compare, typename Alloc>
  struct hash<set<T, Compare, Alloc>>
  {
    using type = set<T, Compare, Alloc>;
    size_t operator()(const type& ss) const
    {
      size_t res = 0;
      for (const auto& s: ss)
        hash_combine(res, s);
      return res;
    }
  };
}

namespace vcsn
{
  template <typename T, typename Compare, typename Alloc>
  std::set<T, Compare, Alloc>
  set_difference(const std::set<T, Compare, Alloc>& set1,
                 const std::set<T, Compare, Alloc>& set2)
  {
    using set_t = std::set<T, Compare, Alloc>;
    set_t res;
    std::insert_iterator<set_t> i{res, begin(res)};
    std::set_difference(begin(set1), end(set1),
                        begin(set2), end(set2),
                        i);
    return res;
  }

  template <typename T, typename Compare, typename Alloc>
  bool
  has(const std::set<T, Compare, Alloc>& s, const T& e)
    ATTRIBUTE_PURE;

  template <typename T, typename Compare, typename Alloc>
  std::set<T, Compare, Alloc>
  intersection(const std::set<T, Compare, Alloc>& set1,
               const std::set<T, Compare, Alloc>& set2);

  template <typename T, typename Compare, typename Alloc>
  std::set<std::set<T, Compare, Alloc>>
  intersection_closure(std::set<std::set<T, Compare, Alloc>> pset);

  template <typename T, typename Compare, typename Alloc>
  std::set<T, Compare, Alloc>
  get_union(const std::set<T, Compare, Alloc>& set1,
            const std::set<T, Compare, Alloc>& set2);

  template <typename T, typename Compare, typename Alloc>
  std::ostream&
  print(const std::set<T, Compare, Alloc>& set, std::ostream& o);

  template <typename Container>
  bool subset(const Container& set1, const Container& set2)
  ATTRIBUTE_PURE;
}

#include <vcsn/misc/set.hxx>