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

📄 a00002.html

📁 This library defines basic operation on polynomials, and contains also 3 different roots (zeroes)-fi
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>The Polynomials Templates Library: 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.4.5 --><div class="tabs">  <ul>    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>    <li><a href="modules.html"><span>Modules</span></a></li>    <li id="current"><a href="annotated.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="annotated.html"><span>Class&nbsp;List</span></a></li>    <li><a href="classes.html"><span>Alphabetical&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>Polynomial&lt; T &gt; Member List</h1>This is the complete list of members for <a class="el" href="a00090.html">Polynomial&lt; T &gt;</a>, including all inherited members.<p><table>  <tr class="memlist"><td><a class="el" href="a00090.html#7d71a634b3ab7d5071c031633b9614d5">compact</a>()</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#b433e0edb11b32a205a9d07b89aefa8f">degree</a>() const </td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#ba49e76c2d516f6aa270b8333e99df8f">degree</a>()</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#a845bf5cc0f93217a7c7f403a0bc9d38">eval</a>(const T &amp;x) const </td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#4dc10e1190f7f71f0d04e9871c1d7a2f">evalAndDeflate</a>(const T &amp;a, Polynomial&lt; T &gt; &amp;q) const </td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#3035df8b06fcc5015efb56762fc68f93">evalAndDerive</a>(const T &amp;x, T &amp;ppx) const </td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#c107df05015e0113aee17e6665ab8a60">getDerivative</a>(Polynomial&lt; T &gt; &amp;pp) const </td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#2fd33ef58c1d4dc24877322027a8bb50">isMonic</a>() const </td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#246af5c906ec9a1a2fb7befea6d991ae">makeMonic</a>()</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#cd642f1b8ab48b8b99394fffc24727d6">operator *</a>(const Polynomial&lt; T &gt; &amp;p, const Polynomial&lt; T &gt; &amp;q)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [friend]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#955b65f7ae51e1a45bcf985c738640eb">operator *</a>(const T &amp;s, const Polynomial&lt; T &gt; &amp;p)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [friend]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#9c6951d37215e36ec4d171d26f90f487">operator *=</a>(const Polynomial&lt; T &gt; &amp;p)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#b2f6bf0ca6914dfcfb6e03862d162c7e">operator *=</a>(const T &amp;f)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#b6cb5632c793b07705ce488ac0fab8eb">operator+</a>(const Polynomial&lt; T &gt; &amp;p, const Polynomial&lt; T &gt; &amp;q)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [friend]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#23b2b39cd96c44c49bb31c1229165119">operator+=</a>(const Polynomial&lt; T &gt; &amp;q)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#6c43bbb2372812f10b97bb365f482a24">operator-</a>(const Polynomial&lt; T &gt; &amp;p, const Polynomial&lt; T &gt; &amp;q)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [friend]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#be51eb0dc8e4a3721479be4b11536da0">operator-=</a>(const Polynomial&lt; T &gt; &amp;q)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#fedcfef27cf2f0a1f0075272a849b951">operator/</a>(const Polynomial&lt; T &gt; &amp;p, const T &amp;s)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [friend]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#11458f42a6275e6c384467ca5c398e95">operator/=</a>(const T &amp;s)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#326ef308fcad15d7d1f778bb3b8beb31">operator=</a>(const std::vector&lt; T &gt; &amp;q)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#7de9b11369dc2daf64bbc609b3454baa">Polynomial</a>(const T &amp;a=T(0))</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline, explicit]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#aaeed1fb3dc10820de49a00bc4dd6821">Polynomial</a>(const std::vector&lt; T &gt; &amp;p)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline, explicit]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#08b4dcb98feb2d90906f1e7697249639">Polynomial</a>(unsigned n, T a0,...)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr>  <tr class="memlist"><td><a class="el" href="a00090.html#043f1f1821306fe3cc497ca3400fc703">shift</a>(int n)</td><td><a class="el" href="a00090.html">Polynomial&lt; T &gt;</a></td><td><code> [inline]</code></td></tr></table><hr size="1"><address style="align: right;"><small>Generated on Mon Aug 21 21:57:25 2006 for The Polynomials Templates Library by&nbsp;<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.5 </small></address></body></html>

⌨️ 快捷键说明

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