Searched refs:Degree (Results 1 - 4 of 4) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/
H A Dgf2n.h101 //! number of significant bits = Degree() + 1
114 signed int Degree() const {return BitCount()-1;} function in class:PolynomialMod2
247 {return a.Degree() > b.Degree();}
250 {return a.Degree() >= b.Degree();}
253 {return a.Degree() < b.Degree();}
256 {return a.Degree() <= b.Degree();}
[all...]
H A Dpolynomi.h87 int Degree(const Ring &ring) const {return int(CoefficientCount(ring))-1;} function in class:PolynomialOver
209 int Degree() const {return B::Degree(ms_fixedRing);} function in class:PolynomialOverFixedRing
411 {return a.Degree() > b.Degree();}
415 {return a.Degree() >= b.Degree();}
419 {return a.Degree() < b.Degree();}
423 {return a.Degree() <
[all...]
H A Dpolynomi.cpp134 int degree = Degree(ring);
327 return Degree(ring)==0 ? ring.MultiplicativeInverse(m_coefficients[0]) : ring.Identity();
333 return Degree(ring)==0 && ring.IsUnit(m_coefficients[0]);
433 const int dDegree = d.Degree(ring);
H A Dgf2n.cpp253 for (int i=b.Degree(); i>=0; i--)
288 int degree = divisor.Degree();
295 for (int i=dividend.Degree(); i>=0; i--)
518 signed int d = Degree();
535 : QuotientRing<EuclideanDomainOf<PolynomialMod2> >(EuclideanDomainOf<PolynomialMod2>(), modulus), m(modulus.Degree())

Completed in 68 milliseconds