diff options
author | nobu <nobu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2009-05-24 13:48:23 +0000 |
---|---|---|
committer | nobu <nobu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2009-05-24 13:48:23 +0000 |
commit | 02fb261ec11afc34e0329aa3bbbe146cd1c89e84 (patch) | |
tree | 4564444a30a9dc991c8401733228fa37c8a0918f /array.c | |
parent | b55ff9989153cbe786967d8a1382846059fd2c54 (diff) | |
download | ruby-02fb261ec11afc34e0329aa3bbbe146cd1c89e84.tar.gz |
* thread.c (rb_exec_recursive_paired): new function for proper
handling of recursive arrays. [EXPERIMENTAL] [ruby-core:23402]
* array.c (rb_ary_equal, rb_ary_eql, rb_ary_cmp): use above.
* hash.c (hash_equal): ditto.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@23557 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'array.c')
-rw-r--r-- | array.c | 12 |
1 files changed, 6 insertions, 6 deletions
@@ -2740,7 +2740,7 @@ recursive_equal(VALUE ary1, VALUE ary2, int recur) { long i; - if (recur) return Qfalse; + if (recur) return Qtrue; /* Subtle! */ for (i=0; i<RARRAY_LEN(ary1); i++) { if (!rb_equal(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i))) return Qfalse; @@ -2773,7 +2773,7 @@ rb_ary_equal(VALUE ary1, VALUE ary2) return rb_equal(ary2, ary1); } if (RARRAY_LEN(ary1) != RARRAY_LEN(ary2)) return Qfalse; - return rb_exec_recursive(recursive_equal, ary1, ary2); + return rb_exec_recursive_paired(recursive_equal, ary1, ary2, ary2); } static VALUE @@ -2781,7 +2781,7 @@ recursive_eql(VALUE ary1, VALUE ary2, int recur) { long i; - if (recur) return Qfalse; + if (recur) return Qtrue; /* Subtle! */ for (i=0; i<RARRAY_LEN(ary1); i++) { if (!rb_eql(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i))) return Qfalse; @@ -2803,7 +2803,7 @@ rb_ary_eql(VALUE ary1, VALUE ary2) if (ary1 == ary2) return Qtrue; if (TYPE(ary2) != T_ARRAY) return Qfalse; if (RARRAY_LEN(ary1) != RARRAY_LEN(ary2)) return Qfalse; - return rb_exec_recursive(recursive_eql, ary1, ary2); + return rb_exec_recursive_paired(recursive_eql, ary1, ary2, ary2); } static VALUE @@ -2870,7 +2870,7 @@ recursive_cmp(VALUE ary1, VALUE ary2, int recur) { long i, len; - if (recur) return Qnil; + if (recur) return Qundef; /* Subtle! */ len = RARRAY_LEN(ary1); if (len > RARRAY_LEN(ary2)) { len = RARRAY_LEN(ary2); @@ -2912,7 +2912,7 @@ rb_ary_cmp(VALUE ary1, VALUE ary2) ary2 = to_ary(ary2); if (ary1 == ary2) return INT2FIX(0); - v = rb_exec_recursive(recursive_cmp, ary1, ary2); + v = rb_exec_recursive_paired(recursive_cmp, ary1, ary2, ary2); if (v != Qundef) return v; len = RARRAY_LEN(ary1) - RARRAY_LEN(ary2); if (len == 0) return INT2FIX(0); |