⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 class_polynomial_mod2-members.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: Member List</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs">  <ul>    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>    <li><a href="namespaces.html"><span>Namespaces</span></a></li>    <li class="current"><a href="classes.html"><span>Classes</span></a></li>    <li><a href="files.html"><span>Files</span></a></li>  </ul></div><div class="tabs">  <ul>    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>  </ul></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.<p><table>  <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#bf3ecc0dafe04c57dacea983a9a6690e">AllOnes</a>(size_t 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#99e2b908f82147116bfe631ef84755b5">And</a>(const PolynomialMod2 &amp;b) 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#69c7853e0d24f1056be18112ee4f5a8e">BERDecodeAsOctetString</a>(BufferedTransformation &amp;bt, size_t 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#86f4e8502eacf95345d18a6240a217b2">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#d22cb6a5fcb0a78646059cf0005d2f6b">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#92653519c01aa965f80a24d6952bc34e">CoefficientCount</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#dc611fe09c3a9b919dce7b8b45cec29d">Decode</a>(const byte *input, size_t inputLen)</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#60ed7031782a3e3051278ce5dfa1c099">Decode</a>(BufferedTransformation &amp;bt, size_t inputLen)</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#2d0e58a23b81b33ab3ccf9b7aa498603">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#700d15948c49f52c01d0ad1bd25c1a3d">DEREncodeAsOctetString</a>(BufferedTransformation &amp;bt, size_t 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#73d92da2ee829619041eca82567b87bc">Divide</a>(PolynomialMod2 &amp;r, PolynomialMod2 &amp;q, const PolynomialMod2 &amp;a, const PolynomialMod2 &amp;d)</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#91bb7fc668249f76ee3aea359daf0842">DividedBy</a>(const PolynomialMod2 &amp;b) 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#5f6006abf328c20f32a5858e96b91c8d">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#1f444d22084163c2b69b5ade313aef14">Encode</a>(byte *output, size_t outputLen) 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#8bc634e489af8451856f5614748fb9c6">Encode</a>(BufferedTransformation &amp;bt, size_t outputLen) 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#5a798b2c21aa6d39ec33ff8b490e5078">Equals</a>(const PolynomialMod2 &amp;rhs) 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#3940dec2ab787489ad4ce67013fe4611">Gcd</a>(const PolynomialMod2 &amp;a, const PolynomialMod2 &amp;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#fcf3588d3c594c24370c5a08366af970">GetBit</a>(size_t 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#7a24a5ec904f384e4285d133dbe07757">GetByte</a>(size_t 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#f6e946183e623ed1303a43c2b84b6a1f">GetCoefficient</a>(size_t i) 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#2e0505b1597d5b697c52bfc7420f4f73">GF2NT</a> class</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#e8005d38604e28556889ea89412fe33f">InverseMod</a>(const PolynomialMod2 &amp;) 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#3ea60cfae9134470da9b8f7c37122acb">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#4cdb6f0136198255766326388ddd4d42">IsUnit</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#91d774c1b3a0b936317265dbf7e5ad75">IsZero</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#00c84f8cb2e7262de75e4c1e28760d43">MinEncodedSize</a>() const</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -