aboutsummaryrefslogtreecommitdiff
path: root/odb/std-map-traits.hxx
diff options
context:
space:
mode:
authorBoris Kolpackov <boris@codesynthesis.com>2010-11-06 17:57:02 +0200
committerBoris Kolpackov <boris@codesynthesis.com>2010-11-06 17:57:02 +0200
commit93392ca601a0cab8517a4ca8d163df4b41dd3e49 (patch)
treeffa58bd3fd7796fd98091f1d890bf410300a746e /odb/std-map-traits.hxx
parent116e353d07f3f65e3d9e29e37efedc37f301e243 (diff)
Add container traits interface and implementation
Implementation is provided for the standard C++ containers.
Diffstat (limited to 'odb/std-map-traits.hxx')
-rw-r--r--odb/std-map-traits.hxx130
1 files changed, 130 insertions, 0 deletions
diff --git a/odb/std-map-traits.hxx b/odb/std-map-traits.hxx
new file mode 100644
index 0000000..4f71868
--- /dev/null
+++ b/odb/std-map-traits.hxx
@@ -0,0 +1,130 @@
+// file : odb/std-map-traits.hxx
+// author : Boris Kolpackov <boris@codesynthesis.com>
+// copyright : Copyright (c) 2009-2010 Code Synthesis Tools CC
+// license : GNU GPL v2; see accompanying LICENSE file
+
+#ifndef ODB_STD_MAP_TRAITS_HXX
+#define ODB_STD_MAP_TRAITS_HXX
+
+#include <odb/pre.hxx>
+
+#include <map>
+
+#include <odb/container-traits.hxx>
+
+namespace odb
+{
+ template <typename K, typename V>
+ class access::container_traits<std::map<K, V> >
+ {
+ public:
+ static container_kind const kind = ck_map;
+
+ typedef K key_type;
+ typedef V value_type;
+ typedef std::map<K, V> container_type;
+ typedef typename container_type::value_type pair_type;
+
+ typedef map_functions<key_type, 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->first, i->second);
+ }
+
+ static void
+ load (container_type& c, bool more, const functions& f)
+ {
+ c.clear ();
+
+ while (more)
+ {
+ key_type k;
+ value_type v;
+ more = f.load_all (k, v);
+ c.insert (pair_type (k, 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->first, i->second);
+ }
+
+ static void
+ erase (const functions& f)
+ {
+ f.delete_all ();
+ }
+ };
+
+ // C++-03 does not guarantee insertion order of equal values but C++-0x
+ // changes that. The current implementation in the generated code does
+ // not guarantee this either.
+ //
+ template <typename K, typename V>
+ class access::container_traits<std::multimap<K, V> >
+ {
+ public:
+ static container_kind const kind = ck_multimap;
+
+ typedef K key_type;
+ typedef V value_type;
+ typedef std::multimap<K, V> container_type;
+ typedef typename container_type::value_type pair_type;
+
+ typedef map_functions<key_type, 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->first, i->second);
+ }
+
+ static void
+ load (container_type& c, bool more, const functions& f)
+ {
+ c.clear ();
+
+ while (more)
+ {
+ key_type k;
+ value_type v;
+ more = f.load_all (k, v);
+ c.insert (pair_type (k, 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->first, i->second);
+ }
+
+ static void
+ erase (const functions& f)
+ {
+ f.delete_all ();
+ }
+ };
+}
+
+#include <odb/post.hxx>
+
+#endif // ODB_STD_MAP_TRAITS_HXX