Lines Matching refs:std

28 bool operator==(const NonZeroIterator<std::pair<A, B>>& it, const NonZeroSentinel&) {
66 checks.append(static_cast<std::size_t>(x.end() - x.begin()) == x.size());
67 checks.append((x.begin() + static_cast<std::ptrdiff_t>(x.size())) == x.end());
90 return std::make_tuple(istart,istop,istep);
102 Sequence(const std::vector<float> &value) : m_size(value.size()) {
103 print_created(this, "of size", m_size, "from std::vector");
180 .def(py::init<const std::vector<float>&>())
212 throw std::runtime_error("Left and right hand size of slice assignment have different sizes!");
229 StringMap(std::unordered_map<std::string, std::string> init)
230 : map(std::move(init)) {}
232 void set(std::string key, std::string val) { map[key] = val; }
233 std::string get(std::string key) const { return map.at(key); }
236 std::unordered_map<std::string, std::string> map;
243 .def(py::init<std::unordered_map<std::string, std::string>>())
244 .def("__getitem__", [](const StringMap &map, std::string key) {
246 catch (const std::out_of_range&) {
261 IntPairs(std::vector<std::pair<int, int>> data) : data_(std::move(data)) {}
262 const std::pair<int, int>* begin() const { return data_.data(); }
264 std::vector<std::pair<int, int>> data_;
267 .def(py::init<std::vector<std::pair<int, int>>>())
269 return py::make_iterator(NonZeroIterator<std::pair<int, int>>(s.begin()), NonZeroSentinel());
272 return py::make_key_iterator(NonZeroIterator<std::pair<int, int>>(s.begin()), NonZeroSentinel());
322 // Make sure that py::iterator works with std algorithms
324 return std::count_if(o.begin(), o.end(), [](py::handle h) { return h.is_none(); });
328 auto it = std::find_if(o.begin(), o.end(), [](py::handle h) { return h.is_none(); });
333 return std::count_if(d.begin(), d.end(), [](std::pair<py::handle, py::handle> p) {
345 return py::make_iterator(std::begin(s), std::end(s));
350 static std::vector<int> list = { 1, 2, 3 };