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

📄 class_polynomial_over-members.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
字号:
<!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>PolynomialOver&lt; T &gt; Member List</h1>This is the complete list of members for <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>, including all inherited members.<p><table>  <tr bgcolor="#f0f0f0"><td><b>Accumulate</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#65c6004a42608f31008ff066f2eba3e2">CoefficientCount</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#2eb91afba2d1f0c11f78f5825ecd5408">CoefficientType</a> typedef</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#604beee6d397108b3334eaeb564b641a">Degree</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#e4e0b0beb7bfab492d6f7343630c2df9">Divide</a>(PolynomialOver&lt; Ring &gt; &amp;r, PolynomialOver&lt; Ring &gt; &amp;q, const PolynomialOver&lt; Ring &gt; &amp;a, const PolynomialOver&lt; Ring &gt; &amp;d, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [static]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>DividedBy</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) const  (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#dad14cc6a75b706ef0a6705134bb78d9">Doubled</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>Equals</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) const  (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#5e862bcafe11988e184db0893d086b3c">EvaluateAt</a>(const CoefficientType &amp;x, const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#e35221cf35e25478e07de2e5fcebf0f9">GetCoefficient</a>(unsigned int i, const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#f2e687246fa4366712cc024e62c799a0">Input</a>(std::istream &amp;in, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#037a72b82d5acfcacbb94a73784b0d85">Inverse</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#bd97055ea77f4c511d84cbde55fee6a0">IsUnit</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#de0983f77089c32d1f7ce07738ea4619">IsZero</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>Minus</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) const  (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr bgcolor="#f0f0f0"><td><b>Modulo</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) const  (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#1a24658cd38205e6a3edc607aaceedda">MultiplicativeInverse</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#45efd76b7e9eb98a968abc90565449b3">Negate</a>(const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>operator=</b>(const PolynomialOver&lt; Ring &gt; &amp;t) (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#2c9b1f5f4bf5a748a1e811ea8b122d3c">Output</a>(std::ostream &amp;out, const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>Plus</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) const  (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#9a479be6ed6b88ac4f74a1c0ca72849c">PolynomialOver</a>()</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#4ae3f58dd93e98544ebd0165fd0beaa2">PolynomialOver</a>(const Ring &amp;ring, unsigned int count)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#393c8f0c973d431d7e04d3d3682b333d">PolynomialOver</a>(const PolynomialOver&lt; Ring &gt; &amp;t)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#f3f01459e456891391d9650e4b82b8b0">PolynomialOver</a>(const CoefficientType &amp;element)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#10f50a46ce4b8b5b4131f5a0057f0bc8">PolynomialOver</a>(Iterator begin, Iterator end)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#ef039d41b917e8297e14c050568a37a2">PolynomialOver</a>(const char *str, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#cccd86996b94b0353287d64ded9ca02f">PolynomialOver</a>(const byte *encodedPolynomialOver, unsigned int byteCount)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#ee5c8c3fe28ec784e02abb66df2c4040">PolynomialOver</a>(const byte *BEREncodedPolynomialOver)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [explicit]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#4cef3038c9a2515037e52647e8af1914">PolynomialOver</a>(BufferedTransformation &amp;bt)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [explicit]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#33a595d1ea6d44eef7ac3636c195a869">PolynomialOver</a>(RandomNumberGenerator &amp;rng, const RandomizationParameter &amp;parameter, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#3a895100d291eba0fba02f50b57d1d44">Randomize</a>(RandomNumberGenerator &amp;rng, const RandomizationParameter &amp;parameter, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>Reduce</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#f87a6be38193e61c7aecb8c96510583e">Ring</a> typedef</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#ac4ab97afda49a151fc9dbd8eaf9aa16">SetCoefficient</a>(unsigned int i, const CoefficientType &amp;value, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#961c5f23af4e1d59554cd8d56ae7c608">ShiftLeft</a>(unsigned int n, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#c24e2a39771e36b36ae3ab550e529d70">ShiftRight</a>(unsigned int n, const Ring &amp;ring)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="class_polynomial_over.html#adf21161e0af900a33e9ca669a1efd27">Squared</a>(const Ring &amp;ring) const </td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr bgcolor="#f0f0f0"><td><b>swap</b>(PolynomialOver&lt; Ring &gt; &amp;t) (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></td></tr>  <tr bgcolor="#f0f0f0"><td><b>Times</b>(const PolynomialOver&lt; Ring &gt; &amp;t, const Ring &amp;ring) const  (defined in <a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a>)</td><td><a class="el" href="class_polynomial_over.html">PolynomialOver&lt; T &gt;</a></td><td></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 + -