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
|
/*
Sets
*/
%include <std_set.i>
%fragment("StdUnorderedSetTraits","header",fragment="<stddef.h>",fragment="StdSetTraits")
%{
namespace swig {
template <class RubySeq, class Key, class Hash, class Compare, class Alloc>
inline void
assign(const RubySeq& rubyseq, std::unordered_set<Key,Hash,Compare,Alloc>* seq) {
// seq->insert(rubyseq.begin(), rubyseq.end()); // not used as not always implemented
typedef typename RubySeq::value_type value_type;
typename RubySeq::const_iterator it = rubyseq.begin();
for (;it != rubyseq.end(); ++it) {
seq->insert(seq->end(),(value_type)(*it));
}
}
template <class Key, class Hash, class Compare, class Alloc>
struct traits_asptr<std::unordered_set<Key,Hash,Compare,Alloc> > {
static int asptr(VALUE 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 VALUE 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(set...) %swig_set_methods(set)
%mixin std::unordered_set "Enumerable";
%rename("delete") std::unordered_set::__delete__;
%rename("reject!") std::unordered_set::reject_bang;
%rename("map!") std::unordered_set::map_bang;
%rename("empty?") std::unordered_set::empty;
%rename("include?" ) std::unordered_set::__contains__ const;
%rename("has_key?" ) std::unordered_set::has_key const;
%alias std::unordered_set::push "<<";
%include <std/std_unordered_set.i>
|
