class_g_f2_n_t-members.html
来自「Crypto++是一个非常强大的密码学库,主要是功能全」· HTML 代码 · 共 61 行 · 第 1/2 页
HTML
61 行
<!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>GF2NT Member List</h1>This is the complete list of members for <a class="el" href="class_g_f2_n_t.html">GF2NT</a>, including all inherited members.<table> <tr bgcolor="#f0f0f0"><td><b>AbstractRing</b>() (defined in <a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a>)</td><td><a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>AbstractRing</b>(const AbstractRing &source) (defined in <a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a>)</td><td><a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Accumulate</b>(Element &a, const Element &b) const (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td><code> [inline, virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Add</b>(const Element &a, const Element &b) const (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td><code> [inline, virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>BERDecodeElement</b>(BufferedTransformation &in, Element &a) const (defined in <a class="el" href="class_g_f2_n_p.html">GF2NP</a>)</td><td><a class="el" href="class_g_f2_n_p.html">GF2NP</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>CascadeExponentiate</b>(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const (defined in <a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a>)</td><td><a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a></td><td><code> [virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>CascadeScalarMultiply</b>(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const (defined in <a class="el" href="class_abstract_group.html">AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element ></a>)</td><td><a class="el" href="class_abstract_group.html">AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element ></a></td><td><code> [virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Clone</b>() const (defined in <a class="el" href="class_g_f2_n_t.html">GF2NT</a>)</td><td><a class="el" href="class_g_f2_n_t.html">GF2NT</a></td><td><code> [inline, virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>DEREncode</b>(BufferedTransformation &bt) const (defined in <a class="el" href="class_g_f2_n_t.html">GF2NT</a>)</td><td><a class="el" href="class_g_f2_n_t.html">GF2NT</a></td><td><code> [virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>DEREncodeElement</b>(BufferedTransformation &out, const Element &a) const (defined in <a class="el" href="class_g_f2_n_p.html">GF2NP</a>)</td><td><a class="el" href="class_g_f2_n_p.html">GF2NP</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>Divide</b>(const Element &a, const Element &b) const (defined in <a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a>)</td><td><a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a></td><td><code> [virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Double</b>(const Element &a) const (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td><code> [inline, virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Element</b> typedef (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>Equal</b>(const Element &a, const Element &b) const (defined in <a class="el" href="class_g_f2_n_p.html">GF2NP</a>)</td><td><a class="el" href="class_g_f2_n_p.html">GF2NP</a></td><td><code> [inline, virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>EuclideanDomain</b> typedef (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>Exponentiate</b>(const Element &a, const Integer &e) const (defined in <a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a>)</td><td><a class="el" href="class_abstract_ring.html">AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element ></a></td><td><code> [virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>GetDomain</b>() const (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>GetModulus</b>() const (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>GF2NP</b>(const PolynomialMod2 &modulus) (defined in <a class="el" href="class_g_f2_n_p.html">GF2NP</a>)</td><td><a class="el" href="class_g_f2_n_p.html">GF2NP</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>GF2NT</b>(unsigned int t0, unsigned int t1, unsigned int t2) (defined in <a class="el" href="class_g_f2_n_t.html">GF2NT</a>)</td><td><a class="el" href="class_g_f2_n_t.html">GF2NT</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>HalfTrace</b>(const Element &a) const (defined in <a class="el" href="class_g_f2_n_p.html">GF2NP</a>)</td><td><a class="el" href="class_g_f2_n_p.html">GF2NP</a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>Identity</b>() const (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td><code> [inline, virtual]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>Inverse</b>(const Element &a) const (defined in <a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a>)</td><td><a class="el" href="class_quotient_ring.html">QuotientRing< EuclideanDomainOf< PolynomialMod2 > ></a></td><td><code> [inline, virtual]</code></td></tr>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?