1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
// file : odb/qt/containers/qhash-traits.hxx
// copyright : Copyright (c) 2009-2012 Code Synthesis Tools CC
// license : GNU GPL v2; see accompanying LICENSE file
#ifndef ODB_QT_CONTAINER_QHASH_TRAITS_HXX
#define ODB_QT_CONTAINER_QHASH_TRAITS_HXX
#include <odb/pre.hxx>
#include <QtCore/QHash>
#include <QtCore/QMultiHash>
#include <odb/container-traits.hxx>
namespace odb
{
template <typename Key, typename T>
class access::container_traits<QHash<Key, T> >
{
public:
static container_kind const kind = ck_map;
typedef QHash<Key, T> container_type;
typedef Key key_type;
typedef T value_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.key (), i.value ());
}
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 (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.key (), i.value ());
}
static void
erase (const functions& f)
{
f.delete_all ();
}
};
// @@ QMultiHash guarantees elements to be stored in reverse order of
// insertion. The current implementation of the generated code does
// not guarantee this.
//
template <typename Key, typename T>
class access::container_traits<QMultiHash<Key, T> >
{
public:
static container_kind const kind = ck_multimap;
typedef QMultiHash<Key, T> container_type;
typedef Key key_type;
typedef T value_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.key (), i.value ());
}
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 (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.key (), i.value ());
}
static void
erase (const functions& f)
{
f.delete_all ();
}
};
}
#include <odb/post.hxx>
#endif // ODB_QT_CONTAINER_QHASH_TRAITS_HXX
|
