blob: 79b9d4bd6752ffb0773b5ce11cfe0580698603ce (
plain)
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
|
// file : odb/qt/containers/qvector-traits.hxx
// copyright : Copyright (c) 2009-2012 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 <odb/pre.hxx>
#include <QtCore/QVector>
#include <odb/container-traits.hxx>
namespace odb
{
template <typename T>
class access::container_traits<QVector<T> >
{
public:
static const container_kind kind = ck_ordered;
static const bool smart = false;
typedef QVector<T> container_type;
typedef T 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)
{
// 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 (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.select (dummy, c.back ());
}
}
static void
update (const container_type& c, const functions& f)
{
f.delete_ ();
for (index_type i (0), n (c.size ()); i < n; ++i)
f.insert (i, c[i]);
}
static void
erase (const functions& f)
{
f.delete_ ();
}
};
}
#include <odb/post.hxx>
#endif // ODB_QT_CONTAINER_QVECTOR_TRAITS_HXX
|