class_<std::set<type> >(name, "mutable set") \
.def("__repr__", &PythonSetAccessor<type>::str) \
.def("__len__", &PythonSetAccessor<type>::size) \
.def("__contains__", &PythonSetAccessor<type>::contains) \
.def("add", &PythonSetAccessor<type>::add, "add element") \
.def("__delitem__", &PythonSetAccessor<type>::remove) \
.def("remove", &PythonSetAccessor<type>::remove, "remove element") \
.def("__iter__", boost::python::iterator<std::set<type> >()) \
.def("union", &PythonSetAccessor<type>::set_union, "set union") \
.def("__or__", &PythonSetAccessor<type>::set_union, "set union") \
.def("intersection", &PythonSetAccessor<type>::set_intersection, "set intersection") \
.def("__and__", &PythonSetAccessor<type>::set_intersection, "set intersection") \
.def("difference", &PythonSetAccessor<type>::set_difference, "elements not in second set") \
.def("__sub__", &PythonSetAccessor<type>::set_difference, "set difference") \
.def("symmetric_difference", &PythonSetAccessor<type>::set_symmetric_difference, "elements unique to either set") \
.def("__xor__", &PythonSetAccessor<type>::set_symmetric_difference, "symmetric set difference") \
footerfunctions;
void block_hashing(boost::python::object)
Definition: PythonSet.h:116