|
15 | 15 | #include <deque> |
16 | 16 | #include <map> |
17 | 17 | #include <unordered_map> |
| 18 | +#include <vector> |
18 | 19 |
|
19 | 20 | class El { |
20 | 21 | public: |
@@ -83,6 +84,71 @@ struct RecursiveMap : std::map<int, RecursiveMap> { |
83 | 84 | using Parent::Parent; |
84 | 85 | }; |
85 | 86 |
|
| 87 | +class UserVectorLike : private std::vector<int> { |
| 88 | +public: |
| 89 | + // This is only a subset of the member functions, as needed at the time. |
| 90 | + using Base = std::vector<int>; |
| 91 | + using typename Base::const_iterator; |
| 92 | + using typename Base::difference_type; |
| 93 | + using typename Base::iterator; |
| 94 | + using typename Base::size_type; |
| 95 | + using typename Base::value_type; |
| 96 | + |
| 97 | + using Base::at; |
| 98 | + using Base::back; |
| 99 | + using Base::Base; |
| 100 | + using Base::begin; |
| 101 | + using Base::cbegin; |
| 102 | + using Base::cend; |
| 103 | + using Base::clear; |
| 104 | + using Base::empty; |
| 105 | + using Base::end; |
| 106 | + using Base::erase; |
| 107 | + using Base::front; |
| 108 | + using Base::insert; |
| 109 | + using Base::pop_back; |
| 110 | + using Base::push_back; |
| 111 | + using Base::reserve; |
| 112 | + using Base::shrink_to_fit; |
| 113 | + using Base::swap; |
| 114 | + using Base::operator[]; |
| 115 | + using Base::capacity; |
| 116 | + using Base::size; |
| 117 | +}; |
| 118 | + |
| 119 | +bool operator==(UserVectorLike const &, UserVectorLike const &) { return true; } |
| 120 | +bool operator!=(UserVectorLike const &, UserVectorLike const &) { return false; } |
| 121 | + |
| 122 | +class UserMapLike : private std::map<int, int> { |
| 123 | +public: |
| 124 | + // This is only a subset of the member functions, as needed at the time. |
| 125 | + using Base = std::map<int, int>; |
| 126 | + using typename Base::const_iterator; |
| 127 | + using typename Base::iterator; |
| 128 | + using typename Base::key_type; |
| 129 | + using typename Base::mapped_type; |
| 130 | + using typename Base::size_type; |
| 131 | + using typename Base::value_type; |
| 132 | + |
| 133 | + using Base::at; |
| 134 | + using Base::Base; |
| 135 | + using Base::begin; |
| 136 | + using Base::cbegin; |
| 137 | + using Base::cend; |
| 138 | + using Base::clear; |
| 139 | + using Base::emplace; |
| 140 | + using Base::emplace_hint; |
| 141 | + using Base::empty; |
| 142 | + using Base::end; |
| 143 | + using Base::erase; |
| 144 | + using Base::find; |
| 145 | + using Base::insert; |
| 146 | + using Base::max_size; |
| 147 | + using Base::swap; |
| 148 | + using Base::operator[]; |
| 149 | + using Base::size; |
| 150 | +}; |
| 151 | + |
86 | 152 | /* |
87 | 153 | * Pybind11 does not catch more complicated recursion schemes, such as mutual |
88 | 154 | * recursion. |
@@ -173,6 +239,10 @@ TEST_SUBMODULE(stl_binders, m) { |
173 | 239 | py::bind_map<MutuallyRecursiveContainerPairMV>(m, "MutuallyRecursiveContainerPairMV"); |
174 | 240 | py::bind_vector<MutuallyRecursiveContainerPairVM>(m, "MutuallyRecursiveContainerPairVM"); |
175 | 241 |
|
| 242 | + // Bind with private inheritance + `using` directives. |
| 243 | + py::bind_vector<UserVectorLike>(m, "UserVectorLike"); |
| 244 | + py::bind_map<UserMapLike>(m, "UserMapLike"); |
| 245 | + |
176 | 246 | // The rest depends on numpy: |
177 | 247 | try { |
178 | 248 | py::module_::import("numpy"); |
|
0 commit comments