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
|
// file : odb/std-list-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_LIST_TRAITS_HXX
#define ODB_STD_LIST_TRAITS_HXX
#include <odb/pre.hxx>
#include <list>
#include <odb/container-traits.hxx>
namespace odb
{
template <typename V, typename A>
class access::container_traits<std::list<V, A> >
{
public:
static container_kind const kind = ck_ordered;
typedef std::list<V, A> container_type;
typedef V 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_type i (0);
for (typename container_type::const_iterator j (c.begin ()),
e (c.end ()); j != e; ++j)
f.insert_one (i++, *j);
}
static void
load (container_type& c, bool more, const functions& f)
{
c.clear ();
while (more)
{
index_type dummy;
c.push_back (value_type ());
more = f.load_all (dummy, c.back ());
}
}
static void
update (const container_type& c, const functions& f)
{
f.delete_all ();
index_type i (0);
for (typename container_type::const_iterator j (c.begin ()),
e (c.end ()); j != e; ++j)
f.insert_one (i++, *j);
}
static void
erase (const functions& f)
{
f.delete_all ();
}
};
}
#include <odb/post.hxx>
#endif // ODB_STD_LIST_TRAITS_HXX
|