1 files changed, 72 insertions, 0 deletions
diff --git a/odb/std-array-traits.hxx b/odb/std-array-traits.hxx
new file mode 100644
index 0000000..a6cb5e3
--- /dev/null
+++ b/odb/std-array-traits.hxx
@@ -0,0 +1,72 @@
+// file      : odb/std-array-traits.hxx
+// copyright : Copyright (c) 2009-2012 Code Synthesis Tools CC
+// license   : GNU GPL v2; see accompanying LICENSE file
+
+#ifndef ODB_STD_ARRAY_TRAITS_HXX
+#define ODB_STD_ARRAY_TRAITS_HXX
+
+#include <odb/pre.hxx>
+
+#include <array>
+#include <cstddef> // std::size_t
+#include <cassert>
+
+#include <odb/container-traits.hxx>
+
+namespace odb
+{
+  template <typename V, std::size_t N>
+  class access::container_traits<std::array<V, N>>
+  {
+  public:
+    static container_kind const kind = ck_ordered;
+
+    typedef std::array<V, N> container_type;
+
+    typedef V value_type;
+    typedef typename container_type::size_type index_type;
+
+    typedef ordered_functions<index_type, value_type> functions;
+
+  public:
+    static void
+    persist (const container_type& c, const functions& f)
+    {
+      for (index_type i (0); i < N; ++i)
+        f.insert_one (i, c[i]);
+    }
+
+    static void
+    load (container_type& c, bool more, const functions& f)
+    {
+      index_type i (0);
+
+      for (; more && i < N; ++i)
+      {
+        index_type dummy;
+        more = f.load_all (dummy, c[i]);
+      }
+
+      assert (!more && i == N);
+    }
+
+    static void
+    update (const container_type& c, const functions& f)
+    {
+      f.delete_all ();
+
+      for (index_type i (0); i < N; ++i)
+        f.insert_one (i, c[i]);
+    }
+
+    static void
+    erase (const functions& f)
+    {
+      f.delete_all ();
+    }
+  };
+}
+
+#include <odb/post.hxx>
+
+#endif // ODB_STD_ARRAY_TRAITS_HXX