Update documentation

1 files changed, 6 insertions, 3 deletions

diff --git a/secblock.h b/secblock.h
index 2227253f..56b5be6d 100644
--- a/secblock.h
+++ b/secblock.h
@@ -888,7 +888,9 @@ public:
 	/// \param ptr a pointer to an array of T

 	/// \param len the number of elements in the memory block

 	/// \details The array pointed to by <tt>ptr</tt> must be distinct

-	///  from this SecBlock because Assign() calls New() and memcpy.

+	///  from this SecBlock because Assign() calls New() and then memcpy().

+	///  The call to New() will invalidate all pointers and iterators, like

+	///  the pointer returned from data().

 	/// \details If the memory block is reduced in size, then the reclaimed

 	///  memory is set to 0. If an assignment occurs, then Assign() resets

 	///  the element count after the previous block is zeroized.

@@ -939,8 +941,9 @@ public:
 	/// \param len the number of elements in the memory block

 	/// \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.

+	///  from this SecBlock because Append() calls Grow() and then memcpy().

+	///  The call to Grow() will invalidate all pointers and iterators, like

+	///  the pointer returned from data().

 	/// \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.