into their own std_functors.i file. Made binarypredicate, etc. be templates to allow more strict predicates/functors. git-svn-id: https://swig.svn.sourceforge.net/svnroot/swig/trunk@9815 626c5289-ae23-0410-ae9c-e8d60b6d4f22
196 lines
5 KiB
Text
196 lines
5 KiB
Text
/**
|
|
* @file rubystdfunctors.swg
|
|
* @date Sun May 6 00:44:33 2007
|
|
*
|
|
* @brief This file provides unary and binary functors for STL
|
|
* containers, that will invoke a Ruby proc or method to do
|
|
* their operation.
|
|
*
|
|
* You can use them in a swig file like:
|
|
*
|
|
* %include <std_set.i>
|
|
* %include <std_functors.i>
|
|
*
|
|
* %template< IntSet > std::set< int, swig::BinaryPredicate<> >;
|
|
*
|
|
*
|
|
* which will then allow calling them from Ruby either like:
|
|
*
|
|
* # order of set is defined by C++ default
|
|
* a = IntSet.new
|
|
*
|
|
* # sort order defined by Ruby proc
|
|
* b = IntSet.new( proc { |a,b| a > b } )
|
|
*
|
|
*/
|
|
|
|
%include rubyclasses.swg
|
|
|
|
%{
|
|
/* This function can be used to check whether a proc or method or similarly
|
|
callable function has been passed. Usually used in a %typecheck. */
|
|
SWIGINTERN
|
|
int SWIG_Ruby_isCallable( VALUE proc )
|
|
{
|
|
static VALUE call_id = rb_intern("call");
|
|
if ( rb_respond_to( proc, call_id ) )
|
|
return 1;
|
|
return 0;
|
|
}
|
|
|
|
/* This function can be used to check the arity (number of arguments)
|
|
a proc or method can take. Usually used in a %typecheck.
|
|
Valid arities will be that equal to minimal or those < 0
|
|
which indicate a variable number of parameters at the end.
|
|
*/
|
|
SWIGINTERN
|
|
int SWIG_Ruby_arity( VALUE proc, int minimal )
|
|
{
|
|
static VALUE arity_id = rb_intern("arity");
|
|
if ( rb_respond_to( proc, arity_id ) )
|
|
{
|
|
VALUE num = rb_funcall( proc, arity_id, 0 );
|
|
int arity = NUM2INT(num);
|
|
if ( arity < 0 && (arity+1) < -minimal ) return 1;
|
|
if ( arity == minimal ) return 1;
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
%}
|
|
|
|
|
|
namespace swig {
|
|
|
|
%apply GC_VALUE { UnaryPredicate, BinaryPredicate, UnaryFunction,
|
|
BinaryFunction };
|
|
|
|
%typecheck(SWIG_TYPECHECK_POINTER,noblock=1)
|
|
UnaryPredicate, UnaryPredicate&, UnaryFunction, UnaryFunction&
|
|
{
|
|
$1 = SWIG_Ruby_isCallable($input) && SWIG_Ruby_arity($input, 1);
|
|
}
|
|
|
|
%typecheck(SWIG_TYPECHECK_POINTER,noblock=1)
|
|
BinaryPredicate, BinaryPredicate&, BinaryFunction, BinaryFunction& {
|
|
$1 = SWIG_Ruby_isCallable($input) && SWIG_Ruby_arity($input, 2);
|
|
}
|
|
|
|
%typemap(in,noblock=1) BinaryFunction&, BinaryFunction {
|
|
$1 = new swig::BinaryFunction< >($input);
|
|
}
|
|
%typemap(in,noblock=1) UnaryFunction&, UnaryFunction {
|
|
$1 = new swig::UnaryFunction< >($input);
|
|
}
|
|
|
|
%typemap(in,noblock=1) BinaryPredicate&, BinaryPredicate {
|
|
$1 = new swig::BinaryPredicate<>($input);
|
|
}
|
|
|
|
%typemap(in,noblock=1) UnaryPredicate&, UnaryPredicate {
|
|
$1 = new swig::UnaryPredicate< >($input);
|
|
}
|
|
|
|
|
|
%ignore BinaryFunction;
|
|
template< class _T = GC_VALUE >
|
|
struct BinaryFunction {
|
|
};
|
|
|
|
%ignore UnaryFunction;
|
|
template< class _T = GC_VALUE >
|
|
struct UnaryFunction {
|
|
};
|
|
|
|
%ignore BinaryPredicate;
|
|
template< class _T = GC_VALUE >
|
|
struct BinaryPredicate {
|
|
};
|
|
|
|
%ignore UnaryPredicate;
|
|
template< class _T = GC_VALUE >
|
|
struct UnaryPredicate {
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
%fragment("StdFunctors","header",fragment="StdTraits")
|
|
{
|
|
namespace swig {
|
|
|
|
static ID call_id = rb_intern("call");
|
|
|
|
template <class _T = GC_VALUE, class _DefaultFunc = std::less<GC_VALUE> >
|
|
struct BinaryPredicate : GC_VALUE, std::binary_function< _T, _T, bool >
|
|
{
|
|
BinaryPredicate(VALUE obj = Qnil) : GC_VALUE(obj) { }
|
|
bool operator()(_T a, _T b) const
|
|
{
|
|
if (_obj != Qnil) {
|
|
SWIG_RUBY_THREAD_BEGIN_BLOCK;
|
|
VALUE arg1 = swig::from(a);
|
|
VALUE arg2 = swig::from(b);
|
|
VALUE res = rb_funcall( _obj, swig::call_id, 2, arg1, arg2);
|
|
SWIG_RUBY_THREAD_END_BLOCK;
|
|
return RTEST(res);
|
|
} else {
|
|
return _DefaultFunc()(a, b);
|
|
}
|
|
}
|
|
};
|
|
|
|
template <class _T = GC_VALUE, class _DefaultFunc = std::less< _T > >
|
|
struct BinaryFunction : GC_VALUE, std::binary_function< _T, _T, _T >
|
|
{
|
|
BinaryFunction(VALUE obj = Qnil) : GC_VALUE(obj) { }
|
|
_T operator()(_T a, _T b) const
|
|
{
|
|
if (_obj != Qnil) {
|
|
SWIG_RUBY_THREAD_BEGIN_BLOCK;
|
|
VALUE arg1 = swig::from(a);
|
|
VALUE arg2 = swig::from(b);
|
|
VALUE res = rb_funcall( _obj, swig::call_id, 2, arg1, arg2);
|
|
SWIG_RUBY_THREAD_END_BLOCK;
|
|
return swig::as<_T >(res);
|
|
} else {
|
|
return _DefaultFunc()(a, b);
|
|
}
|
|
}
|
|
};
|
|
|
|
template< class _T = GC_VALUE >
|
|
struct UnaryPredicate : GC_VALUE, std::unary_function< _T, bool >
|
|
{
|
|
UnaryPredicate(VALUE obj = Qnil) : GC_VALUE(obj) { }
|
|
bool operator()(_T a) const
|
|
{
|
|
SWIG_RUBY_THREAD_BEGIN_BLOCK;
|
|
VALUE arg1 = swig::from<_T >(a);
|
|
VALUE res = rb_funcall( _obj, swig::call_id, 1, arg1);
|
|
SWIG_RUBY_THREAD_END_BLOCK;
|
|
return RTEST(res);
|
|
}
|
|
};
|
|
|
|
template< class _T = GC_VALUE >
|
|
struct UnaryFunction : GC_VALUE, std::unary_function< _T, _T >
|
|
{
|
|
UnaryFunction(VALUE obj = Qnil) : GC_VALUE(obj) { }
|
|
_T operator()(_T a) const
|
|
{
|
|
SWIG_RUBY_THREAD_BEGIN_BLOCK;
|
|
VALUE arg1 = swig::from(a);
|
|
VALUE res = rb_funcall( _obj, swig::call_id, 1, VALUE(arg1));
|
|
SWIG_RUBY_THREAD_END_BLOCK;
|
|
return swig::as< _T >(res);
|
|
}
|
|
};
|
|
|
|
} // namespace swig
|
|
|
|
}
|
|
|
|
|