From 2d1104b1e3cfbf394981c39d8828598599dee5d6 Mon Sep 17 00:00:00 2001 From: Constantin Michael Date: Thu, 21 Apr 2011 09:19:17 +0200 Subject: Add qt/container implementation --- odb/qt/containers/qvector-traits.hxx | 73 ++++++++++++++++++++++++++++++++++++ 1 file changed, 73 insertions(+) create mode 100644 odb/qt/containers/qvector-traits.hxx (limited to 'odb/qt/containers/qvector-traits.hxx') diff --git a/odb/qt/containers/qvector-traits.hxx b/odb/qt/containers/qvector-traits.hxx new file mode 100644 index 0000000..c86aa01 --- /dev/null +++ b/odb/qt/containers/qvector-traits.hxx @@ -0,0 +1,73 @@ +// file : odb/qt/containers/qvector-traits.hxx +// author : Constantin Michael +// copyright : Copyright (c) 2009-2011 Code Synthesis Tools CC +// license : GNU GPL v2; see accompanying LICENSE file + +#ifndef ODB_QT_CONTAINER_QVECTOR_TRAITS_HXX +#define ODB_QT_CONTAINER_QVECTOR_TRAITS_HXX + +#include + +#include + +#include + +namespace odb +{ + template + class access::container_traits > + { + public: + static const container_kind kind = ck_ordered; + + typedef QVector container_type; + + typedef T value_type; + typedef typename container_type::size_type index_type; + + typedef ordered_functions functions; + + public: + static void + persist (const container_type& c, const functions& f) + { + // Index based access is just as fast as iterator based access for + // QVector. + // + for (index_type i (0), n (c.size ()); i < n; ++i) + f.insert_one (i, c[i]); + } + + static void + load (container_type& c, bool more, const functions& f) + { + c.clear (); + + while (more) + { + index_type dummy; + c.append (value_type ()); + more = f.load_all (dummy, c.back ()); + } + } + + static void + update (const container_type& c, const functions& f) + { + f.delete_all (); + + for (index_type i (0), n (c.size ()); i < n; ++i) + f.insert_one (i, c[i]); + } + + static void + erase (const functions& f) + { + f.delete_all (); + } + }; +} + +#include + +#endif // ODB_QT_CONTAINER_QVECTOR_TRAITS_HXX -- cgit v1.1