📄 class_polynomial_mod2.html
字号:
<tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_10" doxytag="PolynomialMod2::Equals"></a>bool </td><td class="memItemRight" valign=bottom><b>Equals</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &rhs) const</td></tr><tr><td colspan=2><br><h2>MANIPULATORS</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_0" doxytag="PolynomialMod2::operator="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_1" doxytag="PolynomialMod2::operator &="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator &=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_2" doxytag="PolynomialMod2::operator^="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator^=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_3" doxytag="PolynomialMod2::operator+="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator+=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_4" doxytag="PolynomialMod2::operator-="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator-=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_5" doxytag="PolynomialMod2::operator *="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator *=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_6" doxytag="PolynomialMod2::operator/="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator/=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_7" doxytag="PolynomialMod2::operator%="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator%=</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_8" doxytag="PolynomialMod2::operator<<="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator<<=</b> (unsigned int)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_9" doxytag="PolynomialMod2::operator>>="></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>operator>>=</b> (unsigned int)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_10" doxytag="PolynomialMod2::Randomize"></a>void </td><td class="memItemRight" valign=bottom><b>Randomize</b> (<a class="el" href="class_random_number_generator.html">RandomNumberGenerator</a> &rng, unsigned int bitcount)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_11" doxytag="PolynomialMod2::SetBit"></a>void </td><td class="memItemRight" valign=bottom><b>SetBit</b> (unsigned int i, int value=1)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_12" doxytag="PolynomialMod2::SetByte"></a>void </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z25_12">SetByte</a> (unsigned int n, byte value)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">set the n-th byte to value <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_13" doxytag="PolynomialMod2::SetCoefficient"></a>void </td><td class="memItemRight" valign=bottom><b>SetCoefficient</b> (unsigned int i, int value)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z25_14" doxytag="PolynomialMod2::swap"></a>void </td><td class="memItemRight" valign=bottom><b>swap</b> (<a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &a)</td></tr><tr><td colspan=2><br><h2>UNARY OPERATORS</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z27_0" doxytag="PolynomialMod2::operator!"></a>bool </td><td class="memItemRight" valign=bottom><b>operator!</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z27_1" doxytag="PolynomialMod2::operator+"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>operator+</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z27_2" doxytag="PolynomialMod2::operator-"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>operator-</b> () const</td></tr><tr><td colspan=2><br><h2>BINARY OPERATORS</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_0" doxytag="PolynomialMod2::And"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>And</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &b) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_1" doxytag="PolynomialMod2::Xor"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>Xor</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &b) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_2" doxytag="PolynomialMod2::Plus"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>Plus</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &b) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_3" doxytag="PolynomialMod2::Minus"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>Minus</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &b) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_4" doxytag="PolynomialMod2::Times"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>Times</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &b) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_5" doxytag="PolynomialMod2::DividedBy"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>DividedBy</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &b) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_6" doxytag="PolynomialMod2::Modulo"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>Modulo</b> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &b) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_7" doxytag="PolynomialMod2::operator>>"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>operator>></b> (unsigned int n) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z29_8" doxytag="PolynomialMod2::operator<<"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>operator<<</b> (unsigned int n) const</td></tr><tr><td colspan=2><br><h2>OTHER ARITHMETIC FUNCTIONS</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_0" doxytag="PolynomialMod2::Parity"></a>unsigned int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_0">Parity</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">sum modulo 2 of all coefficients <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_1" doxytag="PolynomialMod2::IsIrreducible"></a>bool </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_1">IsIrreducible</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">check for irreducibility <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_2" doxytag="PolynomialMod2::Doubled"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_2">Doubled</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">is always zero since we're working modulo 2 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_3" doxytag="PolynomialMod2::Squared"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><b>Squared</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_4" doxytag="PolynomialMod2::IsUnit"></a>bool </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_4">IsUnit</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">only 1 is a unit <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_5" doxytag="PolynomialMod2::MultiplicativeInverse"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_5">MultiplicativeInverse</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return inverse if *this is a unit, otherwise return 0 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_6" doxytag="PolynomialMod2::InverseMod"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_6">InverseMod</a> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &) const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">calculate multiplicative inverse of *this mod n <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_7" doxytag="PolynomialMod2::Gcd"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_7">Gcd</a> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &a, const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &n)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">greatest common divisor <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z31_8" doxytag="PolynomialMod2::Divide"></a>void </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_8">Divide</a> (<a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &r, <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &q, const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &a, const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &d)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">calculate r and q such that (a == d*q + r) && (deg(r) < deg(d)) <br><br></td></tr><tr><td colspan=2><br><h2>INPUT/OUTPUT</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z33_0" doxytag="PolynomialMod2::operator<<"></a>std::ostream & </td><td class="memItemRight" valign=bottom><b>operator<<</b> (std::ostream &out, const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &a)</td></tr><tr><td colspan=2><br><h2>Friends</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2n0" doxytag="PolynomialMod2::GF2NT"></a>class </td><td class="memItemRight" valign=bottom><a class="el" href="class_g_f2_n_t.html#_polynomial_mod2n0">GF2NT</a></td></tr>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -