domain.cpp

//
// Created by RainSure on 2024/2/18.
//
 
#include "preconditioner/domain.h"
#include "Eigen/Core"
#include "common/zip_sort.h"
#include <algorithm>
#include <iterator>
 
namespace rsmesh::preconditioner {
    index_t domain::size() const { return static_cast<index_t>(point_indices.size()); }
 
    index_t domain::grad_size() const { return static_cast<index_t>(grad_point_indices.size()); }
 
    index_t domain::mixed_size() const { return size() + grad_size(); }
 
    void domain::merge_poly_points(const std::vector<index_t>& poly_point_idcs) {
        common::zip_sort(point_indices.begin(), point_indices.end(), inner_point.begin(),
                         inner_point.end(),
                         [](const auto& a, const auto& b) { return a.first < b.first; });
 
        auto n_poly_points = static_cast<index_t>(poly_point_idcs.size());
        std::vector<index_t> new_point_indices(poly_point_idcs);
        std::vector<bool> new_inner_point(n_poly_points);
 
        for (index_t i = 0; i < n_poly_points; i++) {
            auto idx = poly_point_idcs.at(i);
            auto it = std::lower_bound(point_indices.begin(), point_indices.end(), idx);
            if (it == point_indices.end() || *it != idx) {
                continue;
            }
 
            auto it_inner = inner_point.begin() + std::distance(point_indices.begin(), it);
            new_inner_point.at(i) = *it_inner;
 
            point_indices.erase(it);
            inner_point.erase(it_inner);
        }
 
        new_point_indices.insert(new_point_indices.end(), point_indices.begin(), point_indices.end());
        new_inner_point.insert(new_inner_point.end(), inner_point.begin(), inner_point.end());
 
        point_indices = new_point_indices;
        inner_point = new_inner_point;
    }
}