Add std::array container wrappers for Python
These work much like any of the other STL containers except Python slicing is somewhat limited because the array is a fixed size. Only slices of the full size are supported.
This commit is contained in:
parent
4e8ea4e853
commit
55bbf68512
8 changed files with 500 additions and 57 deletions
91
Lib/python/std_array.i
Normal file
91
Lib/python/std_array.i
Normal file
|
|
@ -0,0 +1,91 @@
|
|||
/*
|
||||
std::array
|
||||
*/
|
||||
|
||||
%fragment("StdArrayTraits","header",fragment="StdSequenceTraits")
|
||||
%{
|
||||
namespace swig {
|
||||
template <class T, size_t N>
|
||||
struct traits_asptr<std::array<T, N> > {
|
||||
static int asptr(PyObject *obj, std::array<T, N> **vec) {
|
||||
return traits_asptr_stdseq<std::array<T, N> >::asptr(obj, vec);
|
||||
}
|
||||
};
|
||||
|
||||
template <class T, size_t N>
|
||||
struct traits_from<std::array<T, N> > {
|
||||
static PyObject *from(const std::array<T, N>& vec) {
|
||||
return traits_from_stdseq<std::array<T, N> >::from(vec);
|
||||
}
|
||||
};
|
||||
|
||||
template <class SwigPySeq, class T, size_t N>
|
||||
inline void
|
||||
assign(const SwigPySeq& swigpyseq, std::array<T, N>* seq) {
|
||||
if (swigpyseq.size() < seq->size())
|
||||
throw std::invalid_argument("std::array cannot be expanded in size");
|
||||
else if (swigpyseq.size() > seq->size())
|
||||
throw std::invalid_argument("std::array cannot be reduced in size");
|
||||
std::copy(swigpyseq.begin(), swigpyseq.end(), seq->begin());
|
||||
}
|
||||
|
||||
template <class T, size_t N>
|
||||
inline void
|
||||
erase(std::array<T, N>* seq, const typename std::array<T, N>::iterator& position) {
|
||||
throw std::invalid_argument("std::array object does not support item deletion");
|
||||
}
|
||||
|
||||
// Only limited slicing is supported as std::array is fixed in size
|
||||
template <class T, size_t N, class Difference>
|
||||
inline std::array<T, N>*
|
||||
getslice(const std::array<T, N>* self, Difference i, Difference j, Py_ssize_t step) {
|
||||
using Sequence = std::array<T, N>;
|
||||
typename Sequence::size_type size = self->size();
|
||||
Difference ii = 0;
|
||||
Difference jj = 0;
|
||||
swig::slice_adjust(i, j, step, size, ii, jj);
|
||||
|
||||
if (step == 1 && ii == 0 && jj == size) {
|
||||
Sequence *sequence = new Sequence();
|
||||
std::copy(self->begin(), self->end(), sequence->begin());
|
||||
return sequence;
|
||||
} else if (step == -1 && ii == (size - 1) && jj == -1) {
|
||||
Sequence *sequence = new Sequence();
|
||||
std::copy(self->rbegin(), self->rend(), sequence->begin());
|
||||
return sequence;
|
||||
} else {
|
||||
throw std::invalid_argument("std::array object only supports getting a slice that is the size of the array");
|
||||
}
|
||||
}
|
||||
|
||||
template <class T, size_t N, class Difference, class InputSeq>
|
||||
inline void
|
||||
setslice(std::array<T, N>* self, Difference i, Difference j, Py_ssize_t step, const InputSeq& is = InputSeq()) {
|
||||
using Sequence = std::array<T, N>;
|
||||
typename Sequence::size_type size = self->size();
|
||||
Difference ii = 0;
|
||||
Difference jj = 0;
|
||||
swig::slice_adjust(i, j, step, size, ii, jj, true);
|
||||
|
||||
if (step == 1 && ii == 0 && jj == size) {
|
||||
std::copy(is.begin(), is.end(), self->begin());
|
||||
} else if (step == -1 && ii == (size - 1) && jj == -1) {
|
||||
std::copy(is.rbegin(), is.rend(), self->begin());
|
||||
} else {
|
||||
throw std::invalid_argument("std::array object only supports setting a slice that is the size of the array");
|
||||
}
|
||||
}
|
||||
|
||||
template <class T, size_t N, class Difference>
|
||||
inline void
|
||||
delslice(std::array<T, N>* self, Difference i, Difference j, Py_ssize_t step) {
|
||||
throw std::invalid_argument("std::array object does not support item deletion");
|
||||
}
|
||||
}
|
||||
%}
|
||||
|
||||
#define %swig_array_methods(Type...) %swig_sequence_methods_non_resizable(Type)
|
||||
#define %swig_array_methods_val(Type...) %swig_sequence_methods_non_resizable_val(Type);
|
||||
|
||||
%include <std/std_array.i>
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue