shadps4-emu/ext-cryptopp
1
0
Fork 0
mirror of https://github.com/shadps4-emu/ext-cryptopp.git synced 2024-11-23 09:59:42 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update documentation for SecBlock

Browse Source
This commit is contained in:
Jeffrey Walton 2021-04-09 12:32:19 -04:00
parent d90f9aadd9
commit 0af5b86ce7
No known key found for this signature in database
GPG Key ID: B36AB348921B1838
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
secblock.h
View File

@ -938,7 +938,7 @@ public:
/// \throw InvalidArgument if resulting size would overflow
/// \details The array pointed to by <tt>ptr</tt> must be distinct
/// from this SecBlock because Append() calls Grow() and memcpy.
/// \details Internally, this SecBlock calls Grow and then appends t.
/// \details Internally, this SecBlock calls Grow() and then appends t.
/// \details Append() may be less efficient than a ByteQueue because
/// Append() must Grow() the internal array and then copy elements.
/// The ByteQueue can copy elements without growing.
@ -959,7 +959,7 @@ public:
/// \brief Append contents from another SecBlock
/// \param t the other SecBlock
/// \throw InvalidArgument if resulting size would overflow
/// \details Internally, this SecBlock calls Grow and then appends t.
/// \details Internally, this SecBlock calls Grow() and then appends t.
/// \details Append() may be less efficient than a ByteQueue because
/// Append() must Grow() the internal array and then copy elements.
/// The ByteQueue can copy elements without growing.
@ -990,7 +990,7 @@ public:
/// \param count the number of values to copy
/// \param value the value, repeated count times
/// \throw InvalidArgument if resulting size would overflow
/// \details Internally, this SecBlock calls Grow and then appends value.
/// \details Internally, this SecBlock calls Grow() and then appends value.
/// \details Append() may be less efficient than a ByteQueue because
/// Append() must Grow() the internal array and then copy elements.
/// The ByteQueue can copy elements without growing.