aboutsummaryrefslogtreecommitdiff
path: root/odb/std-array-traits.hxx
blob: 1d0f1a111465fa5166db135a9397e0c19a19aab5 (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
// file      : odb/std-array-traits.hxx
// license   : GNU GPL v2; see accompanying LICENSE file

#ifndef ODB_STD_ARRAY_TRAITS_HXX
#define ODB_STD_ARRAY_TRAITS_HXX

#include <odb/pre.hxx>

#include <array>
#include <cstddef> // std::size_t
#include <cassert>

#include <odb/container-traits.hxx>

namespace odb
{
  template <typename V, std::size_t N>
  class access::container_traits<std::array<V, N>>
  {
  public:
    static const container_kind kind = ck_ordered;
    static const bool smart = false;

    typedef std::array<V, N> 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)
    {
      for (index_type i (0); i < N; ++i)
        f.insert (i, c[i]);
    }

    static void
    load (container_type& c, bool more, const functions& f)
    {
      index_type i (0);

      for (; more && i < N; ++i)
      {
        index_type dummy;
        more = f.select (dummy, c[i]);
      }

      assert (!more && i == N);
    }

    static void
    update (const container_type& c, const functions& f)
    {
      f.delete_ ();

      for (index_type i (0); i < N; ++i)
        f.insert (i, c[i]);
    }

    static void
    erase (const functions& f)
    {
      f.delete_ ();
    }
  };
}

#include <odb/post.hxx>

#endif // ODB_STD_ARRAY_TRAITS_HXX