📄 class_iterated_hash.html
字号:
<!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++: TemplateIteratedHash< T, B, S, BASE > class Reference</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>IteratedHash< T, B, S, BASE > Class Template Reference</h1><code>#include <<a class="el" href="iterhash_8h-source.html">iterhash.h</a>></code><p><p>Inheritance diagram for IteratedHash< T, B, S, BASE >:<p><center><img src="class_iterated_hash.png" usemap="#IteratedHash< T, B, S, BASE >_map" border="0" alt=""></center><map name="IteratedHash< T, B, S, BASE >_map"><area href="class_iterated_hash_base2.html" alt="IteratedHashBase2< T, B, BASE >" shape="rect" coords="0,112,208,136"></map><a href="class_iterated_hash-members.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2><h3>template<class T, class B, unsigned int S, class BASE = HashTransformation><br> class IteratedHash< T, B, S, BASE ></h3><p><p>Definition at line <a class="el" href="iterhash_8h-source.html#l00071">71</a> of file <a class="el" href="iterhash_8h-source.html">iterhash.h</a>.<table border=0 cellpadding=0 cellspacing=0><tr><td></td></tr><tr><td colspan=2><br><h2>Public Types</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>enum </td><td class="memItemRight" valign=bottom>{ <b>BLOCKSIZE</b> = S }</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2w0" doxytag="IteratedHash::ByteOrderClass"></a>typedef B </td><td class="memItemRight" valign=bottom><b>ByteOrderClass</b></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2w1" doxytag="IteratedHash::HashWordType"></a>typedef IteratedHashBase<<br> T, BASE >::HashWordType </td><td class="memItemRight" valign=bottom><b>HashWordType</b></td></tr><tr><td colspan=2><br><h2>Public Member Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2a1" doxytag="IteratedHash::TruncatedFinal"></a>void </td><td class="memItemRight" valign=bottom><b>TruncatedFinal</b> (byte *hash, unsigned int size)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2a2" doxytag="IteratedHash::DigestSize"></a>unsigned int </td><td class="memItemRight" valign=bottom><b>DigestSize</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2a3" doxytag="IteratedHash::OptimalBlockSize"></a>unsigned int </td><td class="memItemRight" valign=bottom><b>OptimalBlockSize</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2a4" doxytag="IteratedHash::Update"></a>void </td><td class="memItemRight" valign=bottom><b>Update</b> (const byte *input, unsigned int length)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2a5" doxytag="IteratedHash::CreateUpdateSpace"></a>byte * </td><td class="memItemRight" valign=bottom><b>CreateUpdateSpace</b> (unsigned int &size)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2a6" doxytag="IteratedHash::Restart"></a>void </td><td class="memItemRight" valign=bottom><b>Restart</b> ()</td></tr><tr><td colspan=2><br><h2>Static Public Member Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2e0" doxytag="IteratedHash::CorrectEndianess"></a>void </td><td class="memItemRight" valign=bottom><b>CorrectEndianess</b> (HashWordType *out, const HashWordType *in, unsigned int byteCount)</td></tr><tr><td colspan=2><br><h2>Protected Member Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hashb0" doxytag="IteratedHash::IteratedHash"></a> </td><td class="memItemRight" valign=bottom><b>IteratedHash</b> (unsigned int digestSize)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hashb1" doxytag="IteratedHash::BlockSize"></a>unsigned int </td><td class="memItemRight" valign=bottom><b>BlockSize</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b0" doxytag="IteratedHash::HashBlock"></a>void </td><td class="memItemRight" valign=bottom><b>HashBlock</b> (const HashWordType *input)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b7" doxytag="IteratedHash::HashBlock"></a>virtual void </td><td class="memItemRight" valign=bottom><b>HashBlock</b> (const T *input)=0</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b1" doxytag="IteratedHash::vTransform"></a>virtual void </td><td class="memItemRight" valign=bottom><b>vTransform</b> (const HashWordType *data)=0</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b2" doxytag="IteratedHash::GetBitCountHi"></a>T </td><td class="memItemRight" valign=bottom><b>GetBitCountHi</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b3" doxytag="IteratedHash::GetBitCountLo"></a>T </td><td class="memItemRight" valign=bottom><b>GetBitCountLo</b> () const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b4" doxytag="IteratedHash::HashMultipleBlocks"></a>virtual unsigned int </td><td class="memItemRight" valign=bottom><b>HashMultipleBlocks</b> (const T *input, unsigned int length)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b5" doxytag="IteratedHash::PadLastBlock"></a>void </td><td class="memItemRight" valign=bottom><b>PadLastBlock</b> (unsigned int lastBlockSize, byte padFirst=0x80)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2b6" doxytag="IteratedHash::Init"></a>virtual void </td><td class="memItemRight" valign=bottom><b>Init</b> ()=0</td></tr><tr><td colspan=2><br><h2>Protected Attributes</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2p0" doxytag="IteratedHash::m_data"></a><a class="el" href="class_sec_block.html">SecBlock</a>< T > </td><td class="memItemRight" valign=bottom><b>m_data</b></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_iterated_hash_base2p1" doxytag="IteratedHash::m_digest"></a><a class="el" href="class_sec_block.html">SecBlock</a>< T > </td><td class="memItemRight" valign=bottom><b>m_digest</b></td></tr></table><hr>The documentation for this class was generated from the following file:<ul><li><a class="el" href="iterhash_8h-source.html">iterhash.h</a></ul><hr size="1"><address style="align: right;"><small>Generated on Tue Jul 8 23:35:08 2003 for Crypto++ by<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border=0 > </a>1.3.2 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -