// (C) Copyright Joel de Guzman 2003. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef MAP_INDEXING_SUITE_JDG20038_HPP # define MAP_INDEXING_SUITE_JDG20038_HPP # include # include # include # include namespace boost { namespace python { // Forward declaration template class map_indexing_suite; namespace detail { template class final_map_derived_policies : public map_indexing_suite > {}; } // The map_indexing_suite class is a predefined indexing_suite derived // class for wrapping std::vector (and std::vector like) classes. It provides // all the policies required by the indexing_suite (see indexing_suite). // Example usage: // // class X {...}; // // ... // // class_ >("XMap") // .def(map_indexing_suite >()) // ; // // By default indexed elements are returned by proxy. This can be // disabled by supplying *true* in the NoProxy template parameter. // template < class Container, bool NoProxy = false, class DerivedPolicies = detail::final_map_derived_policies > class map_indexing_suite : public indexing_suite< Container , DerivedPolicies , NoProxy , true , typename Container::value_type::second_type , typename Container::key_type , typename Container::key_type > { public: typedef typename Container::value_type value_type; typedef typename Container::value_type::second_type data_type; typedef typename Container::key_type key_type; typedef typename Container::key_type index_type; typedef typename Container::size_type size_type; typedef typename Container::difference_type difference_type; template static void extension_def(Class& cl) { // Wrap the map's element (value_type) std::string elem_name = "map_indexing_suite_"; object class_name(cl.attr("__name__")); extract class_name_extractor(class_name); elem_name += class_name_extractor(); elem_name += "_entry"; typedef typename mpl::if_< is_class , return_internal_reference<> , default_call_policies >::type get_data_return_policy; class_(elem_name.c_str()) .def("__repr__", &DerivedPolicies::print_elem) .def("data", &DerivedPolicies::get_data, get_data_return_policy()) .def("key", &DerivedPolicies::get_key) ; } static object print_elem(typename Container::value_type const& e) { return "(%s, %s)" % python::make_tuple(e.first, e.second); } static typename mpl::if_< is_class , data_type& , data_type >::type get_data(typename Container::value_type& e) { return e.second; } static typename Container::key_type get_key(typename Container::value_type& e) { return e.first; } static data_type& get_item(Container& container, index_type i_) { typename Container::iterator i = container.find(i_); if (i == container.end()) { PyErr_SetString(PyExc_KeyError, "Invalid key"); throw_error_already_set(); } return i->second; } static void set_item(Container& container, index_type i, data_type const& v) { container[i] = v; } static void delete_item(Container& container, index_type i) { container.erase(i); } static size_t size(Container& container) { return container.size(); } static bool contains(Container& container, key_type const& key) { return container.find(key) != container.end(); } static bool compare_index(Container& container, index_type a, index_type b) { return container.key_comp()(a, b); } static index_type convert_index(Container& container, PyObject* i_) { extract i(i_); if (i.check()) { return i(); } else { extract i(i_); if (i.check()) return i(); } PyErr_SetString(PyExc_TypeError, "Invalid index type"); throw_error_already_set(); return index_type(); } }; }} // namespace boost::python #endif // MAP_INDEXING_SUITE_JDG20038_HPP