blob: c677f15d7a984a3d61c74275b5307e723b0eaeb0 [file] [log] [blame]
Wenzel Jakob38bd7112015-07-05 20:05:44 +02001/*
Jason Rhinelanderb3f3d792016-07-18 16:43:18 -04002 example/example-sequences-and-iterators.cpp -- supporting Pythons' sequence protocol, iterators,
Wenzel Jakoba576e6a2015-07-29 17:51:54 +02003 etc.
Wenzel Jakob38bd7112015-07-05 20:05:44 +02004
Wenzel Jakob8cb6cb32016-04-17 20:21:41 +02005 Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
Wenzel Jakob38bd7112015-07-05 20:05:44 +02006
7 All rights reserved. Use of this source code is governed by a
8 BSD-style license that can be found in the LICENSE file.
9*/
10
11#include "example.h"
Jason Rhinelander3f589372016-08-07 13:05:26 -040012#include "constructor-stats.h"
Wenzel Jakob8f4eb002015-10-15 18:13:33 +020013#include <pybind11/operators.h>
14#include <pybind11/stl.h>
Wenzel Jakob38bd7112015-07-05 20:05:44 +020015
16class Sequence {
17public:
18 Sequence(size_t size) : m_size(size) {
Jason Rhinelander3f589372016-08-07 13:05:26 -040019 print_created(this, "of size", m_size);
Wenzel Jakob38bd7112015-07-05 20:05:44 +020020 m_data = new float[size];
21 memset(m_data, 0, sizeof(float) * size);
22 }
23
24 Sequence(const std::vector<float> &value) : m_size(value.size()) {
Jason Rhinelander3f589372016-08-07 13:05:26 -040025 print_created(this, "of size", m_size, "from std::vector");
Wenzel Jakob38bd7112015-07-05 20:05:44 +020026 m_data = new float[m_size];
27 memcpy(m_data, &value[0], sizeof(float) * m_size);
28 }
29
30 Sequence(const Sequence &s) : m_size(s.m_size) {
Jason Rhinelander3f589372016-08-07 13:05:26 -040031 print_copy_created(this);
Wenzel Jakob38bd7112015-07-05 20:05:44 +020032 m_data = new float[m_size];
33 memcpy(m_data, s.m_data, sizeof(float)*m_size);
34 }
35
36 Sequence(Sequence &&s) : m_size(s.m_size), m_data(s.m_data) {
Jason Rhinelander3f589372016-08-07 13:05:26 -040037 print_move_created(this);
Wenzel Jakob38bd7112015-07-05 20:05:44 +020038 s.m_size = 0;
39 s.m_data = nullptr;
40 }
41
42 ~Sequence() {
Jason Rhinelander3f589372016-08-07 13:05:26 -040043 print_destroyed(this);
Wenzel Jakob38bd7112015-07-05 20:05:44 +020044 delete[] m_data;
45 }
46
47 Sequence &operator=(const Sequence &s) {
Jason Rhinelander3f589372016-08-07 13:05:26 -040048 if (&s != this) {
49 delete[] m_data;
50 m_size = s.m_size;
51 m_data = new float[m_size];
52 memcpy(m_data, s.m_data, sizeof(float)*m_size);
53 }
54
55 print_copy_assigned(this);
56
Wenzel Jakob38bd7112015-07-05 20:05:44 +020057 return *this;
58 }
59
60 Sequence &operator=(Sequence &&s) {
Wenzel Jakob38bd7112015-07-05 20:05:44 +020061 if (&s != this) {
62 delete[] m_data;
63 m_size = s.m_size;
64 m_data = s.m_data;
65 s.m_size = 0;
66 s.m_data = nullptr;
67 }
Jason Rhinelander3f589372016-08-07 13:05:26 -040068
69 print_move_assigned(this);
70
Wenzel Jakob38bd7112015-07-05 20:05:44 +020071 return *this;
72 }
73
74 bool operator==(const Sequence &s) const {
75 if (m_size != s.size())
76 return false;
77 for (size_t i=0; i<m_size; ++i)
78 if (m_data[i] != s[i])
79 return false;
80 return true;
81 }
82
83 bool operator!=(const Sequence &s) const {
84 return !operator==(s);
85 }
86
87 float operator[](size_t index) const {
88 return m_data[index];
89 }
90
91 float &operator[](size_t index) {
92 return m_data[index];
93 }
94
95 bool contains(float v) const {
96 for (size_t i=0; i<m_size; ++i)
97 if (v == m_data[i])
98 return true;
99 return false;
100 }
101
102 Sequence reversed() const {
103 Sequence result(m_size);
104 for (size_t i=0; i<m_size; ++i)
105 result[m_size-i-1] = m_data[i];
106 return result;
107 }
108
109 size_t size() const { return m_size; }
110
Wenzel Jakobb2825952016-04-13 23:33:00 +0200111 const float *begin() const { return m_data; }
112 const float *end() const { return m_data+m_size; }
113
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200114private:
115 size_t m_size;
116 float *m_data;
117};
118
Jason Rhinelanderb3f3d792016-07-18 16:43:18 -0400119void init_ex_sequences_and_iterators(py::module &m) {
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200120 py::class_<Sequence> seq(m, "Sequence");
121
122 seq.def(py::init<size_t>())
123 .def(py::init<const std::vector<float>&>())
124 /// Bare bones interface
125 .def("__getitem__", [](const Sequence &s, size_t i) {
126 if (i >= s.size())
127 throw py::index_error();
128 return s[i];
129 })
130 .def("__setitem__", [](Sequence &s, size_t i, float v) {
131 if (i >= s.size())
132 throw py::index_error();
133 s[i] = v;
134 })
135 .def("__len__", &Sequence::size)
136 /// Optional sequence protocol operations
Wenzel Jakobb2825952016-04-13 23:33:00 +0200137 .def("__iter__", [](const Sequence &s) { return py::make_iterator(s.begin(), s.end()); },
138 py::keep_alive<0, 1>() /* Essential: keep object alive while iterator exists */)
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200139 .def("__contains__", [](const Sequence &s, float v) { return s.contains(v); })
140 .def("__reversed__", [](const Sequence &s) -> Sequence { return s.reversed(); })
141 /// Slicing protocol (optional)
142 .def("__getitem__", [](const Sequence &s, py::slice slice) -> Sequence* {
Wenzel Jakob0a078052016-05-29 13:40:40 +0200143 size_t start, stop, step, slicelength;
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200144 if (!slice.compute(s.size(), &start, &stop, &step, &slicelength))
145 throw py::error_already_set();
146 Sequence *seq = new Sequence(slicelength);
Wenzel Jakob0a078052016-05-29 13:40:40 +0200147 for (size_t i=0; i<slicelength; ++i) {
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200148 (*seq)[i] = s[start]; start += step;
149 }
150 return seq;
151 })
152 .def("__setitem__", [](Sequence &s, py::slice slice, const Sequence &value) {
Wenzel Jakob0a078052016-05-29 13:40:40 +0200153 size_t start, stop, step, slicelength;
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200154 if (!slice.compute(s.size(), &start, &stop, &step, &slicelength))
155 throw py::error_already_set();
Wenzel Jakob0a078052016-05-29 13:40:40 +0200156 if (slicelength != value.size())
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200157 throw std::runtime_error("Left and right hand size of slice assignment have different sizes!");
Wenzel Jakob0a078052016-05-29 13:40:40 +0200158 for (size_t i=0; i<slicelength; ++i) {
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200159 s[start] = value[i]; start += step;
160 }
161 })
162 /// Comparisons
163 .def(py::self == py::self)
164 .def(py::self != py::self);
165 // Could also define py::self + py::self for concatenation, etc.
166
Wenzel Jakobb2825952016-04-13 23:33:00 +0200167#if 0
168 // Obsolete: special data structure for exposing custom iterator types to python
169 // kept here for illustrative purposes because there might be some use cases which
170 // are not covered by the much simpler py::make_iterator
171
172 struct PySequenceIterator {
173 PySequenceIterator(const Sequence &seq, py::object ref) : seq(seq), ref(ref) { }
174
175 float next() {
176 if (index == seq.size())
177 throw py::stop_iteration();
178 return seq[index++];
179 }
180
181 const Sequence &seq;
182 py::object ref; // keep a reference
183 size_t index = 0;
184 };
185
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200186 py::class_<PySequenceIterator>(seq, "Iterator")
187 .def("__iter__", [](PySequenceIterator &it) -> PySequenceIterator& { return it; })
188 .def("__next__", &PySequenceIterator::next);
Wenzel Jakobb2825952016-04-13 23:33:00 +0200189
190 On the actual Sequence object, the iterator would be constructed as follows:
191 .def("__iter__", [](py::object s) { return PySequenceIterator(s.cast<const Sequence &>(), s); })
192#endif
Wenzel Jakob38bd7112015-07-05 20:05:44 +0200193}