songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

removed leading _ from polynomial converter

This commit is contained in:
Luis Peñaranda 2013-09-19 16:22:55 -03:00
parent 7481e18eae
commit 1f91465c32
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
Algebraic_kernel_d/include/CGAL/RS/polynomial_converter.h
View File

@ -46,18 +46,18 @@ public std::unary_function<RS_polynomial_1,RS_polynomial_1>{
// The conversions using this macro are efficient, since this construct an // The conversions using this macro are efficient, since this construct an
// RS polynomial only by copying pointers. The only implementation detail // RS polynomial only by copying pointers. The only implementation detail
// is that it should not free the occuped by the pointed coefficients. // is that it should not free the occuped by the pointed coefficients.
#define CGALRS_POLYNOMIAL_CONVERTER_REF(_T,_CONVERT) \ #define CGALRS_POLYNOMIAL_CONVERTER_REF(TYPE,CONVERT_FUNCTION) \
template<> \ template<> \
struct to_rs_poly<Polynomial<_T> >: \ struct to_rs_poly<Polynomial<TYPE> >: \
public std::unary_function<Polynomial<_T>,RS_polynomial_1>{ \ public std::unary_function<Polynomial<TYPE>,RS_polynomial_1>{ \
RS_polynomial_1& operator()(const Polynomial<_T> &p)const{ \ RS_polynomial_1& operator()(const Polynomial<TYPE> &p)const{ \
void *(*af)(size_t); \ void *(*af)(size_t); \
void *(*rf)(void*,size_t,size_t); \ void *(*rf)(void*,size_t,size_t); \
void (*ff)(void*,size_t); \ void (*ff)(void*,size_t); \
int d=p.degree(); \ int d=p.degree(); \
mpz_t* c=(mpz_t*)malloc((d+1)*sizeof(mpz_t)); \ mpz_t* c=(mpz_t*)malloc((d+1)*sizeof(mpz_t)); \
for(int i=0;i<=d;++i) \ for(int i=0;i<=d;++i) \
_CONVERT; \ CONVERT_FUNCTION; \
mp_get_memory_functions(&af,&rf,&ff); \ mp_get_memory_functions(&af,&rf,&ff); \
mp_set_memory_functions(af,rf,cgalrs_dummy_free); \ mp_set_memory_functions(af,rf,cgalrs_dummy_free); \
RS_polynomial_1 *r=new RS_polynomial_1(&c,d); \ RS_polynomial_1 *r=new RS_polynomial_1(&c,d); \
@ -69,16 +69,16 @@ public std::unary_function<RS_polynomial_1,RS_polynomial_1>{
// The conversions using this macro are not intended to be efficient, since // The conversions using this macro are not intended to be efficient, since
// there is no direct way to convert from these types to mpz_t and we need // there is no direct way to convert from these types to mpz_t and we need
// thus to create new mpz_t's. // thus to create new mpz_t's.
#define CGALRS_POLYNOMIAL_CONVERTER_COPY(_T,_CONVERT) \ #define CGALRS_POLYNOMIAL_CONVERTER_COPY(TYPE,CONVERT_FUNCTION) \
template<> \ template<> \
struct to_rs_poly<Polynomial<_T> >: \ struct to_rs_poly<Polynomial<TYPE> >: \
public std::unary_function<Polynomial<_T>,RS_polynomial_1>{ \ public std::unary_function<Polynomial<TYPE>,RS_polynomial_1>{ \
RS_polynomial_1& operator()(const Polynomial<_T> &p)const{ \ RS_polynomial_1& operator()(const Polynomial<TYPE> &p)const{ \
int d=p.degree(); \ int d=p.degree(); \
mpz_t* c=(mpz_t*)malloc((d+1)*sizeof(mpz_t)); \ mpz_t* c=(mpz_t*)malloc((d+1)*sizeof(mpz_t)); \
for(int i=0;i<=d;++i){ \ for(int i=0;i<=d;++i){ \
mpz_init(c[i]); \ mpz_init(c[i]); \
_CONVERT; \ CONVERT_FUNCTION; \
} \ } \
return *(new RS_polynomial_1(&c,d)); \ return *(new RS_polynomial_1(&c,d)); \
} \ } \