50 lines
1.5 KiB
OpenEdge ABL
50 lines
1.5 KiB
OpenEdge ABL
/*
|
|
Sets
|
|
*/
|
|
|
|
%include <std_set.i>
|
|
|
|
%fragment("StdUnorderedSetTraits","header",fragment="<stddef.h>",fragment="StdSequenceTraits")
|
|
%{
|
|
namespace swig {
|
|
template <class RubySeq, class T>
|
|
inline void
|
|
assign(const RubySeq& rubyseq, std::unordered_set<T>* 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 T>
|
|
struct traits_asptr<std::unordered_set<T> > {
|
|
static int asptr(VALUE 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 VALUE from(const std::unordered_set<T>& vec) {
|
|
return traits_from_stdseq<std::unordered_set<T> >::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>
|