diff options
Diffstat (limited to 'share/swig/3.0.12/python/std_unordered_set.i')
-rw-r--r-- | share/swig/3.0.12/python/std_unordered_set.i | 62 |
1 files changed, 62 insertions, 0 deletions
diff --git a/share/swig/3.0.12/python/std_unordered_set.i b/share/swig/3.0.12/python/std_unordered_set.i new file mode 100644 index 0000000..855a28d --- /dev/null +++ b/share/swig/3.0.12/python/std_unordered_set.i @@ -0,0 +1,62 @@ +/* + Unordered Sets +*/ + +%fragment("StdUnorderedSetTraits","header",fragment="StdSequenceTraits") +%{ + namespace swig { + template <class SwigPySeq, class T> + inline void + assign(const SwigPySeq& swigpyseq, std::unordered_set<T>* seq) { + // seq->insert(swigpyseq.begin(), swigpyseq.end()); // not used as not always implemented + typedef typename SwigPySeq::value_type value_type; + typename SwigPySeq::const_iterator it = swigpyseq.begin(); + for (;it != swigpyseq.end(); ++it) { + seq->insert(seq->end(),(value_type)(*it)); + } + } + + template <class T> + struct traits_reserve<std::unordered_set<T> > { + static void reserve(std::unordered_set<T> &seq, typename std::unordered_set<T>::size_type n) { + seq.reserve(n); + } + }; + + template <class T> + struct traits_asptr<std::unordered_set<T> > { + static int asptr(PyObject *obj, std::unordered_set<T> **s) { + return traits_asptr_stdseq<std::unordered_set<T> >::asptr(obj, s); + } + }; + + template <class T> + struct traits_from<std::unordered_set<T> > { + static PyObject *from(const std::unordered_set<T>& vec) { + return traits_from_stdseq<std::unordered_set<T> >::from(vec); + } + }; + } +%} + +%define %swig_unordered_set_methods(unordered_set...) + %swig_sequence_iterator(unordered_set); + %swig_container_methods(unordered_set); + + %extend { + void append(value_type x) { + self->insert(x); + } + + bool __contains__(value_type x) { + return self->find(x) != self->end(); + } + + value_type __getitem__(difference_type i) const throw (std::out_of_range) { + return *(swig::cgetpos(self, i)); + } + + }; +%enddef + +%include <std/std_unordered_set.i> |