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
|
//
// immer: immutable data structures for C++
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//
#include <pybind11/pybind11.h>
#include <immer/vector.hpp>
#include <immer/refcount/unsafe_refcount_policy.hpp>
namespace {
struct heap_t
{
template <typename ...Tags>
static void* allocate(std::size_t size, Tags...)
{
return PyMem_Malloc(size);
}
template <typename ...Tags>
static void deallocate(std::size_t, void* obj, Tags...)
{
PyMem_Free(obj);
}
};
using memory_t = immer::memory_policy<
immer::unsafe_free_list_heap_policy<heap_t>,
immer::unsafe_refcount_policy>;
} // anonymous namespace
namespace py = pybind11;
PYBIND11_PLUGIN(immer_python_module)
{
py::module m("immer", R"pbdoc(
Immer
-----
.. currentmodule:: immer
.. autosummary::
:toctree: _generate
Vector
)pbdoc");
using vector_t = immer::vector<py::object, memory_t>;
py::class_<vector_t>(m, "Vector")
.def(py::init<>())
.def("__len__", &vector_t::size)
.def("__getitem__",
[] (const vector_t& v, std::size_t i) {
if (i > v.size())
throw py::index_error{"Index out of range"};
return v[i];
})
.def("append",
[] (const vector_t& v, py::object x) {
return v.push_back(std::move(x));
})
.def("set",
[] (const vector_t& v, std::size_t i, py::object x) {
return v.set(i, std::move(x));
});
#ifdef VERSION_INFO
m.attr("__version__") = py::str(VERSION_INFO);
#else
m.attr("__version__") = py::str("dev");
#endif
return m.ptr();
}
|
