Lib/python/std_unordered_set.i

/*
  Unordered Sets
*/

%fragment("StdUnorderedSetTraits","header",fragment="StdSequenceTraits")
%{
  namespace swig {
    template <class Key, class Hash, class Compare, class Alloc>
    struct traits_reserve<std::unordered_set<Key,Hash,Compare,Alloc> >  {
      static void reserve(std::unordered_set<Key,Hash,Compare,Alloc> &seq, typename std::unordered_set<Key,Hash,Compare,Alloc>::size_type n) {
        seq.reserve(n);
      }
    };

    template <class Key, class Hash, class Compare, class Alloc>
    struct traits_asptr<std::unordered_set<Key,Hash,Compare,Alloc> >  {
      static int asptr(PyObject *obj, std::unordered_set<Key,Hash,Compare,Alloc> **s) {
	return traits_asptr_stdseq<std::unordered_set<Key,Hash,Compare,Alloc> >::asptr(obj, s);
      }
    };

    template <class Key, class Hash, class Compare, class Alloc>
    struct traits_from<std::unordered_set<Key,Hash,Compare,Alloc> > {
      static PyObject *from(const std::unordered_set<Key,Hash,Compare,Alloc>& vec) {
	return traits_from_stdseq<std::unordered_set<Key,Hash,Compare,Alloc> >::from(vec);
      }
    };
  }
%}

// A set of Python objects takes anything, so the catch-all __contains__ overload is redundant
%ignore std::unordered_set<swig::SwigPtr_PyObject>::__contains__(PyObject *);

%define %swig_unordered_set_methods(unordered_set...)
  %swig_sequence_forward_iterator(unordered_set);
  %swig_container_methods(unordered_set);

#if defined(SWIGPYTHON_BUILTIN)
  %feature("python:slot", "sq_contains", functype="objobjproc") __contains__;
  %feature("python:slot", "mp_subscript", functype="binaryfunc") __getitem__;
#endif


  %extend {
     void append(value_type x) {
       self->insert(x);
     }
  
     bool __contains__(value_type x) {
       return self->find(x) != self->end();
     }

     bool __contains__(PyObject *) {
       return false;
     }

     value_type __getitem__(difference_type i) const throw (std::out_of_range) {
       return *(swig::cgetpos(self, i));
     }

     void add(value_type x) {
       self->insert(x);
     }

     void discard(value_type x) {
       self->erase(x);
     }
  }
%enddef

%include <std/std_unordered_set.i>