50 lines
1.8 KiB
C++
50 lines
1.8 KiB
C++
// Copyright (c) 2006-2013 INRIA Nancy-Grand Est (France). All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org)
|
|
//
|
|
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Algebraic_kernel_d/include/CGAL/RS/polynomial_converter_1.h $
|
|
// $Id: polynomial_converter_1.h 52164b1 2019-10-19T15:34:59+02:00 Sébastien Loriot
|
|
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
|
|
//
|
|
// Author: Luis Peñaranda <luis.penaranda@gmx.com>
|
|
|
|
#ifndef CGAL_RS_POLYNOMIAL_CONVERTER_1_H
|
|
#define CGAL_RS_POLYNOMIAL_CONVERTER_1_H
|
|
|
|
namespace CGAL{
|
|
namespace RS_AK1{
|
|
|
|
template <class InputPolynomial_,class OutputPolynomial_>
|
|
struct Polynomial_converter_1:
|
|
public CGAL::cpp98::unary_function<InputPolynomial_,OutputPolynomial_>{
|
|
typedef InputPolynomial_ InpPolynomial_1;
|
|
typedef OutputPolynomial_ OutPolynomial_1;
|
|
OutPolynomial_1 operator()(const InpPolynomial_1&)const;
|
|
}; // class Polynomial_converter_1
|
|
|
|
template <>
|
|
Polynomial<Gmpz>
|
|
Polynomial_converter_1<Polynomial<Gmpq>,Polynomial<Gmpz> >::operator()(
|
|
const Polynomial<Gmpq> &p)const{
|
|
std::vector<Gmpz> outcoeffs;
|
|
unsigned degree=p.degree();
|
|
mpz_t lcm;
|
|
mpz_init(lcm);
|
|
mpz_lcm(lcm,mpq_denref(p[0].mpq()),mpq_denref(p[degree].mpq()));
|
|
for(unsigned i=1;i<degree;++i)
|
|
mpz_lcm(lcm,lcm,mpq_denref(p[i].mpq()));
|
|
for(unsigned i=0;i<=degree;++i){
|
|
Gmpz c;
|
|
mpz_divexact(c.mpz(),lcm,mpq_denref(p[i].mpq()));
|
|
mpz_mul(c.mpz(),c.mpz(),mpq_numref(p[i].mpq()));
|
|
outcoeffs.push_back(c);
|
|
}
|
|
mpz_clear(lcm);
|
|
return Polynomial<Gmpz>(outcoeffs.begin(),outcoeffs.end());
|
|
}
|
|
|
|
} // namespace RS_AK1
|
|
} // namespace CGAL
|
|
|
|
#endif // CGAL_RS_POLYNOMIAL_CONVERTER_1_H
|