/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_queue.i (3497B)
/** * @file std_queue.i * @date Sun May 6 01:48:07 2007 * * @brief A wrapping of std::queue for Ruby. * * */ %include // Queue %define %std_queue_methods(queue...) queue(); queue( const _Sequence& ); bool empty() const; size_type size() const; const value_type& front() const; const value_type& back() const; void pop(); void push( const value_type& ); %enddef %define %std_queue_methods_val(queue...) %std_queue_methods(queue) %enddef // ------------------------------------------------------------------------ // std::queue // // const declarations are used to guess the intent of the function being // exported; therefore, the following rationale is applied: // // -- f(std::queue), f(const std::queue&): // the parameter being read-only, either a sequence or a // previously wrapped std::queue can be passed. // -- f(std::queue&), f(std::queue*): // the parameter may be modified; therefore, only a wrapped std::queue // can be passed. // -- std::queue f(), const std::queue& f(): // the queue is returned by copy; therefore, a sequence of T:s // is returned which is most easily used in other functions // -- std::queue& f(), std::queue* f(): // the queue is returned by reference; therefore, a wrapped std::queue // is returned // -- const std::queue* f(), f(const std::queue*): // for consistency, they expect and return a plain queue pointer. // ------------------------------------------------------------------------ %{ #include %} // exported classes namespace std { template > class queue { public: typedef size_t size_type; typedef _Tp value_type; typedef value_type& reference; typedef const value_type& const_reference; typedef _Sequence container_type; %traits_swigtype(_Tp); %fragment(SWIG_Traits_frag(std::queue< _Tp, _Sequence >), "header", fragment=SWIG_Traits_frag(_Tp), fragment="StdQueueTraits") { namespace swig { template <> struct traits > { typedef pointer_category category; static const char* type_name() { return "std::queue<" #_Tp "," #_Sequence " >"; } }; } } %typemap_traits_ptr(SWIG_TYPECHECK_QUEUE, std::queue< _Tp, _Sequence >); #ifdef %swig_queue_methods // Add swig/language extra methods %swig_queue_methods(std::queue< _Tp, _Sequence >); #endif %std_queue_methods(queue); }; template class queue< _Tp*, _Sequence > { public: typedef size_t size_type; typedef _Tp value_type; typedef value_type& reference; typedef const value_type& const_reference; typedef _Sequence container_type; %traits_swigtype(_Tp); %fragment(SWIG_Traits_frag(std::queue< _Tp*, _Sequence >), "header", fragment=SWIG_Traits_frag(_Tp), fragment="StdQueueTraits") { namespace swig { template <> struct traits > { typedef value_category category; static const char* type_name() { return "std::queue<" #_Tp "," #_Sequence " * >"; } }; } } %typemap_traits_ptr(SWIG_TYPECHECK_QUEUE, std::queue< _Tp*, _Sequence >); #ifdef %swig_queue_methods_val // Add swig/language extra methods %swig_queue_methods_val(std::queue< _Tp*, _Sequence >); #endif %std_queue_methods_val(queue); }; }