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

📄 class_polynomial_mod2-members.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 2 页
字号:
  <tr class="memlist"><td><a class="el" href="class_polynomial_mod2.html#a10aa6c97fa37f201fcb477e0aabe209">Minus</a>(const PolynomialMod2 &amp;b) 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#1e1e201da250b5fe9ee142705e14ffdc">Modulo</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#87949fb32436e1f2f96d7b813405c032">Monomial</a>(size_t 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#1a79c76a8039c159d0e3cfba93ad8184">MultiplicativeInverse</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#6d96db42fd089c139d6af6da6d6bc331">One</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 &amp;=</b>(const PolynomialMod2 &amp;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 &amp;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 class="memlist"><td><a class="el" href="class_polynomial_mod2.html#c444b1db16f62393ba63ec16096664b2">operator!</a>() const</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 &amp;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 class="memlist"><td><a class="el" href="class_polynomial_mod2.html#2638a0fb364145eb07a3cd6ed58de1af">operator+</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#074e88a48db114f9f2e7ca859401c24d">operator+=</a>(const PolynomialMod2 &amp;t)</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#bcf3e64ba4bb2f0aad40c217397284d4">operator-</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#a4e227e47fe190e2964f7ae00aa495ee">operator-=</a>(const PolynomialMod2 &amp;t)</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [inline]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>operator/=</b>(const PolynomialMod2 &amp;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 class="memlist"><td><a class="el" href="class_polynomial_mod2.html#a5058e89a823851c08fb11ab7f6449d0">operator&lt;&lt;</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#e2b80f2028ca16b9a75a434e1fb24424">operator&lt;&lt;</a>(std::ostream &amp;out, const PolynomialMod2 &amp;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#d73f6f1c7331f2b745c0d61f11d881b9">operator&lt;&lt;=</a>(unsigned int)</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#cb7a27cfd427af99b60e67503db0b6d6">operator=</a>(const PolynomialMod2 &amp;t)</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#a752ba55ff8ac4050c1391d1dacfbc81">operator&gt;&gt;</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#16f09c3dcc4ac6019c4f42012b177a37">operator&gt;&gt;=</a>(unsigned int)</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#bfbd3eee725068a94239e7581b43fe45">operator[]</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 class="memlist"><td><a class="el" href="class_polynomial_mod2.html#46d95294f13b9b537868389d741b41a8">operator^=</a>(const PolynomialMod2 &amp;t)</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#c2821c87852466235b4e1a2f4cc01334">Parity</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#507094d47020af3d23a9fd68cc4b527d">Pentanomial</a>(size_t t0, size_t t1, size_t t2, size_t t3, size_t t4)</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#cd4130ad85985d2d1a4318b77563c030">Plus</a>(const PolynomialMod2 &amp;b) 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#c67d4fb61b199c101f5de08d3aa2e782">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#6866391c010ebef60c452df7961e809c">PolynomialMod2</a>(const PolynomialMod2 &amp;t)</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#51790dcfe87a449169e8cb5c0f20da7e">PolynomialMod2</a>(word value, size_t bitLength=WORD_BITS)</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#dc62dcb615c688c00c924775920c752d">PolynomialMod2</a>(const byte *encodedPoly, size_t byteCount)</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#ba40ce289e5ffaa47542391ead80aa85">PolynomialMod2</a>(BufferedTransformation &amp;encodedPoly, size_t byteCount)</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#455d995dd1eee03b8412eacae4c61186">PolynomialMod2</a>(RandomNumberGenerator &amp;rng, size_t bitcount)</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#7027d2803057b129738a862611faf3d2">RandomizationParameter</a> typedef</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#7021f18e89d4494b6f2ddede2ac29b3a">Randomize</a>(RandomNumberGenerator &amp;rng, size_t bitcount)</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#b3855a5f77e9bbc7d82a4239ccf59329">SetBit</a>(size_t i, int value=1)</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#f15c7ead361d1f7ea23d5e4bd5535989">SetByte</a>(size_t n, byte value)</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#862faf0cf7d2a2d8a30cd2a17c3d9146">SetCoefficient</a>(size_t i, int value)</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#ebb432d1ab5e16d056165e316254b258">Squared</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#21587324d54a4ae453960770b18c398d">swap</a>(PolynomialMod2 &amp;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#9eb57375ba2c0b403a76008195c50299">Times</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#6d843c32a41885cb33d0aec19e40dda6">Trinomial</a>(size_t t0, size_t t1, size_t t2)</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#88292d16af59aaed460503b6339145b3">WordCount</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#c39e5aa475ea75149c09aeace922734d">Xor</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#11c7e95fb64a071952df785bb4036437">Zero</a>()</td><td><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a></td><td><code> [static]</code></td></tr></table><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:45 2007 for Crypto++ by&nbsp;<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.2 </small></address></body></html>

⌨️ 快捷键说明

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