1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
/*
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);
}
};
}
%}
%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();
}
value_type __getitem__(difference_type i) const throw (std::out_of_range) {
return *(swig::cgetpos(self, i));
}
}
%enddef
%include <std/std_unordered_set.i>
|
