sparse_les.cxx

#include "sparse_les.h"
#include <string>
 
namespace cgv {
    namespace math {
 
sparse_les_factory::~sparse_les_factory()
{
}
 
std::vector<sparse_les_factory_ptr>& ref_solver_factories()
{
    static std::vector<sparse_les_factory_ptr> facs;
    return facs;
}
 
void sparse_les::register_solver_factory(sparse_les_factory_ptr sls_fac)
{
    ref_solver_factories().push_back(sls_fac);
}
const std::vector<sparse_les_factory_ptr>& sparse_les::get_solver_factories()
{
    return ref_solver_factories();
}
 
sparse_les_ptr sparse_les::create_by_name(const std::string& solver_name, int n, int nr_rhs, int nr_nze)
{
    std::vector<sparse_les_factory_ptr>& F = ref_solver_factories();
    for (std::vector<sparse_les_factory_ptr>::const_iterator fi = F.begin(); fi != F.end(); ++fi) {
        if ((*fi)->get_solver_name() == solver_name)
            return (*fi)->create(n, nr_rhs, nr_nze);
    }
    return sparse_les_ptr();
}
 
sparse_les_ptr sparse_les::create_by_cap(SparseLesCaps caps, int n, int nr_rhs, int nr_nze)
{
    std::vector<sparse_les_factory_ptr>& F = ref_solver_factories();
    for (std::vector<sparse_les_factory_ptr>::const_iterator fi = F.begin(); fi != F.end(); ++fi) {
        if (((*fi)->get_caps() & caps) == caps)
            return (*fi)->create(n, nr_rhs, nr_nze);
    }
    return sparse_les_ptr();
}
 
void sparse_les::set_b_entry(int i, double val)
{
    set_b_entry(i,0,val);
}
double& sparse_les::ref_b_entry(int i)
{
    return ref_b_entry(i, 0);
}
double sparse_les::get_x_entry(int i) const
{
    return get_x_entry(i,0);
}
 
    }
}