File: array_adaptor.h

package info (click to toggle)
bagel 1.2.2-8
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 134,940 kB
  • sloc: cpp: 1,236,571; javascript: 15,383; python: 1,461; ansic: 674; makefile: 253; sh: 109
file content (258 lines) | stat: -rw-r--r-- 6,813 bytes parent folder | download | duplicates (5)
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
#ifndef __BTAS_ARRAYADAPTOR_H_
#define __BTAS_ARRAYADAPTOR_H_

// adaptors for std "array" containers

#include <vector>
#include <array>
#include <cassert>
#include <btas/tensor_traits.h>
#include <btas/generic/numeric_type.h>
#include <btas/varray/varray.h>
#include <btas/serialization.h>
#include <boost/version.hpp>
#include <boost/serialization/array.hpp>

namespace btas {

  template <typename Array> struct array_adaptor;

  /// Adaptor from std::array
  template <typename T, size_t N>
  struct array_adaptor< std::array<T, N> > {
      typedef std::array<T, N> array;
      typedef typename array::value_type value_type;

      static array construct(std::size_t n) {
        assert(n <= N);
        array result;
        return result;
      }
      static array construct(std::size_t n, T value) {
        assert(n <= N);
        array result;
        std::fill_n(result.begin(), n, value);
        return result;
      }

      static void resize(array& x, std::size_t n) {
        assert(x.size() == N);
        assert(x.size() >= n);
      }

      static void print(const array& a, std::ostream& os) {
        os << "{";
        for(std::size_t i = 0; i != N; ++i) {
          os << a[i];
          if (i != (N - 1))
            os << ",";
        }
        os << "}";
      }
  };

  template <typename T, size_t N>
  constexpr std::size_t rank(const std::array<T, N>& x) noexcept {
    return N;
  }

  /// Adaptor from const-size array
  template <typename T, size_t N>
  struct array_adaptor< T[N] > {
      typedef T (array)[N];
      typedef T value_type;

      static void print(const array& a, std::ostream& os) {
        os << "{";
        for(std::size_t i = 0; i != N; ++i) {
          os << a[i];
          if (i != (N - 1))
            os << ",";
        }
        os << "}";
      }
  };

  template <typename T, size_t N>
  constexpr std::size_t rank(const T (&x)[N]) noexcept {
    return N;
  }

  template <typename T, size_t N>
  std::ostream& operator<<(std::ostream& os, const std::array<T, N>& x) {
    array_adaptor<std::array<T, N> >::print(x,os);
    return os;
  }

  /// Adaptors for sequence container, e.g. std::vector, btas::varray, and std::initializer_list

  template <typename Array, class = typename std::enable_if<not btas::is_tensor<Array>::value>::type>
  std::size_t rank(const Array& x) {
    return x.size();
  }

  template <typename Array>
  struct array_adaptor {
      typedef Array array;
      typedef typename Array::value_type value_type;

      static array construct(std::size_t N) {
        return array(N);
      }
      static array construct(std::size_t N,
                             value_type value) {
        return array(N, value);
      }
      static void resize(array& x, std::size_t N) {
        x.resize(N);
      }
      static void print(const array& a, std::ostream& os) {
        std::size_t n = rank(a);
        os << "{";
        for(std::size_t i = 0; i != n; ++i) {
          os << a[i];
          if (i != (n - 1))
            os << ",";
        }
        os << "}";
      }
  };

  template <typename T>
  std::ostream& operator<<(std::ostream& os, const btas::varray<T>& x) {
    array_adaptor<btas::varray<T> >::print(x,os);
    return os;
  }

  template <typename T>
  std::ostream& operator<<(std::ostream& os, const std::vector<T>& x) {
    array_adaptor<std::vector<T> >::print(x,os);
    return os;
  }

  template <typename T>
  std::ostream& operator<<(std::ostream& os, const std::initializer_list<T>& x) {
    array_adaptor<std::vector<T> >::print(x,os);
    return os;
  }
}

namespace std {

  template <typename T, size_t N>
  const T* cbegin(const T(&x)[N]) {
    return &x[0];
  }
  template <typename T, size_t N>
  const T* cend(const T(&x)[N]) {
    return &x[N];
  }
  template <typename T, size_t N>
  const T* rbegin(T(&x)[N]) {
    return &x[N-1];
  }
  template <typename T, size_t N>
  const T* rend(T(&x)[N]) {
    return &x[0] - 1;
  }

  template <typename T>
  const T* cbegin(const T* x) {
    return x;
  }
  template <typename T>
  const T* cbegin(T* x) {
    return x;
  }
  template <typename T>
  T* begin(T* x) {
    return x;
  }

#if __cplusplus == 201103L // add useful bits to make transition to C++14 easier
  template <typename C>
  constexpr auto cbegin(const C& x) -> decltype(std::begin(x)) {
    return std::begin(x);
  }
  template <typename C>
  constexpr auto cend(const C& x) -> decltype(std::end(x)) {
    return std::end(x);
  }
  template <typename C>
  auto rbegin(C& x) -> decltype(x.rbegin()) {
    return x.rbegin();
  }
  template <typename C>
  auto rend(C& x) -> decltype(x.rend()) {
    return x.rend();
  }
#endif

  template <typename T>
  struct make_unsigned<std::vector<T> > {
      typedef std::vector<typename make_unsigned<T>::type > type;
  };
  template <typename T>
  struct make_unsigned<std::initializer_list<T> > {
      typedef std::initializer_list<typename make_unsigned<T>::type > type;
  };
  template <typename T, size_t N>
  struct make_unsigned<std::array<T, N> > {
      typedef std::array<typename make_unsigned<T>::type, N> type;
  };
  template <typename T>
  struct make_unsigned<btas::varray<T> > {
      typedef btas::varray<typename make_unsigned<T>::type > type;
  };
  template <typename T, size_t N>
  struct make_unsigned<T[N]> {
      typedef typename make_unsigned<T>::type uT;
      typedef uT (type)[N];
  };

}

namespace btas {
  template <typename Array, typename T>
  struct replace_value_type;

  template <typename T, typename U>
  struct replace_value_type<std::vector<T>, U> {
      typedef std::vector<U> type;
  };
  template <typename T, typename U>
  struct replace_value_type<std::initializer_list<T>,U> {
      typedef std::initializer_list<U> type;
  };
  template <typename T, size_t N, typename U>
  struct replace_value_type<std::array<T, N>,U> {
      typedef std::array<U, N> type;
  };
  template <typename T, typename U>
  struct replace_value_type<btas::varray<T>,U> {
      typedef btas::varray<U> type;
  };
  template <typename T, size_t N, typename U>
  struct replace_value_type<T[N],U> {
      typedef U (type)[N];
  };
}

#ifndef BOOST_SERIALIZATION_STD_ARRAY // legacy switch to disable BTAS-provided serialization of std:array
#define BOOST_SERIALIZATION_STD_ARRAY
#  if BOOST_VERSION / 100 < 1056
namespace boost {
  namespace serialization {

    template<class Archive, class T, size_t N>
    void serialize(Archive & ar, std::array<T,N> & a, const unsigned int version)
    {
        ar & boost::serialization::make_array(a.data(), a.size());
    }

  } // namespace serialization
} // namespace boost
#  endif // boost < 1.56 does not serialize std::array ... provide our own
#endif // not defined BOOST_SERIALIZATION_STD_ARRAY? provide our own

#endif /* __BTAS_ARRAYADAPTOR_H_ */