Cast for argument to delete[] - VC6 doesn't want to delete a const pointer

[wxWidgets.git] / include / wx / vector.h

diff --git a/include/wx/vector.h b/include/wx/vector.h
index c1a8ece678de3286ddcae8b9b99e55b07b7a2aa8..85d925794371ef7e0b162d2def26a4ce7eaf8823 100644 (file)
--- a/include/wx/vector.h
+++ b/include/wx/vector.h
@@ -22,14 +22,99 @@
 #else // !wxUSE_STL
 
 #include "wx/utils.h"
 #else // !wxUSE_STL
 
 #include "wx/utils.h"

+#include "wx/meta/movable.h"
+#include "wx/meta/if.h"

 
 #include "wx/beforestd.h"
 #include <new> // for placement new
 #include "wx/afterstd.h"
 
 
 #include "wx/beforestd.h"
 #include <new> // for placement new
 #include "wx/afterstd.h"
 

+namespace wxPrivate
+{
+
+// These templates encapsulate memory operations for use by wxVector; there are
+// two implementations, both in generic way for any C++ types and as an
+// optimized version for "movable" types that uses realloc() and memmove().
+
+// version for movable types:
+template<typename T>
+struct wxVectorMemOpsMovable
+{
+    static void Free(T* array)
+        { free(array); }
+
+    static T* Realloc(T* old, size_t newCapacity, size_t WXUNUSED(occupiedSize))
+        { return (T*)realloc(old, newCapacity * sizeof(T)); }
+
+    static void MemmoveBackward(T* dest, T* source, size_t count)
+        { memmove(dest, source, count * sizeof(T)); }
+
+    static void MemmoveForward(T* dest, T* source, size_t count)
+        { memmove(dest, source, count * sizeof(T)); }
+};
+
+// generic version for non-movable types:
+template<typename T>
+struct wxVectorMemOpsGeneric
+{
+    static void Free(T* array)
+        { ::operator delete(array); }
+
+    static T* Realloc(T* old, size_t newCapacity, size_t occupiedSize)
+    {
+        T *mem = (T*)::operator new(newCapacity * sizeof(T));
+        for ( size_t i = 0; i < occupiedSize; i++ )
+        {
+            new(mem + i) T(old[i]);
+            old[i].~T();
+        }
+        ::operator delete(old);
+        return mem;
+    }
+
+    static void MemmoveBackward(T* dest, T* source, size_t count)
+    {
+        wxASSERT( dest < source );
+        T* destptr = dest;
+        T* sourceptr = source;
+        for ( size_t i = count; i > 0; --i, ++destptr, ++sourceptr )
+        {
+            new(destptr) T(*sourceptr);
+            sourceptr->~T();
+        }
+    }
+
+    static void MemmoveForward(T* dest, T* source, size_t count)
+    {
+        wxASSERT( dest > source );
+        T* destptr = dest + count - 1;
+        T* sourceptr = source + count - 1;
+        for ( size_t i = count; i > 0; --i, --destptr, --sourceptr )
+        {
+            new(destptr) T(*sourceptr);
+            sourceptr->~T();
+        }
+    }
+};
+
+
+} // namespace wxPrivate
+

 template<typename T>
 class wxVector
 {
 template<typename T>
 class wxVector
 {

+private:
+    // This cryptic expression means "typedef Ops to wxVectorMemOpsMovable if
+    // type T is movable type, otherwise to wxVectorMemOpsGeneric".
+    //
+    // Note that we use typedef instead of privately deriving from this (which
+    // would allowed us to omit "Ops::" prefixes below) to keep VC6 happy,
+    // it can't compile code that derives from wxIf<...>::value.
+    typedef typename wxIf< wxIsMovable<T>::value,
+                           wxPrivate::wxVectorMemOpsMovable<T>,
+                           wxPrivate::wxVectorMemOpsGeneric<T> >::value
+            Ops;
+

 public:
     typedef size_t size_type;
     typedef T value_type;
 public:
     typedef size_t size_type;
     typedef T value_type;


@@ -54,10 +139,10 @@ public:
         // call destructors of stored objects:
         for ( size_type i = 0; i < m_size; i++ )
         {
         // call destructors of stored objects:
         for ( size_type i = 0; i < m_size; i++ )
         {

-            m_values[i].~value_type();
+            m_values[i].~T();

         }
 
         }
 

-        free(m_values);
+        Ops::Free(m_values);

         m_values = NULL;
         m_size = m_capacity = 0;
     }
         m_values = NULL;
         m_size = m_capacity = 0;
     }


@@ -78,8 +163,7 @@ public:
         if ( m_capacity + increment > n )
             n = m_capacity + increment;
 
         if ( m_capacity + increment > n )
             n = m_capacity + increment;
 

-        m_values = (value_type*)realloc(m_values, n * sizeof(value_type));
-
+        m_values = Ops::Realloc(m_values, n * sizeof(value_type), m_size);

         m_capacity = n;
     }
 
         m_capacity = n;
     }
 


@@ -162,9 +246,7 @@ public:
         // the way:
         if ( after > 0 )
         {
         // the way:
         if ( after > 0 )
         {

-            memmove(m_values + idx + 1,
-                    m_values + idx,
-                    after * sizeof(value_type));
+            Ops::MemmoveForward(m_values + idx + 1, m_values + idx, after);

         }
 
 #if wxUSE_EXCEPTIONS
         }
 
 #if wxUSE_EXCEPTIONS


@@ -183,9 +265,7 @@ public:
             // back to their original positions in m_values
             if ( after > 0 )
             {
             // back to their original positions in m_values
             if ( after > 0 )
             {

-                memmove(m_values + idx,
-                        m_values + idx + 1,
-                        after * sizeof(value_type));
+                Ops::MemmoveBackward(m_values + idx, m_values + idx + 1, after);

             }
 
             throw; // rethrow the exception
             }
 
             throw; // rethrow the exception


@@ -217,14 +297,12 @@ public:
 
         // erase elements by calling their destructors:
         for ( iterator i = first; i < last; ++i )
 
         // erase elements by calling their destructors:
         for ( iterator i = first; i < last; ++i )

-            i->~value_type();
+            i->~T();

 
         // once that's done, move following elements over to the freed space:
         if ( after > 0 )
         {
 
         // once that's done, move following elements over to the freed space:
         if ( after > 0 )
         {

-            memmove(m_values + idx,
-                    m_values + idx + count,
-                    after * sizeof(value_type));
+            Ops::MemmoveBackward(m_values + idx, m_values + idx + count, after);

         }
 
         m_size -= count;
         }
 
         m_size -= count;