diff --git a/iterhash.h b/iterhash.h index edaa18e2..f642ab47 100644 --- a/iterhash.h +++ b/iterhash.h @@ -152,8 +152,8 @@ public: { CRYPTOPP_ASSERT(in != NULLPTR); CRYPTOPP_ASSERT(out != NULLPTR); - CRYPTOPP_ASSERT(IsAligned(in)); - CRYPTOPP_ASSERT(IsAligned(out)); + CRYPTOPP_ASSERT(IsAligned(in)); + CRYPTOPP_ASSERT(IsAligned(out)); ConditionalByteReverse(T_Endianness::ToEnum(), out, in, byteCount); } diff --git a/misc.h b/misc.h index 377f9fd7..36101e7d 100644 --- a/misc.h +++ b/misc.h @@ -2043,7 +2043,7 @@ inline T ConditionalByteReverse(ByteOrder order, T value) /// not part of a full element. If T is int (and int is 4 bytes), then /// byteCount = 10 means only the first 2 elements or 8 bytes are /// reversed. -/// \details The follwoing program should help illustrate the behavior. +/// \details The following program should help illustrate the behavior. ///
vector v1, v2;
 ///
 /// v1.push_back(1);
@@ -2063,7 +2063,7 @@ inline T ConditionalByteReverse(ByteOrder order, T value)
 /// for(unsigned int i = 0; i < v2.size(); i++)
 ///   cout << std::hex << v2[i] << " ";
 /// cout << endl;
-/// The program above results in the follwoing output. +/// The program above results in the following output. ///
V1: 00000001 00000002 00000003 00000004
 /// V2: 01000000 02000000 03000000 04000000
/// \sa ConditionalByteReverse @@ -2072,8 +2072,8 @@ void ByteReverse(T *out, const T *in, size_t byteCount) { // Alignment check due to Issues 690 CRYPTOPP_ASSERT(byteCount % sizeof(T) == 0); - CRYPTOPP_ASSERT(IsAligned(in)); - CRYPTOPP_ASSERT(IsAligned(out)); + //CRYPTOPP_ASSERT(IsAligned(in)); + //CRYPTOPP_ASSERT(IsAligned(out)); size_t count = byteCount/sizeof(T); for (size_t i=0; i