Merge technique
(Mylib/Misc/merge_technique.cpp)

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00

Operations

Requirements

Notes

Problems

References

Verified with

• test/aoj/2559/main.binomial_heap.test.cpp
• test/aoj/2559/main.leftist_heap.test.cpp
• test/aoj/2559/main.pairing_heap.test.cpp
• test/aoj/2559/main.skew_heap.test.cpp

Code

#pragma once
#include <set>
#include <utility>

namespace haar_lib {
  template <typename T>
  void merge_technique(std::set<T> &res, std::set<T> &a, std::set<T> &b) {
    if (a.size() > b.size()) {
      a.insert(b.begin(), b.end());
      std::swap(res, a);
    } else {
      b.insert(a.begin(), a.end());
      std::swap(res, b);
    }
  }
}  // namespace haar_lib

#line 2 "Mylib/Misc/merge_technique.cpp"
#include <set>
#include <utility>

namespace haar_lib {
  template <typename T>
  void merge_technique(std::set<T> &res, std::set<T> &a, std::set<T> &b) {
    if (a.size() > b.size()) {
      a.insert(b.begin(), b.end());
      std::swap(res, a);
    } else {
      b.insert(a.begin(), a.end());
      std::swap(res, b);
    }
  }
}  // namespace haar_lib

Back to top page