/cln-1.3.2/include/cln/univpoly_complex.h
C Header | 228 lines | 174 code | 27 blank | 27 comment | 0 complexity | a29267782ebf5088e80f83dfe992dcb2 MD5 | raw file
Possible License(s): GPL-2.0
- // Univariate Polynomials over the complex numbers.
- #ifndef _CL_UNIVPOLY_COMPLEX_H
- #define _CL_UNIVPOLY_COMPLEX_H
- #include "cln/ring.h"
- #include "cln/univpoly.h"
- #include "cln/number.h"
- #include "cln/complex_class.h"
- #include "cln/integer_class.h"
- #include "cln/complex_ring.h"
- namespace cln {
- // Normal univariate polynomials with stricter static typing:
- // `cl_N' instead of `cl_ring_element'.
- #ifdef notyet
- typedef cl_UP_specialized<cl_N> cl_UP_N;
- typedef cl_univpoly_specialized_ring<cl_N> cl_univpoly_complex_ring;
- //typedef cl_heap_univpoly_specialized_ring<cl_N> cl_heap_univpoly_complex_ring;
- #else
- class cl_heap_univpoly_complex_ring;
- class cl_univpoly_complex_ring : public cl_univpoly_ring {
- public:
- // Default constructor.
- cl_univpoly_complex_ring () : cl_univpoly_ring () {}
- // Copy constructor.
- cl_univpoly_complex_ring (const cl_univpoly_complex_ring&);
- // Assignment operator.
- cl_univpoly_complex_ring& operator= (const cl_univpoly_complex_ring&);
- // Automatic dereferencing.
- cl_heap_univpoly_complex_ring* operator-> () const
- { return (cl_heap_univpoly_complex_ring*)heappointer; }
- };
- // Copy constructor and assignment operator.
- CL_DEFINE_COPY_CONSTRUCTOR2(cl_univpoly_complex_ring,cl_univpoly_ring)
- CL_DEFINE_ASSIGNMENT_OPERATOR(cl_univpoly_complex_ring,cl_univpoly_complex_ring)
- class cl_UP_N : public cl_UP {
- public:
- const cl_univpoly_complex_ring& ring () const { return The(cl_univpoly_complex_ring)(_ring); }
- // Conversion.
- CL_DEFINE_CONVERTER(cl_ring_element)
- // Destructive modification.
- void set_coeff (uintL index, const cl_N& y);
- void finalize();
- // Evaluation.
- const cl_N operator() (const cl_N& y) const;
- public: // Ability to place an object at a given address.
- void* operator new (size_t size) { return malloc_hook(size); }
- void* operator new (size_t size, void* ptr) { (void)size; return ptr; }
- void operator delete (void* ptr) { free_hook(ptr); }
- };
- class cl_heap_univpoly_complex_ring : public cl_heap_univpoly_ring {
- SUBCLASS_cl_heap_univpoly_ring()
- // High-level operations.
- void fprint (std::ostream& stream, const cl_UP_N& x)
- {
- cl_heap_univpoly_ring::fprint(stream,x);
- }
- bool equal (const cl_UP_N& x, const cl_UP_N& y)
- {
- return cl_heap_univpoly_ring::equal(x,y);
- }
- const cl_UP_N zero ()
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::zero());
- }
- bool zerop (const cl_UP_N& x)
- {
- return cl_heap_univpoly_ring::zerop(x);
- }
- const cl_UP_N plus (const cl_UP_N& x, const cl_UP_N& y)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::plus(x,y));
- }
- const cl_UP_N minus (const cl_UP_N& x, const cl_UP_N& y)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::minus(x,y));
- }
- const cl_UP_N uminus (const cl_UP_N& x)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::uminus(x));
- }
- const cl_UP_N one ()
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::one());
- }
- const cl_UP_N canonhom (const cl_I& x)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::canonhom(x));
- }
- const cl_UP_N mul (const cl_UP_N& x, const cl_UP_N& y)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::mul(x,y));
- }
- const cl_UP_N square (const cl_UP_N& x)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::square(x));
- }
- const cl_UP_N expt_pos (const cl_UP_N& x, const cl_I& y)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::expt_pos(x,y));
- }
- const cl_UP_N scalmul (const cl_N& x, const cl_UP_N& y)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::scalmul(cl_ring_element(cl_C_ring,x),y));
- }
- sintL degree (const cl_UP_N& x)
- {
- return cl_heap_univpoly_ring::degree(x);
- }
- sintL ldegree (const cl_UP_N& x)
- {
- return cl_heap_univpoly_ring::ldegree(x);
- }
- const cl_UP_N monomial (const cl_N& x, uintL e)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::monomial(cl_ring_element(cl_C_ring,x),e));
- }
- const cl_N coeff (const cl_UP_N& x, uintL index)
- {
- return The(cl_N)(cl_heap_univpoly_ring::coeff(x,index));
- }
- const cl_UP_N create (sintL deg)
- {
- return The2(cl_UP_N)(cl_heap_univpoly_ring::create(deg));
- }
- void set_coeff (cl_UP_N& x, uintL index, const cl_N& y)
- {
- cl_heap_univpoly_ring::set_coeff(x,index,cl_ring_element(cl_C_ring,y));
- }
- void finalize (cl_UP_N& x)
- {
- cl_heap_univpoly_ring::finalize(x);
- }
- const cl_N eval (const cl_UP_N& x, const cl_N& y)
- {
- return The(cl_N)(cl_heap_univpoly_ring::eval(x,cl_ring_element(cl_C_ring,y)));
- }
- private:
- // No need for any constructors.
- cl_heap_univpoly_complex_ring ();
- };
- // Lookup of polynomial rings.
- inline const cl_univpoly_complex_ring find_univpoly_ring (const cl_complex_ring& r)
- { return The(cl_univpoly_complex_ring) (find_univpoly_ring((const cl_ring&)r)); }
- inline const cl_univpoly_complex_ring find_univpoly_ring (const cl_complex_ring& r, const cl_symbol& varname)
- { return The(cl_univpoly_complex_ring) (find_univpoly_ring((const cl_ring&)r,varname)); }
- // Operations on polynomials.
- // Add.
- inline const cl_UP_N operator+ (const cl_UP_N& x, const cl_UP_N& y)
- { return x.ring()->plus(x,y); }
- // Negate.
- inline const cl_UP_N operator- (const cl_UP_N& x)
- { return x.ring()->uminus(x); }
- // Subtract.
- inline const cl_UP_N operator- (const cl_UP_N& x, const cl_UP_N& y)
- { return x.ring()->minus(x,y); }
- // Multiply.
- inline const cl_UP_N operator* (const cl_UP_N& x, const cl_UP_N& y)
- { return x.ring()->mul(x,y); }
- // Squaring.
- inline const cl_UP_N square (const cl_UP_N& x)
- { return x.ring()->square(x); }
- // Exponentiation x^y, where y > 0.
- inline const cl_UP_N expt_pos (const cl_UP_N& x, const cl_I& y)
- { return x.ring()->expt_pos(x,y); }
- // Scalar multiplication.
- #if 0 // less efficient
- inline const cl_UP_N operator* (const cl_I& x, const cl_UP_N& y)
- { return y.ring()->mul(y.ring()->canonhom(x),y); }
- inline const cl_UP_N operator* (const cl_UP_N& x, const cl_I& y)
- { return x.ring()->mul(x.ring()->canonhom(y),x); }
- #endif
- inline const cl_UP_N operator* (const cl_I& x, const cl_UP_N& y)
- { return y.ring()->scalmul(x,y); }
- inline const cl_UP_N operator* (const cl_UP_N& x, const cl_I& y)
- { return x.ring()->scalmul(y,x); }
- inline const cl_UP_N operator* (const cl_N& x, const cl_UP_N& y)
- { return y.ring()->scalmul(x,y); }
- inline const cl_UP_N operator* (const cl_UP_N& x, const cl_N& y)
- { return x.ring()->scalmul(y,x); }
- // Coefficient.
- inline const cl_N coeff (const cl_UP_N& x, uintL index)
- { return x.ring()->coeff(x,index); }
- // Destructive modification.
- inline void set_coeff (cl_UP_N& x, uintL index, const cl_N& y)
- { x.ring()->set_coeff(x,index,y); }
- inline void finalize (cl_UP_N& x)
- { x.ring()->finalize(x); }
- inline void cl_UP_N::set_coeff (uintL index, const cl_N& y)
- { ring()->set_coeff(*this,index,y); }
- inline void cl_UP_N::finalize ()
- { ring()->finalize(*this); }
- // Evaluation. (No extension of the base ring allowed here for now.)
- inline const cl_N cl_UP_N::operator() (const cl_N& y) const
- {
- return ring()->eval(*this,y);
- }
- // Derivative.
- inline const cl_UP_N deriv (const cl_UP_N& x)
- { return The2(cl_UP_N)(deriv((const cl_UP&)x)); }
- #endif
- } // namespace cln
- #endif /* _CL_UNIVPOLY_COMPLEX_H */