set.hpp

Go to the documentation of this file.

#ifndef IROHA_SET_HPP
#define IROHA_SET_HPP

#include <unordered_set>

namespace iroha {
  template <typename Hasher,
            typename Collection,
            typename TargetType = typename Collection::value_type>
  auto merge_unique(Collection left, Collection right) {
    std::unordered_set<TargetType, Hasher> unique_set(left.begin(), left.end());

    unique_set.insert(right.begin(), right.end());
    return Collection(unique_set.begin(), unique_set.end());
  }

  template <typename Set, typename Merge>
  Set set_union(const Set &left, const Set &right, Merge &&merge) {
    Set out;
    out.insert(left.begin(), left.end());
    for (auto &&tx : right) {
      auto iter = out.find(tx);
      if (iter != out.end()) {
        merge(*iter, tx);
      } else {
        out.insert(tx);
      }
    }
    return out;
  }

  template <typename Set>
  Set set_difference(const Set &left, const Set &right) {
    Set out;
    for (auto &&element : left) {
      if (right.find(element) == right.end()) {
        out.insert(element);
      }
    }
    return out;
  }
}  // namespace iroha
#endif  // IROHA_SET_HPP