X-Git-Url: https://git.saurik.com/wxWidgets.git/blobdiff_plain/664e5ff93e8ed74969e67c79ce9da004309ca91c..427861bde09badef1a2950ad799e69fac6b4a48a:/interface/wx/vector.h?ds=sidebyside

diff --git a/interface/wx/vector.h b/interface/wx/vector.h
index a85825f258..412330d380 100644
--- a/interface/wx/vector.h
+++ b/interface/wx/vector.h
@@ -20,7 +20,7 @@
     @nolibrary
     @category{containers}
 
-    @see @ref overview_container, wxList<T>, wxArray<T>
+    @see @ref overview_container, wxList<T>, wxArray<T>, wxVectorSort<T>
 */
 template<typename T>
 class wxVector<T>
@@ -120,7 +120,7 @@ public:
         Return reverse iterator to end of the vector.
     */
     reverse_iterator rbegin();
-    
+
     /**
         Return reverse iterator to beginning of the vector.
     */
@@ -218,9 +218,38 @@ public:
     */
     void reserve(size_type n);
 
+    /**
+        Makes the vector of size @a n.
+
+        If @a n is less than the current size(), the elements at the end of the
+        vector are erased. If it is greater, then the vector is completed with
+        either the copies of the given object @a v or @c value_type() objects
+        until it becomes of size @a n.
+     */
+    //@{
+    void resize(size_type n);
+    void resize(size_type n, const value_type& v);
+    //@}
+
     /**
         Returns the size of the vector.
     */
     size_type size() const;
 };
 
+
+/**
+   Sort the contents of a @c wxVector<T>.  In a STL build this function will
+   be defined as a thin wrapper around std::sort.  To be sortable the
+   contained type must support the less-than operator.
+
+   @code
+   wxVector<SomeClass> v;
+   ... // items are added to the vector v...
+   wxVectorSort(v);
+   @endcode
+      
+   @see wxVector<T>
+*/
+template<typename T>
+void wxVectorSort(wxVector<T>& v);