Add support for change-tracking containers

ODB now supports "smart" ordered containers. Such containers get extra
functions for updating and deleting individual elements. Based on this
functionality implement two change-tracking containers: odb::vector
(equivalent to std::vector) and QOdbList (equivalent to QList). New
tests: common/container/change-tracking and qt/common/container/change-
tracking.

1 files changed, 7 insertions, 6 deletions

diff --git a/odb/std-array-traits.hxx b/odb/std-array-traits.hxx
index a6cb5e3..438665a 100644
--- a/odb/std-array-traits.hxx
+++ b/odb/std-array-traits.hxx
@@ -19,7 +19,8 @@ namespace odb
   class access::container_traits<std::array<V, N>>
   {
   public:
-    static container_kind const kind = ck_ordered;
+    static const container_kind kind = ck_ordered;
+    static const bool smart = false;
 
     typedef std::array<V, N> container_type;
 
@@ -33,7 +34,7 @@ namespace odb
     persist (const container_type& c, const functions& f)
     {
       for (index_type i (0); i < N; ++i)
-        f.insert_one (i, c[i]);
+        f.insert (i, c[i]);
     }
 
     static void
@@ -44,7 +45,7 @@ namespace odb
       for (; more && i < N; ++i)
       {
         index_type dummy;
-        more = f.load_all (dummy, c[i]);
+        more = f.select (dummy, c[i]);
       }
 
       assert (!more && i == N);
@@ -53,16 +54,16 @@ namespace odb
     static void
     update (const container_type& c, const functions& f)
     {
-      f.delete_all ();
+      f.delete_ ();
 
       for (index_type i (0); i < N; ++i)
-        f.insert_one (i, c[i]);
+        f.insert (i, c[i]);
     }
 
     static void
     erase (const functions& f)
     {
-      f.delete_all ();
+      f.delete_ ();
     }
   };
 }