📄 class_polynomial_mod2-members.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>Crypto++: Member List</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.2 --><div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="hierarchy.html">Class Hierarchy</a> | <a class="qindex" href="classes.html">Alphabetical List</a> | <a class="qindex" href="annotated.html">Compound List</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="namespacemembers.html">Namespace Members</a> | <a class="qindex" href="functions.html">Compound Members</a> | <a class="qindex" href="globals.html">File Members</a></div><h1>PolynomialMod2 Member List</h1>This is the complete list of members for <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>, including all inherited members.<table> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_9">AllOnes</a>(unsigned n)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [static]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>And</b>(const PolynomialMod2 &b) const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_6">BERDecodeAsOctetString</a>(BufferedTransformation &bt, unsigned int length)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_0">BitCount</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_1">ByteCount</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_6">CoefficientCount</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Decode</b>(const byte *input, unsigned int inputLen) (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>Decode</b>(BufferedTransformation &bt, unsigned int inputLen) (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_5">Degree</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_5">DEREncodeAsOctetString</a>(BufferedTransformation &bt, unsigned int length) const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_8">Divide</a>(PolynomialMod2 &r, PolynomialMod2 &q, const PolynomialMod2 &a, const PolynomialMod2 &d)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [static]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>DividedBy</b>(const PolynomialMod2 &b) const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_2">Doubled</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_1">Encode</a>(byte *output, unsigned int outputLen) const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>Encode</b>(BufferedTransformation &bt, unsigned int outputLen) const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>Equals</b>(const PolynomialMod2 &rhs) const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_7">Gcd</a>(const PolynomialMod2 &a, const PolynomialMod2 &n)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [static]</code></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_3">GetBit</a>(unsigned int n) const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_4">GetByte</a>(unsigned int n) const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_7">GetCoefficient</a>(unsigned int i) const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>GF2NT</b> (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [friend]</code></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_6">InverseMod</a>(const PolynomialMod2 &) const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_1">IsIrreducible</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_4">IsUnit</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>IsZero</b>() const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_0">MinEncodedSize</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Minus</b>(const PolynomialMod2 &b) const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Modulo</b>(const PolynomialMod2 &b) const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_6">Monomial</a>(unsigned i)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [static]</code></td></tr> <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z31_5">MultiplicativeInverse</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>One</b>() (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [static]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>operator &=</b>(const PolynomialMod2 &t) (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>operator *=</b>(const PolynomialMod2 &t) (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>operator!</b>() const (defined in <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td></td></tr>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -