wrap_util.h

#ifndef LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_WRAP_UTIL_H
#define LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_WRAP_UTIL_H
#include <molpro/linalg/itsolv/wrap.h>
 
#include <algorithm>
#include <memory>
 
namespace molpro::linalg::itsolv {
template <typename R, typename ForwardIt>
std::vector<size_t> find_ref(const VecRef<R>& wparams, ForwardIt begin, ForwardIt end) {
  auto indices = std::vector<size_t>{};
  for (auto it = begin; it != end; ++it) {
    auto it_found = std::find_if(std::begin(wparams), std::end(wparams),
                                 [&it](const auto& w) { return std::addressof(w.get()) == std::addressof(*it); });
    if (it_found != std::end(wparams))
      indices.emplace_back(std::distance(begin, it));
  }
  return indices;
}
 
template <typename R>
std::vector<size_t> find_ref(const CVecRef<R>& wparams, const CVecRef<R>& wparams_ref) {
  auto indices = std::vector<size_t>{};
  for (auto it = wparams_ref.cbegin(); it != wparams_ref.cend(); ++it) {
    auto it_found = std::find_if(std::begin(wparams), std::end(wparams),
                                 [&it](const auto& w) { return std::addressof(w.get()) == std::addressof(it->get()); });
    if (it_found != std::end(wparams))
      indices.emplace_back(std::distance(wparams_ref.cbegin(), it));
  }
  return indices;
}
 
template <typename T, typename U>
auto remove_elements(std::vector<T> params, const std::vector<U>& indices) {
  const auto n = params.size();
  for (size_t i = 0, j = 0; i < n; ++i) {
    if (std::find(begin(indices), end(indices), i) != end(indices)) {
      params.erase(begin(params) + j);
    } else {
      ++j;
    }
  }
  return params;
}
 
} // namespace molpro::linalg::itsolv
#endif // LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_WRAP_UTIL_H