include/cln/univpoly_rational.h

0001 // Univariate Polynomials over the rational numbers.
0002
0003 #ifndef _CL_UNIVPOLY_RATIONAL_H
0004 #define _CL_UNIVPOLY_RATIONAL_H
0005
0006 #include "cln/ring.h"
0007 #include "cln/univpoly.h"
0008 #include "cln/number.h"
0009 #include "cln/rational_class.h"
0010 #include "cln/integer_class.h"
0011 #include "cln/rational_ring.h"
0012
0013 namespace cln {
0014
0015 // Normal univariate polynomials with stricter static typing:
0016 // `cl_RA' instead of `cl_ring_element'.
0017
0018 #ifdef notyet
0019
0020 typedef cl_UP_specialized<cl_RA> cl_UP_RA;
0021 typedef cl_univpoly_specialized_ring<cl_RA> cl_univpoly_rational_ring;
0022 //typedef cl_heap_univpoly_specialized_ring<cl_RA> cl_heap_univpoly_rational_ring;
0023
0024 #else
0025
0026 class cl_heap_univpoly_rational_ring;
0027
0028 class cl_univpoly_rational_ring : public cl_univpoly_ring {
0029 public:
0030     // Default constructor.
0031     cl_univpoly_rational_ring () : cl_univpoly_ring () {}
0032     // Copy constructor.
0033     cl_univpoly_rational_ring (const cl_univpoly_rational_ring&);
0034     // Assignment operator.
0035     cl_univpoly_rational_ring& operator= (const cl_univpoly_rational_ring&);
0036     // Automatic dereferencing.
0037     cl_heap_univpoly_rational_ring* operator-> () const
0038     { return (cl_heap_univpoly_rational_ring*)heappointer; }
0039 };
0040 // Copy constructor and assignment operator.
0041 CL_DEFINE_COPY_CONSTRUCTOR2(cl_univpoly_rational_ring,cl_univpoly_ring)
0042 CL_DEFINE_ASSIGNMENT_OPERATOR(cl_univpoly_rational_ring,cl_univpoly_rational_ring)
0043
0044 class cl_UP_RA : public cl_UP {
0045 public:
0046     const cl_univpoly_rational_ring& ring () const { return The(cl_univpoly_rational_ring)(_ring); }
0047     // Conversion.
0048     CL_DEFINE_CONVERTER(cl_ring_element)
0049     // Destructive modification.
0050     void set_coeff (uintL index, const cl_RA& y);
0051     void finalize();
0052     // Evaluation.
0053     const cl_RA operator() (const cl_RA& y) const;
0054 public: // Ability to place an object at a given address.
0055     void* operator new (size_t size) { return malloc_hook(size); }
0056     void* operator new (size_t size, void* ptr) { (void)size; return ptr; }
0057     void operator delete (void* ptr) { free_hook(ptr); }
0058 };
0059
0060 class cl_heap_univpoly_rational_ring : public cl_heap_univpoly_ring {
0061     SUBCLASS_cl_heap_univpoly_ring()
0062     // High-level operations.
0063     void fprint (std::ostream& stream, const cl_UP_RA& x)
0064     {
0065         cl_heap_univpoly_ring::fprint(stream,x);
0066     }
0067     bool equal (const cl_UP_RA& x, const cl_UP_RA& y)
0068     {
0069         return cl_heap_univpoly_ring::equal(x,y);
0070     }
0071     const cl_UP_RA zero ()
0072     {
0073         return The2(cl_UP_RA)(cl_heap_univpoly_ring::zero());
0074     }
0075     bool zerop (const cl_UP_RA& x)
0076     {
0077         return cl_heap_univpoly_ring::zerop(x);
0078     }
0079     const cl_UP_RA plus (const cl_UP_RA& x, const cl_UP_RA& y)
0080     {
0081         return The2(cl_UP_RA)(cl_heap_univpoly_ring::plus(x,y));
0082     }
0083     const cl_UP_RA minus (const cl_UP_RA& x, const cl_UP_RA& y)
0084     {
0085         return The2(cl_UP_RA)(cl_heap_univpoly_ring::minus(x,y));
0086     }
0087     const cl_UP_RA uminus (const cl_UP_RA& x)
0088     {
0089         return The2(cl_UP_RA)(cl_heap_univpoly_ring::uminus(x));
0090     }
0091     const cl_UP_RA one ()
0092     {
0093         return The2(cl_UP_RA)(cl_heap_univpoly_ring::one());
0094     }
0095     const cl_UP_RA canonhom (const cl_I& x)
0096     {
0097         return The2(cl_UP_RA)(cl_heap_univpoly_ring::canonhom(x));
0098     }
0099     const cl_UP_RA mul (const cl_UP_RA& x, const cl_UP_RA& y)
0100     {
0101         return The2(cl_UP_RA)(cl_heap_univpoly_ring::mul(x,y));
0102     }
0103     const cl_UP_RA square (const cl_UP_RA& x)
0104     {
0105         return The2(cl_UP_RA)(cl_heap_univpoly_ring::square(x));
0106     }
0107     const cl_UP_RA expt_pos (const cl_UP_RA& x, const cl_I& y)
0108     {
0109         return The2(cl_UP_RA)(cl_heap_univpoly_ring::expt_pos(x,y));
0110     }
0111     const cl_UP_RA scalmul (const cl_RA& x, const cl_UP_RA& y)
0112     {
0113         return The2(cl_UP_RA)(cl_heap_univpoly_ring::scalmul(cl_ring_element(cl_RA_ring,x),y));
0114     }
0115     sintL degree (const cl_UP_RA& x)
0116     {
0117         return cl_heap_univpoly_ring::degree(x);
0118     }
0119     sintL ldegree (const cl_UP_RA& x)
0120     {
0121         return cl_heap_univpoly_ring::ldegree(x);
0122     }
0123     const cl_UP_RA monomial (const cl_RA& x, uintL e)
0124     {
0125         return The2(cl_UP_RA)(cl_heap_univpoly_ring::monomial(cl_ring_element(cl_RA_ring,x),e));
0126     }
0127     const cl_RA coeff (const cl_UP_RA& x, uintL index)
0128     {
0129         return The(cl_RA)(cl_heap_univpoly_ring::coeff(x,index));
0130     }
0131     const cl_UP_RA create (sintL deg)
0132     {
0133         return The2(cl_UP_RA)(cl_heap_univpoly_ring::create(deg));
0134     }
0135     void set_coeff (cl_UP_RA& x, uintL index, const cl_RA& y)
0136     {
0137         cl_heap_univpoly_ring::set_coeff(x,index,cl_ring_element(cl_RA_ring,y));
0138     }
0139     void finalize (cl_UP_RA& x)
0140     {
0141         cl_heap_univpoly_ring::finalize(x);
0142     }
0143     const cl_RA eval (const cl_UP_RA& x, const cl_RA& y)
0144     {
0145         return The(cl_RA)(cl_heap_univpoly_ring::eval(x,cl_ring_element(cl_RA_ring,y)));
0146     }
0147 private:
0148     // No need for any constructors.
0149     cl_heap_univpoly_rational_ring ();
0150 };
0151
0152 // Lookup of polynomial rings.
0153 inline const cl_univpoly_rational_ring find_univpoly_ring (const cl_rational_ring& r)
0154 { return The(cl_univpoly_rational_ring) (find_univpoly_ring((const cl_ring&)r)); }
0155 inline const cl_univpoly_rational_ring find_univpoly_ring (const cl_rational_ring& r, const cl_symbol& varname)
0156 { return The(cl_univpoly_rational_ring) (find_univpoly_ring((const cl_ring&)r,varname)); }
0157
0158 // Operations on polynomials.
0159
0160 // Add.
0161 inline const cl_UP_RA operator+ (const cl_UP_RA& x, const cl_UP_RA& y)
0162     { return x.ring()->plus(x,y); }
0163
0164 // Negate.
0165 inline const cl_UP_RA operator- (const cl_UP_RA& x)
0166     { return x.ring()->uminus(x); }
0167
0168 // Subtract.
0169 inline const cl_UP_RA operator- (const cl_UP_RA& x, const cl_UP_RA& y)
0170     { return x.ring()->minus(x,y); }
0171
0172 // Multiply.
0173 inline const cl_UP_RA operator* (const cl_UP_RA& x, const cl_UP_RA& y)
0174     { return x.ring()->mul(x,y); }
0175
0176 // Squaring.
0177 inline const cl_UP_RA square (const cl_UP_RA& x)
0178     { return x.ring()->square(x); }
0179
0180 // Exponentiation x^y, where y > 0.
0181 inline const cl_UP_RA expt_pos (const cl_UP_RA& x, const cl_I& y)
0182     { return x.ring()->expt_pos(x,y); }
0183
0184 // Scalar multiplication.
0185 #if 0 // less efficient
0186 inline const cl_UP_RA operator* (const cl_I& x, const cl_UP_RA& y)
0187     { return y.ring()->mul(y.ring()->canonhom(x),y); }
0188 inline const cl_UP_RA operator* (const cl_UP_RA& x, const cl_I& y)
0189     { return x.ring()->mul(x.ring()->canonhom(y),x); }
0190 #endif
0191 inline const cl_UP_RA operator* (const cl_I& x, const cl_UP_RA& y)
0192     { return y.ring()->scalmul(x,y); }
0193 inline const cl_UP_RA operator* (const cl_UP_RA& x, const cl_I& y)
0194     { return x.ring()->scalmul(y,x); }
0195 inline const cl_UP_RA operator* (const cl_RA& x, const cl_UP_RA& y)
0196     { return y.ring()->scalmul(x,y); }
0197 inline const cl_UP_RA operator* (const cl_UP_RA& x, const cl_RA& y)
0198     { return x.ring()->scalmul(y,x); }
0199
0200 // Coefficient.
0201 inline const cl_RA coeff (const cl_UP_RA& x, uintL index)
0202     { return x.ring()->coeff(x,index); }
0203
0204 // Destructive modification.
0205 inline void set_coeff (cl_UP_RA& x, uintL index, const cl_RA& y)
0206     { x.ring()->set_coeff(x,index,y); }
0207 inline void finalize (cl_UP_RA& x)
0208     { x.ring()->finalize(x); }
0209 inline void cl_UP_RA::set_coeff (uintL index, const cl_RA& y)
0210     { ring()->set_coeff(*this,index,y); }
0211 inline void cl_UP_RA::finalize ()
0212     { ring()->finalize(*this); }
0213
0214 // Evaluation. (No extension of the base ring allowed here for now.)
0215 inline const cl_RA cl_UP_RA::operator() (const cl_RA& y) const
0216 {
0217     return ring()->eval(*this,y);
0218 }
0219
0220 // Derivative.
0221 inline const cl_UP_RA deriv (const cl_UP_RA& x)
0222     { return The2(cl_UP_RA)(deriv((const cl_UP&)x)); }
0223
0224 #endif
0225
0226
0227 // Returns the n-th Legendre polynomial (n >= 0).
0228 extern const cl_UP_RA legendre (sintL n);
0229
0230 }  // namespace cln
0231
0232 #endif /* _CL_UNIVPOLY_RATIONAL_H */