aboutsummaryrefslogtreecommitdiff
path: root/libbutl/small-vector-odb.hxx
blob: af9d96c4d9956059b1e22f4ee16c3c73c2d54b8d (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
// file      : libbutl/small-vector-odb.hxx -*- C++ -*-
// license   : MIT; see accompanying LICENSE file

#pragma once

#include <odb/pre.hxx>

#include <libbutl/small-vector.mxx>

#include <odb/container-traits.hxx>

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

    using container_type = butl::small_vector<V, N>;

    using value_type = V;
    using index_type = typename container_type::size_type;

    using functions = ordered_functions<index_type, value_type>;

  public:
    static void
    persist (const container_type& c, const functions& f)
    {
      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.push_back (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>