aboutsummaryrefslogtreecommitdiff
path: root/odb/std-unordered-set-traits.hxx
diff options
context:
space:
mode:
authorBoris Kolpackov <boris@codesynthesis.com>2012-02-29 17:08:36 +0200
committerBoris Kolpackov <boris@codesynthesis.com>2012-02-29 17:08:36 +0200
commitd8bfbd451d14b7891b43e88541704f69fe8ccd33 (patch)
tree30f2a4caf92f2fc4ce950281847452cf6bbbad03 /odb/std-unordered-set-traits.hxx
parent650bcfa07b968118c7f77a5408ec504e42c5d8a3 (diff)
Support for C++11 containers (array, forward_list, unordered)
Diffstat (limited to 'odb/std-unordered-set-traits.hxx')
-rw-r--r--odb/std-unordered-set-traits.hxx124
1 files changed, 124 insertions, 0 deletions
diff --git a/odb/std-unordered-set-traits.hxx b/odb/std-unordered-set-traits.hxx
new file mode 100644
index 0000000..6f8e6a8
--- /dev/null
+++ b/odb/std-unordered-set-traits.hxx
@@ -0,0 +1,124 @@
+// file : odb/std-unordered-set-traits.hxx
+// copyright : Copyright (c) 2009-2012 Code Synthesis Tools CC
+// license : GNU GPL v2; see accompanying LICENSE file
+
+#ifndef ODB_STD_UNORDERED_SET_TRAITS_HXX
+#define ODB_STD_UNORDERED_SET_TRAITS_HXX
+
+#include <odb/pre.hxx>
+
+#include <utility> // std::move
+#include <unordered_set>
+
+#include <odb/container-traits.hxx>
+
+namespace odb
+{
+ template <typename V, typename H, typename P, typename A>
+ class access::container_traits<std::unordered_set<V, H, P, A>>
+ {
+ public:
+ static container_kind const kind = ck_set;
+
+ typedef std::unordered_set<V, H, P, A> container_type;
+ typedef V value_type;
+
+ typedef set_functions<value_type> functions;
+
+ public:
+ static void
+ persist (const container_type& c, const functions& f)
+ {
+ for (typename container_type::const_iterator i (c.begin ()),
+ e (c.end ()); i != e; ++i)
+ f.insert_one (*i);
+ }
+
+ static void
+ load (container_type& c, bool more, const functions& f)
+ {
+ c.clear ();
+
+ while (more)
+ {
+ value_type v;
+ more = f.load_all (v);
+ c.insert (std::move (v));
+ }
+ }
+
+ static void
+ update (const container_type& c, const functions& f)
+ {
+ f.delete_all ();
+
+ for (typename container_type::const_iterator i (c.begin ()),
+ e (c.end ()); i != e; ++i)
+ f.insert_one (*i);
+ }
+
+ static void
+ erase (const functions& f)
+ {
+ f.delete_all ();
+ }
+ };
+
+ // @@ Does multiset preserve insertion order of equal elements? The
+ // current implementation in the generated code does not guarantee
+ // this.
+ //
+ template <typename V, typename H, typename P, typename A>
+ class access::container_traits<std::unordered_multiset<V, H, P, A>>
+ {
+ public:
+ static container_kind const kind = ck_multiset;
+
+ typedef std::unordered_multiset<V, H, P, A> container_type;
+ typedef V value_type;
+
+ typedef set_functions<value_type> functions;
+
+ public:
+ static void
+ persist (const container_type& c, const functions& f)
+ {
+ for (typename container_type::const_iterator i (c.begin ()),
+ e (c.end ()); i != e; ++i)
+ f.insert_one (*i);
+ }
+
+ static void
+ load (container_type& c, bool more, const functions& f)
+ {
+ c.clear ();
+
+ while (more)
+ {
+ value_type v;
+ more = f.load_all (v);
+ c.insert (std::move (v));
+ }
+ }
+
+ static void
+ update (const container_type& c, const functions& f)
+ {
+ f.delete_all ();
+
+ for (typename container_type::const_iterator i (c.begin ()),
+ e (c.end ()); i != e; ++i)
+ f.insert_one (*i);
+ }
+
+ static void
+ erase (const functions& f)
+ {
+ f.delete_all ();
+ }
+ };
+}
+
+#include <odb/post.hxx>
+
+#endif // ODB_STD_UNORDERED_SET_TRAITS_HXX