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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/**
* @file std_queue.i
* @date Sun May 6 01:48:07 2007
*
* @brief A wrapping of std::queue for Ruby.
*
*
*/
%include <std_container.i>
// 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<T>), f(const std::queue<T>&):
// the parameter being read-only, either a sequence or a
// previously wrapped std::queue<T> can be passed.
// -- f(std::queue<T>&), f(std::queue<T>*):
// the parameter may be modified; therefore, only a wrapped std::queue
// can be passed.
// -- std::queue<T> f(), const std::queue<T>& 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<T>& f(), std::queue<T>* f():
// the queue is returned by reference; therefore, a wrapped std::queue
// is returned
// -- const std::queue<T>* f(), f(const std::queue<T>*):
// for consistency, they expect and return a plain queue pointer.
// ------------------------------------------------------------------------
%{
#include <queue>
%}
// exported classes
namespace std {
template<class _Tp, class _Sequence = std::deque<_Tp> >
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<std::queue<_Tp, _Sequence > > {
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 _Tp, class _Sequence >
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<std::queue<_Tp*, _Sequence > > {
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(std::queue<_Tp*, _Sequence >);
};
}
|
