Added an implementation of std_queue with tests.
git-svn-id: https://swig.svn.sourceforge.net/svnroot/swig/trunk@9779 626c5289-ae23-0410-ae9c-e8d60b6d4f22
This commit is contained in:
parent
5e27a6828a
commit
a7aa62ce68
6 changed files with 206 additions and 1 deletions
16
Examples/test-suite/ruby/li_std_queue.i
Normal file
16
Examples/test-suite/ruby/li_std_queue.i
Normal file
|
|
@ -0,0 +1,16 @@
|
||||||
|
/**
|
||||||
|
* @file std_queue.i
|
||||||
|
* @author gga
|
||||||
|
* @date Sun May 6 01:52:44 2007
|
||||||
|
*
|
||||||
|
* @brief test of std::queue
|
||||||
|
*
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
%module li_std_queue
|
||||||
|
|
||||||
|
%include std_queue.i
|
||||||
|
|
||||||
|
|
||||||
|
%template( IntQueue ) std::queue< int >;
|
||||||
32
Examples/test-suite/ruby/li_std_queue_runme.rb
Executable file
32
Examples/test-suite/ruby/li_std_queue_runme.rb
Executable file
|
|
@ -0,0 +1,32 @@
|
||||||
|
#!/usr/bin/env ruby
|
||||||
|
#
|
||||||
|
# A simple std::stack test
|
||||||
|
#
|
||||||
|
# Author::
|
||||||
|
# Copyright::
|
||||||
|
# License:: Ruby
|
||||||
|
#
|
||||||
|
|
||||||
|
require 'swig_assert'
|
||||||
|
|
||||||
|
require 'li_std_queue'
|
||||||
|
include Li_std_queue
|
||||||
|
|
||||||
|
swig_assert_each_line(<<'EOF', binding)
|
||||||
|
a = IntQueue.new
|
||||||
|
a << 1
|
||||||
|
a << 2
|
||||||
|
a << 3
|
||||||
|
a.back == 3
|
||||||
|
a.front == 1
|
||||||
|
a.pop
|
||||||
|
a.back == 3
|
||||||
|
a.front == 2
|
||||||
|
a.pop
|
||||||
|
a.back == 3
|
||||||
|
a.front == 3
|
||||||
|
a.pop
|
||||||
|
a.size == 0
|
||||||
|
a.empty? == true
|
||||||
|
|
||||||
|
EOF
|
||||||
24
Lib/ruby/std_queue.i
Normal file
24
Lib/ruby/std_queue.i
Normal file
|
|
@ -0,0 +1,24 @@
|
||||||
|
/*
|
||||||
|
Queues
|
||||||
|
*/
|
||||||
|
|
||||||
|
%fragment("StdQueueTraits","header",fragment="StdSequenceTraits")
|
||||||
|
%{
|
||||||
|
namespace swig {
|
||||||
|
template <class T>
|
||||||
|
struct traits_asptr<std::queue<T> > {
|
||||||
|
static int asptr(VALUE obj, std::queue<T> **vec) {
|
||||||
|
return traits_asptr_stdseq<std::queue<T> >::asptr(obj, vec);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct traits_from<std::queue<T> > {
|
||||||
|
static VALUE from(const std::queue<T> & vec) {
|
||||||
|
return traits_from_stdseq<std::queue<T> >::from(vec);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
}
|
||||||
|
%}
|
||||||
|
|
||||||
|
%include <std/std_queue.i>
|
||||||
132
Lib/std/std_queue.i
Normal file
132
Lib/std/std_queue.i
Normal file
|
|
@ -0,0 +1,132 @@
|
||||||
|
/**
|
||||||
|
* @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...)
|
||||||
|
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 _Alloc = allocator<_Tp> >
|
||||||
|
class queue {
|
||||||
|
public:
|
||||||
|
typedef size_t size_type;
|
||||||
|
typedef ptrdiff_t difference_type;
|
||||||
|
typedef _Tp value_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(_Tp);
|
||||||
|
|
||||||
|
%fragment(SWIG_Traits_frag(std::queue<_Tp, _Alloc >), "header",
|
||||||
|
fragment=SWIG_Traits_frag(_Tp),
|
||||||
|
fragment="StdQueueTraits") {
|
||||||
|
namespace swig {
|
||||||
|
template <> struct traits<std::queue<_Tp, _Alloc > > {
|
||||||
|
typedef pointer_category category;
|
||||||
|
static const char* type_name() {
|
||||||
|
return "std::queue<" #_Tp " >";
|
||||||
|
}
|
||||||
|
};
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
%typemap_traits_ptr(SWIG_TYPECHECK_QUEUE, std::queue<_Tp, _Alloc >);
|
||||||
|
|
||||||
|
#ifdef %swig_queue_methods
|
||||||
|
// Add swig/language extra methods
|
||||||
|
%swig_queue_methods(std::queue<_Tp, _Alloc >);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
%std_queue_methods(queue);
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class _Tp, class _Alloc >
|
||||||
|
class queue<_Tp*, _Alloc > {
|
||||||
|
public:
|
||||||
|
typedef size_t size_type;
|
||||||
|
typedef ptrdiff_t difference_type;
|
||||||
|
typedef _Tp* value_type;
|
||||||
|
typedef value_type* pointer;
|
||||||
|
typedef const value_type* const_pointer;
|
||||||
|
typedef value_type reference;
|
||||||
|
typedef value_type const_reference;
|
||||||
|
typedef _Alloc allocator_type;
|
||||||
|
|
||||||
|
%traits_swigtype(_Tp);
|
||||||
|
|
||||||
|
%fragment(SWIG_Traits_frag(std::queue<_Tp*, _Alloc >), "header",
|
||||||
|
fragment=SWIG_Traits_frag(_Tp),
|
||||||
|
fragment="StdQueueTraits") {
|
||||||
|
namespace swig {
|
||||||
|
template <> struct traits<std::queue<_Tp*, _Alloc > > {
|
||||||
|
typedef value_category category;
|
||||||
|
static const char* type_name() {
|
||||||
|
return "std::queue<" #_Tp " * >";
|
||||||
|
}
|
||||||
|
};
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
%typemap_traits_ptr(SWIG_TYPECHECK_QUEUE, std::queue<_Tp*, _Alloc >);
|
||||||
|
|
||||||
|
#ifdef %swig_queue_methods_val
|
||||||
|
// Add swig/language extra methods
|
||||||
|
%swig_queue_methods_val(std::queue<_Tp*, _Alloc >);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
%std_queue_methods_val(std::queue<_Tp*, _Alloc >);
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -14,7 +14,7 @@
|
||||||
%define %std_stack_methods(stack...)
|
%define %std_stack_methods(stack...)
|
||||||
bool empty() const;
|
bool empty() const;
|
||||||
size_type size() const;
|
size_type size() const;
|
||||||
const value_type& top();
|
const value_type& top() const;
|
||||||
void pop();
|
void pop();
|
||||||
void push( const value_type& );
|
void push( const value_type& );
|
||||||
%enddef
|
%enddef
|
||||||
|
|
|
||||||
|
|
@ -542,6 +542,7 @@ namespace std {
|
||||||
%define SWIG_TYPECHECK_MAP 210 %enddef
|
%define SWIG_TYPECHECK_MAP 210 %enddef
|
||||||
%define SWIG_TYPECHECK_MULTIMAP 220 %enddef
|
%define SWIG_TYPECHECK_MULTIMAP 220 %enddef
|
||||||
%define SWIG_TYPECHECK_STACK 230 %enddef
|
%define SWIG_TYPECHECK_STACK 230 %enddef
|
||||||
|
%define SWIG_TYPECHECK_QUEUE 240 %enddef
|
||||||
|
|
||||||
%define SWIG_TYPECHECK_BOOL_ARRAY 1015 %enddef
|
%define SWIG_TYPECHECK_BOOL_ARRAY 1015 %enddef
|
||||||
%define SWIG_TYPECHECK_INT8_ARRAY 1025 %enddef
|
%define SWIG_TYPECHECK_INT8_ARRAY 1025 %enddef
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue