--- quantlib-swig-1.3.orig/Ruby/quantlib_wrap.cpp +++ quantlib-swig-1.3/Ruby/quantlib_wrap.cpp @@ -1,6 +1,6 @@ /* ---------------------------------------------------------------------------- * This file was automatically generated by SWIG (http://www.swig.org). - * Version 2.0.10 + * Version 2.0.8 * * This file is not intended to be easily readable and contains a number of * coding conventions designed to improve portability and efficiency. Do not make @@ -422,7 +422,7 @@ return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0; } #else /* no cast-rank mode */ -# define SWIG_AddCast(r) (r) +# define SWIG_AddCast # define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0) #endif @@ -486,18 +486,18 @@ /* Check type equivalence in a name list like ||... - Return 0 if equal, -1 if nb < tb, 1 if nb > tb + Return 0 if not equal, 1 if equal */ SWIGRUNTIME int -SWIG_TypeCmp(const char *nb, const char *tb) { - int equiv = 1; +SWIG_TypeEquiv(const char *nb, const char *tb) { + int equiv = 0; const char* te = tb + strlen(tb); const char* ne = nb; - while (equiv != 0 && *ne) { + while (!equiv && *ne) { for (nb = ne; *ne; ++ne) { if (*ne == '|') break; } - equiv = SWIG_TypeNameComp(nb, ne, tb, te); + equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0; if (*ne) ++ne; } return equiv; @@ -505,13 +505,24 @@ /* Check type equivalence in a name list like ||... - Return 0 if not equal, 1 if equal + Return 0 if equal, -1 if nb < tb, 1 if nb > tb */ SWIGRUNTIME int -SWIG_TypeEquiv(const char *nb, const char *tb) { - return SWIG_TypeCmp(nb, tb) == 0 ? 1 : 0; +SWIG_TypeCompare(const char *nb, const char *tb) { + int equiv = 0; + const char* te = tb + strlen(tb); + const char* ne = nb; + while (!equiv && *ne) { + for (nb = ne; *ne; ++ne) { + if (*ne == '|') break; + } + equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0; + if (*ne) ++ne; + } + return equiv; } + /* Check the typename */ @@ -1387,7 +1398,7 @@ /* Runtime API */ -#define SWIG_GetModule(clientdata) SWIG_Ruby_GetModule(clientdata) +#define SWIG_GetModule(clientdata) SWIG_Ruby_GetModule() #define SWIG_SetModule(clientdata, pointer) SWIG_Ruby_SetModule(pointer) @@ -1723,7 +1734,7 @@ } SWIGRUNTIME swig_module_info * -SWIG_Ruby_GetModule(void *SWIGUNUSEDPARM(clientdata)) +SWIG_Ruby_GetModule(void) { VALUE pointer; swig_module_info *ret = 0; @@ -1763,7 +1774,7 @@ SWIGINTERN int SWIG_Ruby_isCallable( VALUE proc ) { - if ( rb_respond_to( proc, swig_call_id ) ) + if ( rb_respond_to( proc, swig_call_id ) == Qtrue ) return 1; return 0; } @@ -1776,7 +1787,7 @@ SWIGINTERN int SWIG_Ruby_arity( VALUE proc, int minimal ) { - if ( rb_respond_to( proc, swig_arity_id ) ) + if ( rb_respond_to( proc, swig_arity_id ) == Qtrue ) { VALUE num = rb_funcall( proc, swig_arity_id, 0 ); int arity = NUM2INT(num); @@ -2530,7 +2541,7 @@ #define SWIG_RUBY_THREAD_END_BLOCK -#define SWIGVERSION 0x020010 +#define SWIGVERSION 0x020008 #define SWIG_VERSION SWIGVERSION @@ -2588,64 +2599,11 @@ namespace swig { - class SwigGCReferences { - // Hash of all GC_VALUE's currently in use - static SwigGCReferences s_references; - - VALUE _hash; - - SwigGCReferences() : _hash(Qnil) { - } - ~SwigGCReferences() { - if (_hash != Qnil) - rb_gc_unregister_address(&_hash); - } - static void EndProcHandler(VALUE) { - // Ruby interpreter ending - _hash can no longer be accessed. - s_references._hash = Qnil; - } - public: - static SwigGCReferences& instance() { - return s_references; - } - static void initialize() { - if (s_references._hash == Qnil) { - rb_set_end_proc(&EndProcHandler, Qnil); - s_references._hash = rb_hash_new(); - rb_gc_register_address(&s_references._hash); - } - } - void GC_register(VALUE& obj) { - if (FIXNUM_P(obj) || SPECIAL_CONST_P(obj) || SYMBOL_P(obj)) - return; - if (_hash != Qnil) { - VALUE val = rb_hash_aref(_hash, obj); - unsigned n = FIXNUM_P(val) ? NUM2UINT(val) : 0; - ++n; - rb_hash_aset(_hash, obj, INT2NUM(n)); - } - } - void GC_unregister(const VALUE& obj) { - if (FIXNUM_P(obj) || SPECIAL_CONST_P(obj) || SYMBOL_P(obj)) - return; - // this test should not be needed but I've noticed some very erratic - // behavior of none being unregistered in some very rare situations. - if (BUILTIN_TYPE(obj) == T_NONE) - return; - if (_hash != Qnil) { - VALUE val = rb_hash_aref(s_references._hash, obj); - unsigned n = FIXNUM_P(val) ? NUM2UINT(val) : 1; - --n; - if (n) - rb_hash_aset(s_references._hash, obj, INT2NUM(n)); - else - rb_hash_delete(s_references._hash, obj); - } - } - }; - class GC_VALUE { protected: + // Hash of all GC_VALUE's currently in use + static VALUE _hash; + VALUE _obj; static ID hash_id; @@ -2682,33 +2640,75 @@ public: - GC_VALUE() : _obj(Qnil) + static void initialize() + { + if ( _hash == Qnil ) + { + _hash = rb_hash_new(); + rb_gc_register_address( &_hash ); + } + } + + // this function is never called. Provided for symmetry only. + static void cleanup() + { + rb_gc_unregister_address( &_hash ); + } + + GC_VALUE() : _obj( Qnil ) { } GC_VALUE(const GC_VALUE& item) : _obj(item._obj) { - SwigGCReferences::instance().GC_register(_obj); + GC_register(); } GC_VALUE(VALUE obj) :_obj(obj) { - SwigGCReferences::instance().GC_register(_obj); + GC_register(); } ~GC_VALUE() { - SwigGCReferences::instance().GC_unregister(_obj); + GC_unregister(); } GC_VALUE & operator=(const GC_VALUE& item) { - SwigGCReferences::instance().GC_unregister(_obj); + GC_unregister(); _obj = item._obj; - SwigGCReferences::instance().GC_register(_obj); + GC_register(); return *this; } + void GC_register() + { + if ( FIXNUM_P(_obj) || SPECIAL_CONST_P(_obj) || SYMBOL_P(_obj) ) + return; + VALUE val = rb_hash_aref( _hash, _obj ); + unsigned n = FIXNUM_P(val) ? NUM2UINT(val) : 0; + ++n; + rb_hash_aset( _hash, _obj, INT2NUM(n) ); + } + + void GC_unregister() + { + if ( FIXNUM_P(_obj) || SPECIAL_CONST_P(_obj) || SYMBOL_P(_obj) ) + return; + // this test should not be needed but I've noticed some very erratic + // behavior of none being unregistered in some very rare situations. + if ( BUILTIN_TYPE(_obj) == T_NONE ) return; + + VALUE val = rb_hash_aref( _hash, _obj ); + unsigned n = FIXNUM_P(val) ? NUM2UINT(val) : 1; + --n; + if ( n ) + rb_hash_aset( _hash, _obj, INT2NUM(n) ); + else + rb_hash_delete( _hash, _obj ); + } + operator VALUE() const { return _obj; @@ -2724,110 +2724,113 @@ return rb_inspect(_obj); } - static VALUE swig_rescue_swallow(VALUE) - { - /* - VALUE errstr = rb_obj_as_string(rb_errinfo()); - printf("Swallowing error: '%s'\n", RSTRING_PTR(StringValue(errstr))); - */ - return Qnil; /* Swallow Ruby exception */ - } - - static VALUE swig_rescue_funcall(VALUE p) + static VALUE swig_protect_funcall( VALUE p ) { OpArgs* args = (OpArgs*) p; - return rb_funcall(args->src, args->id, args->nargs, args->target); + return rb_funcall( args->src, args->id, args->nargs, args->target ); } - bool relational_equal_op(const GC_VALUE& other, const ID& op_id, bool (*op_func)(const VALUE& a, const VALUE& b)) const - { - if (FIXNUM_P(_obj) && FIXNUM_P(other._obj)) { - return op_func(_obj, other._obj); - } - bool res = false; - VALUE ret = Qnil; - SWIG_RUBY_THREAD_BEGIN_BLOCK; - if (rb_respond_to(_obj, op_id)) { - OpArgs args; - args.src = _obj; - args.id = op_id; - args.nargs = 1; - args.target = VALUE(other); - ret = rb_rescue(RUBY_METHOD_FUNC(swig_rescue_funcall), VALUE(&args), - (RUBY_METHOD_FUNC(swig_rescue_swallow)), Qnil); - } - if (ret == Qnil) { - VALUE a = rb_funcall( _obj, hash_id, 0 ); - VALUE b = rb_funcall( VALUE(other), hash_id, 0 ); - res = op_func(a, b); - } else { - res = RTEST(ret); - } - SWIG_RUBY_THREAD_END_BLOCK; - return res; + +#define GC_VALUE_CMP( op_id, op, cmp, cmpval ) \ + bool op( const GC_VALUE& other ) const \ + { \ + if ( FIXNUM_P(_obj) && FIXNUM_P(other._obj) ) \ + { \ + return _obj cmp other._obj; \ + } \ + bool res = false; \ + VALUE ret = Qnil; \ + SWIG_RUBY_THREAD_BEGIN_BLOCK; \ + if ( rb_respond_to( _obj, op_id ) == Qtrue ) \ + { \ + int status; \ + OpArgs args; \ + args.src = _obj; \ + args.id = op_id; \ + args.nargs = 1; \ + args.target = VALUE(other); \ + ret = rb_protect( PROTECTFUNC(swig_protect_funcall), \ + VALUE(&args), &status ); \ + } \ + if ( ret == Qnil ) { \ + VALUE a = rb_funcall( _obj, hash_id, 0 ); \ + VALUE b = rb_funcall( VALUE(other), hash_id, 0 ); \ + res = a cmp b; \ + } \ + else \ + { \ + res = RTEST( ret ); \ + } \ + SWIG_RUBY_THREAD_END_BLOCK; \ + return res; \ } - static bool operator_eq(const VALUE& a, const VALUE& b) { return a == b; } - static bool operator_lt(const VALUE& a, const VALUE& b) { return a < b; } - static bool operator_le(const VALUE& a, const VALUE& b) { return a <= b; } - static bool operator_gt(const VALUE& a, const VALUE& b) { return a > b; } - static bool operator_ge(const VALUE& a, const VALUE& b) { return a >= b; } - - bool operator==(const GC_VALUE& other) const { return relational_equal_op(other, eq_id, operator_eq); } - bool operator<(const GC_VALUE& other) const { return relational_equal_op(other, lt_id, operator_lt); } - bool operator<=(const GC_VALUE& other) const { return relational_equal_op(other, le_id, operator_le); } - bool operator>(const GC_VALUE& other) const { return relational_equal_op(other, gt_id, operator_gt); } - bool operator>=(const GC_VALUE& other) const { return relational_equal_op(other, ge_id, operator_ge); } - bool operator!=(const GC_VALUE& other) const + GC_VALUE_CMP( eq_id, operator==, ==, == 0 ) + GC_VALUE_CMP( lt_id, operator<, < , < 0 ) + GC_VALUE_CMP( le_id, operator<=, <=, <= 0 ) + GC_VALUE_CMP( gt_id, operator>, > , > 0 ) + GC_VALUE_CMP( ge_id, operator>=, >=, >= 0 ) +#undef GC_VALUE_CMP + + bool operator!=( const GC_VALUE& other ) { return !(this->operator==(other)); } - GC_VALUE unary_op(const ID& op_id) const - { - VALUE ret = Qnil; - SWIG_RUBY_THREAD_BEGIN_BLOCK; - OpArgs args; - args.src = _obj; - args.id = op_id; - args.nargs = 0; - args.target = Qnil; - ret = rb_rescue(RUBY_METHOD_FUNC(swig_rescue_funcall), VALUE(&args), - (RUBY_METHOD_FUNC(swig_rescue_swallow)), Qnil); - SWIG_RUBY_THREAD_END_BLOCK; - return ret; - } +#define GC_VALUE_UNARY( proc_id, op ) \ + GC_VALUE op() const \ + { \ + VALUE ret = Qnil; \ + SWIG_RUBY_THREAD_BEGIN_BLOCK; \ + int status; \ + OpArgs args; \ + args.src = _obj; \ + args.id = proc_id; \ + args.nargs = 0; \ + args.target = Qnil; \ + ret = rb_protect( PROTECTFUNC(swig_protect_funcall), VALUE(&args), \ + &status ); \ + SWIG_RUBY_THREAD_END_BLOCK; \ + return ret; \ + } + + GC_VALUE_UNARY( pos_id, operator+ ) + GC_VALUE_UNARY( neg_id, operator- ) + GC_VALUE_UNARY( inv_id, operator~ ) +#undef GC_VALUE_BINARY + +#define GC_VALUE_BINARY( proc_id, op ) \ + GC_VALUE op( const GC_VALUE& other ) const \ + { \ + VALUE ret = Qnil; \ + SWIG_RUBY_THREAD_BEGIN_BLOCK; \ + int status; \ + OpArgs args; \ + args.src = _obj; \ + args.id = proc_id; \ + args.nargs = 1; \ + args.target = VALUE(other); \ + ret = rb_protect( PROTECTFUNC(swig_protect_funcall), VALUE(&args), \ + &status ); \ + SWIG_RUBY_THREAD_END_BLOCK; \ + return GC_VALUE(ret); \ + } + + GC_VALUE_BINARY( add_id, operator+ ); + GC_VALUE_BINARY( sub_id, operator- ); + GC_VALUE_BINARY( mul_id, operator* ); + GC_VALUE_BINARY( div_id, operator/ ); + GC_VALUE_BINARY( mod_id, operator% ); + + GC_VALUE_BINARY( and_id, operator& ); + GC_VALUE_BINARY( xor_id, operator^ ); + GC_VALUE_BINARY( or_id, operator| ); + + GC_VALUE_BINARY( lshift_id, operator<< ); + GC_VALUE_BINARY( rshift_id, operator>> ); +#undef GC_VALUE_BINARY - GC_VALUE operator+() const { return unary_op(pos_id); } - GC_VALUE operator-() const { return unary_op(neg_id); } - GC_VALUE operator~() const { return unary_op(inv_id); } - - GC_VALUE binary_op(const GC_VALUE& other, const ID& op_id) const - { - VALUE ret = Qnil; - SWIG_RUBY_THREAD_BEGIN_BLOCK; - OpArgs args; - args.src = _obj; - args.id = op_id; - args.nargs = 1; - args.target = VALUE(other); - ret = rb_rescue(RUBY_METHOD_FUNC(swig_rescue_funcall), VALUE(&args), - (RUBY_METHOD_FUNC(swig_rescue_swallow)), Qnil); - SWIG_RUBY_THREAD_END_BLOCK; - return GC_VALUE(ret); - } - - GC_VALUE operator+(const GC_VALUE& other) const { return binary_op(other, add_id); } - GC_VALUE operator-(const GC_VALUE& other) const { return binary_op(other, sub_id); } - GC_VALUE operator*(const GC_VALUE& other) const { return binary_op(other, mul_id); } - GC_VALUE operator/(const GC_VALUE& other) const { return binary_op(other, div_id); } - GC_VALUE operator%(const GC_VALUE& other) const { return binary_op(other, mod_id); } - GC_VALUE operator&(const GC_VALUE& other) const { return binary_op(other, and_id); } - GC_VALUE operator^(const GC_VALUE& other) const { return binary_op(other, xor_id); } - GC_VALUE operator|(const GC_VALUE& other) const { return binary_op(other, or_id); } - GC_VALUE operator<<(const GC_VALUE& other) const { return binary_op(other, lshift_id); } - GC_VALUE operator>>(const GC_VALUE& other) const { return binary_op(other, rshift_id); } }; ID GC_VALUE::hash_id = rb_intern("hash"); @@ -2854,7 +2857,7 @@ ID GC_VALUE::lshift_id = rb_intern("<<"); ID GC_VALUE::rshift_id = rb_intern(">>"); - SwigGCReferences SwigGCReferences::s_references; + VALUE GC_VALUE::_hash = Qnil; typedef GC_VALUE LANGUAGE_OBJ; @@ -3146,7 +3149,7 @@ } -/*@SWIG:/usr/local/share/swig/2.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/ +/*@SWIG:/usr/share/swig2.0/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/ SWIGINTERN VALUE SWIG_AUX_NUM2ULONG(VALUE *args) { VALUE obj = args[0]; @@ -3192,7 +3195,7 @@ } -/*@SWIG:/usr/local/share/swig/2.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/ +/*@SWIG:/usr/share/swig2.0/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/ SWIGINTERN VALUE SWIG_AUX_NUM2LONG(VALUE *args) { VALUE obj = args[0]; @@ -3403,7 +3406,11 @@ SWIG_AsCharPtrAndSize(VALUE obj, char** cptr, size_t* psize, int *alloc) { if (TYPE(obj) == T_STRING) { + #if defined(StringValuePtr) char *cstr = StringValuePtr(obj); + #else + char *cstr = STR2CSTR(obj); + #endif size_t size = RSTRING_LEN(obj) + 1; if (cptr) { if (alloc) { @@ -5016,6 +5023,25 @@ return r; } +SWIGINTERN std::vector< Period,std::allocator< Period > > *std_vector_Sl_Period_Sg__reject_bang(std::vector< Period > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_Period_Sg__delete_at(std::vector< Period > *self,std::vector< Period >::difference_type i){ VALUE r = Qnil; try { @@ -5032,14 +5058,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< Period,std::allocator< Period > > *std_vector_Sl_Period_Sg__reject_bang(std::vector< Period > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_Period_Sg__pop(std::vector< Period > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -5385,6 +5403,25 @@ return r; } +SWIGINTERN std::vector< Date,std::allocator< Date > > *std_vector_Sl_Date_Sg__reject_bang(std::vector< Date > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_Date_Sg__delete_at(std::vector< Date > *self,std::vector< Date >::difference_type i){ VALUE r = Qnil; try { @@ -5401,14 +5438,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< Date,std::allocator< Date > > *std_vector_Sl_Date_Sg__reject_bang(std::vector< Date > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_Date_Sg__pop(std::vector< Date > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -5729,6 +5758,25 @@ return r; } +SWIGINTERN std::vector< int,std::allocator< int > > *std_vector_Sl_int_Sg__reject_bang(std::vector< int > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_int_Sg__delete_at(std::vector< int > *self,std::vector< int >::difference_type i){ VALUE r = Qnil; try { @@ -5745,14 +5793,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< int,std::allocator< int > > *std_vector_Sl_int_Sg__reject_bang(std::vector< int > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_int_Sg__pop(std::vector< int > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -6111,6 +6151,25 @@ return r; } +SWIGINTERN std::vector< unsigned int,std::allocator< unsigned int > > *std_vector_Sl_unsigned_SS_int_Sg__reject_bang(std::vector< unsigned int > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_unsigned_SS_int_Sg__delete_at(std::vector< unsigned int > *self,std::vector< unsigned int >::difference_type i){ VALUE r = Qnil; try { @@ -6127,14 +6186,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< unsigned int,std::allocator< unsigned int > > *std_vector_Sl_unsigned_SS_int_Sg__reject_bang(std::vector< unsigned int > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_unsigned_SS_int_Sg__pop(std::vector< unsigned int > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -6348,7 +6399,7 @@ return r; } -/*@SWIG:/usr/local/share/swig/2.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/ +/*@SWIG:/usr/share/swig2.0/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/ SWIGINTERN VALUE SWIG_AUX_NUM2DBL(VALUE *args) { VALUE obj = args[0]; @@ -6502,6 +6553,25 @@ return r; } +SWIGINTERN std::vector< double,std::allocator< double > > *std_vector_Sl_double_Sg__reject_bang(std::vector< double > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_double_Sg__delete_at(std::vector< double > *self,std::vector< double >::difference_type i){ VALUE r = Qnil; try { @@ -6518,14 +6588,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< double,std::allocator< double > > *std_vector_Sl_double_Sg__reject_bang(std::vector< double > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_double_Sg__pop(std::vector< double > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -6879,6 +6941,25 @@ return r; } +SWIGINTERN std::vector< std::string,std::allocator< std::string > > *std_vector_Sl_std_string_Sg__reject_bang(std::vector< std::string > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_std_string_Sg__delete_at(std::vector< std::string > *self,std::vector< std::string >::difference_type i){ VALUE r = Qnil; try { @@ -6895,14 +6976,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< std::string,std::allocator< std::string > > *std_vector_Sl_std_string_Sg__reject_bang(std::vector< std::string > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_std_string_Sg__pop(std::vector< std::string > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -7238,6 +7311,25 @@ return r; } +SWIGINTERN std::vector< bool,std::allocator< bool > > *std_vector_Sl_bool_Sg__reject_bang(std::vector< bool > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_bool_Sg__delete_at(std::vector< bool > *self,std::vector< bool >::difference_type i){ VALUE r = Qnil; try { @@ -7254,14 +7346,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< bool,std::allocator< bool > > *std_vector_Sl_bool_Sg__reject_bang(std::vector< bool > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_bool_Sg__pop(std::vector< bool > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -7761,6 +7845,25 @@ return r; } +SWIGINTERN std::vector< std::pair< Date,double >,std::allocator< std::pair< Date,double > > > *std_vector_Sl_std_pair_Sl_Date_Sc_double_Sg__Sg__reject_bang(std::vector< std::pair< Date,double > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< std::pair< Date,double > > >::iterator i = self->begin(); + std::vector,std::allocator< std::pair< Date,double > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< std::pair< Date,double > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_std_pair_Sl_Date_Sc_double_Sg__Sg__delete_at(std::vector< std::pair< Date,double > > *self,std::vector< std::pair< Date,double > >::difference_type i){ VALUE r = Qnil; try { @@ -7777,14 +7880,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< std::pair< Date,double >,std::allocator< std::pair< Date,double > > > *std_vector_Sl_std_pair_Sl_Date_Sc_double_Sg__Sg__reject_bang(std::vector< std::pair< Date,double > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< std::pair< Date,double > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_std_pair_Sl_Date_Sc_double_Sg__Sg__pop(std::vector< std::pair< Date,double > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< std::pair< Date,double > > >::value_type x = self->back(); @@ -8304,6 +8399,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > *std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Quote > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< Quote > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< Quote > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< Quote > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__delete_at(std::vector< boost::shared_ptr< Quote > > *self,std::vector< boost::shared_ptr< Quote > >::difference_type i){ VALUE r = Qnil; try { @@ -8320,14 +8434,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > *std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Quote > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< Quote > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__pop(std::vector< boost::shared_ptr< Quote > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< Quote > > >::value_type x = self->back(); @@ -8605,6 +8711,25 @@ return r; } +SWIGINTERN std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *std_vector_Sl_std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__Sg__reject_bang(std::vector< std::vector< boost::shared_ptr< Quote > > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__Sg__delete_at(std::vector< std::vector< boost::shared_ptr< Quote > > > *self,std::vector< std::vector< boost::shared_ptr< Quote > > >::difference_type i){ VALUE r = Qnil; try { @@ -8621,14 +8746,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *std_vector_Sl_std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__Sg__reject_bang(std::vector< std::vector< boost::shared_ptr< Quote > > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__Sg__pop(std::vector< std::vector< boost::shared_ptr< Quote > > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > >::value_type x = self->back(); @@ -8914,6 +9031,25 @@ return r; } +SWIGINTERN std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > *std_vector_Sl_Handle_Sl_Quote_Sg__Sg__reject_bang(std::vector< Handle< Quote > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< Handle< Quote > > >::iterator i = self->begin(); + std::vector,std::allocator< Handle< Quote > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< Handle< Quote > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_Handle_Sl_Quote_Sg__Sg__delete_at(std::vector< Handle< Quote > > *self,std::vector< Handle< Quote > >::difference_type i){ VALUE r = Qnil; try { @@ -8930,14 +9066,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > *std_vector_Sl_Handle_Sl_Quote_Sg__Sg__reject_bang(std::vector< Handle< Quote > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< Handle< Quote > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_Handle_Sl_Quote_Sg__Sg__pop(std::vector< Handle< Quote > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< Handle< Quote > > >::value_type x = self->back(); @@ -9215,6 +9343,25 @@ return r; } +SWIGINTERN std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *std_vector_Sl_std_vector_Sl_Handle_Sl_Quote_Sg__Sg__Sg__reject_bang(std::vector< std::vector< Handle< Quote > > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > >::iterator i = self->begin(); + std::vector,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_std_vector_Sl_Handle_Sl_Quote_Sg__Sg__Sg__delete_at(std::vector< std::vector< Handle< Quote > > > *self,std::vector< std::vector< Handle< Quote > > >::difference_type i){ VALUE r = Qnil; try { @@ -9231,14 +9378,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *std_vector_Sl_std_vector_Sl_Handle_Sl_Quote_Sg__Sg__Sg__reject_bang(std::vector< std::vector< Handle< Quote > > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_std_vector_Sl_Handle_Sl_Quote_Sg__Sg__Sg__pop(std::vector< std::vector< Handle< Quote > > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > >::value_type x = self->back(); @@ -9524,6 +9663,25 @@ return r; } +SWIGINTERN std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > *std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__reject_bang(std::vector< RelinkableHandle< Quote > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< RelinkableHandle< Quote > > >::iterator i = self->begin(); + std::vector,std::allocator< RelinkableHandle< Quote > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< RelinkableHandle< Quote > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__delete_at(std::vector< RelinkableHandle< Quote > > *self,std::vector< RelinkableHandle< Quote > >::difference_type i){ VALUE r = Qnil; try { @@ -9540,14 +9698,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > *std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__reject_bang(std::vector< RelinkableHandle< Quote > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< RelinkableHandle< Quote > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__pop(std::vector< RelinkableHandle< Quote > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< RelinkableHandle< Quote > > >::value_type x = self->back(); @@ -9825,6 +9975,25 @@ return r; } +SWIGINTERN std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *std_vector_Sl_std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__Sg__reject_bang(std::vector< std::vector< RelinkableHandle< Quote > > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > >::iterator i = self->begin(); + std::vector,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__Sg__delete_at(std::vector< std::vector< RelinkableHandle< Quote > > > *self,std::vector< std::vector< RelinkableHandle< Quote > > >::difference_type i){ VALUE r = Qnil; try { @@ -9841,14 +10010,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *std_vector_Sl_std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__Sg__reject_bang(std::vector< std::vector< RelinkableHandle< Quote > > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__Sg__pop(std::vector< std::vector< RelinkableHandle< Quote > > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > >::value_type x = self->back(); @@ -10489,6 +10650,25 @@ return r; } +SWIGINTERN std::vector< IntervalPrice,std::allocator< IntervalPrice > > *std_vector_Sl_IntervalPrice_Sg__reject_bang(std::vector< IntervalPrice > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector >::iterator i = self->begin(); + std::vector >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_IntervalPrice_Sg__delete_at(std::vector< IntervalPrice > *self,std::vector< IntervalPrice >::difference_type i){ VALUE r = Qnil; try { @@ -10505,14 +10685,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< IntervalPrice,std::allocator< IntervalPrice > > *std_vector_Sl_IntervalPrice_Sg__reject_bang(std::vector< IntervalPrice > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_IntervalPrice_Sg__pop(std::vector< IntervalPrice > *self){ if (self->empty()) return Qnil; std::vector >::value_type x = self->back(); @@ -11822,6 +11994,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< StochasticProcess >,std::allocator< boost::shared_ptr< StochasticProcess > > > *std_vector_Sl_boost_shared_ptr_Sl_StochasticProcess_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< StochasticProcess > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< StochasticProcess > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< StochasticProcess > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< StochasticProcess > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_StochasticProcess_Sg__Sg__delete_at(std::vector< boost::shared_ptr< StochasticProcess > > *self,std::vector< boost::shared_ptr< StochasticProcess > >::difference_type i){ VALUE r = Qnil; try { @@ -11838,14 +12029,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< StochasticProcess >,std::allocator< boost::shared_ptr< StochasticProcess > > > *std_vector_Sl_boost_shared_ptr_Sl_StochasticProcess_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< StochasticProcess > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< StochasticProcess > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_StochasticProcess_Sg__Sg__pop(std::vector< boost::shared_ptr< StochasticProcess > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< StochasticProcess > > >::value_type x = self->back(); @@ -13040,6 +13223,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< Instrument >,std::allocator< boost::shared_ptr< Instrument > > > *std_vector_Sl_boost_shared_ptr_Sl_Instrument_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Instrument > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< Instrument > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< Instrument > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< Instrument > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Instrument_Sg__Sg__delete_at(std::vector< boost::shared_ptr< Instrument > > *self,std::vector< boost::shared_ptr< Instrument > >::difference_type i){ VALUE r = Qnil; try { @@ -13056,14 +13258,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< Instrument >,std::allocator< boost::shared_ptr< Instrument > > > *std_vector_Sl_boost_shared_ptr_Sl_Instrument_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Instrument > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< Instrument > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Instrument_Sg__Sg__pop(std::vector< boost::shared_ptr< Instrument > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< Instrument > > >::value_type x = self->back(); @@ -13624,6 +13818,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< CashFlow >,std::allocator< boost::shared_ptr< CashFlow > > > *std_vector_Sl_boost_shared_ptr_Sl_CashFlow_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< CashFlow > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< CashFlow > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< CashFlow > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< CashFlow > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_CashFlow_Sg__Sg__delete_at(std::vector< boost::shared_ptr< CashFlow > > *self,std::vector< boost::shared_ptr< CashFlow > >::difference_type i){ VALUE r = Qnil; try { @@ -13640,14 +13853,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< CashFlow >,std::allocator< boost::shared_ptr< CashFlow > > > *std_vector_Sl_boost_shared_ptr_Sl_CashFlow_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< CashFlow > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< CashFlow > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_CashFlow_Sg__Sg__pop(std::vector< boost::shared_ptr< CashFlow > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< CashFlow > > >::value_type x = self->back(); @@ -14700,6 +14905,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< Callability >,std::allocator< boost::shared_ptr< Callability > > > *std_vector_Sl_boost_shared_ptr_Sl_Callability_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Callability > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< Callability > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< Callability > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< Callability > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Callability_Sg__Sg__delete_at(std::vector< boost::shared_ptr< Callability > > *self,std::vector< boost::shared_ptr< Callability > >::difference_type i){ VALUE r = Qnil; try { @@ -14716,14 +14940,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< Callability >,std::allocator< boost::shared_ptr< Callability > > > *std_vector_Sl_boost_shared_ptr_Sl_Callability_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Callability > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< Callability > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Callability_Sg__Sg__pop(std::vector< boost::shared_ptr< Callability > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< Callability > > >::value_type x = self->back(); @@ -15066,6 +15282,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< Dividend >,std::allocator< boost::shared_ptr< Dividend > > > *std_vector_Sl_boost_shared_ptr_Sl_Dividend_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Dividend > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< Dividend > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< Dividend > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< Dividend > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Dividend_Sg__Sg__delete_at(std::vector< boost::shared_ptr< Dividend > > *self,std::vector< boost::shared_ptr< Dividend > >::difference_type i){ VALUE r = Qnil; try { @@ -15082,14 +15317,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< Dividend >,std::allocator< boost::shared_ptr< Dividend > > > *std_vector_Sl_boost_shared_ptr_Sl_Dividend_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< Dividend > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< Dividend > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_Dividend_Sg__Sg__pop(std::vector< boost::shared_ptr< Dividend > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< Dividend > > >::value_type x = self->back(); @@ -15534,6 +15761,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< DefaultProbabilityHelper >,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_DefaultProbabilityHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_DefaultProbabilityHelper_Sg__Sg__delete_at(std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *self,std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::difference_type i){ VALUE r = Qnil; try { @@ -15550,14 +15796,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< DefaultProbabilityHelper >,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_DefaultProbabilityHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_DefaultProbabilityHelper_Sg__Sg__pop(std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > >::value_type x = self->back(); @@ -16305,6 +16543,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< ZeroHelper >,std::allocator< boost::shared_ptr< ZeroHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_ZeroHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< ZeroHelper > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< ZeroHelper > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< ZeroHelper > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< ZeroHelper > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_ZeroHelper_Sg__Sg__delete_at(std::vector< boost::shared_ptr< ZeroHelper > > *self,std::vector< boost::shared_ptr< ZeroHelper > >::difference_type i){ VALUE r = Qnil; try { @@ -16321,14 +16578,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< ZeroHelper >,std::allocator< boost::shared_ptr< ZeroHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_ZeroHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< ZeroHelper > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< ZeroHelper > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_ZeroHelper_Sg__Sg__pop(std::vector< boost::shared_ptr< ZeroHelper > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< ZeroHelper > > >::value_type x = self->back(); @@ -16614,6 +16863,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< YoYHelper >,std::allocator< boost::shared_ptr< YoYHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_YoYHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< YoYHelper > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< YoYHelper > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< YoYHelper > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< YoYHelper > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_YoYHelper_Sg__Sg__delete_at(std::vector< boost::shared_ptr< YoYHelper > > *self,std::vector< boost::shared_ptr< YoYHelper > >::difference_type i){ VALUE r = Qnil; try { @@ -16630,14 +16898,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< YoYHelper >,std::allocator< boost::shared_ptr< YoYHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_YoYHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< YoYHelper > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< YoYHelper > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_YoYHelper_Sg__Sg__pop(std::vector< boost::shared_ptr< YoYHelper > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< YoYHelper > > >::value_type x = self->back(); @@ -17437,6 +17697,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< RateHelper >,std::allocator< boost::shared_ptr< RateHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_RateHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< RateHelper > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< RateHelper > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< RateHelper > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< RateHelper > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_RateHelper_Sg__Sg__delete_at(std::vector< boost::shared_ptr< RateHelper > > *self,std::vector< boost::shared_ptr< RateHelper > >::difference_type i){ VALUE r = Qnil; try { @@ -17453,14 +17732,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< RateHelper >,std::allocator< boost::shared_ptr< RateHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_RateHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< RateHelper > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< RateHelper > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_RateHelper_Sg__Sg__pop(std::vector< boost::shared_ptr< RateHelper > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< RateHelper > > >::value_type x = self->back(); @@ -17849,6 +18120,25 @@ return r; } +SWIGINTERN std::vector< boost::shared_ptr< CalibrationHelper >,std::allocator< boost::shared_ptr< CalibrationHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_CalibrationHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< CalibrationHelper > > *self){ + if ( !rb_block_given_p() ) + rb_raise( rb_eArgError, "no block given" ); + + std::vector,std::allocator< boost::shared_ptr< CalibrationHelper > > >::iterator i = self->begin(); + std::vector,std::allocator< boost::shared_ptr< CalibrationHelper > > >::iterator e = self->end(); + for ( ; i != e; ) + { + VALUE r = swig::from< std::vector,std::allocator< boost::shared_ptr< CalibrationHelper > > >::value_type >(*i); + if ( RTEST( rb_yield(r) ) ) { + self->erase(i++); + e = self->end(); + } else { + ++i; + } + } + + return self; + } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_CalibrationHelper_Sg__Sg__delete_at(std::vector< boost::shared_ptr< CalibrationHelper > > *self,std::vector< boost::shared_ptr< CalibrationHelper > >::difference_type i){ VALUE r = Qnil; try { @@ -17865,14 +18155,6 @@ VALUE r = Qnil; return r; } -SWIGINTERN std::vector< boost::shared_ptr< CalibrationHelper >,std::allocator< boost::shared_ptr< CalibrationHelper > > > *std_vector_Sl_boost_shared_ptr_Sl_CalibrationHelper_Sg__Sg__reject_bang(std::vector< boost::shared_ptr< CalibrationHelper > > *self){ - if ( !rb_block_given_p() ) - rb_raise( rb_eArgError, "no block given" ); - - self->erase( std::remove_if( self->begin(), self->end(), - swig::yield< std::vector,std::allocator< boost::shared_ptr< CalibrationHelper > > >::value_type >() ), self->end() ); - return self; - } SWIGINTERN VALUE std_vector_Sl_boost_shared_ptr_Sl_CalibrationHelper_Sg__Sg__pop(std::vector< boost::shared_ptr< CalibrationHelper > > *self){ if (self->empty()) return Qnil; std::vector,std::allocator< boost::shared_ptr< CalibrationHelper > > >::value_type x = self->back(); @@ -20687,6 +20969,49 @@ /* + Document-method: QuantLibc::PeriodVector.reject! + + call-seq: + reject! -> PeriodVector + +Iterate thru each element in the PeriodVector and reject those that fail a condition. A block must be provided. PeriodVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_PeriodVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< Period > *arg1 = (std::vector< Period > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< Period,std::allocator< Period > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_Period_std__allocatorT_Period_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Period > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< Period > * >(argp1); + { + try { + result = (std::vector< Period,std::allocator< Period > > *)std_vector_Sl_Period_Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_Period_std__allocatorT_Period_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::PeriodVector.delete_at call-seq: @@ -20783,49 +21108,6 @@ /* - Document-method: QuantLibc::PeriodVector.reject! - - call-seq: - reject! -> PeriodVector - -Iterate thru each element in the PeriodVector and reject those that fail a condition. A block must be provided. PeriodVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_PeriodVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< Period > *arg1 = (std::vector< Period > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< Period,std::allocator< Period > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_Period_std__allocatorT_Period_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Period > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< Period > * >(argp1); - { - try { - result = (std::vector< Period,std::allocator< Period > > *)std_vector_Sl_Period_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_Period_std__allocatorT_Period_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::PeriodVector.pop call-seq: @@ -21610,10 +21892,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Period > const &","vector<(Period)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Period > const &","std::vector<(Period)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Period > const &","vector<(Period)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Period > const &","std::vector<(Period)>", 1, argv[0])); } arg1 = ptr; } @@ -22031,7 +22313,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Period >::size_type","vector<(Period)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Period >::size_type","std::vector<(Period)>", 1, argv[0] )); } arg1 = static_cast< std::vector< Period >::size_type >(val1); { @@ -22312,15 +22594,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Period >::size_type","vector<(Period)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Period >::size_type","std::vector<(Period)>", 1, argv[0] )); } arg1 = static_cast< std::vector< Period >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Period, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< Period >::value_type const &","vector<(Period)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< Period >::value_type const &","std::vector<(Period)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Period >::value_type const &","vector<(Period)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Period >::value_type const &","std::vector<(Period)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< Period >::value_type * >(argp2); { @@ -24938,6 +25220,49 @@ /* + Document-method: QuantLibc::DateVector.reject! + + call-seq: + reject! -> DateVector + +Iterate thru each element in the DateVector and reject those that fail a condition. A block must be provided. DateVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_DateVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< Date > *arg1 = (std::vector< Date > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< Date,std::allocator< Date > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_Date_std__allocatorT_Date_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Date > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< Date > * >(argp1); + { + try { + result = (std::vector< Date,std::allocator< Date > > *)std_vector_Sl_Date_Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_Date_std__allocatorT_Date_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::DateVector.delete_at call-seq: @@ -25034,49 +25359,6 @@ /* - Document-method: QuantLibc::DateVector.reject! - - call-seq: - reject! -> DateVector - -Iterate thru each element in the DateVector and reject those that fail a condition. A block must be provided. DateVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_DateVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< Date > *arg1 = (std::vector< Date > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< Date,std::allocator< Date > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_Date_std__allocatorT_Date_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Date > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< Date > * >(argp1); - { - try { - result = (std::vector< Date,std::allocator< Date > > *)std_vector_Sl_Date_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_Date_std__allocatorT_Date_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::DateVector.pop call-seq: @@ -25861,10 +26143,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Date > const &","vector<(Date)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Date > const &","std::vector<(Date)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Date > const &","vector<(Date)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Date > const &","std::vector<(Date)>", 1, argv[0])); } arg1 = ptr; } @@ -26282,7 +26564,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Date >::size_type","vector<(Date)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Date >::size_type","std::vector<(Date)>", 1, argv[0] )); } arg1 = static_cast< std::vector< Date >::size_type >(val1); { @@ -26563,15 +26845,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Date >::size_type","vector<(Date)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Date >::size_type","std::vector<(Date)>", 1, argv[0] )); } arg1 = static_cast< std::vector< Date >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Date, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< Date >::value_type const &","vector<(Date)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< Date >::value_type const &","std::vector<(Date)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Date >::value_type const &","vector<(Date)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Date >::value_type const &","std::vector<(Date)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< Date >::value_type * >(argp2); { @@ -28729,6 +29011,49 @@ /* + Document-method: QuantLibc::IntVector.reject! + + call-seq: + reject! -> IntVector + +Iterate thru each element in the IntVector and reject those that fail a condition. A block must be provided. IntVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_IntVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< int > *arg1 = (std::vector< int > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< int,std::allocator< int > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_int_std__allocatorT_int_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< int > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< int > * >(argp1); + { + try { + result = (std::vector< int,std::allocator< int > > *)std_vector_Sl_int_Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_int_std__allocatorT_int_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::IntVector.delete_at call-seq: @@ -28824,49 +29149,6 @@ /* - Document-method: QuantLibc::IntVector.reject! - - call-seq: - reject! -> IntVector - -Iterate thru each element in the IntVector and reject those that fail a condition. A block must be provided. IntVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_IntVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< int > *arg1 = (std::vector< int > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< int,std::allocator< int > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_int_std__allocatorT_int_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< int > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< int > * >(argp1); - { - try { - result = (std::vector< int,std::allocator< int > > *)std_vector_Sl_int_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_int_std__allocatorT_int_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::IntVector.pop call-seq: @@ -29650,10 +29932,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< int > const &","vector<(int)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< int > const &","std::vector<(int)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< int > const &","vector<(int)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< int > const &","std::vector<(int)>", 1, argv[0])); } arg1 = ptr; } @@ -30071,7 +30353,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< int >::size_type","vector<(int)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< int >::size_type","std::vector<(int)>", 1, argv[0] )); } arg1 = static_cast< std::vector< int >::size_type >(val1); { @@ -30353,12 +30635,12 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< int >::size_type","vector<(int)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< int >::size_type","std::vector<(int)>", 1, argv[0] )); } arg1 = static_cast< std::vector< int >::size_type >(val1); ecode2 = SWIG_AsVal_int(argv[1], &val2); if (!SWIG_IsOK(ecode2)) { - SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< int >::value_type","vector<(int)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< int >::value_type","std::vector<(int)>", 2, argv[1] )); } temp2 = static_cast< std::vector< int >::value_type >(val2); arg2 = &temp2; @@ -31426,6 +31708,49 @@ /* + Document-method: QuantLibc::UnsignedIntVector.reject! + + call-seq: + reject! -> UnsignedIntVector + +Iterate thru each element in the UnsignedIntVector and reject those that fail a condition. A block must be provided. UnsignedIntVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_UnsignedIntVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< unsigned int > *arg1 = (std::vector< unsigned int > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< unsigned int,std::allocator< unsigned int > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_unsigned_int_std__allocatorT_unsigned_int_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< unsigned int > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< unsigned int > * >(argp1); + { + try { + result = (std::vector< unsigned int,std::allocator< unsigned int > > *)std_vector_Sl_unsigned_SS_int_Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_unsigned_int_std__allocatorT_unsigned_int_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::UnsignedIntVector.delete_at call-seq: @@ -31521,49 +31846,6 @@ /* - Document-method: QuantLibc::UnsignedIntVector.reject! - - call-seq: - reject! -> UnsignedIntVector - -Iterate thru each element in the UnsignedIntVector and reject those that fail a condition. A block must be provided. UnsignedIntVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_UnsignedIntVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< unsigned int > *arg1 = (std::vector< unsigned int > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< unsigned int,std::allocator< unsigned int > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_unsigned_int_std__allocatorT_unsigned_int_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< unsigned int > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< unsigned int > * >(argp1); - { - try { - result = (std::vector< unsigned int,std::allocator< unsigned int > > *)std_vector_Sl_unsigned_SS_int_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_unsigned_int_std__allocatorT_unsigned_int_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::UnsignedIntVector.pop call-seq: @@ -32347,10 +32629,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< unsigned int > const &","vector<(unsigned int)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< unsigned int > const &","std::vector<(unsigned int)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< unsigned int > const &","vector<(unsigned int)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< unsigned int > const &","std::vector<(unsigned int)>", 1, argv[0])); } arg1 = ptr; } @@ -32768,7 +33050,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< unsigned int >::size_type","vector<(unsigned int)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< unsigned int >::size_type","std::vector<(unsigned int)>", 1, argv[0] )); } arg1 = static_cast< std::vector< unsigned int >::size_type >(val1); { @@ -33050,12 +33332,12 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< unsigned int >::size_type","vector<(unsigned int)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< unsigned int >::size_type","std::vector<(unsigned int)>", 1, argv[0] )); } arg1 = static_cast< std::vector< unsigned int >::size_type >(val1); ecode2 = SWIG_AsVal_unsigned_SS_int(argv[1], &val2); if (!SWIG_IsOK(ecode2)) { - SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< unsigned int >::value_type","vector<(unsigned int)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< unsigned int >::value_type","std::vector<(unsigned int)>", 2, argv[1] )); } temp2 = static_cast< std::vector< unsigned int >::value_type >(val2); arg2 = &temp2; @@ -34123,6 +34405,49 @@ /* + Document-method: QuantLibc::DoubleVector.reject! + + call-seq: + reject! -> DoubleVector + +Iterate thru each element in the DoubleVector and reject those that fail a condition. A block must be provided. DoubleVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_DoubleVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< double > *arg1 = (std::vector< double > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< double,std::allocator< double > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_double_std__allocatorT_double_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< double > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< double > * >(argp1); + { + try { + result = (std::vector< double,std::allocator< double > > *)std_vector_Sl_double_Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_double_std__allocatorT_double_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::DoubleVector.delete_at call-seq: @@ -34218,49 +34543,6 @@ /* - Document-method: QuantLibc::DoubleVector.reject! - - call-seq: - reject! -> DoubleVector - -Iterate thru each element in the DoubleVector and reject those that fail a condition. A block must be provided. DoubleVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_DoubleVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< double > *arg1 = (std::vector< double > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< double,std::allocator< double > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_double_std__allocatorT_double_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< double > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< double > * >(argp1); - { - try { - result = (std::vector< double,std::allocator< double > > *)std_vector_Sl_double_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_double_std__allocatorT_double_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::DoubleVector.pop call-seq: @@ -35044,10 +35326,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< double > const &","vector<(double)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< double > const &","std::vector<(double)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< double > const &","vector<(double)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< double > const &","std::vector<(double)>", 1, argv[0])); } arg1 = ptr; } @@ -35465,7 +35747,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< double >::size_type","vector<(double)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< double >::size_type","std::vector<(double)>", 1, argv[0] )); } arg1 = static_cast< std::vector< double >::size_type >(val1); { @@ -35747,12 +36029,12 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< double >::size_type","vector<(double)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< double >::size_type","std::vector<(double)>", 1, argv[0] )); } arg1 = static_cast< std::vector< double >::size_type >(val1); ecode2 = SWIG_AsVal_double(argv[1], &val2); if (!SWIG_IsOK(ecode2)) { - SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< double >::value_type","vector<(double)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< double >::value_type","std::vector<(double)>", 2, argv[1] )); } temp2 = static_cast< std::vector< double >::value_type >(val2); arg2 = &temp2; @@ -36820,6 +37102,49 @@ /* + Document-method: QuantLibc::StrVector.reject! + + call-seq: + reject! -> StrVector + +Iterate thru each element in the StrVector and reject those that fail a condition. A block must be provided. StrVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_StrVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< std::string > *arg1 = (std::vector< std::string > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< std::string,std::allocator< std::string > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__string_std__allocatorT_std__string_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::string > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< std::string > * >(argp1); + { + try { + result = (std::vector< std::string,std::allocator< std::string > > *)std_vector_Sl_std_string_Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__string_std__allocatorT_std__string_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::StrVector.delete_at call-seq: @@ -36920,49 +37245,6 @@ /* - Document-method: QuantLibc::StrVector.reject! - - call-seq: - reject! -> StrVector - -Iterate thru each element in the StrVector and reject those that fail a condition. A block must be provided. StrVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_StrVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< std::string > *arg1 = (std::vector< std::string > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< std::string,std::allocator< std::string > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__string_std__allocatorT_std__string_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::string > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< std::string > * >(argp1); - { - try { - result = (std::vector< std::string,std::allocator< std::string > > *)std_vector_Sl_std_string_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__string_std__allocatorT_std__string_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::StrVector.pop call-seq: @@ -37754,10 +38036,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::string > const &","vector<(std::string)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::string > const &","std::vector<(std::string)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::string > const &","vector<(std::string)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::string > const &","std::vector<(std::string)>", 1, argv[0])); } arg1 = ptr; } @@ -38175,7 +38457,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::string >::size_type","vector<(std::string)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::string >::size_type","std::vector<(std::string)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::string >::size_type >(val1); { @@ -38455,17 +38737,17 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::string >::size_type","vector<(std::string)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::string >::size_type","std::vector<(std::string)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::string >::size_type >(val1); { std::string *ptr = (std::string *)0; res2 = SWIG_AsPtr_std_string(argv[1], &ptr); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::string >::value_type const &","vector<(std::string)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::string >::value_type const &","std::vector<(std::string)>", 2, argv[1] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::string >::value_type const &","vector<(std::string)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::string >::value_type const &","std::vector<(std::string)>", 2, argv[1])); } arg2 = ptr; } @@ -39552,6 +39834,49 @@ /* + Document-method: QuantLibc::BoolVector.reject! + + call-seq: + reject! -> BoolVector + +Iterate thru each element in the BoolVector and reject those that fail a condition. A block must be provided. BoolVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_BoolVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< bool > *arg1 = (std::vector< bool > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< bool,std::allocator< bool > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_bool_std__allocatorT_bool_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< bool > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< bool > * >(argp1); + { + try { + result = (std::vector< bool,std::allocator< bool > > *)std_vector_Sl_bool_Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_bool_std__allocatorT_bool_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::BoolVector.delete_at call-seq: @@ -39647,49 +39972,6 @@ /* - Document-method: QuantLibc::BoolVector.reject! - - call-seq: - reject! -> BoolVector - -Iterate thru each element in the BoolVector and reject those that fail a condition. A block must be provided. BoolVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_BoolVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< bool > *arg1 = (std::vector< bool > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< bool,std::allocator< bool > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_bool_std__allocatorT_bool_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< bool > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< bool > * >(argp1); - { - try { - result = (std::vector< bool,std::allocator< bool > > *)std_vector_Sl_bool_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_bool_std__allocatorT_bool_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::BoolVector.pop call-seq: @@ -40473,10 +40755,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< bool > const &","vector<(bool)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< bool > const &","std::vector<(bool)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< bool > const &","vector<(bool)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< bool > const &","std::vector<(bool)>", 1, argv[0])); } arg1 = ptr; } @@ -40894,7 +41176,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< bool >::size_type","vector<(bool)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< bool >::size_type","std::vector<(bool)>", 1, argv[0] )); } arg1 = static_cast< std::vector< bool >::size_type >(val1); { @@ -41175,12 +41457,12 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< bool >::size_type","vector<(bool)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< bool >::size_type","std::vector<(bool)>", 1, argv[0] )); } arg1 = static_cast< std::vector< bool >::size_type >(val1); ecode2 = SWIG_AsVal_bool(argv[1], &val2); if (!SWIG_IsOK(ecode2)) { - SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< bool >::value_type","vector<(bool)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "std::vector< bool >::value_type","std::vector<(bool)>", 2, argv[1] )); } arg2 = static_cast< std::vector< bool >::value_type >(val2); { @@ -41961,17 +42243,17 @@ { res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_Date, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Date","pair<(Date,double)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Date","std::pair<(Date,double)>", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Date","pair<(Date,double)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Date","std::pair<(Date,double)>", 1, argv[0])); } else { arg1 = *(reinterpret_cast< Date * >(argp1)); } } ecode2 = SWIG_AsVal_double(argv[1], &val2); if (!SWIG_IsOK(ecode2)) { - SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "double","pair<(Date,double)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "double","std::pair<(Date,double)>", 2, argv[1] )); } arg2 = static_cast< double >(val2); { @@ -42022,10 +42304,10 @@ std::pair *ptr = (std::pair *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::pair< Date,double > const &","pair<(Date,double)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::pair< Date,double > const &","std::pair<(Date,double)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::pair< Date,double > const &","pair<(Date,double)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::pair< Date,double > const &","std::pair<(Date,double)>", 1, argv[0])); } arg1 = ptr; } @@ -42746,6 +43028,49 @@ /* + Document-method: QuantLibc::NodeVector.reject! + + call-seq: + reject! -> NodeVector + +Iterate thru each element in the NodeVector and reject those that fail a condition. A block must be provided. NodeVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_NodeVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< std::pair< Date,double > > *arg1 = (std::vector< std::pair< Date,double > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< std::pair< Date,double >,std::allocator< std::pair< Date,double > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__pairT_Date_double_t_std__allocatorT_std__pairT_Date_double_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< std::pair< Date,double > > * >(argp1); + { + try { + result = (std::vector< std::pair< Date,double >,std::allocator< std::pair< Date,double > > > *)std_vector_Sl_std_pair_Sl_Date_Sc_double_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__pairT_Date_double_t_std__allocatorT_std__pairT_Date_double_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::NodeVector.delete_at call-seq: @@ -42846,49 +43171,6 @@ /* - Document-method: QuantLibc::NodeVector.reject! - - call-seq: - reject! -> NodeVector - -Iterate thru each element in the NodeVector and reject those that fail a condition. A block must be provided. NodeVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_NodeVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< std::pair< Date,double > > *arg1 = (std::vector< std::pair< Date,double > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< std::pair< Date,double >,std::allocator< std::pair< Date,double > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__pairT_Date_double_t_std__allocatorT_std__pairT_Date_double_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< std::pair< Date,double > > * >(argp1); - { - try { - result = (std::vector< std::pair< Date,double >,std::allocator< std::pair< Date,double > > > *)std_vector_Sl_std_pair_Sl_Date_Sc_double_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__pairT_Date_double_t_std__allocatorT_std__pairT_Date_double_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::NodeVector.pop call-seq: @@ -43680,10 +43962,10 @@ std::vector,std::allocator< std::pair< Date,double > > > *ptr = (std::vector,std::allocator< std::pair< Date,double > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > > const &","vector<(std::pair<(Date,double)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > > const &","std::vector<(std::pair<(Date,double)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::pair< Date,double > > const &","vector<(std::pair<(Date,double)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::pair< Date,double > > const &","std::vector<(std::pair<(Date,double)>)>", 1, argv[0])); } arg1 = ptr; } @@ -44101,7 +44383,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > >::size_type","vector<(std::pair<(Date,double)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > >::size_type","std::vector<(std::pair<(Date,double)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::pair< Date,double > >::size_type >(val1); { @@ -44381,17 +44663,17 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > >::size_type","vector<(std::pair<(Date,double)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > >::size_type","std::vector<(std::pair<(Date,double)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::pair< Date,double > >::size_type >(val1); { std::pair *ptr = (std::pair *)0; res2 = swig::asptr(argv[1], &ptr); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > >::value_type const &","vector<(std::pair<(Date,double)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::pair< Date,double > >::value_type const &","std::vector<(std::pair<(Date,double)>)>", 2, argv[1] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::pair< Date,double > >::value_type const &","vector<(std::pair<(Date,double)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::pair< Date,double > >::value_type const &","std::vector<(std::pair<(Date,double)>)>", 2, argv[1])); } arg2 = ptr; } @@ -46059,11 +46341,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -46187,11 +46469,11 @@ } { if (rb_obj_is_kind_of(self,rb_cArray)) { - Size size = RARRAY(self)->len; + Size size = RARRAY_LEN(self); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(self)[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -46277,11 +46559,11 @@ arg1 = reinterpret_cast< Array * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -46342,11 +46624,11 @@ arg1 = reinterpret_cast< Array * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -46440,11 +46722,11 @@ arg1 = reinterpret_cast< Array * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -46497,11 +46779,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -46512,14 +46794,14 @@ temp2 = Matrix(rows,cols); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp2[i][j] = SWIG_NUM2DBL(x); else @@ -47429,11 +47711,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -47444,14 +47726,14 @@ temp1 = Matrix(rows,cols); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp1[i][j] = SWIG_NUM2DBL(x); else @@ -47581,11 +47863,11 @@ { if (rb_obj_is_kind_of(self,rb_cArray)) { Size rows, cols; - rows = RARRAY(self)->len; + rows = RARRAY_LEN(self); if (rows > 0) { - VALUE o = RARRAY(self)->ptr[0]; + VALUE o = RARRAY_PTR(self)[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -47596,14 +47878,14 @@ temp1 = Matrix(rows,cols); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(self)[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp1[i][j] = SWIG_NUM2DBL(x); else @@ -47650,11 +47932,11 @@ { if (rb_obj_is_kind_of(self,rb_cArray)) { Size rows, cols; - rows = RARRAY(self)->len; + rows = RARRAY_LEN(self); if (rows > 0) { - VALUE o = RARRAY(self)->ptr[0]; + VALUE o = RARRAY_PTR(self)[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -47665,14 +47947,14 @@ temp1 = Matrix(rows,cols); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(self)[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp1[i][j] = SWIG_NUM2DBL(x); else @@ -47761,11 +48043,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -47776,14 +48058,14 @@ temp2 = Matrix(rows,cols); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp2[i][j] = SWIG_NUM2DBL(x); else @@ -47847,11 +48129,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -47862,14 +48144,14 @@ temp2 = Matrix(rows,cols); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp2[i][j] = SWIG_NUM2DBL(x); else @@ -47965,11 +48247,11 @@ arg1 = reinterpret_cast< Matrix * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -48022,11 +48304,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -48037,14 +48319,14 @@ temp2 = Matrix(rows,cols); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp2[i][j] = SWIG_NUM2DBL(x); else @@ -48325,11 +48607,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -48340,14 +48622,14 @@ temp1 = Matrix(rows,cols); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp1[i][j] = SWIG_NUM2DBL(x); else @@ -48395,11 +48677,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -48415,11 +48697,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -48467,11 +48749,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -48482,14 +48764,14 @@ temp1 = Matrix(rows,cols); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp1[i][j] = SWIG_NUM2DBL(x); else @@ -48559,11 +48841,11 @@ { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[0])->len; + rows = RARRAY_LEN(argv[0]); if (rows > 0) { - VALUE o = RARRAY(argv[0])->ptr[0]; + VALUE o = RARRAY_PTR(argv[0])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -48574,14 +48856,14 @@ temp1 = Matrix(rows,cols); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp1[i][j] = SWIG_NUM2DBL(x); else @@ -49779,6 +50061,49 @@ /* + Document-method: QuantLibc::QuoteVector.reject! + + call-seq: + reject! -> QuoteVector + +Iterate thru each element in the QuoteVector and reject those that fail a condition. A block must be provided. QuoteVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_QuoteVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< Quote > > *arg1 = (std::vector< boost::shared_ptr< Quote > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Quote > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > *)std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::QuoteVector.delete_at call-seq: @@ -49875,49 +50200,6 @@ /* - Document-method: QuantLibc::QuoteVector.reject! - - call-seq: - reject! -> QuoteVector - -Iterate thru each element in the QuoteVector and reject those that fail a condition. A block must be provided. QuoteVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_QuoteVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< Quote > > *arg1 = (std::vector< boost::shared_ptr< Quote > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Quote > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > *)std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::QuoteVector.pop call-seq: @@ -50702,10 +50984,10 @@ std::vector,std::allocator< boost::shared_ptr< Quote > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< Quote > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > > const &","vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > > const &","std::vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Quote > > const &","vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Quote > > const &","std::vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0])); } arg1 = ptr; } @@ -51123,7 +51405,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > >::size_type","vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > >::size_type","std::vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Quote > >::size_type >(val1); { @@ -51404,15 +51686,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > >::size_type","vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > >::size_type","std::vector<(boost::shared_ptr<(Quote)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Quote > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_Quote_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > >::value_type const &","vector<(boost::shared_ptr<(Quote)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Quote > >::value_type const &","std::vector<(boost::shared_ptr<(Quote)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Quote > >::value_type const &","vector<(boost::shared_ptr<(Quote)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Quote > >::value_type const &","std::vector<(boost::shared_ptr<(Quote)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< Quote > >::value_type * >(argp2); { @@ -52392,6 +52674,49 @@ /* + Document-method: QuantLibc::QuoteVectorVector.reject! + + call-seq: + reject! -> QuoteVectorVector + +Iterate thru each element in the QuoteVectorVector and reject those that fail a condition. A block must be provided. QuoteVectorVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_QuoteVectorVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< std::vector< boost::shared_ptr< Quote > > > *arg1 = (std::vector< std::vector< boost::shared_ptr< Quote > > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_std__allocatorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< std::vector< boost::shared_ptr< Quote > > > * >(argp1); + { + try { + result = (std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *)std_vector_Sl_std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_std__allocatorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::QuoteVectorVector.delete_at call-seq: @@ -52492,49 +52817,6 @@ /* - Document-method: QuantLibc::QuoteVectorVector.reject! - - call-seq: - reject! -> QuoteVectorVector - -Iterate thru each element in the QuoteVectorVector and reject those that fail a condition. A block must be provided. QuoteVectorVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_QuoteVectorVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< std::vector< boost::shared_ptr< Quote > > > *arg1 = (std::vector< std::vector< boost::shared_ptr< Quote > > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_std__allocatorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< std::vector< boost::shared_ptr< Quote > > > * >(argp1); - { - try { - result = (std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *)std_vector_Sl_std_vector_Sl_boost_shared_ptr_Sl_Quote_Sg__Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_std__allocatorT_std__vectorT_boost__shared_ptrT_Quote_t_std__allocatorT_boost__shared_ptrT_Quote_t_t_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::QuoteVectorVector.pop call-seq: @@ -53326,10 +53608,10 @@ std::vector,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< Quote > > >,std::allocator< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > const &","vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > const &","std::vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > const &","vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< boost::shared_ptr< Quote >,std::allocator< boost::shared_ptr< Quote > > > > const &","std::vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0])); } arg1 = ptr; } @@ -53747,7 +54029,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > >::size_type","vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > >::size_type","std::vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::vector< boost::shared_ptr< Quote > > >::size_type >(val1); { @@ -54027,17 +54309,17 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > >::size_type","vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > >::size_type","std::vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::vector< boost::shared_ptr< Quote > > >::size_type >(val1); { std::vector,std::allocator< boost::shared_ptr< Quote > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< Quote > > > *)0; res2 = swig::asptr(argv[1], &ptr); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > >::value_type const &","vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::vector< boost::shared_ptr< Quote > > >::value_type const &","std::vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 2, argv[1] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< boost::shared_ptr< Quote > > >::value_type const &","vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< boost::shared_ptr< Quote > > >::value_type const &","std::vector<(std::vector<(boost::shared_ptr<(Quote)>)>)>", 2, argv[1])); } arg2 = ptr; } @@ -55032,6 +55314,49 @@ /* + Document-method: QuantLibc::QuoteHandleVector.reject! + + call-seq: + reject! -> QuoteHandleVector + +Iterate thru each element in the QuoteHandleVector and reject those that fail a condition. A block must be provided. QuoteHandleVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_QuoteHandleVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< Handle< Quote > > *arg1 = (std::vector< Handle< Quote > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< Handle< Quote > > * >(argp1); + { + try { + result = (std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > *)std_vector_Sl_Handle_Sl_Quote_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::QuoteHandleVector.delete_at call-seq: @@ -55128,49 +55453,6 @@ /* - Document-method: QuantLibc::QuoteHandleVector.reject! - - call-seq: - reject! -> QuoteHandleVector - -Iterate thru each element in the QuoteHandleVector and reject those that fail a condition. A block must be provided. QuoteHandleVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_QuoteHandleVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< Handle< Quote > > *arg1 = (std::vector< Handle< Quote > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< Handle< Quote > > * >(argp1); - { - try { - result = (std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > *)std_vector_Sl_Handle_Sl_Quote_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::QuoteHandleVector.pop call-seq: @@ -55955,10 +56237,10 @@ std::vector,std::allocator< Handle< Quote > > > *ptr = (std::vector,std::allocator< Handle< Quote > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > > const &","vector<(Handle<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > > const &","std::vector<(Handle<(Quote)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Handle< Quote > > const &","vector<(Handle<(Quote)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Handle< Quote > > const &","std::vector<(Handle<(Quote)>)>", 1, argv[0])); } arg1 = ptr; } @@ -56376,7 +56658,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > >::size_type","vector<(Handle<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > >::size_type","std::vector<(Handle<(Quote)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< Handle< Quote > >::size_type >(val1); { @@ -56657,15 +56939,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > >::size_type","vector<(Handle<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > >::size_type","std::vector<(Handle<(Quote)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< Handle< Quote > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_HandleT_Quote_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > >::value_type const &","vector<(Handle<(Quote)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< Handle< Quote > >::value_type const &","std::vector<(Handle<(Quote)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Handle< Quote > >::value_type const &","vector<(Handle<(Quote)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< Handle< Quote > >::value_type const &","std::vector<(Handle<(Quote)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< Handle< Quote > >::value_type * >(argp2); { @@ -57645,6 +57927,49 @@ /* + Document-method: QuantLibc::QuoteHandleVectorVector.reject! + + call-seq: + reject! -> QuoteHandleVectorVector + +Iterate thru each element in the QuoteHandleVectorVector and reject those that fail a condition. A block must be provided. QuoteHandleVectorVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_QuoteHandleVectorVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< std::vector< Handle< Quote > > > *arg1 = (std::vector< std::vector< Handle< Quote > > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_std__allocatorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< std::vector< Handle< Quote > > > * >(argp1); + { + try { + result = (std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *)std_vector_Sl_std_vector_Sl_Handle_Sl_Quote_Sg__Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_std__allocatorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::QuoteHandleVectorVector.delete_at call-seq: @@ -57745,49 +58070,6 @@ /* - Document-method: QuantLibc::QuoteHandleVectorVector.reject! - - call-seq: - reject! -> QuoteHandleVectorVector - -Iterate thru each element in the QuoteHandleVectorVector and reject those that fail a condition. A block must be provided. QuoteHandleVectorVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_QuoteHandleVectorVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< std::vector< Handle< Quote > > > *arg1 = (std::vector< std::vector< Handle< Quote > > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_std__allocatorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< std::vector< Handle< Quote > > > * >(argp1); - { - try { - result = (std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *)std_vector_Sl_std_vector_Sl_Handle_Sl_Quote_Sg__Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_std__allocatorT_std__vectorT_HandleT_Quote_t_std__allocatorT_HandleT_Quote_t_t_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::QuoteHandleVectorVector.pop call-seq: @@ -58579,10 +58861,10 @@ std::vector,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *ptr = (std::vector,std::allocator< Handle< Quote > > >,std::allocator< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > const &","vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > const &","std::vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > const &","vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< Handle< Quote >,std::allocator< Handle< Quote > > > > const &","std::vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0])); } arg1 = ptr; } @@ -59000,7 +59282,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > >::size_type","vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > >::size_type","std::vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::vector< Handle< Quote > > >::size_type >(val1); { @@ -59280,17 +59562,17 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > >::size_type","vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > >::size_type","std::vector<(std::vector<(Handle<(Quote)>)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::vector< Handle< Quote > > >::size_type >(val1); { std::vector,std::allocator< Handle< Quote > > > *ptr = (std::vector,std::allocator< Handle< Quote > > > *)0; res2 = swig::asptr(argv[1], &ptr); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > >::value_type const &","vector<(std::vector<(Handle<(Quote)>)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::vector< Handle< Quote > > >::value_type const &","std::vector<(std::vector<(Handle<(Quote)>)>)>", 2, argv[1] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< Handle< Quote > > >::value_type const &","vector<(std::vector<(Handle<(Quote)>)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< Handle< Quote > > >::value_type const &","std::vector<(std::vector<(Handle<(Quote)>)>)>", 2, argv[1])); } arg2 = ptr; } @@ -60285,6 +60567,49 @@ /* + Document-method: QuantLibc::RelinkableQuoteHandleVector.reject! + + call-seq: + reject! -> RelinkableQuoteHandleVector + +Iterate thru each element in the RelinkableQuoteHandleVector and reject those that fail a condition. A block must be provided. RelinkableQuoteHandleVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_RelinkableQuoteHandleVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< RelinkableHandle< Quote > > *arg1 = (std::vector< RelinkableHandle< Quote > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< RelinkableHandle< Quote > > * >(argp1); + { + try { + result = (std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > *)std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::RelinkableQuoteHandleVector.delete_at call-seq: @@ -60381,49 +60706,6 @@ /* - Document-method: QuantLibc::RelinkableQuoteHandleVector.reject! - - call-seq: - reject! -> RelinkableQuoteHandleVector - -Iterate thru each element in the RelinkableQuoteHandleVector and reject those that fail a condition. A block must be provided. RelinkableQuoteHandleVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_RelinkableQuoteHandleVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< RelinkableHandle< Quote > > *arg1 = (std::vector< RelinkableHandle< Quote > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< RelinkableHandle< Quote > > * >(argp1); - { - try { - result = (std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > *)std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::RelinkableQuoteHandleVector.pop call-seq: @@ -61208,10 +61490,10 @@ std::vector,std::allocator< RelinkableHandle< Quote > > > *ptr = (std::vector,std::allocator< RelinkableHandle< Quote > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > > const &","vector<(RelinkableHandle<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > > const &","std::vector<(RelinkableHandle<(Quote)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< RelinkableHandle< Quote > > const &","vector<(RelinkableHandle<(Quote)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< RelinkableHandle< Quote > > const &","std::vector<(RelinkableHandle<(Quote)>)>", 1, argv[0])); } arg1 = ptr; } @@ -61629,7 +61911,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > >::size_type","vector<(RelinkableHandle<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > >::size_type","std::vector<(RelinkableHandle<(Quote)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< RelinkableHandle< Quote > >::size_type >(val1); { @@ -61910,15 +62192,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > >::size_type","vector<(RelinkableHandle<(Quote)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > >::size_type","std::vector<(RelinkableHandle<(Quote)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< RelinkableHandle< Quote > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_RelinkableHandleT_Quote_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > >::value_type const &","vector<(RelinkableHandle<(Quote)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< RelinkableHandle< Quote > >::value_type const &","std::vector<(RelinkableHandle<(Quote)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< RelinkableHandle< Quote > >::value_type const &","vector<(RelinkableHandle<(Quote)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< RelinkableHandle< Quote > >::value_type const &","std::vector<(RelinkableHandle<(Quote)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< RelinkableHandle< Quote > >::value_type * >(argp2); { @@ -62898,6 +63180,49 @@ /* + Document-method: QuantLibc::RelinkableQuoteHandleVectorVector.reject! + + call-seq: + reject! -> RelinkableQuoteHandleVectorVector + +Iterate thru each element in the RelinkableQuoteHandleVectorVector and reject those that fail a condition. A block must be provided. RelinkableQuoteHandleVectorVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_RelinkableQuoteHandleVectorVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< std::vector< RelinkableHandle< Quote > > > *arg1 = (std::vector< std::vector< RelinkableHandle< Quote > > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_std__allocatorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< std::vector< RelinkableHandle< Quote > > > * >(argp1); + { + try { + result = (std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *)std_vector_Sl_std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_std__allocatorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::RelinkableQuoteHandleVectorVector.delete_at call-seq: @@ -62998,49 +63323,6 @@ /* - Document-method: QuantLibc::RelinkableQuoteHandleVectorVector.reject! - - call-seq: - reject! -> RelinkableQuoteHandleVectorVector - -Iterate thru each element in the RelinkableQuoteHandleVectorVector and reject those that fail a condition. A block must be provided. RelinkableQuoteHandleVectorVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_RelinkableQuoteHandleVectorVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< std::vector< RelinkableHandle< Quote > > > *arg1 = (std::vector< std::vector< RelinkableHandle< Quote > > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_std__allocatorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< std::vector< RelinkableHandle< Quote > > > * >(argp1); - { - try { - result = (std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *)std_vector_Sl_std_vector_Sl_RelinkableHandle_Sl_Quote_Sg__Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_std__allocatorT_std__vectorT_RelinkableHandleT_Quote_t_std__allocatorT_RelinkableHandleT_Quote_t_t_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::RelinkableQuoteHandleVectorVector.pop call-seq: @@ -63832,10 +64114,10 @@ std::vector,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *ptr = (std::vector,std::allocator< RelinkableHandle< Quote > > >,std::allocator< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > const &","vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > const &","std::vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > const &","vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< RelinkableHandle< Quote >,std::allocator< RelinkableHandle< Quote > > > > const &","std::vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0])); } arg1 = ptr; } @@ -64253,7 +64535,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > >::size_type","vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > >::size_type","std::vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::vector< RelinkableHandle< Quote > > >::size_type >(val1); { @@ -64533,17 +64815,17 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > >::size_type","vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > >::size_type","std::vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< std::vector< RelinkableHandle< Quote > > >::size_type >(val1); { std::vector,std::allocator< RelinkableHandle< Quote > > > *ptr = (std::vector,std::allocator< RelinkableHandle< Quote > > > *)0; res2 = swig::asptr(argv[1], &ptr); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > >::value_type const &","vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< std::vector< RelinkableHandle< Quote > > >::value_type const &","std::vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 2, argv[1] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< RelinkableHandle< Quote > > >::value_type const &","vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< std::vector< RelinkableHandle< Quote > > >::value_type const &","std::vector<(std::vector<(RelinkableHandle<(Quote)>)>)>", 2, argv[1])); } arg2 = ptr; } @@ -65861,7 +66143,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Thirty360::Convention","Thirty360", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Thirty360::Convention","QuantLib::Thirty360", 1, argv[0] )); } arg1 = static_cast< QuantLib::Thirty360::Convention >(val1); { @@ -65976,7 +66258,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::ActualActual::Convention","ActualActual", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::ActualActual::Convention","QuantLib::ActualActual", 1, argv[0] )); } arg1 = static_cast< QuantLib::ActualActual::Convention >(val1); { @@ -69703,7 +69985,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Argentina::Market","Argentina", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Argentina::Market","QuantLib::Argentina", 1, argv[0] )); } arg1 = static_cast< QuantLib::Argentina::Market >(val1); { @@ -69867,7 +70149,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Brazil::Market","Brazil", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Brazil::Market","QuantLib::Brazil", 1, argv[0] )); } arg1 = static_cast< QuantLib::Brazil::Market >(val1); { @@ -69982,7 +70264,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Canada::Market","Canada", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Canada::Market","QuantLib::Canada", 1, argv[0] )); } arg1 = static_cast< QuantLib::Canada::Market >(val1); { @@ -70146,7 +70428,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::CzechRepublic::Market","CzechRepublic", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::CzechRepublic::Market","QuantLib::CzechRepublic", 1, argv[0] )); } arg1 = static_cast< QuantLib::CzechRepublic::Market >(val1); { @@ -70359,7 +70641,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Germany::Market","Germany", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Germany::Market","QuantLib::Germany", 1, argv[0] )); } arg1 = static_cast< QuantLib::Germany::Market >(val1); { @@ -70474,7 +70756,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::HongKong::Market","HongKong", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::HongKong::Market","QuantLib::HongKong", 1, argv[0] )); } arg1 = static_cast< QuantLib::HongKong::Market >(val1); { @@ -70638,7 +70920,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Iceland::Market","Iceland", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Iceland::Market","QuantLib::Iceland", 1, argv[0] )); } arg1 = static_cast< QuantLib::Iceland::Market >(val1); { @@ -70753,7 +71035,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::India::Market","India", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::India::Market","QuantLib::India", 1, argv[0] )); } arg1 = static_cast< QuantLib::India::Market >(val1); { @@ -70868,7 +71150,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Indonesia::Market","Indonesia", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Indonesia::Market","QuantLib::Indonesia", 1, argv[0] )); } arg1 = static_cast< QuantLib::Indonesia::Market >(val1); { @@ -70983,7 +71265,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Italy::Market","Italy", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Italy::Market","QuantLib::Italy", 1, argv[0] )); } arg1 = static_cast< QuantLib::Italy::Market >(val1); { @@ -71147,7 +71429,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Mexico::Market","Mexico", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Mexico::Market","QuantLib::Mexico", 1, argv[0] )); } arg1 = static_cast< QuantLib::Mexico::Market >(val1); { @@ -71458,7 +71740,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::SaudiArabia::Market","SaudiArabia", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::SaudiArabia::Market","QuantLib::SaudiArabia", 1, argv[0] )); } arg1 = static_cast< QuantLib::SaudiArabia::Market >(val1); { @@ -71573,7 +71855,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Singapore::Market","Singapore", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Singapore::Market","QuantLib::Singapore", 1, argv[0] )); } arg1 = static_cast< QuantLib::Singapore::Market >(val1); { @@ -71688,7 +71970,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Slovakia::Market","Slovakia", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Slovakia::Market","QuantLib::Slovakia", 1, argv[0] )); } arg1 = static_cast< QuantLib::Slovakia::Market >(val1); { @@ -71852,7 +72134,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::SouthKorea::Market","SouthKorea", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::SouthKorea::Market","QuantLib::SouthKorea", 1, argv[0] )); } arg1 = static_cast< QuantLib::SouthKorea::Market >(val1); { @@ -72065,7 +72347,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Taiwan::Market","Taiwan", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Taiwan::Market","QuantLib::Taiwan", 1, argv[0] )); } arg1 = static_cast< QuantLib::Taiwan::Market >(val1); { @@ -72278,7 +72560,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Ukraine::Market","Ukraine", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::Ukraine::Market","QuantLib::Ukraine", 1, argv[0] )); } arg1 = static_cast< QuantLib::Ukraine::Market >(val1); { @@ -72393,7 +72675,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::UnitedKingdom::Market","UnitedKingdom", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::UnitedKingdom::Market","QuantLib::UnitedKingdom", 1, argv[0] )); } arg1 = static_cast< QuantLib::UnitedKingdom::Market >(val1); { @@ -72508,7 +72790,7 @@ } ecode1 = SWIG_AsVal_int(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::UnitedStates::Market","UnitedStates", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "QuantLib::UnitedStates::Market","QuantLib::UnitedStates", 1, argv[0] )); } arg1 = static_cast< QuantLib::UnitedStates::Market >(val1); { @@ -72727,23 +73009,23 @@ } res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 1, argv[0])); } arg1 = reinterpret_cast< Calendar * >(argp1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 2, argv[1])); } arg2 = reinterpret_cast< Calendar * >(argp2); ecode3 = SWIG_AsVal_int(argv[2], &val3); if (!SWIG_IsOK(ecode3)) { - SWIG_exception_fail(SWIG_ArgError(ecode3), Ruby_Format_TypeError( "", "JointCalendarRule","JointCalendar", 3, argv[2] )); + SWIG_exception_fail(SWIG_ArgError(ecode3), Ruby_Format_TypeError( "", "JointCalendarRule","QuantLib::JointCalendar", 3, argv[2] )); } arg3 = static_cast< JointCalendarRule >(val3); { @@ -72779,18 +73061,18 @@ } res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 1, argv[0])); } arg1 = reinterpret_cast< Calendar * >(argp1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 2, argv[1])); } arg2 = reinterpret_cast< Calendar * >(argp2); { @@ -72832,31 +73114,31 @@ } res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 1, argv[0])); } arg1 = reinterpret_cast< Calendar * >(argp1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 2, argv[1])); } arg2 = reinterpret_cast< Calendar * >(argp2); res3 = SWIG_ConvertPtr(argv[2], &argp3, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res3)) { - SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 3, argv[2] )); + SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 3, argv[2] )); } if (!argp3) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 3, argv[2])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 3, argv[2])); } arg3 = reinterpret_cast< Calendar * >(argp3); ecode4 = SWIG_AsVal_int(argv[3], &val4); if (!SWIG_IsOK(ecode4)) { - SWIG_exception_fail(SWIG_ArgError(ecode4), Ruby_Format_TypeError( "", "JointCalendarRule","JointCalendar", 4, argv[3] )); + SWIG_exception_fail(SWIG_ArgError(ecode4), Ruby_Format_TypeError( "", "JointCalendarRule","QuantLib::JointCalendar", 4, argv[3] )); } arg4 = static_cast< JointCalendarRule >(val4); { @@ -72895,26 +73177,26 @@ } res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 1, argv[0])); } arg1 = reinterpret_cast< Calendar * >(argp1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 2, argv[1])); } arg2 = reinterpret_cast< Calendar * >(argp2); res3 = SWIG_ConvertPtr(argv[2], &argp3, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res3)) { - SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 3, argv[2] )); + SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 3, argv[2] )); } if (!argp3) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 3, argv[2])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 3, argv[2])); } arg3 = reinterpret_cast< Calendar * >(argp3); { @@ -72959,39 +73241,39 @@ } res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 1, argv[0])); } arg1 = reinterpret_cast< Calendar * >(argp1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 2, argv[1])); } arg2 = reinterpret_cast< Calendar * >(argp2); res3 = SWIG_ConvertPtr(argv[2], &argp3, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res3)) { - SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 3, argv[2] )); + SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 3, argv[2] )); } if (!argp3) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 3, argv[2])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 3, argv[2])); } arg3 = reinterpret_cast< Calendar * >(argp3); res4 = SWIG_ConvertPtr(argv[3], &argp4, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res4)) { - SWIG_exception_fail(SWIG_ArgError(res4), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 4, argv[3] )); + SWIG_exception_fail(SWIG_ArgError(res4), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 4, argv[3] )); } if (!argp4) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 4, argv[3])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 4, argv[3])); } arg4 = reinterpret_cast< Calendar * >(argp4); ecode5 = SWIG_AsVal_int(argv[4], &val5); if (!SWIG_IsOK(ecode5)) { - SWIG_exception_fail(SWIG_ArgError(ecode5), Ruby_Format_TypeError( "", "JointCalendarRule","JointCalendar", 5, argv[4] )); + SWIG_exception_fail(SWIG_ArgError(ecode5), Ruby_Format_TypeError( "", "JointCalendarRule","QuantLib::JointCalendar", 5, argv[4] )); } arg5 = static_cast< JointCalendarRule >(val5); { @@ -73050,34 +73332,34 @@ } res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 1, argv[0])); } arg1 = reinterpret_cast< Calendar * >(argp1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 2, argv[1])); } arg2 = reinterpret_cast< Calendar * >(argp2); res3 = SWIG_ConvertPtr(argv[2], &argp3, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res3)) { - SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 3, argv[2] )); + SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 3, argv[2] )); } if (!argp3) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 3, argv[2])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 3, argv[2])); } arg3 = reinterpret_cast< Calendar * >(argp3); res4 = SWIG_ConvertPtr(argv[3], &argp4, SWIGTYPE_p_Calendar, 0 ); if (!SWIG_IsOK(res4)) { - SWIG_exception_fail(SWIG_ArgError(res4), Ruby_Format_TypeError( "", "Calendar const &","JointCalendar", 4, argv[3] )); + SWIG_exception_fail(SWIG_ArgError(res4), Ruby_Format_TypeError( "", "Calendar const &","QuantLib::JointCalendar", 4, argv[3] )); } if (!argp4) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","JointCalendar", 4, argv[3])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Calendar const &","QuantLib::JointCalendar", 4, argv[3])); } arg4 = reinterpret_cast< Calendar * >(argp4); { @@ -73291,10 +73573,10 @@ std::string *ptr = (std::string *)0; res1 = SWIG_AsPtr_std_string(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::string const &","BespokeCalendar", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::string const &","QuantLib::BespokeCalendar", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::string const &","BespokeCalendar", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::string const &","QuantLib::BespokeCalendar", 1, argv[0])); } arg1 = ptr; } @@ -77925,11 +78207,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -77945,11 +78227,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78167,11 +78449,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78187,11 +78469,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78409,11 +78691,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78429,11 +78711,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78651,11 +78933,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78671,11 +78953,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78893,11 +79175,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -78913,11 +79195,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -79582,11 +79864,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -79602,11 +79884,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -80271,11 +80553,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -80291,11 +80573,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -80960,11 +81242,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -80980,11 +81262,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -81649,11 +81931,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -81669,11 +81951,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -82338,11 +82620,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -82358,11 +82640,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -83027,11 +83309,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -83047,11 +83329,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -83716,11 +83998,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -83736,11 +84018,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -84405,11 +84687,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -84425,11 +84707,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -85094,11 +85376,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -85114,11 +85396,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -85783,11 +86065,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -85803,11 +86085,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -86472,11 +86754,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -86492,11 +86774,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -87163,11 +87445,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -87183,11 +87465,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -87204,11 +87486,11 @@ { if (rb_obj_is_kind_of(argv[2],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[2])->len; + rows = RARRAY_LEN(argv[2]); if (rows > 0) { - VALUE o = RARRAY(argv[2])->ptr[0]; + VALUE o = RARRAY_PTR(argv[2])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -87219,14 +87501,14 @@ temp3 = Matrix(rows,cols); arg3 = &temp3; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[2])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp3[i][j] = SWIG_NUM2DBL(x); else @@ -87476,11 +87758,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -87496,11 +87778,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -87517,11 +87799,11 @@ { if (rb_obj_is_kind_of(argv[2],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[2])->len; + rows = RARRAY_LEN(argv[2]); if (rows > 0) { - VALUE o = RARRAY(argv[2])->ptr[0]; + VALUE o = RARRAY_PTR(argv[2])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -87532,14 +87814,14 @@ temp3 = Matrix(rows,cols); arg3 = &temp3; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[2])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp3[i][j] = SWIG_NUM2DBL(x); else @@ -94604,12 +94886,55 @@ } res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > *","each", 1, self )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > *","each", 1, self )); + } + arg1 = reinterpret_cast< std::vector< IntervalPrice > * >(argp1); + { + try { + result = (std::vector< IntervalPrice,std::allocator< IntervalPrice > > *)std_vector_Sl_IntervalPrice_Sg__each(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* + Document-method: QuantLibc::IntervalPriceVector.select + + call-seq: + select -> IntervalPriceVector + +Iterate thru each element in the IntervalPriceVector and select those that match a condition. A block must be provided. +*/ +SWIGINTERN VALUE +_wrap_IntervalPriceVector_select(int argc, VALUE *argv, VALUE self) { + std::vector< IntervalPrice > *arg1 = (std::vector< IntervalPrice > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< IntervalPrice,std::allocator< IntervalPrice > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > *","select", 1, self )); } arg1 = reinterpret_cast< std::vector< IntervalPrice > * >(argp1); { try { - result = (std::vector< IntervalPrice,std::allocator< IntervalPrice > > *)std_vector_Sl_IntervalPrice_Sg__each(arg1); + result = (std::vector< IntervalPrice,std::allocator< IntervalPrice > > *)std_vector_Sl_IntervalPrice_Sg__select(arg1); } catch (std::out_of_range& e) { SWIG_exception(SWIG_IndexError,const_cast(e.what())); } catch (std::exception& e) { @@ -94618,7 +94943,7 @@ SWIG_exception(SWIG_UnknownError,"unknown error"); } } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, SWIG_POINTER_OWN | 0 ); return vresult; fail: return Qnil; @@ -94627,15 +94952,15 @@ /* - Document-method: QuantLibc::IntervalPriceVector.select + Document-method: QuantLibc::IntervalPriceVector.reject! call-seq: - select -> IntervalPriceVector + reject! -> IntervalPriceVector -Iterate thru each element in the IntervalPriceVector and select those that match a condition. A block must be provided. +Iterate thru each element in the IntervalPriceVector and reject those that fail a condition. A block must be provided. IntervalPriceVector is modified in place. */ SWIGINTERN VALUE -_wrap_IntervalPriceVector_select(int argc, VALUE *argv, VALUE self) { +_wrap_IntervalPriceVector_rejectN___(int argc, VALUE *argv, VALUE self) { std::vector< IntervalPrice > *arg1 = (std::vector< IntervalPrice > *) 0 ; void *argp1 = 0 ; int res1 = 0 ; @@ -94647,12 +94972,12 @@ } res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > *","select", 1, self )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > *","reject_bang", 1, self )); } arg1 = reinterpret_cast< std::vector< IntervalPrice > * >(argp1); { try { - result = (std::vector< IntervalPrice,std::allocator< IntervalPrice > > *)std_vector_Sl_IntervalPrice_Sg__select(arg1); + result = (std::vector< IntervalPrice,std::allocator< IntervalPrice > > *)std_vector_Sl_IntervalPrice_Sg__reject_bang(arg1); } catch (std::out_of_range& e) { SWIG_exception(SWIG_IndexError,const_cast(e.what())); } catch (std::exception& e) { @@ -94661,7 +94986,7 @@ SWIG_exception(SWIG_UnknownError,"unknown error"); } } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, SWIG_POINTER_OWN | 0 ); + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); return vresult; fail: return Qnil; @@ -94766,49 +95091,6 @@ /* - Document-method: QuantLibc::IntervalPriceVector.reject! - - call-seq: - reject! -> IntervalPriceVector - -Iterate thru each element in the IntervalPriceVector and reject those that fail a condition. A block must be provided. IntervalPriceVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_IntervalPriceVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< IntervalPrice > *arg1 = (std::vector< IntervalPrice > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< IntervalPrice,std::allocator< IntervalPrice > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< IntervalPrice > * >(argp1); - { - try { - result = (std::vector< IntervalPrice,std::allocator< IntervalPrice > > *)std_vector_Sl_IntervalPrice_Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_IntervalPrice_std__allocatorT_IntervalPrice_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::IntervalPriceVector.pop call-seq: @@ -95593,10 +95875,10 @@ std::vector > *ptr = (std::vector > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > const &","vector<(IntervalPrice)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice > const &","std::vector<(IntervalPrice)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< IntervalPrice > const &","vector<(IntervalPrice)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< IntervalPrice > const &","std::vector<(IntervalPrice)>", 1, argv[0])); } arg1 = ptr; } @@ -96014,7 +96296,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice >::size_type","vector<(IntervalPrice)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice >::size_type","std::vector<(IntervalPrice)>", 1, argv[0] )); } arg1 = static_cast< std::vector< IntervalPrice >::size_type >(val1); { @@ -96295,15 +96577,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice >::size_type","vector<(IntervalPrice)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< IntervalPrice >::size_type","std::vector<(IntervalPrice)>", 1, argv[0] )); } arg1 = static_cast< std::vector< IntervalPrice >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_IntervalPrice, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< IntervalPrice >::value_type const &","vector<(IntervalPrice)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< IntervalPrice >::value_type const &","std::vector<(IntervalPrice)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< IntervalPrice >::value_type const &","vector<(IntervalPrice)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< IntervalPrice >::value_type const &","std::vector<(IntervalPrice)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< IntervalPrice >::value_type * >(argp2); { @@ -123253,11 +123535,11 @@ { if (rb_obj_is_kind_of(argv[4],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[4])->len; + rows = RARRAY_LEN(argv[4]); if (rows > 0) { - VALUE o = RARRAY(argv[4])->ptr[0]; + VALUE o = RARRAY_PTR(argv[4])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -123268,14 +123550,14 @@ temp5 = Matrix(rows,cols); arg5 = &temp5; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[4])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp5[i][j] = SWIG_NUM2DBL(x); else @@ -123397,11 +123679,11 @@ { if (rb_obj_is_kind_of(argv[4],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[4])->len; + rows = RARRAY_LEN(argv[4]); if (rows > 0) { - VALUE o = RARRAY(argv[4])->ptr[0]; + VALUE o = RARRAY_PTR(argv[4])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -123412,14 +123694,14 @@ temp5 = Matrix(rows,cols); arg5 = &temp5; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[4])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp5[i][j] = SWIG_NUM2DBL(x); else @@ -123550,11 +123832,11 @@ { if (rb_obj_is_kind_of(argv[4],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[4])->len; + rows = RARRAY_LEN(argv[4]); if (rows > 0) { - VALUE o = RARRAY(argv[4])->ptr[0]; + VALUE o = RARRAY_PTR(argv[4])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -123565,14 +123847,14 @@ temp5 = Matrix(rows,cols); arg5 = &temp5; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[4])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp5[i][j] = SWIG_NUM2DBL(x); else @@ -125155,11 +125437,11 @@ { if (rb_obj_is_kind_of(argv[3],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[3])->len; + rows = RARRAY_LEN(argv[3]); if (rows > 0) { - VALUE o = RARRAY(argv[3])->ptr[0]; + VALUE o = RARRAY_PTR(argv[3])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -125170,14 +125452,14 @@ temp4 = Matrix(rows,cols); arg4 = &temp4; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[3])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp4[i][j] = SWIG_NUM2DBL(x); else @@ -125400,11 +125682,11 @@ { if (rb_obj_is_kind_of(argv[4],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[4])->len; + rows = RARRAY_LEN(argv[4]); if (rows > 0) { - VALUE o = RARRAY(argv[4])->ptr[0]; + VALUE o = RARRAY_PTR(argv[4])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -125415,14 +125697,14 @@ temp5 = Matrix(rows,cols); arg5 = &temp5; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[4])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp5[i][j] = SWIG_NUM2DBL(x); else @@ -127677,11 +127959,11 @@ { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[1])->len; + rows = RARRAY_LEN(argv[1]); if (rows > 0) { - VALUE o = RARRAY(argv[1])->ptr[0]; + VALUE o = RARRAY_PTR(argv[1])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -127692,14 +127974,14 @@ temp2 = Matrix(rows,cols); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp2[i][j] = SWIG_NUM2DBL(x); else @@ -128608,6 +128890,49 @@ /* + Document-method: QuantLibc::StochasticProcessVector.reject! + + call-seq: + reject! -> StochasticProcessVector + +Iterate thru each element in the StochasticProcessVector and reject those that fail a condition. A block must be provided. StochasticProcessVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_StochasticProcessVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< StochasticProcess > > *arg1 = (std::vector< boost::shared_ptr< StochasticProcess > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< StochasticProcess >,std::allocator< boost::shared_ptr< StochasticProcess > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_StochasticProcess_t_std__allocatorT_boost__shared_ptrT_StochasticProcess_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< StochasticProcess > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< StochasticProcess >,std::allocator< boost::shared_ptr< StochasticProcess > > > *)std_vector_Sl_boost_shared_ptr_Sl_StochasticProcess_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_StochasticProcess_t_std__allocatorT_boost__shared_ptrT_StochasticProcess_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::StochasticProcessVector.delete_at call-seq: @@ -128704,49 +129029,6 @@ /* - Document-method: QuantLibc::StochasticProcessVector.reject! - - call-seq: - reject! -> StochasticProcessVector - -Iterate thru each element in the StochasticProcessVector and reject those that fail a condition. A block must be provided. StochasticProcessVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_StochasticProcessVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< StochasticProcess > > *arg1 = (std::vector< boost::shared_ptr< StochasticProcess > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< StochasticProcess >,std::allocator< boost::shared_ptr< StochasticProcess > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_StochasticProcess_t_std__allocatorT_boost__shared_ptrT_StochasticProcess_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< StochasticProcess > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< StochasticProcess >,std::allocator< boost::shared_ptr< StochasticProcess > > > *)std_vector_Sl_boost_shared_ptr_Sl_StochasticProcess_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_StochasticProcess_t_std__allocatorT_boost__shared_ptrT_StochasticProcess_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::StochasticProcessVector.pop call-seq: @@ -129531,10 +129813,10 @@ std::vector,std::allocator< boost::shared_ptr< StochasticProcess > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< StochasticProcess > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > > const &","vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > > const &","std::vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< StochasticProcess > > const &","vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< StochasticProcess > > const &","std::vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0])); } arg1 = ptr; } @@ -129952,7 +130234,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > >::size_type","vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > >::size_type","std::vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< StochasticProcess > >::size_type >(val1); { @@ -130233,15 +130515,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > >::size_type","vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > >::size_type","std::vector<(boost::shared_ptr<(StochasticProcess)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< StochasticProcess > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_StochasticProcess_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > >::value_type const &","vector<(boost::shared_ptr<(StochasticProcess)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< StochasticProcess > >::value_type const &","std::vector<(boost::shared_ptr<(StochasticProcess)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< StochasticProcess > >::value_type const &","vector<(boost::shared_ptr<(StochasticProcess)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< StochasticProcess > >::value_type const &","std::vector<(boost::shared_ptr<(StochasticProcess)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< StochasticProcess > >::value_type * >(argp2); { @@ -142121,6 +142403,49 @@ /* + Document-method: QuantLibc::OptionList.reject! + + call-seq: + reject! -> OptionList + +Iterate thru each element in the OptionList and reject those that fail a condition. A block must be provided. OptionList is modified in place. +*/ +SWIGINTERN VALUE +_wrap_OptionList_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< Instrument > > *arg1 = (std::vector< boost::shared_ptr< Instrument > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< Instrument >,std::allocator< boost::shared_ptr< Instrument > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Instrument_t_std__allocatorT_boost__shared_ptrT_Instrument_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Instrument > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< Instrument >,std::allocator< boost::shared_ptr< Instrument > > > *)std_vector_Sl_boost_shared_ptr_Sl_Instrument_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Instrument_t_std__allocatorT_boost__shared_ptrT_Instrument_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::OptionList.delete_at call-seq: @@ -142217,49 +142542,6 @@ /* - Document-method: QuantLibc::OptionList.reject! - - call-seq: - reject! -> OptionList - -Iterate thru each element in the OptionList and reject those that fail a condition. A block must be provided. OptionList is modified in place. -*/ -SWIGINTERN VALUE -_wrap_OptionList_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< Instrument > > *arg1 = (std::vector< boost::shared_ptr< Instrument > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< Instrument >,std::allocator< boost::shared_ptr< Instrument > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Instrument_t_std__allocatorT_boost__shared_ptrT_Instrument_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Instrument > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< Instrument >,std::allocator< boost::shared_ptr< Instrument > > > *)std_vector_Sl_boost_shared_ptr_Sl_Instrument_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Instrument_t_std__allocatorT_boost__shared_ptrT_Instrument_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::OptionList.pop call-seq: @@ -143044,10 +143326,10 @@ std::vector,std::allocator< boost::shared_ptr< Instrument > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< Instrument > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > > const &","vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > > const &","std::vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Instrument > > const &","vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Instrument > > const &","std::vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0])); } arg1 = ptr; } @@ -143465,7 +143747,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > >::size_type","vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > >::size_type","std::vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Instrument > >::size_type >(val1); { @@ -143746,15 +144028,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > >::size_type","vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > >::size_type","std::vector<(boost::shared_ptr<(Instrument)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Instrument > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_Instrument_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > >::value_type const &","vector<(boost::shared_ptr<(Instrument)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Instrument > >::value_type const &","std::vector<(boost::shared_ptr<(Instrument)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Instrument > >::value_type const &","vector<(boost::shared_ptr<(Instrument)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Instrument > >::value_type const &","std::vector<(boost::shared_ptr<(Instrument)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< Instrument > >::value_type * >(argp2); { @@ -145291,11 +145573,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -147799,6 +148081,49 @@ /* + Document-method: QuantLibc::Leg.reject! + + call-seq: + reject! -> Leg + +Iterate thru each element in the Leg and reject those that fail a condition. A block must be provided. Leg is modified in place. +*/ +SWIGINTERN VALUE +_wrap_Leg_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< CashFlow > > *arg1 = (std::vector< boost::shared_ptr< CashFlow > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< CashFlow >,std::allocator< boost::shared_ptr< CashFlow > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CashFlow_t_std__allocatorT_boost__shared_ptrT_CashFlow_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< CashFlow > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< CashFlow >,std::allocator< boost::shared_ptr< CashFlow > > > *)std_vector_Sl_boost_shared_ptr_Sl_CashFlow_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CashFlow_t_std__allocatorT_boost__shared_ptrT_CashFlow_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::Leg.delete_at call-seq: @@ -147895,49 +148220,6 @@ /* - Document-method: QuantLibc::Leg.reject! - - call-seq: - reject! -> Leg - -Iterate thru each element in the Leg and reject those that fail a condition. A block must be provided. Leg is modified in place. -*/ -SWIGINTERN VALUE -_wrap_Leg_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< CashFlow > > *arg1 = (std::vector< boost::shared_ptr< CashFlow > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< CashFlow >,std::allocator< boost::shared_ptr< CashFlow > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CashFlow_t_std__allocatorT_boost__shared_ptrT_CashFlow_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< CashFlow > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< CashFlow >,std::allocator< boost::shared_ptr< CashFlow > > > *)std_vector_Sl_boost_shared_ptr_Sl_CashFlow_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CashFlow_t_std__allocatorT_boost__shared_ptrT_CashFlow_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::Leg.pop call-seq: @@ -148722,10 +149004,10 @@ std::vector,std::allocator< boost::shared_ptr< CashFlow > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< CashFlow > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > > const &","vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > > const &","std::vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CashFlow > > const &","vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CashFlow > > const &","std::vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0])); } arg1 = ptr; } @@ -149143,7 +149425,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > >::size_type","vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > >::size_type","std::vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< CashFlow > >::size_type >(val1); { @@ -149424,15 +149706,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > >::size_type","vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > >::size_type","std::vector<(boost::shared_ptr<(CashFlow)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< CashFlow > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_CashFlow_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > >::value_type const &","vector<(boost::shared_ptr<(CashFlow)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CashFlow > >::value_type const &","std::vector<(boost::shared_ptr<(CashFlow)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CashFlow > >::value_type const &","vector<(boost::shared_ptr<(CashFlow)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CashFlow > >::value_type const &","std::vector<(boost::shared_ptr<(CashFlow)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< CashFlow > >::value_type * >(argp2); { @@ -172397,23 +172679,23 @@ } res1 = SWIG_ConvertPtr(argv[0], &argp1, SWIGTYPE_p_CallabilityPrice, 0 ); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "CallabilityPrice const &","shared_ptr<(Callability)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "CallabilityPrice const &","boost::shared_ptr<(Callability)>", 1, argv[0] )); } if (!argp1) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "CallabilityPrice const &","shared_ptr<(Callability)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "CallabilityPrice const &","boost::shared_ptr<(Callability)>", 1, argv[0])); } arg1 = reinterpret_cast< CallabilityPrice * >(argp1); ecode2 = SWIG_AsVal_int(argv[1], &val2); if (!SWIG_IsOK(ecode2)) { - SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "Callability::Type","shared_ptr<(Callability)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "Callability::Type","boost::shared_ptr<(Callability)>", 2, argv[1] )); } arg2 = static_cast< Callability::Type >(val2); res3 = SWIG_ConvertPtr(argv[2], &argp3, SWIGTYPE_p_Date, 0 ); if (!SWIG_IsOK(res3)) { - SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Date const &","shared_ptr<(Callability)>", 3, argv[2] )); + SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "Date const &","boost::shared_ptr<(Callability)>", 3, argv[2] )); } if (!argp3) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Date const &","shared_ptr<(Callability)>", 3, argv[2])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "Date const &","boost::shared_ptr<(Callability)>", 3, argv[2])); } arg3 = reinterpret_cast< Date * >(argp3); { @@ -172941,6 +173223,49 @@ /* + Document-method: QuantLibc::CallabilitySchedule.reject! + + call-seq: + reject! -> CallabilitySchedule + +Iterate thru each element in the CallabilitySchedule and reject those that fail a condition. A block must be provided. CallabilitySchedule is modified in place. +*/ +SWIGINTERN VALUE +_wrap_CallabilitySchedule_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< Callability > > *arg1 = (std::vector< boost::shared_ptr< Callability > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< Callability >,std::allocator< boost::shared_ptr< Callability > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Callability_t_std__allocatorT_boost__shared_ptrT_Callability_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Callability > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< Callability >,std::allocator< boost::shared_ptr< Callability > > > *)std_vector_Sl_boost_shared_ptr_Sl_Callability_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Callability_t_std__allocatorT_boost__shared_ptrT_Callability_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::CallabilitySchedule.delete_at call-seq: @@ -173037,49 +173362,6 @@ /* - Document-method: QuantLibc::CallabilitySchedule.reject! - - call-seq: - reject! -> CallabilitySchedule - -Iterate thru each element in the CallabilitySchedule and reject those that fail a condition. A block must be provided. CallabilitySchedule is modified in place. -*/ -SWIGINTERN VALUE -_wrap_CallabilitySchedule_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< Callability > > *arg1 = (std::vector< boost::shared_ptr< Callability > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< Callability >,std::allocator< boost::shared_ptr< Callability > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Callability_t_std__allocatorT_boost__shared_ptrT_Callability_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Callability > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< Callability >,std::allocator< boost::shared_ptr< Callability > > > *)std_vector_Sl_boost_shared_ptr_Sl_Callability_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Callability_t_std__allocatorT_boost__shared_ptrT_Callability_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::CallabilitySchedule.pop call-seq: @@ -173864,10 +174146,10 @@ std::vector,std::allocator< boost::shared_ptr< Callability > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< Callability > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > > const &","vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > > const &","std::vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Callability > > const &","vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Callability > > const &","std::vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0])); } arg1 = ptr; } @@ -174285,7 +174567,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > >::size_type","vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > >::size_type","std::vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Callability > >::size_type >(val1); { @@ -174566,15 +174848,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > >::size_type","vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > >::size_type","std::vector<(boost::shared_ptr<(Callability)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Callability > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_Callability_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > >::value_type const &","vector<(boost::shared_ptr<(Callability)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Callability > >::value_type const &","std::vector<(boost::shared_ptr<(Callability)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Callability > >::value_type const &","vector<(boost::shared_ptr<(Callability)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Callability > >::value_type const &","std::vector<(boost::shared_ptr<(Callability)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< Callability > >::value_type * >(argp2); { @@ -176941,6 +177223,49 @@ /* + Document-method: QuantLibc::DividendSchedule.reject! + + call-seq: + reject! -> DividendSchedule + +Iterate thru each element in the DividendSchedule and reject those that fail a condition. A block must be provided. DividendSchedule is modified in place. +*/ +SWIGINTERN VALUE +_wrap_DividendSchedule_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< Dividend > > *arg1 = (std::vector< boost::shared_ptr< Dividend > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< Dividend >,std::allocator< boost::shared_ptr< Dividend > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Dividend_t_std__allocatorT_boost__shared_ptrT_Dividend_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Dividend > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< Dividend >,std::allocator< boost::shared_ptr< Dividend > > > *)std_vector_Sl_boost_shared_ptr_Sl_Dividend_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Dividend_t_std__allocatorT_boost__shared_ptrT_Dividend_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::DividendSchedule.delete_at call-seq: @@ -177037,49 +177362,6 @@ /* - Document-method: QuantLibc::DividendSchedule.reject! - - call-seq: - reject! -> DividendSchedule - -Iterate thru each element in the DividendSchedule and reject those that fail a condition. A block must be provided. DividendSchedule is modified in place. -*/ -SWIGINTERN VALUE -_wrap_DividendSchedule_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< Dividend > > *arg1 = (std::vector< boost::shared_ptr< Dividend > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< Dividend >,std::allocator< boost::shared_ptr< Dividend > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Dividend_t_std__allocatorT_boost__shared_ptrT_Dividend_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< Dividend > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< Dividend >,std::allocator< boost::shared_ptr< Dividend > > > *)std_vector_Sl_boost_shared_ptr_Sl_Dividend_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_Dividend_t_std__allocatorT_boost__shared_ptrT_Dividend_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::DividendSchedule.pop call-seq: @@ -177864,10 +178146,10 @@ std::vector,std::allocator< boost::shared_ptr< Dividend > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< Dividend > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > > const &","vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > > const &","std::vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Dividend > > const &","vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Dividend > > const &","std::vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0])); } arg1 = ptr; } @@ -178285,7 +178567,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > >::size_type","vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > >::size_type","std::vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Dividend > >::size_type >(val1); { @@ -178566,15 +178848,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > >::size_type","vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > >::size_type","std::vector<(boost::shared_ptr<(Dividend)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< Dividend > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_Dividend_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > >::value_type const &","vector<(boost::shared_ptr<(Dividend)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< Dividend > >::value_type const &","std::vector<(boost::shared_ptr<(Dividend)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Dividend > >::value_type const &","vector<(boost::shared_ptr<(Dividend)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< Dividend > >::value_type const &","std::vector<(boost::shared_ptr<(Dividend)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< Dividend > >::value_type * >(argp2); { @@ -186196,6 +186478,49 @@ /* + Document-method: QuantLibc::DefaultProbabilityHelperVector.reject! + + call-seq: + reject! -> DefaultProbabilityHelperVector + +Iterate thru each element in the DefaultProbabilityHelperVector and reject those that fail a condition. A block must be provided. DefaultProbabilityHelperVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_DefaultProbabilityHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *arg1 = (std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< DefaultProbabilityHelper >,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_DefaultProbabilityHelper_t_std__allocatorT_boost__shared_ptrT_DefaultProbabilityHelper_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< DefaultProbabilityHelper > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< DefaultProbabilityHelper >,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_DefaultProbabilityHelper_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_DefaultProbabilityHelper_t_std__allocatorT_boost__shared_ptrT_DefaultProbabilityHelper_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::DefaultProbabilityHelperVector.delete_at call-seq: @@ -186292,49 +186617,6 @@ /* - Document-method: QuantLibc::DefaultProbabilityHelperVector.reject! - - call-seq: - reject! -> DefaultProbabilityHelperVector - -Iterate thru each element in the DefaultProbabilityHelperVector and reject those that fail a condition. A block must be provided. DefaultProbabilityHelperVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_DefaultProbabilityHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *arg1 = (std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< DefaultProbabilityHelper >,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_DefaultProbabilityHelper_t_std__allocatorT_boost__shared_ptrT_DefaultProbabilityHelper_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< DefaultProbabilityHelper > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< DefaultProbabilityHelper >,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_DefaultProbabilityHelper_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_DefaultProbabilityHelper_t_std__allocatorT_boost__shared_ptrT_DefaultProbabilityHelper_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::DefaultProbabilityHelperVector.pop call-seq: @@ -187119,10 +187401,10 @@ std::vector,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< DefaultProbabilityHelper > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > > const &","vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > > const &","std::vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > > const &","vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > > const &","std::vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0])); } arg1 = ptr; } @@ -187540,7 +187822,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::size_type","vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::size_type","std::vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::size_type >(val1); { @@ -187821,15 +188103,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::size_type","vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::size_type","std::vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_DefaultProbabilityHelper_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::value_type const &","vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::value_type const &","std::vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::value_type const &","vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::value_type const &","std::vector<(boost::shared_ptr<(DefaultProbabilityHelper)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< DefaultProbabilityHelper > >::value_type * >(argp2); { @@ -207562,6 +207844,49 @@ /* + Document-method: QuantLibc::ZeroHelperVector.reject! + + call-seq: + reject! -> ZeroHelperVector + +Iterate thru each element in the ZeroHelperVector and reject those that fail a condition. A block must be provided. ZeroHelperVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_ZeroHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< ZeroHelper > > *arg1 = (std::vector< boost::shared_ptr< ZeroHelper > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< ZeroHelper >,std::allocator< boost::shared_ptr< ZeroHelper > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_ZeroHelper_t_std__allocatorT_boost__shared_ptrT_ZeroHelper_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< ZeroHelper > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< ZeroHelper >,std::allocator< boost::shared_ptr< ZeroHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_ZeroHelper_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_ZeroHelper_t_std__allocatorT_boost__shared_ptrT_ZeroHelper_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::ZeroHelperVector.delete_at call-seq: @@ -207658,49 +207983,6 @@ /* - Document-method: QuantLibc::ZeroHelperVector.reject! - - call-seq: - reject! -> ZeroHelperVector - -Iterate thru each element in the ZeroHelperVector and reject those that fail a condition. A block must be provided. ZeroHelperVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_ZeroHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< ZeroHelper > > *arg1 = (std::vector< boost::shared_ptr< ZeroHelper > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< ZeroHelper >,std::allocator< boost::shared_ptr< ZeroHelper > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_ZeroHelper_t_std__allocatorT_boost__shared_ptrT_ZeroHelper_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< ZeroHelper > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< ZeroHelper >,std::allocator< boost::shared_ptr< ZeroHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_ZeroHelper_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_ZeroHelper_t_std__allocatorT_boost__shared_ptrT_ZeroHelper_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::ZeroHelperVector.pop call-seq: @@ -208485,10 +208767,10 @@ std::vector,std::allocator< boost::shared_ptr< ZeroHelper > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< ZeroHelper > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > > const &","vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > > const &","std::vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< ZeroHelper > > const &","vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< ZeroHelper > > const &","std::vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0])); } arg1 = ptr; } @@ -208906,7 +209188,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > >::size_type","vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > >::size_type","std::vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< ZeroHelper > >::size_type >(val1); { @@ -209187,15 +209469,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > >::size_type","vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > >::size_type","std::vector<(boost::shared_ptr<(ZeroHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< ZeroHelper > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_ZeroHelper_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > >::value_type const &","vector<(boost::shared_ptr<(ZeroHelper)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< ZeroHelper > >::value_type const &","std::vector<(boost::shared_ptr<(ZeroHelper)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< ZeroHelper > >::value_type const &","vector<(boost::shared_ptr<(ZeroHelper)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< ZeroHelper > >::value_type const &","std::vector<(boost::shared_ptr<(ZeroHelper)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< ZeroHelper > >::value_type * >(argp2); { @@ -210175,6 +210457,49 @@ /* + Document-method: QuantLibc::YoYHelperVector.reject! + + call-seq: + reject! -> YoYHelperVector + +Iterate thru each element in the YoYHelperVector and reject those that fail a condition. A block must be provided. YoYHelperVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_YoYHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< YoYHelper > > *arg1 = (std::vector< boost::shared_ptr< YoYHelper > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< YoYHelper >,std::allocator< boost::shared_ptr< YoYHelper > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_YoYHelper_t_std__allocatorT_boost__shared_ptrT_YoYHelper_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< YoYHelper > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< YoYHelper >,std::allocator< boost::shared_ptr< YoYHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_YoYHelper_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_YoYHelper_t_std__allocatorT_boost__shared_ptrT_YoYHelper_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::YoYHelperVector.delete_at call-seq: @@ -210271,49 +210596,6 @@ /* - Document-method: QuantLibc::YoYHelperVector.reject! - - call-seq: - reject! -> YoYHelperVector - -Iterate thru each element in the YoYHelperVector and reject those that fail a condition. A block must be provided. YoYHelperVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_YoYHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< YoYHelper > > *arg1 = (std::vector< boost::shared_ptr< YoYHelper > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< YoYHelper >,std::allocator< boost::shared_ptr< YoYHelper > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_YoYHelper_t_std__allocatorT_boost__shared_ptrT_YoYHelper_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< YoYHelper > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< YoYHelper >,std::allocator< boost::shared_ptr< YoYHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_YoYHelper_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_YoYHelper_t_std__allocatorT_boost__shared_ptrT_YoYHelper_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::YoYHelperVector.pop call-seq: @@ -211098,10 +211380,10 @@ std::vector,std::allocator< boost::shared_ptr< YoYHelper > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< YoYHelper > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > > const &","vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > > const &","std::vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< YoYHelper > > const &","vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< YoYHelper > > const &","std::vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0])); } arg1 = ptr; } @@ -211519,7 +211801,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > >::size_type","vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > >::size_type","std::vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< YoYHelper > >::size_type >(val1); { @@ -211800,15 +212082,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > >::size_type","vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > >::size_type","std::vector<(boost::shared_ptr<(YoYHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< YoYHelper > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_YoYHelper_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > >::value_type const &","vector<(boost::shared_ptr<(YoYHelper)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< YoYHelper > >::value_type const &","std::vector<(boost::shared_ptr<(YoYHelper)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< YoYHelper > >::value_type const &","vector<(boost::shared_ptr<(YoYHelper)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< YoYHelper > >::value_type const &","std::vector<(boost::shared_ptr<(YoYHelper)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< YoYHelper > >::value_type * >(argp2); { @@ -220715,11 +220997,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -220736,11 +221018,11 @@ { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { Size rows, cols; - rows = RARRAY(argv[1])->len; + rows = RARRAY_LEN(argv[1]); if (rows > 0) { - VALUE o = RARRAY(argv[1])->ptr[0]; + VALUE o = RARRAY_PTR(argv[1])[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -220751,14 +221033,14 @@ temp2 = Matrix(rows,cols); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp2[i][j] = SWIG_NUM2DBL(x); else @@ -222385,11 +222667,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -222405,11 +222687,11 @@ } { if (rb_obj_is_kind_of(argv[1],rb_cArray)) { - Size size = RARRAY(argv[1])->len; + Size size = RARRAY_LEN(argv[1]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[1])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -222425,11 +222707,11 @@ } { if (rb_obj_is_kind_of(argv[2],rb_cArray)) { - Size size = RARRAY(argv[2])->len; + Size size = RARRAY_LEN(argv[2]); temp3 = Array(size); arg3 = &temp3; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[2])[i]; if (TYPE(o) == T_FLOAT) temp3[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -222481,11 +222763,11 @@ arg1 = reinterpret_cast< TridiagonalOperator * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -222537,11 +222819,11 @@ arg1 = reinterpret_cast< TridiagonalOperator * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -228059,6 +228341,49 @@ /* + Document-method: QuantLibc::RateHelperVector.reject! + + call-seq: + reject! -> RateHelperVector + +Iterate thru each element in the RateHelperVector and reject those that fail a condition. A block must be provided. RateHelperVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_RateHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< RateHelper > > *arg1 = (std::vector< boost::shared_ptr< RateHelper > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< RateHelper >,std::allocator< boost::shared_ptr< RateHelper > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_RateHelper_t_std__allocatorT_boost__shared_ptrT_RateHelper_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< RateHelper > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< RateHelper >,std::allocator< boost::shared_ptr< RateHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_RateHelper_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_RateHelper_t_std__allocatorT_boost__shared_ptrT_RateHelper_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::RateHelperVector.delete_at call-seq: @@ -228155,49 +228480,6 @@ /* - Document-method: QuantLibc::RateHelperVector.reject! - - call-seq: - reject! -> RateHelperVector - -Iterate thru each element in the RateHelperVector and reject those that fail a condition. A block must be provided. RateHelperVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_RateHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< RateHelper > > *arg1 = (std::vector< boost::shared_ptr< RateHelper > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< RateHelper >,std::allocator< boost::shared_ptr< RateHelper > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_RateHelper_t_std__allocatorT_boost__shared_ptrT_RateHelper_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< RateHelper > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< RateHelper >,std::allocator< boost::shared_ptr< RateHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_RateHelper_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_RateHelper_t_std__allocatorT_boost__shared_ptrT_RateHelper_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::RateHelperVector.pop call-seq: @@ -228982,10 +229264,10 @@ std::vector,std::allocator< boost::shared_ptr< RateHelper > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< RateHelper > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > > const &","vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > > const &","std::vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< RateHelper > > const &","vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< RateHelper > > const &","std::vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0])); } arg1 = ptr; } @@ -229403,7 +229685,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > >::size_type","vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > >::size_type","std::vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< RateHelper > >::size_type >(val1); { @@ -229684,15 +229966,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > >::size_type","vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > >::size_type","std::vector<(boost::shared_ptr<(RateHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< RateHelper > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_RateHelper_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > >::value_type const &","vector<(boost::shared_ptr<(RateHelper)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< RateHelper > >::value_type const &","std::vector<(boost::shared_ptr<(RateHelper)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< RateHelper > >::value_type const &","vector<(boost::shared_ptr<(RateHelper)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< RateHelper > >::value_type const &","std::vector<(boost::shared_ptr<(RateHelper)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< RateHelper > >::value_type * >(argp2); { @@ -231931,11 +232213,11 @@ } { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp1 = Array(size); arg1 = &temp1; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp1[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -232275,11 +232557,11 @@ arg1 = reinterpret_cast< SampledCurve * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -232328,11 +232610,11 @@ arg1 = reinterpret_cast< SampledCurve * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -232595,11 +232877,11 @@ arg1 = reinterpret_cast< SampledCurve * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -234624,6 +234906,49 @@ /* + Document-method: QuantLibc::CalibrationHelperVector.reject! + + call-seq: + reject! -> CalibrationHelperVector + +Iterate thru each element in the CalibrationHelperVector and reject those that fail a condition. A block must be provided. CalibrationHelperVector is modified in place. +*/ +SWIGINTERN VALUE +_wrap_CalibrationHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { + std::vector< boost::shared_ptr< CalibrationHelper > > *arg1 = (std::vector< boost::shared_ptr< CalibrationHelper > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + std::vector< boost::shared_ptr< CalibrationHelper >,std::allocator< boost::shared_ptr< CalibrationHelper > > > *result = 0 ; + VALUE vresult = Qnil; + + if ((argc < 0) || (argc > 0)) { + rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; + } + res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CalibrationHelper_t_std__allocatorT_boost__shared_ptrT_CalibrationHelper_t_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > > *","reject_bang", 1, self )); + } + arg1 = reinterpret_cast< std::vector< boost::shared_ptr< CalibrationHelper > > * >(argp1); + { + try { + result = (std::vector< boost::shared_ptr< CalibrationHelper >,std::allocator< boost::shared_ptr< CalibrationHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_CalibrationHelper_Sg__Sg__reject_bang(arg1); + } catch (std::out_of_range& e) { + SWIG_exception(SWIG_IndexError,const_cast(e.what())); + } catch (std::exception& e) { + SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); + } catch (...) { + SWIG_exception(SWIG_UnknownError,"unknown error"); + } + } + vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CalibrationHelper_t_std__allocatorT_boost__shared_ptrT_CalibrationHelper_t_t_t, 0 | 0 ); + return vresult; +fail: + return Qnil; +} + + + +/* Document-method: QuantLibc::CalibrationHelperVector.delete_at call-seq: @@ -234720,49 +235045,6 @@ /* - Document-method: QuantLibc::CalibrationHelperVector.reject! - - call-seq: - reject! -> CalibrationHelperVector - -Iterate thru each element in the CalibrationHelperVector and reject those that fail a condition. A block must be provided. CalibrationHelperVector is modified in place. -*/ -SWIGINTERN VALUE -_wrap_CalibrationHelperVector_rejectN___(int argc, VALUE *argv, VALUE self) { - std::vector< boost::shared_ptr< CalibrationHelper > > *arg1 = (std::vector< boost::shared_ptr< CalibrationHelper > > *) 0 ; - void *argp1 = 0 ; - int res1 = 0 ; - std::vector< boost::shared_ptr< CalibrationHelper >,std::allocator< boost::shared_ptr< CalibrationHelper > > > *result = 0 ; - VALUE vresult = Qnil; - - if ((argc < 0) || (argc > 0)) { - rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail; - } - res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CalibrationHelper_t_std__allocatorT_boost__shared_ptrT_CalibrationHelper_t_t_t, 0 | 0 ); - if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > > *","reject_bang", 1, self )); - } - arg1 = reinterpret_cast< std::vector< boost::shared_ptr< CalibrationHelper > > * >(argp1); - { - try { - result = (std::vector< boost::shared_ptr< CalibrationHelper >,std::allocator< boost::shared_ptr< CalibrationHelper > > > *)std_vector_Sl_boost_shared_ptr_Sl_CalibrationHelper_Sg__Sg__reject_bang(arg1); - } catch (std::out_of_range& e) { - SWIG_exception(SWIG_IndexError,const_cast(e.what())); - } catch (std::exception& e) { - SWIG_exception(SWIG_RuntimeError,const_cast(e.what())); - } catch (...) { - SWIG_exception(SWIG_UnknownError,"unknown error"); - } - } - vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_boost__shared_ptrT_CalibrationHelper_t_std__allocatorT_boost__shared_ptrT_CalibrationHelper_t_t_t, 0 | 0 ); - return vresult; -fail: - return Qnil; -} - - - -/* Document-method: QuantLibc::CalibrationHelperVector.pop call-seq: @@ -235547,10 +235829,10 @@ std::vector,std::allocator< boost::shared_ptr< CalibrationHelper > > > *ptr = (std::vector,std::allocator< boost::shared_ptr< CalibrationHelper > > > *)0; res1 = swig::asptr(argv[0], &ptr); if (!SWIG_IsOK(res1)) { - SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > > const &","vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > > const &","std::vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0] )); } if (!ptr) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CalibrationHelper > > const &","vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CalibrationHelper > > const &","std::vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0])); } arg1 = ptr; } @@ -235968,7 +236250,7 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > >::size_type","vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > >::size_type","std::vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< CalibrationHelper > >::size_type >(val1); { @@ -236249,15 +236531,15 @@ } ecode1 = SWIG_AsVal_size_t(argv[0], &val1); if (!SWIG_IsOK(ecode1)) { - SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > >::size_type","vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0] )); + SWIG_exception_fail(SWIG_ArgError(ecode1), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > >::size_type","std::vector<(boost::shared_ptr<(CalibrationHelper)>)>", 1, argv[0] )); } arg1 = static_cast< std::vector< boost::shared_ptr< CalibrationHelper > >::size_type >(val1); res2 = SWIG_ConvertPtr(argv[1], &argp2, SWIGTYPE_p_boost__shared_ptrT_CalibrationHelper_t, 0 ); if (!SWIG_IsOK(res2)) { - SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > >::value_type const &","vector<(boost::shared_ptr<(CalibrationHelper)>)>", 2, argv[1] )); + SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "std::vector< boost::shared_ptr< CalibrationHelper > >::value_type const &","std::vector<(boost::shared_ptr<(CalibrationHelper)>)>", 2, argv[1] )); } if (!argp2) { - SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CalibrationHelper > >::value_type const &","vector<(boost::shared_ptr<(CalibrationHelper)>)>", 2, argv[1])); + SWIG_exception_fail(SWIG_ValueError, Ruby_Format_TypeError("invalid null reference ", "std::vector< boost::shared_ptr< CalibrationHelper > >::value_type const &","std::vector<(boost::shared_ptr<(CalibrationHelper)>)>", 2, argv[1])); } arg2 = reinterpret_cast< std::vector< boost::shared_ptr< CalibrationHelper > >::value_type * >(argp2); { @@ -243387,11 +243669,11 @@ arg1 = reinterpret_cast< GenericSequenceStatistics< Statistics > * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -243445,11 +243727,11 @@ arg1 = reinterpret_cast< GenericSequenceStatistics< Statistics > * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -244251,11 +244533,11 @@ arg1 = reinterpret_cast< GenericSequenceStatistics< RiskStatistics > * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -244309,11 +244591,11 @@ arg1 = reinterpret_cast< GenericSequenceStatistics< RiskStatistics > * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -245115,11 +245397,11 @@ arg1 = reinterpret_cast< GenericSequenceStatistics< IncrementalStatistics > * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -245173,11 +245455,11 @@ arg1 = reinterpret_cast< GenericSequenceStatistics< IncrementalStatistics > * >(argp1); { if (rb_obj_is_kind_of(argv[0],rb_cArray)) { - Size size = RARRAY(argv[0])->len; + Size size = RARRAY_LEN(argv[0]); temp2 = Array(size); arg2 = &temp2; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR(argv[0])[i]; if (TYPE(o) == T_FLOAT) temp2[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -254353,6 +254635,7 @@ size_t i; swig_module_info *module_head, *iter; int found, init; + (void *)clientdata; /* check to see if the circular list has been setup, if not, set it up */ if (swig_module.next==0) { @@ -254557,7 +254840,7 @@ SwigClassGC_VALUE.mark = 0; SwigClassGC_VALUE.trackObjects = 0; - swig::SwigGCReferences::initialize(); + swig::GC_VALUE::initialize(); SwigClassConstIterator.klass = rb_define_class_under(mQuantLibc, "ConstIterator", rb_cObject); @@ -254657,10 +254940,10 @@ rb_define_method(SwigClassPeriodVector.klass, "slice", VALUEFUNC(_wrap_PeriodVector_slice), -1); rb_define_method(SwigClassPeriodVector.klass, "each", VALUEFUNC(_wrap_PeriodVector_each), -1); rb_define_method(SwigClassPeriodVector.klass, "select", VALUEFUNC(_wrap_PeriodVector_select), -1); - rb_define_method(SwigClassPeriodVector.klass, "delete_at", VALUEFUNC(_wrap_PeriodVector_delete_at), -1); - rb_define_method(SwigClassPeriodVector.klass, "__delete2__", VALUEFUNC(_wrap_PeriodVector___delete2__), -1); rb_define_method(SwigClassPeriodVector.klass, "reject!", VALUEFUNC(_wrap_PeriodVector_rejectN___), -1); rb_define_alias(SwigClassPeriodVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassPeriodVector.klass, "delete_at", VALUEFUNC(_wrap_PeriodVector_delete_at), -1); + rb_define_method(SwigClassPeriodVector.klass, "__delete2__", VALUEFUNC(_wrap_PeriodVector___delete2__), -1); rb_define_method(SwigClassPeriodVector.klass, "pop", VALUEFUNC(_wrap_PeriodVector_pop), -1); rb_define_method(SwigClassPeriodVector.klass, "push", VALUEFUNC(_wrap_PeriodVector_push), -1); rb_define_alias(SwigClassPeriodVector.klass, "<<", "push"); @@ -254754,10 +255037,10 @@ rb_define_method(SwigClassDateVector.klass, "slice", VALUEFUNC(_wrap_DateVector_slice), -1); rb_define_method(SwigClassDateVector.klass, "each", VALUEFUNC(_wrap_DateVector_each), -1); rb_define_method(SwigClassDateVector.klass, "select", VALUEFUNC(_wrap_DateVector_select), -1); - rb_define_method(SwigClassDateVector.klass, "delete_at", VALUEFUNC(_wrap_DateVector_delete_at), -1); - rb_define_method(SwigClassDateVector.klass, "__delete2__", VALUEFUNC(_wrap_DateVector___delete2__), -1); rb_define_method(SwigClassDateVector.klass, "reject!", VALUEFUNC(_wrap_DateVector_rejectN___), -1); rb_define_alias(SwigClassDateVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassDateVector.klass, "delete_at", VALUEFUNC(_wrap_DateVector_delete_at), -1); + rb_define_method(SwigClassDateVector.klass, "__delete2__", VALUEFUNC(_wrap_DateVector___delete2__), -1); rb_define_method(SwigClassDateVector.klass, "pop", VALUEFUNC(_wrap_DateVector_pop), -1); rb_define_method(SwigClassDateVector.klass, "push", VALUEFUNC(_wrap_DateVector_push), -1); rb_define_alias(SwigClassDateVector.klass, "<<", "push"); @@ -254826,10 +255109,10 @@ rb_define_method(SwigClassIntVector.klass, "slice", VALUEFUNC(_wrap_IntVector_slice), -1); rb_define_method(SwigClassIntVector.klass, "each", VALUEFUNC(_wrap_IntVector_each), -1); rb_define_method(SwigClassIntVector.klass, "select", VALUEFUNC(_wrap_IntVector_select), -1); - rb_define_method(SwigClassIntVector.klass, "delete_at", VALUEFUNC(_wrap_IntVector_delete_at), -1); - rb_define_method(SwigClassIntVector.klass, "__delete2__", VALUEFUNC(_wrap_IntVector___delete2__), -1); rb_define_method(SwigClassIntVector.klass, "reject!", VALUEFUNC(_wrap_IntVector_rejectN___), -1); rb_define_alias(SwigClassIntVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassIntVector.klass, "delete_at", VALUEFUNC(_wrap_IntVector_delete_at), -1); + rb_define_method(SwigClassIntVector.klass, "__delete2__", VALUEFUNC(_wrap_IntVector___delete2__), -1); rb_define_method(SwigClassIntVector.klass, "pop", VALUEFUNC(_wrap_IntVector_pop), -1); rb_define_method(SwigClassIntVector.klass, "push", VALUEFUNC(_wrap_IntVector_push), -1); rb_define_alias(SwigClassIntVector.klass, "<<", "push"); @@ -254874,10 +255157,10 @@ rb_define_method(SwigClassUnsignedIntVector.klass, "slice", VALUEFUNC(_wrap_UnsignedIntVector_slice), -1); rb_define_method(SwigClassUnsignedIntVector.klass, "each", VALUEFUNC(_wrap_UnsignedIntVector_each), -1); rb_define_method(SwigClassUnsignedIntVector.klass, "select", VALUEFUNC(_wrap_UnsignedIntVector_select), -1); - rb_define_method(SwigClassUnsignedIntVector.klass, "delete_at", VALUEFUNC(_wrap_UnsignedIntVector_delete_at), -1); - rb_define_method(SwigClassUnsignedIntVector.klass, "__delete2__", VALUEFUNC(_wrap_UnsignedIntVector___delete2__), -1); rb_define_method(SwigClassUnsignedIntVector.klass, "reject!", VALUEFUNC(_wrap_UnsignedIntVector_rejectN___), -1); rb_define_alias(SwigClassUnsignedIntVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassUnsignedIntVector.klass, "delete_at", VALUEFUNC(_wrap_UnsignedIntVector_delete_at), -1); + rb_define_method(SwigClassUnsignedIntVector.klass, "__delete2__", VALUEFUNC(_wrap_UnsignedIntVector___delete2__), -1); rb_define_method(SwigClassUnsignedIntVector.klass, "pop", VALUEFUNC(_wrap_UnsignedIntVector_pop), -1); rb_define_method(SwigClassUnsignedIntVector.klass, "push", VALUEFUNC(_wrap_UnsignedIntVector_push), -1); rb_define_alias(SwigClassUnsignedIntVector.klass, "<<", "push"); @@ -254922,10 +255205,10 @@ rb_define_method(SwigClassDoubleVector.klass, "slice", VALUEFUNC(_wrap_DoubleVector_slice), -1); rb_define_method(SwigClassDoubleVector.klass, "each", VALUEFUNC(_wrap_DoubleVector_each), -1); rb_define_method(SwigClassDoubleVector.klass, "select", VALUEFUNC(_wrap_DoubleVector_select), -1); - rb_define_method(SwigClassDoubleVector.klass, "delete_at", VALUEFUNC(_wrap_DoubleVector_delete_at), -1); - rb_define_method(SwigClassDoubleVector.klass, "__delete2__", VALUEFUNC(_wrap_DoubleVector___delete2__), -1); rb_define_method(SwigClassDoubleVector.klass, "reject!", VALUEFUNC(_wrap_DoubleVector_rejectN___), -1); rb_define_alias(SwigClassDoubleVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassDoubleVector.klass, "delete_at", VALUEFUNC(_wrap_DoubleVector_delete_at), -1); + rb_define_method(SwigClassDoubleVector.klass, "__delete2__", VALUEFUNC(_wrap_DoubleVector___delete2__), -1); rb_define_method(SwigClassDoubleVector.klass, "pop", VALUEFUNC(_wrap_DoubleVector_pop), -1); rb_define_method(SwigClassDoubleVector.klass, "push", VALUEFUNC(_wrap_DoubleVector_push), -1); rb_define_alias(SwigClassDoubleVector.klass, "<<", "push"); @@ -254970,10 +255253,10 @@ rb_define_method(SwigClassStrVector.klass, "slice", VALUEFUNC(_wrap_StrVector_slice), -1); rb_define_method(SwigClassStrVector.klass, "each", VALUEFUNC(_wrap_StrVector_each), -1); rb_define_method(SwigClassStrVector.klass, "select", VALUEFUNC(_wrap_StrVector_select), -1); - rb_define_method(SwigClassStrVector.klass, "delete_at", VALUEFUNC(_wrap_StrVector_delete_at), -1); - rb_define_method(SwigClassStrVector.klass, "__delete2__", VALUEFUNC(_wrap_StrVector___delete2__), -1); rb_define_method(SwigClassStrVector.klass, "reject!", VALUEFUNC(_wrap_StrVector_rejectN___), -1); rb_define_alias(SwigClassStrVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassStrVector.klass, "delete_at", VALUEFUNC(_wrap_StrVector_delete_at), -1); + rb_define_method(SwigClassStrVector.klass, "__delete2__", VALUEFUNC(_wrap_StrVector___delete2__), -1); rb_define_method(SwigClassStrVector.klass, "pop", VALUEFUNC(_wrap_StrVector_pop), -1); rb_define_method(SwigClassStrVector.klass, "push", VALUEFUNC(_wrap_StrVector_push), -1); rb_define_alias(SwigClassStrVector.klass, "<<", "push"); @@ -255017,10 +255300,10 @@ rb_define_method(SwigClassBoolVector.klass, "slice", VALUEFUNC(_wrap_BoolVector_slice), -1); rb_define_method(SwigClassBoolVector.klass, "each", VALUEFUNC(_wrap_BoolVector_each), -1); rb_define_method(SwigClassBoolVector.klass, "select", VALUEFUNC(_wrap_BoolVector_select), -1); - rb_define_method(SwigClassBoolVector.klass, "delete_at", VALUEFUNC(_wrap_BoolVector_delete_at), -1); - rb_define_method(SwigClassBoolVector.klass, "__delete2__", VALUEFUNC(_wrap_BoolVector___delete2__), -1); rb_define_method(SwigClassBoolVector.klass, "reject!", VALUEFUNC(_wrap_BoolVector_rejectN___), -1); rb_define_alias(SwigClassBoolVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassBoolVector.klass, "delete_at", VALUEFUNC(_wrap_BoolVector_delete_at), -1); + rb_define_method(SwigClassBoolVector.klass, "__delete2__", VALUEFUNC(_wrap_BoolVector___delete2__), -1); rb_define_method(SwigClassBoolVector.klass, "pop", VALUEFUNC(_wrap_BoolVector_pop), -1); rb_define_method(SwigClassBoolVector.klass, "push", VALUEFUNC(_wrap_BoolVector_push), -1); rb_define_alias(SwigClassBoolVector.klass, "<<", "push"); @@ -255081,10 +255364,10 @@ rb_define_method(SwigClassNodeVector.klass, "slice", VALUEFUNC(_wrap_NodeVector_slice), -1); rb_define_method(SwigClassNodeVector.klass, "each", VALUEFUNC(_wrap_NodeVector_each), -1); rb_define_method(SwigClassNodeVector.klass, "select", VALUEFUNC(_wrap_NodeVector_select), -1); - rb_define_method(SwigClassNodeVector.klass, "delete_at", VALUEFUNC(_wrap_NodeVector_delete_at), -1); - rb_define_method(SwigClassNodeVector.klass, "__delete2__", VALUEFUNC(_wrap_NodeVector___delete2__), -1); rb_define_method(SwigClassNodeVector.klass, "reject!", VALUEFUNC(_wrap_NodeVector_rejectN___), -1); rb_define_alias(SwigClassNodeVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassNodeVector.klass, "delete_at", VALUEFUNC(_wrap_NodeVector_delete_at), -1); + rb_define_method(SwigClassNodeVector.klass, "__delete2__", VALUEFUNC(_wrap_NodeVector___delete2__), -1); rb_define_method(SwigClassNodeVector.klass, "pop", VALUEFUNC(_wrap_NodeVector_pop), -1); rb_define_method(SwigClassNodeVector.klass, "push", VALUEFUNC(_wrap_NodeVector_push), -1); rb_define_alias(SwigClassNodeVector.klass, "<<", "push"); @@ -255318,10 +255601,10 @@ rb_define_method(SwigClassQuoteVector.klass, "slice", VALUEFUNC(_wrap_QuoteVector_slice), -1); rb_define_method(SwigClassQuoteVector.klass, "each", VALUEFUNC(_wrap_QuoteVector_each), -1); rb_define_method(SwigClassQuoteVector.klass, "select", VALUEFUNC(_wrap_QuoteVector_select), -1); - rb_define_method(SwigClassQuoteVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteVector_delete_at), -1); - rb_define_method(SwigClassQuoteVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteVector___delete2__), -1); rb_define_method(SwigClassQuoteVector.klass, "reject!", VALUEFUNC(_wrap_QuoteVector_rejectN___), -1); rb_define_alias(SwigClassQuoteVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassQuoteVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteVector_delete_at), -1); + rb_define_method(SwigClassQuoteVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteVector___delete2__), -1); rb_define_method(SwigClassQuoteVector.klass, "pop", VALUEFUNC(_wrap_QuoteVector_pop), -1); rb_define_method(SwigClassQuoteVector.klass, "push", VALUEFUNC(_wrap_QuoteVector_push), -1); rb_define_alias(SwigClassQuoteVector.klass, "<<", "push"); @@ -255364,10 +255647,10 @@ rb_define_method(SwigClassQuoteVectorVector.klass, "slice", VALUEFUNC(_wrap_QuoteVectorVector_slice), -1); rb_define_method(SwigClassQuoteVectorVector.klass, "each", VALUEFUNC(_wrap_QuoteVectorVector_each), -1); rb_define_method(SwigClassQuoteVectorVector.klass, "select", VALUEFUNC(_wrap_QuoteVectorVector_select), -1); - rb_define_method(SwigClassQuoteVectorVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteVectorVector_delete_at), -1); - rb_define_method(SwigClassQuoteVectorVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteVectorVector___delete2__), -1); rb_define_method(SwigClassQuoteVectorVector.klass, "reject!", VALUEFUNC(_wrap_QuoteVectorVector_rejectN___), -1); rb_define_alias(SwigClassQuoteVectorVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassQuoteVectorVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteVectorVector_delete_at), -1); + rb_define_method(SwigClassQuoteVectorVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteVectorVector___delete2__), -1); rb_define_method(SwigClassQuoteVectorVector.klass, "pop", VALUEFUNC(_wrap_QuoteVectorVector_pop), -1); rb_define_method(SwigClassQuoteVectorVector.klass, "push", VALUEFUNC(_wrap_QuoteVectorVector_push), -1); rb_define_alias(SwigClassQuoteVectorVector.klass, "<<", "push"); @@ -255410,10 +255693,10 @@ rb_define_method(SwigClassQuoteHandleVector.klass, "slice", VALUEFUNC(_wrap_QuoteHandleVector_slice), -1); rb_define_method(SwigClassQuoteHandleVector.klass, "each", VALUEFUNC(_wrap_QuoteHandleVector_each), -1); rb_define_method(SwigClassQuoteHandleVector.klass, "select", VALUEFUNC(_wrap_QuoteHandleVector_select), -1); - rb_define_method(SwigClassQuoteHandleVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteHandleVector_delete_at), -1); - rb_define_method(SwigClassQuoteHandleVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteHandleVector___delete2__), -1); rb_define_method(SwigClassQuoteHandleVector.klass, "reject!", VALUEFUNC(_wrap_QuoteHandleVector_rejectN___), -1); rb_define_alias(SwigClassQuoteHandleVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassQuoteHandleVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteHandleVector_delete_at), -1); + rb_define_method(SwigClassQuoteHandleVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteHandleVector___delete2__), -1); rb_define_method(SwigClassQuoteHandleVector.klass, "pop", VALUEFUNC(_wrap_QuoteHandleVector_pop), -1); rb_define_method(SwigClassQuoteHandleVector.klass, "push", VALUEFUNC(_wrap_QuoteHandleVector_push), -1); rb_define_alias(SwigClassQuoteHandleVector.klass, "<<", "push"); @@ -255456,10 +255739,10 @@ rb_define_method(SwigClassQuoteHandleVectorVector.klass, "slice", VALUEFUNC(_wrap_QuoteHandleVectorVector_slice), -1); rb_define_method(SwigClassQuoteHandleVectorVector.klass, "each", VALUEFUNC(_wrap_QuoteHandleVectorVector_each), -1); rb_define_method(SwigClassQuoteHandleVectorVector.klass, "select", VALUEFUNC(_wrap_QuoteHandleVectorVector_select), -1); - rb_define_method(SwigClassQuoteHandleVectorVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteHandleVectorVector_delete_at), -1); - rb_define_method(SwigClassQuoteHandleVectorVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteHandleVectorVector___delete2__), -1); rb_define_method(SwigClassQuoteHandleVectorVector.klass, "reject!", VALUEFUNC(_wrap_QuoteHandleVectorVector_rejectN___), -1); rb_define_alias(SwigClassQuoteHandleVectorVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassQuoteHandleVectorVector.klass, "delete_at", VALUEFUNC(_wrap_QuoteHandleVectorVector_delete_at), -1); + rb_define_method(SwigClassQuoteHandleVectorVector.klass, "__delete2__", VALUEFUNC(_wrap_QuoteHandleVectorVector___delete2__), -1); rb_define_method(SwigClassQuoteHandleVectorVector.klass, "pop", VALUEFUNC(_wrap_QuoteHandleVectorVector_pop), -1); rb_define_method(SwigClassQuoteHandleVectorVector.klass, "push", VALUEFUNC(_wrap_QuoteHandleVectorVector_push), -1); rb_define_alias(SwigClassQuoteHandleVectorVector.klass, "<<", "push"); @@ -255502,10 +255785,10 @@ rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "slice", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_slice), -1); rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "each", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_each), -1); rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "select", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_select), -1); - rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "delete_at", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_delete_at), -1); - rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "__delete2__", VALUEFUNC(_wrap_RelinkableQuoteHandleVector___delete2__), -1); rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "reject!", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_rejectN___), -1); rb_define_alias(SwigClassRelinkableQuoteHandleVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "delete_at", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_delete_at), -1); + rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "__delete2__", VALUEFUNC(_wrap_RelinkableQuoteHandleVector___delete2__), -1); rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "pop", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_pop), -1); rb_define_method(SwigClassRelinkableQuoteHandleVector.klass, "push", VALUEFUNC(_wrap_RelinkableQuoteHandleVector_push), -1); rb_define_alias(SwigClassRelinkableQuoteHandleVector.klass, "<<", "push"); @@ -255548,10 +255831,10 @@ rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "slice", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_slice), -1); rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "each", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_each), -1); rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "select", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_select), -1); - rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "delete_at", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_delete_at), -1); - rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "__delete2__", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector___delete2__), -1); rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "reject!", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_rejectN___), -1); rb_define_alias(SwigClassRelinkableQuoteHandleVectorVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "delete_at", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_delete_at), -1); + rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "__delete2__", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector___delete2__), -1); rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "pop", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_pop), -1); rb_define_method(SwigClassRelinkableQuoteHandleVectorVector.klass, "push", VALUEFUNC(_wrap_RelinkableQuoteHandleVectorVector_push), -1); rb_define_alias(SwigClassRelinkableQuoteHandleVectorVector.klass, "<<", "push"); @@ -257006,10 +257289,10 @@ rb_define_method(SwigClassIntervalPriceVector.klass, "slice", VALUEFUNC(_wrap_IntervalPriceVector_slice), -1); rb_define_method(SwigClassIntervalPriceVector.klass, "each", VALUEFUNC(_wrap_IntervalPriceVector_each), -1); rb_define_method(SwigClassIntervalPriceVector.klass, "select", VALUEFUNC(_wrap_IntervalPriceVector_select), -1); - rb_define_method(SwigClassIntervalPriceVector.klass, "delete_at", VALUEFUNC(_wrap_IntervalPriceVector_delete_at), -1); - rb_define_method(SwigClassIntervalPriceVector.klass, "__delete2__", VALUEFUNC(_wrap_IntervalPriceVector___delete2__), -1); rb_define_method(SwigClassIntervalPriceVector.klass, "reject!", VALUEFUNC(_wrap_IntervalPriceVector_rejectN___), -1); rb_define_alias(SwigClassIntervalPriceVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassIntervalPriceVector.klass, "delete_at", VALUEFUNC(_wrap_IntervalPriceVector_delete_at), -1); + rb_define_method(SwigClassIntervalPriceVector.klass, "__delete2__", VALUEFUNC(_wrap_IntervalPriceVector___delete2__), -1); rb_define_method(SwigClassIntervalPriceVector.klass, "pop", VALUEFUNC(_wrap_IntervalPriceVector_pop), -1); rb_define_method(SwigClassIntervalPriceVector.klass, "push", VALUEFUNC(_wrap_IntervalPriceVector_push), -1); rb_define_alias(SwigClassIntervalPriceVector.klass, "<<", "push"); @@ -258252,10 +258535,10 @@ rb_define_method(SwigClassStochasticProcessVector.klass, "slice", VALUEFUNC(_wrap_StochasticProcessVector_slice), -1); rb_define_method(SwigClassStochasticProcessVector.klass, "each", VALUEFUNC(_wrap_StochasticProcessVector_each), -1); rb_define_method(SwigClassStochasticProcessVector.klass, "select", VALUEFUNC(_wrap_StochasticProcessVector_select), -1); - rb_define_method(SwigClassStochasticProcessVector.klass, "delete_at", VALUEFUNC(_wrap_StochasticProcessVector_delete_at), -1); - rb_define_method(SwigClassStochasticProcessVector.klass, "__delete2__", VALUEFUNC(_wrap_StochasticProcessVector___delete2__), -1); rb_define_method(SwigClassStochasticProcessVector.klass, "reject!", VALUEFUNC(_wrap_StochasticProcessVector_rejectN___), -1); rb_define_alias(SwigClassStochasticProcessVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassStochasticProcessVector.klass, "delete_at", VALUEFUNC(_wrap_StochasticProcessVector_delete_at), -1); + rb_define_method(SwigClassStochasticProcessVector.klass, "__delete2__", VALUEFUNC(_wrap_StochasticProcessVector___delete2__), -1); rb_define_method(SwigClassStochasticProcessVector.klass, "pop", VALUEFUNC(_wrap_StochasticProcessVector_pop), -1); rb_define_method(SwigClassStochasticProcessVector.klass, "push", VALUEFUNC(_wrap_StochasticProcessVector_push), -1); rb_define_alias(SwigClassStochasticProcessVector.klass, "<<", "push"); @@ -258798,10 +259081,10 @@ rb_define_method(SwigClassOptionList.klass, "slice", VALUEFUNC(_wrap_OptionList_slice), -1); rb_define_method(SwigClassOptionList.klass, "each", VALUEFUNC(_wrap_OptionList_each), -1); rb_define_method(SwigClassOptionList.klass, "select", VALUEFUNC(_wrap_OptionList_select), -1); - rb_define_method(SwigClassOptionList.klass, "delete_at", VALUEFUNC(_wrap_OptionList_delete_at), -1); - rb_define_method(SwigClassOptionList.klass, "__delete2__", VALUEFUNC(_wrap_OptionList___delete2__), -1); rb_define_method(SwigClassOptionList.klass, "reject!", VALUEFUNC(_wrap_OptionList_rejectN___), -1); rb_define_alias(SwigClassOptionList.klass, "delete_if", "reject!"); + rb_define_method(SwigClassOptionList.klass, "delete_at", VALUEFUNC(_wrap_OptionList_delete_at), -1); + rb_define_method(SwigClassOptionList.klass, "__delete2__", VALUEFUNC(_wrap_OptionList___delete2__), -1); rb_define_method(SwigClassOptionList.klass, "pop", VALUEFUNC(_wrap_OptionList_pop), -1); rb_define_method(SwigClassOptionList.klass, "push", VALUEFUNC(_wrap_OptionList_push), -1); rb_define_alias(SwigClassOptionList.klass, "<<", "push"); @@ -259040,10 +259323,10 @@ rb_define_method(SwigClassLeg.klass, "slice", VALUEFUNC(_wrap_Leg_slice), -1); rb_define_method(SwigClassLeg.klass, "each", VALUEFUNC(_wrap_Leg_each), -1); rb_define_method(SwigClassLeg.klass, "select", VALUEFUNC(_wrap_Leg_select), -1); - rb_define_method(SwigClassLeg.klass, "delete_at", VALUEFUNC(_wrap_Leg_delete_at), -1); - rb_define_method(SwigClassLeg.klass, "__delete2__", VALUEFUNC(_wrap_Leg___delete2__), -1); rb_define_method(SwigClassLeg.klass, "reject!", VALUEFUNC(_wrap_Leg_rejectN___), -1); rb_define_alias(SwigClassLeg.klass, "delete_if", "reject!"); + rb_define_method(SwigClassLeg.klass, "delete_at", VALUEFUNC(_wrap_Leg_delete_at), -1); + rb_define_method(SwigClassLeg.klass, "__delete2__", VALUEFUNC(_wrap_Leg___delete2__), -1); rb_define_method(SwigClassLeg.klass, "pop", VALUEFUNC(_wrap_Leg_pop), -1); rb_define_method(SwigClassLeg.klass, "push", VALUEFUNC(_wrap_Leg_push), -1); rb_define_alias(SwigClassLeg.klass, "<<", "push"); @@ -259409,10 +259692,10 @@ rb_define_method(SwigClassCallabilitySchedule.klass, "slice", VALUEFUNC(_wrap_CallabilitySchedule_slice), -1); rb_define_method(SwigClassCallabilitySchedule.klass, "each", VALUEFUNC(_wrap_CallabilitySchedule_each), -1); rb_define_method(SwigClassCallabilitySchedule.klass, "select", VALUEFUNC(_wrap_CallabilitySchedule_select), -1); - rb_define_method(SwigClassCallabilitySchedule.klass, "delete_at", VALUEFUNC(_wrap_CallabilitySchedule_delete_at), -1); - rb_define_method(SwigClassCallabilitySchedule.klass, "__delete2__", VALUEFUNC(_wrap_CallabilitySchedule___delete2__), -1); rb_define_method(SwigClassCallabilitySchedule.klass, "reject!", VALUEFUNC(_wrap_CallabilitySchedule_rejectN___), -1); rb_define_alias(SwigClassCallabilitySchedule.klass, "delete_if", "reject!"); + rb_define_method(SwigClassCallabilitySchedule.klass, "delete_at", VALUEFUNC(_wrap_CallabilitySchedule_delete_at), -1); + rb_define_method(SwigClassCallabilitySchedule.klass, "__delete2__", VALUEFUNC(_wrap_CallabilitySchedule___delete2__), -1); rb_define_method(SwigClassCallabilitySchedule.klass, "pop", VALUEFUNC(_wrap_CallabilitySchedule_pop), -1); rb_define_method(SwigClassCallabilitySchedule.klass, "push", VALUEFUNC(_wrap_CallabilitySchedule_push), -1); rb_define_alias(SwigClassCallabilitySchedule.klass, "<<", "push"); @@ -259524,10 +259807,10 @@ rb_define_method(SwigClassDividendSchedule.klass, "slice", VALUEFUNC(_wrap_DividendSchedule_slice), -1); rb_define_method(SwigClassDividendSchedule.klass, "each", VALUEFUNC(_wrap_DividendSchedule_each), -1); rb_define_method(SwigClassDividendSchedule.klass, "select", VALUEFUNC(_wrap_DividendSchedule_select), -1); - rb_define_method(SwigClassDividendSchedule.klass, "delete_at", VALUEFUNC(_wrap_DividendSchedule_delete_at), -1); - rb_define_method(SwigClassDividendSchedule.klass, "__delete2__", VALUEFUNC(_wrap_DividendSchedule___delete2__), -1); rb_define_method(SwigClassDividendSchedule.klass, "reject!", VALUEFUNC(_wrap_DividendSchedule_rejectN___), -1); rb_define_alias(SwigClassDividendSchedule.klass, "delete_if", "reject!"); + rb_define_method(SwigClassDividendSchedule.klass, "delete_at", VALUEFUNC(_wrap_DividendSchedule_delete_at), -1); + rb_define_method(SwigClassDividendSchedule.klass, "__delete2__", VALUEFUNC(_wrap_DividendSchedule___delete2__), -1); rb_define_method(SwigClassDividendSchedule.klass, "pop", VALUEFUNC(_wrap_DividendSchedule_pop), -1); rb_define_method(SwigClassDividendSchedule.klass, "push", VALUEFUNC(_wrap_DividendSchedule_push), -1); rb_define_alias(SwigClassDividendSchedule.klass, "<<", "push"); @@ -259697,10 +259980,10 @@ rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "slice", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_slice), -1); rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "each", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_each), -1); rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "select", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_select), -1); - rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "delete_at", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_delete_at), -1); - rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_DefaultProbabilityHelperVector___delete2__), -1); rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "reject!", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_rejectN___), -1); rb_define_alias(SwigClassDefaultProbabilityHelperVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "delete_at", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_delete_at), -1); + rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_DefaultProbabilityHelperVector___delete2__), -1); rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "pop", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_pop), -1); rb_define_method(SwigClassDefaultProbabilityHelperVector.klass, "push", VALUEFUNC(_wrap_DefaultProbabilityHelperVector_push), -1); rb_define_alias(SwigClassDefaultProbabilityHelperVector.klass, "<<", "push"); @@ -260394,10 +260677,10 @@ rb_define_method(SwigClassZeroHelperVector.klass, "slice", VALUEFUNC(_wrap_ZeroHelperVector_slice), -1); rb_define_method(SwigClassZeroHelperVector.klass, "each", VALUEFUNC(_wrap_ZeroHelperVector_each), -1); rb_define_method(SwigClassZeroHelperVector.klass, "select", VALUEFUNC(_wrap_ZeroHelperVector_select), -1); - rb_define_method(SwigClassZeroHelperVector.klass, "delete_at", VALUEFUNC(_wrap_ZeroHelperVector_delete_at), -1); - rb_define_method(SwigClassZeroHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_ZeroHelperVector___delete2__), -1); rb_define_method(SwigClassZeroHelperVector.klass, "reject!", VALUEFUNC(_wrap_ZeroHelperVector_rejectN___), -1); rb_define_alias(SwigClassZeroHelperVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassZeroHelperVector.klass, "delete_at", VALUEFUNC(_wrap_ZeroHelperVector_delete_at), -1); + rb_define_method(SwigClassZeroHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_ZeroHelperVector___delete2__), -1); rb_define_method(SwigClassZeroHelperVector.klass, "pop", VALUEFUNC(_wrap_ZeroHelperVector_pop), -1); rb_define_method(SwigClassZeroHelperVector.klass, "push", VALUEFUNC(_wrap_ZeroHelperVector_push), -1); rb_define_alias(SwigClassZeroHelperVector.klass, "<<", "push"); @@ -260440,10 +260723,10 @@ rb_define_method(SwigClassYoYHelperVector.klass, "slice", VALUEFUNC(_wrap_YoYHelperVector_slice), -1); rb_define_method(SwigClassYoYHelperVector.klass, "each", VALUEFUNC(_wrap_YoYHelperVector_each), -1); rb_define_method(SwigClassYoYHelperVector.klass, "select", VALUEFUNC(_wrap_YoYHelperVector_select), -1); - rb_define_method(SwigClassYoYHelperVector.klass, "delete_at", VALUEFUNC(_wrap_YoYHelperVector_delete_at), -1); - rb_define_method(SwigClassYoYHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_YoYHelperVector___delete2__), -1); rb_define_method(SwigClassYoYHelperVector.klass, "reject!", VALUEFUNC(_wrap_YoYHelperVector_rejectN___), -1); rb_define_alias(SwigClassYoYHelperVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassYoYHelperVector.klass, "delete_at", VALUEFUNC(_wrap_YoYHelperVector_delete_at), -1); + rb_define_method(SwigClassYoYHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_YoYHelperVector___delete2__), -1); rb_define_method(SwigClassYoYHelperVector.klass, "pop", VALUEFUNC(_wrap_YoYHelperVector_pop), -1); rb_define_method(SwigClassYoYHelperVector.klass, "push", VALUEFUNC(_wrap_YoYHelperVector_push), -1); rb_define_alias(SwigClassYoYHelperVector.klass, "<<", "push"); @@ -261252,10 +261535,10 @@ rb_define_method(SwigClassRateHelperVector.klass, "slice", VALUEFUNC(_wrap_RateHelperVector_slice), -1); rb_define_method(SwigClassRateHelperVector.klass, "each", VALUEFUNC(_wrap_RateHelperVector_each), -1); rb_define_method(SwigClassRateHelperVector.klass, "select", VALUEFUNC(_wrap_RateHelperVector_select), -1); - rb_define_method(SwigClassRateHelperVector.klass, "delete_at", VALUEFUNC(_wrap_RateHelperVector_delete_at), -1); - rb_define_method(SwigClassRateHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_RateHelperVector___delete2__), -1); rb_define_method(SwigClassRateHelperVector.klass, "reject!", VALUEFUNC(_wrap_RateHelperVector_rejectN___), -1); rb_define_alias(SwigClassRateHelperVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassRateHelperVector.klass, "delete_at", VALUEFUNC(_wrap_RateHelperVector_delete_at), -1); + rb_define_method(SwigClassRateHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_RateHelperVector___delete2__), -1); rb_define_method(SwigClassRateHelperVector.klass, "pop", VALUEFUNC(_wrap_RateHelperVector_pop), -1); rb_define_method(SwigClassRateHelperVector.klass, "push", VALUEFUNC(_wrap_RateHelperVector_push), -1); rb_define_alias(SwigClassRateHelperVector.klass, "<<", "push"); @@ -261412,10 +261695,10 @@ rb_define_method(SwigClassCalibrationHelperVector.klass, "slice", VALUEFUNC(_wrap_CalibrationHelperVector_slice), -1); rb_define_method(SwigClassCalibrationHelperVector.klass, "each", VALUEFUNC(_wrap_CalibrationHelperVector_each), -1); rb_define_method(SwigClassCalibrationHelperVector.klass, "select", VALUEFUNC(_wrap_CalibrationHelperVector_select), -1); - rb_define_method(SwigClassCalibrationHelperVector.klass, "delete_at", VALUEFUNC(_wrap_CalibrationHelperVector_delete_at), -1); - rb_define_method(SwigClassCalibrationHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_CalibrationHelperVector___delete2__), -1); rb_define_method(SwigClassCalibrationHelperVector.klass, "reject!", VALUEFUNC(_wrap_CalibrationHelperVector_rejectN___), -1); rb_define_alias(SwigClassCalibrationHelperVector.klass, "delete_if", "reject!"); + rb_define_method(SwigClassCalibrationHelperVector.klass, "delete_at", VALUEFUNC(_wrap_CalibrationHelperVector_delete_at), -1); + rb_define_method(SwigClassCalibrationHelperVector.klass, "__delete2__", VALUEFUNC(_wrap_CalibrationHelperVector___delete2__), -1); rb_define_method(SwigClassCalibrationHelperVector.klass, "pop", VALUEFUNC(_wrap_CalibrationHelperVector_pop), -1); rb_define_method(SwigClassCalibrationHelperVector.klass, "push", VALUEFUNC(_wrap_CalibrationHelperVector_push), -1); rb_define_alias(SwigClassCalibrationHelperVector.klass, "<<", "push"); --- quantlib-swig-1.3.orig/Ruby/setup.rb +++ quantlib-swig-1.3/Ruby/setup.rb @@ -18,7 +18,7 @@ require 'rbconfig' require 'mkmf' -require 'ftools' +require 'fileutils' def usage puts < 0555, :verbose => true + FileUtils.install "./QuantLib.rb", libDir+"/QuantLib.rb", :mode => 0555, :verbose => true } availableCommands = { --- quantlib-swig-1.3.orig/SWIG/linearalgebra.i +++ quantlib-swig-1.3/SWIG/linearalgebra.i @@ -283,10 +283,10 @@ #elif defined(SWIGRUBY) %typemap(in) Array (Array* v) { if (rb_obj_is_kind_of($input,rb_cArray)) { - Size size = RARRAY($input)->len; + Size size = RARRAY_LEN($input); $1 = Array(size); for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR($input)[i]; if (TYPE(o) == T_FLOAT) (($1_type &)$1)[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -304,11 +304,11 @@ %typemap(in) const Array& (Array temp), const Array* (Array temp) { if (rb_obj_is_kind_of($input,rb_cArray)) { - Size size = RARRAY($input)->len; + Size size = RARRAY_LEN($input); temp = Array(size); $1 = &temp; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR($input)[i]; if (TYPE(o) == T_FLOAT) temp[i] = NUM2DBL(o); else if (FIXNUM_P(o)) @@ -355,11 +355,11 @@ %typemap(in) Matrix (Matrix* m) { if (rb_obj_is_kind_of($input,rb_cArray)) { Size rows, cols; - rows = RARRAY($input)->len; + rows = RARRAY_LEN($input); if (rows > 0) { - VALUE o = RARRAY($input)->ptr[0]; + VALUE o = RARRAY_PTR($input)[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -369,14 +369,14 @@ } $1 = Matrix(rows,cols); for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR($input)[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) $1[i][j] = SWIG_NUM2DBL(x); else @@ -397,11 +397,11 @@ const Matrix* (Matrix temp) { if (rb_obj_is_kind_of($input,rb_cArray)) { Size rows, cols; - rows = RARRAY($input)->len; + rows = RARRAY_LEN($input); if (rows > 0) { - VALUE o = RARRAY($input)->ptr[0]; + VALUE o = RARRAY_PTR($input)[0]; if (rb_obj_is_kind_of(o,rb_cArray)) { - cols = RARRAY(o)->len; + cols = RARRAY_LEN(o); } else { rb_raise(rb_eTypeError, "wrong argument type (expected Matrix)"); @@ -412,14 +412,14 @@ temp = Matrix(rows,cols); $1 = &temp; for (Size i=0; iptr[i]; + VALUE o = RARRAY_PTR($input)[i]; if (rb_obj_is_kind_of(o,rb_cArray)) { - if (Size(RARRAY(o)->len) != cols) { + if (Size(RARRAY_LEN(o)) != cols) { rb_raise(rb_eTypeError, "Matrix must have equal-length rows"); } for (Size j=0; jptr[j]; + VALUE x = RARRAY_PTR(o)[j]; if (SWIG_FLOAT_P(x)) temp[i][j] = SWIG_NUM2DBL(x); else --- quantlib-swig-1.3.orig/debian/changelog +++ quantlib-swig-1.3/debian/changelog @@ -0,0 +1,630 @@ +quantlib-swig (1.3-2) unstable; urgency=low + + * SWIG/linearalgebra.i: Applied patch kindly supplied by Christian + Hofstaedtler to permit building under Ruby 1.9.1 + * Ruby/setup.rb: Idem + + * debian/control: Update Build-Depends: to ruby-1.9.1 (Closes: #733105) + * debian/rules: For now, disable unit test for Ruby as it too needs an + update for Ruby 1.9.1 + + * debian/control: Set Standards-Version: to current version + + -- Dirk Eddelbuettel Mon, 30 Dec 2013 19:01:08 -0600 + +quantlib-swig (1.3-1) unstable; urgency=low + + * New upstream release + + * debian/control: Set Build-Depends: to current QuantLib version + + * debian/control: Set Standards-Version: to current version + + -- Dirk Eddelbuettel Mon, 02 Sep 2013 14:18:33 -0500 + +quantlib-swig (1.2-2) unstable; urgency=low + + * debian/control: Reduce Build-Depends from 'ruby, ruby1.8, ruby1.8-dev' + to just 'ruby1.8, ruby1.8-dev' as the package does not currently build + with Ruby 1.9 (Closes: #676112) + + -- Dirk Eddelbuettel Mon, 04 Jun 2012 18:48:42 -0500 + +quantlib-swig (1.2-1) unstable; urgency=low + + * New upstream release + + -- Dirk Eddelbuettel Sat, 31 Mar 2012 09:55:48 -0500 + +quantlib-swig (1.1-1) unstable; urgency=low + + * New upstream version released today + + -- Dirk Eddelbuettel Mon, 23 May 2011 20:03:51 -0500 + +quantlib-swig (1.1~20110503-1) unstable; urgency=low + + * First beta release for QuantLib 1.1 + + * debian/rules: Removed -fpermissive; new upstream code corrected + + * debian/rules: Corrected 'python setup.py install' arguments + (Closes: #625946) + + -- Dirk Eddelbuettel Sat, 07 May 2011 14:21:41 -0500 + +quantlib-swig (1.0.0-3) unstable; urgency=low + + * debian/rules: Use -fpermissive on all architectures + + -- Dirk Eddelbuettel Sun, 01 May 2011 21:19:45 -0500 + +quantlib-swig (1.0.0-2) unstable; urgency=low + + * debian/*: Updated to use new dh_python2 scheme (Closes: #617050) + * debian/control: Remove Build-Depends: on python-central + + * debian/control: Set Standards-Version: to current version + + * debian/rules: Added -fpermissive to compilerflag to make g++ 4.6 happy + + -- Dirk Eddelbuettel Sun, 01 May 2011 20:52:41 -0500 + +quantlib-swig (1.0.0-1) unstable; urgency=low + + * New upstream release + + -- Dirk Eddelbuettel Thu, 25 Feb 2010 21:47:52 -0600 + +quantlib-swig (1.0.0~20100209-1) unstable; urgency=low + + * Third beta release for QuantLib 1.0.0 + + -- Dirk Eddelbuettel Sat, 13 Feb 2010 15:39:53 -0600 + +quantlib-swig (1.0.0~20100125-1) unstable; urgency=low + + * Second beta release for QuantLib 1.0.0 + + -- Dirk Eddelbuettel Tue, 26 Jan 2010 18:39:30 -0600 + +quantlib-swig (1.0.0~20100112-1) unstable; urgency=low + + * First beta release for QuantLib 1.0.0 + + -- Dirk Eddelbuettel Thu, 14 Jan 2010 17:07:38 -0600 + +quantlib-swig (0.9.9-1) unstable; urgency=low + + * New upstream release + + * debian/control: Updated Standards-Version: to current value + + -- Dirk Eddelbuettel Thu, 03 Dec 2009 17:01:53 -0600 + +quantlib-swig (0.9.7-4) unstable; urgency=low + + * debian/rules: Re-enable support for Ruby following a short debugging + session with upstream (thanks, Luigi!). Turns out that we simply need + to run configure to create a Makefile even though none of several dozen + prior releases needed this. + * debian/control: Added 'ruby, ruby1.8, ruby1.8-dev' back to Build-Depends + + -- Dirk Eddelbuettel Wed, 01 Jul 2009 06:28:57 -0500 + +quantlib-swig (0.9.7-3) unstable; urgency=low + + * debian/rules: Apply patch to support --install-layout=deb switch + for the Python 2.6 transition (Closes: #533107) + + * debian/rules: No longer build the ruby variant as the builds is broken + with newer packages (see bug report #533122). + * debian/control: Remove quantlib-ruby section, adjust Build-Depends: + + -- Dirk Eddelbuettel Fri, 19 Jun 2009 17:19:03 -0500 + +quantlib-swig (0.9.7-2) unstable; urgency=low + + * Rebuilt against newer QuantLib to reflect updated Python libraries + (Closes: #532825) + + * debian/control: Updated Standards-Version: to current value + + -- Dirk Eddelbuettel Thu, 11 Jun 2009 19:48:05 -0500 + +quantlib-swig (0.9.7-1) unstable; urgency=low + + * New upstream release + + -- Dirk Eddelbuettel Sat, 29 Nov 2008 12:45:27 -0600 + +quantlib-swig (0.9.6-1) unstable; urgency=low + + * New upstream release (Closes: #494218) + + -- Dirk Eddelbuettel Sat, 09 Aug 2008 09:31:33 -0500 + +quantlib-swig (0.9.5~20080718-1) unstable; urgency=low + + * Release candidate for 0.9.5 as of 2008-07-18 + + -- Dirk Eddelbuettel Sat, 19 Jul 2008 08:22:30 -0500 + +quantlib-swig (0.9.0-1) unstable; urgency=low + + * New upstream release 0.9.0 + + -- Dirk Eddelbuettel Wed, 26 Dec 2007 08:10:08 -0600 + +quantlib-swig (0.9.0~20071220-1) unstable; urgency=low + + * Release candidate for 0.9.0 as of 2007-12-20 (Closes: #456859) + + * debian/watch: Now uses sf.net redirector (Closes: #450357) + + -- Dirk Eddelbuettel Thu, 20 Dec 2007 19:29:05 -0600 + +quantlib-swig (0.8.0-4) unstable; urgency=low + + * debian/rules: PYTHON is the result of $(shell pyversions -d). Thanks, Joss! + + * debian/rules: Suppress 'no strict aliasing' compiler warning + * debian/rules: No optim or debug on s390 + powerpc as buildds have low ram + * debian/rules: Per Thiemo, use -O2 on mips + mipsel to prevent reloc. errors + + -- Dirk Eddelbuettel Fri, 26 Oct 2007 14:43:19 -0500 + +quantlib-swig (0.8.0-3) unstable; urgency=low + + * debian/rules: PYTHON is now python2.5 (Closes: #445416) + + -- Dirk Eddelbuettel Fri, 05 Oct 2007 12:38:18 -0500 + +quantlib-swig (0.8.0-2) unstable; urgency=low + + * debian/rules: No longer impose '-O0 -g0' on mips/mipsel which should fix + to the FTBFS on these machine. Thanks for Thimo and Steve for waving the + cluebat at me. (Closes: #419742) + + * debian/control: Reset Architecture: to 'any' + + -- Dirk Eddelbuettel Fri, 01 Jun 2007 17:28:13 -0500 + +quantlib-swig (0.8.0-1) unstable; urgency=low + + * New upstream release + + * debian/control: Set Build-Depends: to 'libquantlib0-dev (>= 0.8.0-1)' + + * debian/control: Restrict Architecture: to 'alpha amd64 arm hppa i386 + ia64 powerpc sparc' excluding mips and mipsel whose toolchain is currently + insufficient to build this + + -- Dirk Eddelbuettel Thu, 31 May 2007 11:40:40 -0500 + +quantlib-swig (0.8.0~20070525-1) unstable; urgency=low + + * Release candidate for 0.8.0 as of 2007-05-25 + * debian/control: Update Build-Depends: to + 'libquantlib0-dev (>= 0.8.0~20070525)' + + -- Dirk Eddelbuettel Sun, 27 May 2007 20:21:05 -0500 + +quantlib-swig (0.4.1-1) unstable; urgency=low + + * New upstream release + + -- Dirk Eddelbuettel Mon, 26 Mar 2007 08:01:54 -0500 + +quantlib-swig (0.4.0-1) unstable; urgency=low + + * New upstream release + * debian/control: Update Build-Depends: to 'libquantlib0-dev (>= 0.4.0)' + + -- Dirk Eddelbuettel Thu, 1 Mar 2007 12:26:09 -0600 + +quantlib-swig (0.3.14-1) unstable; urgency=low + + * New upstream version released today + * debian/control: Update Build-Depends: to 'libquantlib0-dev (>= 0.3.14)' + + -- Dirk Eddelbuettel Mon, 6 Nov 2006 21:34:59 -0600 + +quantlib-swig (0.3.13-3) unstable; urgency=low + + * debian/control: Really remove Build-Depends: on g++-4.0 + * debian/control: Updated Build-Depends: 'python-central (>= 0.5)' [lintian] + + -- Dirk Eddelbuettel Tue, 5 Sep 2006 20:03:07 -0500 + +quantlib-swig (0.3.13-2.1) unstable; urgency=low + + * NMU. + * Do what the changelog says: Remove g++-4.0 from the build dependencies. + + -- Matthias Klose Tue, 5 Sep 2006 02:50:55 +0200 + +quantlib-swig (0.3.13-2) unstable; urgency=low + + * debian/control: Remove Build-Depends: on g++-4.0 (Closes: #385823) + + -- Dirk Eddelbuettel Sun, 3 Sep 2006 06:51:02 -0500 + +quantlib-swig (0.3.13-1) unstable; urgency=low + + * New upstream release + + -- Dirk Eddelbuettel Mon, 31 Jul 2006 20:21:40 -0500 + +quantlib-swig (0.3.12-2) unstable; urgency=low + + * Updated for the New Python Policy + * debian/control: + - new fields XS-Python-Version and XB-Python-Version + - added ${python:Depends} to Depends: + - added python-central to Build-Depends: + - updated versioned Depends and Build-Depends: + - added Provides: ${python:Provides} + * debian/rules: Added dh_pycentral call + + * debian/control: Upgraded Standards-Version to 3.7.2 + + -- Dirk Eddelbuettel Wed, 28 Jun 2006 21:03:59 -0500 + +quantlib-swig (0.3.12-1) unstable; urgency=low + + * New upstream release + + * debian/control: Description reworded as Swig interface may not cover + the entire set of functions provided at the C++ level + + -- Dirk Eddelbuettel Tue, 21 Mar 2006 16:19:35 -0600 + +quantlib-swig (0.3.11-3+b1) unstable; urgency=low + + * Binary-only non-maintainer upload for i386; no source changes. + * Rebuild against libquantlib-0.3.11c2a + + -- Debian/i386 Build Daemon Sat, 3 Dec 2005 15:57:19 -0800 + +quantlib-swig (0.3.11-3) unstable; urgency=low + + * Rebuilt with new g++ for libstdc++ allocator transition + * debian/control: Added Build-Depends g++-4.0 (>= 4.0.2-4) and + updated the one for libquantlib0-dev to (>= 0.3.11-2) + + -- Dirk Eddelbuettel Fri, 18 Nov 2005 19:26:52 -0600 + +quantlib-swig (0.3.11-2) unstable; urgency=low + + * debian/rules: Disable regression tests if not on i386 (Closes: #336862) + + -- Dirk Eddelbuettel Tue, 1 Nov 2005 13:03:26 -0600 + +quantlib-swig (0.3.11-1) unstable; urgency=low + + * New upstream release + + * This release corresponds to a new upstream source packaging scheme + that is comprising both the former Debian packages quantlib-python and + quantlib-ruby -- as well as Swig bindings for Guile, MzScheme, Perl, + Java, Csharp which have not yet been covered for Debian. + + * As this continues the quantlib-python package, we extend the exiting + changelog. + + -- Dirk Eddelbuettel Sun, 23 Oct 2005 13:35:52 -0500 + +quantlib-python (0.3.10-2) unstable; urgency=low + + * debian/control: Upgraded Build-Depends: for Boost libraries to 1.33.0-1 + + -- Dirk Eddelbuettel Fri, 14 Oct 2005 19:58:55 -0500 + +quantlib-python (0.3.10-1) unstable; urgency=low + + * New upstream release + + * Following the first gcc/g++ 4.0 release of QuantLib + * debian/control: Update Build-Depends: to gcc (>= 4:4.0), g++ (>= 4:4.0), + libboost-dev (>= 1.32.0+1.33.0-cvs20050727), + libboost-test-dev (>= 1.32.0+1.33.0-cvs20050727), + libquantlib0-dev (>= 0.3.10) + + * debian/control: Update Standards-Version: to 3.6.2.1 + + -- Dirk Eddelbuettel Thu, 28 Jul 2005 23:04:25 -0500 + +quantlib-python (0.3.9-3) unstable; urgency=medium + + * Rebuilt again under QuantLib 0.3.9-3 with renamed libquantlib + * debian/control: Update Build-Depends to libquantlib0-dev (>= 0.3.9-3) + + * Urgency set to medium to permit migration into testing + + -- Dirk Eddelbuettel Wed, 18 May 2005 23:41:23 -0500 + +quantlib-python (0.3.9-2) unstable; urgency=medium + + * Rebuilt under QuantLib 0.3.9-2 with its improved shlibs file + * debian/control: Update Build-Depends to libquantlib0-dev (>= 0.3.9-2) + + * debian/rules: Also use '-O0 -g0' flags on mips and mipsel + + * Urgency set to medium to permit migration into testing + + -- Dirk Eddelbuettel Mon, 16 May 2005 21:24:02 -0500 + +quantlib-python (0.3.9-1) unstable; urgency=low + + * New upstream release 0.3.9 announced today + + * tests/QuantLibTestSuite.py: Still commenting out call to + TermStructureTest + InstrumentTest as tests still hang during build + + -- Dirk Eddelbuettel Mon, 2 May 2005 21:55:40 -0500 + +quantlib-python (0.3.8.rc.20050407-1) unstable; urgency=low + + * Initial release candidate for 0.3.9 dated 2005-04-07 + + * debian/watch: Added watch file + + * debian/control: Build-Depends on QuantLib 0.3.9 release candidate + + * tests/QuantLibTestSuite.py: Still commenting out call to + TermStructureTest as tests continues to hang during build + + * debian/rules: Change how Swig files are installed into package + + * debian/rules: Changed to build for Python 2.4 + * debian/control: Change Build-Depends to python2.4-dev + + -- Dirk Eddelbuettel Thu, 14 Apr 2005 22:27:39 -0500 + +quantlib-python (0.3.8-2) unstable; urgency=low + + * tests/QuantLibTestSuite.py: Back to also commenting out call to + InstrumentTest as it fails on non0i386 arches (Closes: #286995) + + -- Dirk Eddelbuettel Thu, 23 Dec 2004 08:38:07 -0600 + +quantlib-python (0.3.8-1) unstable; urgency=low + + * New upstream release 0.3.8 announced today + * debian/control: Build-Depends on libquantlib0-dev (>= 0.3.8) + * tests/QuantLibTestSuite.py: Still commenting out call to + TermStructureTest as tests continues to hang during build + + -- Dirk Eddelbuettel Tue, 21 Dec 2004 11:13:09 -0600 + +quantlib-python (0.3.7-1) unstable; urgency=low + + * New upstream release 0.3.7 (to be announced in the next few days) + * debian/control: Standards-Version upgraded to 3.6.1.1 + * debian/control: Build-Depends on libquantlib0-dev (>= 0.3.7) + * debian/control: Also Depends: on python (Closes: #259132) + * tests/QuantLibTestSuite.py: Still commenting out calls to + InstrumentTest, and TermStructureTest, as tests hangs during build + + -- Dirk Eddelbuettel Tue, 13 Jul 2004 21:59:15 -0500 + +quantlib-python (0.3.6.rc.20040611-1) unstable; urgency=low + + * Initial release candidate for 0.3.7 dates 2004-06-11 + * debian/control: Build-Depends on libquantlib0-dev (>= 0.3.6.rc.20040611) + * debian/control: Added Build-Depends for libboost-dev, libboost-regex-dev + + * tests/QuantLibTestSuite.py: Per upstream suggestion, commented out + call to InstrumentTest, and TermStructureTest, as tests hangs + + -- Dirk Eddelbuettel Fri, 18 Jun 2004 11:52:32 -0500 + +quantlib-python (0.3.6-1) unstable; urgency=low + + * New upstream release 0.3.6 + * debian/control: Build-Depends on libquantlib0-dev (>= 0.3.6) + + -- Dirk Eddelbuettel Fri, 16 Apr 2004 21:21:42 -0500 + +quantlib-python (0.3.5-1) unstable; urgency=low + + * New upstream release 0.3.5 (final 'golden master') + * debian/control: Build-Depends on libquantlib0-dev (>= 0.3.5) + + -- Dirk Eddelbuettel Wed, 24 Mar 2004 19:12:28 -0600 + +quantlib-python (0.3.4.20040316-1) unstable; urgency=low + + * Upgraded to 'golden master' pre-release of 0.3.5 dated 2004-03-16 + * debian/control: Build-Depends on libquantlib0-dev (>= 0.3.4.20040316) + + -- Dirk Eddelbuettel Wed, 17 Mar 2004 14:46:25 -0600 + +quantlib-python (0.3.4-2) unstable; urgency=low + + * Upgraded to actual release 0.3.4 dated 2003-11-18 + + -- Dirk Eddelbuettel Fri, 21 Nov 2003 02:24:49 +0100 + +quantlib-python (0.3.4-1) unstable; urgency=low + + * Upgraded to 'golden master' pre-release of 0.3.4 + * debian/control: Build-Depends upgraded to libquantlib0-dev (>= 0.3.4) + + -- Dirk Eddelbuettel Thu, 6 Nov 2003 20:35:06 -0600 + +quantlib-python (0.3.3-1) unstable; urgency=low + + * Upgraded to new upstream version 0.3.3 (to be announced next week) + * debian/control: Build-Depends upgraded to libquantlib0-dev (>= 0.3.3) + * debian/control: Standards-Version upgraded to 3.6.1.0 + + -- Dirk Eddelbuettel Thu, 28 Aug 2003 21:01:49 -0500 + +quantlib-python (0.3.2.20030727-3) unstable; urgency=low + + * debian/control: Better Depends on python2.3 via ${python:Depends} + * debian/rules: Use dh_python before dh_installdeb + * Thanks to Josselin for swinging with the clue bat (Closes: #207320) + + -- Dirk Eddelbuettel Tue, 26 Aug 2003 20:06:26 -0500 + +quantlib-python (0.3.2.20030727-2) unstable; urgency=low + + * The 'we all owe doko so I may as well do the python2.3 conversion' release + * debian/rules: PYTHON changed to python2.3 + * debian/control: Build-Depends changed to python2.3-dev + * debian/control: Depends changed to python 2.3 as well + * debian/control: Standards-Version increased to 3.6.0.1 + + -- Dirk Eddelbuettel Thu, 21 Aug 2003 21:06:50 -0500 + +quantlib-python (0.3.2.20030727-1) unstable; urgency=low + + * Upgraded to 'golden master' pre-release of 0.3.3 dated 2003-07-27 + [ N.B.: there was no 0.3.2 release ] + * debian/rules: Move files from usr/include/QuantLib-Python (instead + of the former usr/share/QuantLib-Python) to usr/share/quantlib-python + * debian/control: Section changed to python + * debian/control: Standards-Version upgraded to 3.6.0 + + -- Dirk Eddelbuettel Tue, 5 Aug 2003 20:38:18 -0500 + +quantlib-python (0.3.1-1) unstable; urgency=low + + * Upgraded to new upstream release 0.3.1 + + -- Dirk Eddelbuettel Tue, 28 Jan 2003 20:44:00 -0600 + +quantlib-python (0.3.0.9.1-1) unstable; urgency=low + + * Upgraded to second 'golden master' pre-release of 0.3.1 + * Renamed 0.3.0.9.1 to maintain package version sorting once 0.3.1 is out + * debian/{rules,control}: No longer set g++ to 3.0 or 3.2 on different + platforms as gcc-3.2 (and g++-3.2) are now the default + + -- Dirk Eddelbuettel Tue, 14 Jan 2003 19:18:54 -0600 + +quantlib-python (0.3.0.9-4) unstable; urgency=low + + * debian/rules: Set CXX as well as CC + + -- Dirk Eddelbuettel Thu, 26 Dec 2002 10:54:56 -0600 + +quantlib-python (0.3.0.9-3) unstable; urgency=low + + * correct small snafus with last upload + + -- Dirk Eddelbuettel Wed, 25 Dec 2002 22:17:26 -0600 + +quantlib-python (0.3.0.9-2) unstable; urgency=low + + * debian/rules: Don't run 'make test' on m68k either as it times out + * debian/{control, rules}: Use g++-3.2 for s390 as for QuantLib + + -- Dirk Eddelbuettel Wed, 25 Dec 2002 09:25:31 -0600 + +quantlib-python (0.3.0.9-1) unstable; urgency=low + + * Upgraded to new 'golden master' pre-release of 0.3.1 + * Renamed 0.3.0.9 to maintain package version sorting once 0.3.1 is out + * debian/control: Depends on python (>= 2.2) | python2.2 + + -- Dirk Eddelbuettel Sat, 21 Dec 2002 12:20:08 -0600 + +quantlib-python (0.3.0-4) unstable; urgency=low + + * debian/rules: Building against Python 2.2, so use PYTHON=python2.2 + * debian/control: Changed Build-Depends to python2.2-dev, and Depends to + python (>= 2.2), python (<< 2.3) + + -- Dirk Eddelbuettel Fri, 13 Sep 2002 18:00:09 -0500 + +quantlib-python (0.3.0-3) unstable; urgency=low + + * debian/rules: Don't touch 'QuantLib/quantlib_wrap.cpp' + * debian/rules: Skip errors in 'make test' (Closes: #142200, #142430) + * setup.py: Don't need the CFLAGS treatment, distutils does that for us + + -- Dirk Eddelbuettel Thu, 16 May 2002 21:22:47 -0500 + +quantlib-python (0.3.0-2) unstable; urgency=low + + * setup.py: Small upstream patch to enable CFLAGS + CC to be passed + + -- Dirk Eddelbuettel Tue, 14 May 2002 18:53:23 -0500 + +quantlib-python (0.3.0-1) unstable; urgency=low + + * Upgraded to new upstream release 0.3.0 + + -- Dirk Eddelbuettel Sat, 4 May 2002 22:23:23 -0500 + +quantlib-python (0.2.1.cvs20020322-1) unstable; urgency=low + + * Upgraded to new upstream snapshot release 0.3.0b1-20020322 + + -- Dirk Eddelbuettel Sat, 23 Mar 2002 23:46:07 -0600 + +quantlib-python (0.2.1cvs20020120-2) unstable; urgency=low + + * debian/rules: Added -ffunction-sections to compile command for hppa + * debian/control: Also Build-Depends on gcc-3.0 for ia64 + + -- Dirk Eddelbuettel Fri, 1 Feb 2002 17:21:11 -0600 + +quantlib-python (0.2.1cvs20020120-1) unstable; urgency=low + + * Upgraded to new upstream snapshot release 3.0a5-20020120 + * Adapated version for proper Debian version number sorting + * This upstream version now compiles on Alpha (Closes: #121698) + * debian/rules: Don't run 'setup.py test' on arm (Closes: #130278) + * debian/control: Depends on python (>= 2.1), python (<< 2.2) + + -- Dirk Eddelbuettel Mon, 21 Jan 2002 19:45:09 -0600 + +quantlib-python (0.2.1-2) unstable; urgency=low + + * debian/control: Build-Depends on libquantlib0-dev (>= 0.2.1) + + -- Dirk Eddelbuettel Mon, 10 Dec 2001 20:03:59 -0600 + +quantlib-python (0.2.1-1) unstable; urgency=low + + * Upgraded to new upstream release 0.2.1 + * debian/{rules,control}: Use g++-3.0 on ia64 + + -- Dirk Eddelbuettel Mon, 3 Dec 2001 19:30:22 -0600 + +quantlib-python (0.2.0-3) unstable; urgency=low + + * debian/rules: Call setup.py with python2.1 (Closes: #119606) + + -- Dirk Eddelbuettel Wed, 14 Nov 2001 11:47:24 -0600 + +quantlib-python (0.2.0-2) unstable; urgency=low + + * Adapted Python Policy (as of version 0.3.7) + * debian/control: (Build-)Depends python2.1(-dev) (Closes: #119224) + + -- Dirk Eddelbuettel Mon, 12 Nov 2001 13:14:00 -0600 + +quantlib-python (0.2.0-1) unstable; urgency=low + + * Upgraded to new upstream release 0.2.0 + + -- Dirk Eddelbuettel Thu, 20 Sep 2001 21:32:29 -0500 + +quantlib-python (0.1.9-2) unstable; urgency=low + + * debian/control: Added more Build-Depends detected by dpkg-genbuilddeps + * debian/control: Added python-distutils to Build-Depends (Closes: #103124) + + -- Dirk Eddelbuettel Mon, 2 Jul 2001 21:35:10 -0500 + +quantlib-python (0.1.9-1) unstable; urgency=low + + * Initial Debian release. + + -- Dirk Eddelbuettel Sun, 24 Jun 2001 09:33:25 -0500 --- quantlib-swig-1.3.orig/debian/compat +++ quantlib-swig-1.3/debian/compat @@ -0,0 +1 @@ +5 --- quantlib-swig-1.3.orig/debian/control +++ quantlib-swig-1.3/debian/control @@ -0,0 +1,41 @@ +Source: quantlib-swig +Priority: optional +Section: interpreters +Maintainer: Dirk Eddelbuettel +Standards-Version: 3.9.5 +XS-Python-Version: current +Build-Depends: debhelper (>= 7.0.0), python, python-all-dev (>= 2.6.6-3), ruby1.9.1, ruby1.9.1-dev, libquantlib0-dev (>= 1.3), gcc (>= 4:4.0), g++ (>= 4:4.0), libboost-dev (>= 1.34.0), libboost-test-dev (>= 1.34.0) + +Package: quantlib-python +Section: python +Architecture: any +Depends: ${shlibs:Depends}, ${misc:Depends}, ${python:Depends} +Provides: ${python:Provides} +Description: Python bindings for the Quantlib Quantitative Finance library + The QuantLib project is aimed to provide a comprehensive software framework + for quantitative finance. The goal is to provide a standard free/open source + library to quantitative analysts and developers for modeling, trading, and + risk management in real-life. + . + QuantLib plans to offer tools that are useful for both practical + implementation, with features such as market conventions, solvers, PDEs, + etc., and advanced modeling, e.g., exotic options and interest rate models. + . + This package provides Python bindings to parts of the QuantLib library. + +Package: quantlib-ruby +Section: interpreters +Architecture: any +Depends: ${shlibs:Depends}, ${misc:Depends} +Description: Ruby bindings for the Quantlib Quantitative Finance library + The QuantLib project is aimed to provide a comprehensive software framework + for quantitative finance. The goal is to provide a standard free/open source + library to quantitative analysts and developers for modeling, trading, and + risk management in real-life. + . + QuantLib plans to offer tools that are useful for both practical + implementation, with features such as market conventions, solvers, PDEs, + etc., and advanced modeling, e.g., exotic options and interest rate models. + . + This package provides Ruby bindings to parts of the QuantLib library. + --- quantlib-swig-1.3.orig/debian/control_with_r +++ quantlib-swig-1.3/debian/control_with_r @@ -0,0 +1,56 @@ +Source: quantlib-swig +Priority: optional +Section: interpreters +Maintainer: Dirk Eddelbuettel +Standards-Version: 3.9.3 +XS-Python-Version: current +Build-Depends: debhelper (>= 7.0.0), python, python-all-dev (>= 2.6.6-3), ruby1.8, ruby1.8-dev, libquantlib0-dev (>= 1.2), gcc (>= 4:4.0), g++ (>= 4:4.0), libboost-dev (>= 1.34.0), libboost-test-dev (>= 1.34.0), r-base-dev + +Package: quantlib-python +Section: python +Architecture: any +Depends: ${shlibs:Depends}, ${misc:Depends}, ${python:Depends} +Provides: ${python:Provides} +Description: Python bindings for the Quantlib Quantitative Finance library + The QuantLib project is aimed to provide a comprehensive software framework + for quantitative finance. The goal is to provide a standard free/open source + library to quantitative analysts and developers for modeling, trading, and + risk management in real-life. + . + QuantLib plans to offer tools that are useful for both practical + implementation, with features such as market conventions, solvers, PDEs, + etc., and advanced modeling, e.g., exotic options and interest rate models. + . + This package provides Python bindings to parts of the QuantLib library. + +Package: quantlib-ruby +Section: interpreters +Architecture: any +Depends: ${shlibs:Depends} +Description: Ruby bindings for the Quantlib Quantitative Finance library + The QuantLib project is aimed to provide a comprehensive software framework + for quantitative finance. The goal is to provide a standard free/open source + library to quantitative analysts and developers for modeling, trading, and + risk management in real-life. + . + QuantLib plans to offer tools that are useful for both practical + implementation, with features such as market conventions, solvers, PDEs, + etc., and advanced modeling, e.g., exotic options and interest rate models. + . + This package provides Ruby bindings to parts of the QuantLib library. + +Package: quantlib-r +Section: math +Architecture: any +Depends: ${shlibs:Depends} +Description: GNU R bindings for the Quantlib Quantitative Finance library + The QuantLib project is aimed to provide a comprehensive software framework + for quantitative finance. The goal is to provide a standard free/open source + library to quantitative analysts and developers for modeling, trading, and + risk management in real-life. + . + QuantLib plans to offer tools that are useful for both practical + implementation, with features such as market conventions, solvers, PDEs, + etc., and advanced modeling, e.g., exotic options and interest rate models. + . + This package provides GNU R bindings to parts of the QuantLib library. --- quantlib-swig-1.3.orig/debian/copyright +++ quantlib-swig-1.3/debian/copyright @@ -0,0 +1,52 @@ +This is the Debian GNU/Linux quantlib-swig package of the QuantLib-SWIG +library. QuantLib is being written by the QuantLib group headed by Ferdinando +Ametrano (ferdinando@ametrano.net) as main upstream coordinator (see +Authors.txt). + +This package was put together by Dirk Eddelbuettel +from sources obtained from + http://quantlib.org + http://sourceforge.net/project/showfiles.php?group_id=12740 + +The only change for the Debian package was the addition of the debian/ +files; also see the file changelog.Debian. + +The QuantLib library, as well as its SWIG bindings, are released under +a BSD-inspired Open Source license; the text of the upstream file +LICENSE.TXT is included below: + +QuantLib-SWIG is + Copyright (C) 2002, 2003 Ferdinando Ametrano + Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005 StatPro Italia srl + Copyright (C) 2005 Dominic Thuillier + Copyright (C) 2005 Johan Witters + +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + + Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + Neither the names of the copyright holders nor the names of the QuantLib + Group and its contributors may be used to endorse or promote products + derived from this software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND +CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, +INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE +DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR +CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF +USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED +AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT +LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN +ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. + + --- quantlib-swig-1.3.orig/debian/pycompat +++ quantlib-swig-1.3/debian/pycompat @@ -0,0 +1 @@ +2 --- quantlib-swig-1.3.orig/debian/rules +++ quantlib-swig-1.3/debian/rules @@ -0,0 +1,210 @@ +#! /usr/bin/make -f +# -*- makefile -*- +# debian/rules file for the Debian Linux quantlib-swig package +# Copyright (C) 2001 - 2011 by Dirk Eddelbuettel + +#package := $(shell grep Package debian/control | sed 's/^Package: //') +pypackage = quantlib-python +rbpackage = quantlib-ruby +rrpackage = quantlib-r +version := $(shell head -1 debian/changelog | \ + perl -nle 'm/\S+\s+\((\S+)\)/ && print $$1') +pydeb := $(CURDIR)/debian/$(pypackage) +rbdeb := $(CURDIR)/debian/$(rbpackage) +rrdeb := $(CURDIR)/debian/$(rrpackage) + +#arch := $(shell dpkg-architecture -qDEB_HOST_GNU_TYPE) +## edd 01 Nov 2005 use DEB_BUILD_ARCH_CPU, not DEB_BUILD_GNU_TYPE +## updated rules throughout +arch := $(shell dpkg-architecture -qDEB_BUILD_ARCH_CPU) +cpu := $(shell dpkg-architecture -qDEB_HOST_GNU_CPU) + +PYTHON := $(shell pyversions -d) +RUBY := ruby + +#export DH_VERBOSE=1 + +## edd 29 Nov 2001 Default to g++ +cxxcompiler = g++ + +## edd 14 Jan 2003 no longer change g++ as g++-3.2 is now default +# but use g++-3.0 on ia64 +#ifneq "$(findstring $(arch), ia64)" "" +#cxxcompiler = g++-3.0 +#endif + +## edd 01 Feb 2002 allow -ffunction-sections on hppa +## edd 26 Oct 2007 turn strict aliasing warning off +## edd 01 May 2011 add -fpermissive as g++ is more of a stickler +## edd 06 May 2011 remove -fpermissive with QL 1.1 betas +compilerflags = -O2 -Wall -Wno-strict-aliasing +ifeq ($(cpu),hppa) +compilerflags = -O2 -ffunction-sections +#cxxcompiler = g++-3.0 +endif + +## edd 18 May 2002 no optimisation or debugging on baby systems +## edd 14 May 2005 don't do it on mipsel or mips either +## edd 01 Jun 2007 no longer activate this on mips/mipsel +## edd 26 Jun 2007 use cpu test, not arch test -- thanks to Riku via #430709 +## edd 26 Oct 2007 s390+powerpc also die, so add'em (and remove mips(el), see next item) +## edd 27 May 2012 added mips/mipsel/armel/armhf here too +ifneq "$(findstring $(cpu), m68k arm armeb s390 powerpc armel armhf mips mipsel)" "" +compilerflags = -O0 -g0 +endif + +## edd 26 Oct 2007 really reset mips/mips to -O2 (see #419742) +## edd 27 May 2012 move to previos section +#ifneq "$(findstring $(cpu), mipsel mips)" "" +#compilerflags = -O2 -g0 +#endif + + +## edd 25 Dec 2002 g++-3.2 for s390 + +#ifneq "$(findstring $(arch), s390)" "" +#cxxcompiler = g++-3.2 +#endif + +upstream: get-orig-source +get-orig-source: + lynx http://quantlib.org + +build: build-arch build-indep +build-arch: build-stamp +build-indep: build-stamp +build-stamp: + dh_testdir + @echo "*** Running on arch $(arch) and cpu $(cpu)" + + # need to build the Makefile for R (and Ruby ?) + ./configure --prefix=/usr \ + --build $(arch) + + # $(MAKE) + (cd Python && \ + CC="$(cxxcompiler)" \ + CXX="$(cxxcompiler)" \ + CFLAGS="$(compilerflags)" \ + CXXFLAGS="$(compilerflags)" \ + $(PYTHON) setup.py build ) + + (cd Ruby && \ + CC="$(cxxcompiler)" \ + CXX="$(cxxcompiler)" \ + CFLAGS="$(compilerflags)" \ + CXXFLAGS="$(compilerflags)" \ + $(RUBY) setup.rb build ) + +# (cd R && \ +# CC="$(cxxcompiler)" \ +# CXX="$(cxxcompiler)" \ +# CFLAGS="$(compilerflags)" \ +# CXXFLAGS="$(compilerflags)" \ +# make ) + + touch build-stamp + +test: build test-stamp +test-stamp: +## edd 01 Nov 2005 run check only on i386 +#ifeq "$(findstring $(arch), m68k arm)" "" +ifeq ($(cpu),i486) + # -$(MAKE) test + (cd Python && $(PYTHON) setup.py test ) + #(cd Ruby && $(RUBY) setup.rb test ) +endif + touch test-stamp + +clean: + dh_testdir + dh_testroot + rm -f build-stamp test-stamp install-stamp + -test -f Makefile && $(MAKE) realclean + (cd Python && \ + $(PYTHON) setup.py clean --all && \ + rm -f QuantLib/*.pyc ) + (cd Ruby && \ + rm -f quantlib_wrap.o QuantLibc.so ) + dh_clean + +install: test install-stamp +install-stamp: + dh_testdir + dh_testroot + dh_prep + dh_installdirs -p$(pypackage) usr/share/$(pypackage) + #$(MAKE) install PREFIX=$(debtmp)/usr + (cd Python && \ + $(PYTHON) setup.py \ + install --prefix=$(pydeb)/usr \ + --install-layout=deb ) + + # edd 2005-Apr-14 copy swig file manually instead + cp -vax SWIG/* $(pydeb)/usr/share/$(pypackage)/ + rm -fv Python/test/*.pyc + # remove Docs installed by Python, we do that below + rm -frv $(pydeb)/usr/share/doc/QuantLib-Python + # remove .pyc which Lintian doesn't like + rm -frv $(pydeb)/usr/lib/python*/site-packages/QuantLib/*.pyc + + dh_installdirs -p$(rbpackage) usr/share/$(rbpackage) + # $(MAKE) install PREFIX=$(debtmp)/usr + (cd Ruby && \ + CXX="$(cxxcompiler)" \ + CFLAGS="$(compilerflags)" \ + CXXFLAGS="$(compilerflags)" \ + $(RUBY) setup.rb install \ + --prefix=$(rbdeb)/usr --debian ) + # fix mode, lintian complain about 755 and no #! line + chmod 644 debian/$(rbpackage)/usr/lib/ruby/*/QuantLib.rb + # edd 2007-Dec-20 copy swig file manually instead as well + cp -vax SWIG/* $(rbdeb)/usr/share/$(rbpackage)/ + touch install-stamp + + #dh_installdirs -p$(rrpackage) usr/lib/$(rrpackage) usr/share/$(rrpackage) + ## $(MAKE) install PREFIX=$(debtmp)/usr + #cp -vax R/QuantLib.so R/QuantLib.RData R/QuantLib.R R/README.txt $(rrdeb)/usr/lib/$(rrpackage)/ + #cp -vax SWIG/* $(rrdeb)/usr/share/$(rrpackage)/ + + touch install-stamp + +binary-indep: build test install + +binary-arch: build test install + dh_testdir + dh_testroot +# dh_installdebconf + dh_installdocs -A Readme.txt News.txt + dh_installexamples -p$(pypackage) Python/test/ Python/examples/*.py + dh_installexamples -p$(rbpackage) Ruby/test/ Ruby/examples/*.rb + #dh_installexamples -p$(rrpackage) R/examples/*.R +# dh_installmenu +# dh_installemacsen +# dh_installpam +# dh_installinit +# dh_installcron +# dh_installmanpages +# dh_installinfo +# dh_undocumented + dh_installchangelogs -A ChangeLog.txt +# dh_link + dh_compress + dh_fixperms + dh_strip +# dh_suidregister +# dh_pycentral -p$(pypackage) +# dh_python -p$(pypackage) + dh_python2 + dh_makeshlibs + dh_installdeb + dh_shlibdeps + dh_gencontrol +# dh_md5sums + dh_builddeb + +source diff: + @echo >&2 'source and diff are obsolete - use dpkg-source -b'; false + +binary: binary-indep binary-arch +.PHONY: build clean binary-indep binary-arch binary install test --- quantlib-swig-1.3.orig/debian/watch +++ quantlib-swig-1.3/debian/watch @@ -0,0 +1,2 @@ +version=3 +http://sf.net/quantlib/ QuantLib-SWIG-(.+)\.tar\.gz