X-Git-Url: https://git.saurik.com/wxWidgets.git/blobdiff_plain/12f5e1e78fe906050ff2fee9529476db332633f0..4e878f44abee3e03cf981772e9c623f0c16408c9:/interface/wx/arrstr.h

diff --git a/interface/wx/arrstr.h b/interface/wx/arrstr.h
index 8c68b94aa7..7303b4d8f2 100644
--- a/interface/wx/arrstr.h
+++ b/interface/wx/arrstr.h
@@ -96,13 +96,10 @@ public:
     size_t Add(const wxString& str, size_t copies = 1);
 
     /**
-        Preallocates enough memory to store @a nCount items. This function may be
-        used to improve array class performance before adding a known number of items
-        consecutively.
+        Preallocates enough memory to store @a nCount items.
 
-        @todo FIX THIS LINK
-
-        @see @ref wxArray::memorymanagement "Dynamic array memory management"
+        This function may be used to improve array class performance before
+        adding a known number of items consecutively.
     */
     void Alloc(size_t nCount);
 
@@ -186,13 +183,10 @@ public:
     void RemoveAt(size_t nIndex, size_t count = 1);
 
     /**
-        Releases the extra memory allocated by the array. This function is useful to
-        minimize the array memory consumption.
-
-        @todo FIX THIS LINK
+        Releases the extra memory allocated by the array.
+        This function is useful to minimize the array memory consumption.
 
-        @see Alloc(), @ref wxArray::memorymanagement "Dynamic array memory
-        management"
+        @see Alloc()
     */
     void Shrink();
 
@@ -308,7 +302,7 @@ public:
         the @a bCase and @a bFromEnd parameters.
     */
     int Index(const wxString& sz, bool bCase = true,
-              bool bFromEnd = false);
+              bool bFromEnd = false) const;
 
     /**
         @warning this function should not be used with sorted arrays because it