/usr/share/swig/3.0.12/std
NameSizeModeActions
std_alloc.i20150644editdlrm
std_array.i25840644editdlrm
std_basic_string.i65000644editdlrm
std_carray.swg14160644editdlrm
std_char_traits.i31900644editdlrm
std_common.i53910644editdlrm
std_container.i42970644editdlrm
std_deque.i34940644editdlrm
std_except.i11910644editdlrm
std_ios.i52140644editdlrm
std_iostream.i88530644editdlrm
std_list.i38780644editdlrm
std_map.i36800644editdlrm
std_multimap.i32580644editdlrm
std_multiset.i25400644editdlrm
std_pair.i37120644editdlrm
std_queue.i34970644editdlrm
std_set.i33620644editdlrm
std_sstream.i53230644editdlrm
std_stack.i34710644editdlrm
std_streambuf.i17410644editdlrm
std_string.i2190644editdlrm
std_unordered_map.i41930644editdlrm
std_unordered_multimap.i32780644editdlrm
std_unordered_multiset.i30120644editdlrm
std_unordered_set.i38690644editdlrm
std_vector.i61670644editdlrm
std_vectora.i1470644editdlrm
std_wios.i900644editdlrm
std_wiostream.i1000644editdlrm
std_wsstream.i980644editdlrm
std_wstreambuf.i1020644editdlrm
std_wstring.i2490644editdlrm
_std_deque.i44370644editdlrm
Edit: /usr/share/swig/3.0.12/std/std_set.i (3362B)
// // std::set // %include %include // Set %define %std_set_methods_common(set...) set(); set( const set& ); bool empty() const; size_type size() const; void clear(); void swap(set& v); size_type erase(const key_type& x); size_type count(const key_type& x) const; #ifdef SWIG_EXPORT_ITERATOR_METHODS class iterator; class reverse_iterator; iterator begin(); iterator end(); reverse_iterator rbegin(); reverse_iterator rend(); %extend { // %extend wrapper used for differing definitions of these methods introduced in C++11 void erase(iterator pos) { $self->erase(pos); } void erase(iterator first, iterator last) { $self->erase(first, last); } } iterator find(const key_type& x); iterator lower_bound(const key_type& x); iterator upper_bound(const key_type& x); std::pair equal_range(const key_type& x); #endif %enddef %define %std_set_methods(set...) %std_set_methods_common(set); #ifdef SWIG_EXPORT_ITERATOR_METHODS std::pair insert(const value_type& __x); #endif %enddef // ------------------------------------------------------------------------ // std::set // // const declarations are used to guess the intent of the function being // exported; therefore, the following rationale is applied: // // -- f(std::set), f(const std::set&): // the parameter being read-only, either a sequence or a // previously wrapped std::set can be passed. // -- f(std::set&), f(std::set*): // the parameter may be modified; therefore, only a wrapped std::set // can be passed. // -- std::set f(), const std::set& f(): // the set is returned by copy; therefore, a sequence of T:s // is returned which is most easily used in other functions // -- std::set& f(), std::set* f(): // the set is returned by reference; therefore, a wrapped std::set // is returned // -- const std::set* f(), f(const std::set*): // for consistency, they expect and return a plain set pointer. // ------------------------------------------------------------------------ %{ #include %} // exported classes namespace std { template , class _Alloc = allocator< _Key > > class set { public: typedef size_t size_type; typedef ptrdiff_t difference_type; typedef _Key value_type; typedef _Key key_type; typedef value_type* pointer; typedef const value_type* const_pointer; typedef value_type& reference; typedef const value_type& const_reference; typedef _Alloc allocator_type; %traits_swigtype(_Key); %fragment(SWIG_Traits_frag(std::set< _Key, _Compare, _Alloc >), "header", fragment=SWIG_Traits_frag(_Key), fragment="StdSetTraits") { namespace swig { template <> struct traits > { typedef pointer_category category; static const char* type_name() { return "std::set<" #_Key "," #_Compare "," #_Alloc " >"; } }; } } %typemap_traits_ptr(SWIG_TYPECHECK_SET, std::set< _Key, _Compare, _Alloc >); set( const _Compare& ); #ifdef %swig_set_methods // Add swig/language extra methods %swig_set_methods(std::set< _Key, _Compare, _Alloc >); #endif %std_set_methods(set); }; }