diff options
Diffstat (limited to 'compar.c')
| -rw-r--r-- | compar.c | 215 |
1 files changed, 117 insertions, 98 deletions
@@ -2,210 +2,227 @@ compar.c - - $Author: dave $ - $Date: 2003/12/19 00:01:18 $ + $Author$ created at: Thu Aug 26 14:39:48 JST 1993 - Copyright (C) 1993-2003 Yukihiro Matsumoto + Copyright (C) 1993-2007 Yukihiro Matsumoto **********************************************************************/ -#include "ruby.h" +#include "ruby/ruby.h" +#include "id.h" VALUE rb_mComparable; -static ID cmp; - -int -rb_cmpint(val, a, b) - VALUE val, a, b; +static VALUE +rb_cmp(VALUE x, VALUE y) { - if (NIL_P(val)) { - rb_cmperr(a, b); - } - if (FIXNUM_P(val)) return FIX2INT(val); - if (TYPE(val) == T_BIGNUM) { - if (RBIGNUM(val)->sign) return 1; - return -1; - } - if (RTEST(rb_funcall(val, '>', 1, INT2FIX(0)))) return 1; - if (RTEST(rb_funcall(val, '<', 1, INT2FIX(0)))) return -1; - return 0; + return rb_funcallv(x, idCmp, 1, &y); } void -rb_cmperr(x, y) - VALUE x, y; +rb_cmperr(VALUE x, VALUE y) { - const char *classname; + VALUE classname; - if (SPECIAL_CONST_P(y)) { - y = rb_inspect(y); - classname = StringValuePtr(y); + if (SPECIAL_CONST_P(y) || BUILTIN_TYPE(y) == T_FLOAT) { + classname = rb_inspect(y); } else { - classname = rb_obj_classname(y); + classname = rb_obj_class(y); } - rb_raise(rb_eArgError, "comparison of %s with %s failed", - rb_obj_classname(x), classname); + rb_raise(rb_eArgError, "comparison of %"PRIsVALUE" with %"PRIsVALUE" failed", + rb_obj_class(x), classname); } -#define cmperr() (rb_cmperr(x, y), Qnil) - static VALUE -cmp_eq(a) - VALUE *a; +invcmp_recursive(VALUE x, VALUE y, int recursive) { - VALUE c = rb_funcall(a[0], cmp, 1, a[1]); + if (recursive) return Qnil; + return rb_cmp(y, x); +} - if (NIL_P(c)) return Qnil; - if (rb_cmpint(c, a[0], a[1]) == 0) return Qtrue; - return Qfalse; +VALUE +rb_invcmp(VALUE x, VALUE y) +{ + VALUE invcmp = rb_exec_recursive(invcmp_recursive, x, y); + if (invcmp == Qundef || NIL_P(invcmp)) { + return Qnil; + } + else { + int result = -rb_cmpint(invcmp, x, y); + return INT2FIX(result); + } } static VALUE -cmp_failed() +cmp_eq_recursive(VALUE arg1, VALUE arg2, int recursive) { - return Qnil; + if (recursive) return Qnil; + return rb_cmp(arg1, arg2); } /* * call-seq: - * obj == other => true or false - * + * obj == other -> true or false + * * Compares two objects based on the receiver's <code><=></code> * method, returning true if it returns 0. Also returns true if * _obj_ and _other_ are the same object. */ static VALUE -cmp_equal(x, y) - VALUE x, y; +cmp_equal(VALUE x, VALUE y) { - VALUE a[2]; - + VALUE c; if (x == y) return Qtrue; - a[0] = x; a[1] = y; - return rb_rescue(cmp_eq, (VALUE)a, cmp_failed, 0); + c = rb_exec_recursive_paired_outer(cmp_eq_recursive, x, y, y); + + if (NIL_P(c)) return Qfalse; + if (rb_cmpint(c, x, y) == 0) return Qtrue; + return Qfalse; +} + +static int +cmpint(VALUE x, VALUE y) +{ + return rb_cmpint(rb_cmp(x, y), x, y); } /* * call-seq: - * obj > other => true or false - * + * obj > other -> true or false + * * Compares two objects based on the receiver's <code><=></code> * method, returning true if it returns 1. */ static VALUE -cmp_gt(x, y) - VALUE x, y; +cmp_gt(VALUE x, VALUE y) { - VALUE c = rb_funcall(x, cmp, 1, y); - - if (NIL_P(c)) return cmperr(); - if (rb_cmpint(c, x, y) > 0) return Qtrue; + if (cmpint(x, y) > 0) return Qtrue; return Qfalse; } /* * call-seq: - * obj >= other => true or false - * + * obj >= other -> true or false + * * Compares two objects based on the receiver's <code><=></code> * method, returning true if it returns 0 or 1. */ static VALUE -cmp_ge(x, y) - VALUE x, y; +cmp_ge(VALUE x, VALUE y) { - VALUE c = rb_funcall(x, cmp, 1, y); - - if (NIL_P(c)) return cmperr(); - if (rb_cmpint(c, x, y) >= 0) return Qtrue; + if (cmpint(x, y) >= 0) return Qtrue; return Qfalse; } /* * call-seq: - * obj < other => true or false - * + * obj < other -> true or false + * * Compares two objects based on the receiver's <code><=></code> * method, returning true if it returns -1. */ static VALUE -cmp_lt(x, y) - VALUE x, y; +cmp_lt(VALUE x, VALUE y) { - VALUE c = rb_funcall(x, cmp, 1, y); - - if (NIL_P(c)) return cmperr(); - if (rb_cmpint(c, x, y) < 0) return Qtrue; + if (cmpint(x, y) < 0) return Qtrue; return Qfalse; } - /* * call-seq: - * obj <= other => true or false - * + * obj <= other -> true or false + * * Compares two objects based on the receiver's <code><=></code> * method, returning true if it returns -1 or 0. */ static VALUE -cmp_le(x, y) - VALUE x, y; +cmp_le(VALUE x, VALUE y) { - VALUE c = rb_funcall(x, cmp, 1, y); - - if (NIL_P(c)) return cmperr(); - if (rb_cmpint(c, x, y) <= 0) return Qtrue; + if (cmpint(x, y) <= 0) return Qtrue; return Qfalse; } /* * call-seq: - * obj.between?(min, max) => true or false - * + * obj.between?(min, max) -> true or false + * * Returns <code>false</code> if <i>obj</i> <code><=></code> * <i>min</i> is less than zero or if <i>anObject</i> <code><=></code> * <i>max</i> is greater than zero, <code>true</code> otherwise. - * + * * 3.between?(1, 5) #=> true * 6.between?(1, 5) #=> false * 'cat'.between?('ant', 'dog') #=> true * 'gnu'.between?('ant', 'dog') #=> false - * + * */ static VALUE -cmp_between(x, min, max) - VALUE x, min, max; +cmp_between(VALUE x, VALUE min, VALUE max) { - if (RTEST(cmp_lt(x, min))) return Qfalse; - if (RTEST(cmp_gt(x, max))) return Qfalse; + if (cmpint(x, min) < 0) return Qfalse; + if (cmpint(x, max) > 0) return Qfalse; return Qtrue; } /* + * call-seq: + * obj.clamp(min, max) -> obj + * + * Returns <i>min</i> if <i>obj</i> <code><=></code> <i>min</i> is less + * than zero, <i>max</i> if <i>obj</i> <code><=></code> <i>max</i> is + * greater than zero and <i>obj</i> otherwise. + * + * 12.clamp(0, 100) #=> 12 + * 523.clamp(0, 100) #=> 100 + * -3.123.clamp(0, 100) #=> 0 + * + * 'd'.clamp('a', 'f') #=> 'd' + * 'z'.clamp('a', 'f') #=> 'f' + */ + +static VALUE +cmp_clamp(VALUE x, VALUE min, VALUE max) +{ + int c; + + if (cmpint(min, max) > 0) { + rb_raise(rb_eArgError, "min argument must be smaller than max argument"); + } + + c = cmpint(x, min); + if (c == 0) return x; + if (c < 0) return min; + c = cmpint(x, max); + if (c > 0) return max; + return x; +} + +/* * The <code>Comparable</code> mixin is used by classes whose objects * may be ordered. The class must define the <code><=></code> operator, * which compares the receiver against another object, returning -1, 0, * or +1 depending on whether the receiver is less than, equal to, or - * greater than the other object. <code>Comparable</code> uses + * greater than the other object. If the other object is not comparable + * then the <code><=></code> operator should return nil. + * <code>Comparable</code> uses * <code><=></code> to implement the conventional comparison operators * (<code><</code>, <code><=</code>, <code>==</code>, <code>>=</code>, * and <code>></code>) and the method <code>between?</code>. - * + * * class SizeMatters * include Comparable * attr :str - * def <=>(anOther) - * str.size <=> anOther.str.size + * def <=>(other) + * str.size <=> other.str.size * end * def initialize(str) * @str = str @@ -214,23 +231,26 @@ cmp_between(x, min, max) * @str * end * end - * + * * s1 = SizeMatters.new("Z") * s2 = SizeMatters.new("YY") * s3 = SizeMatters.new("XXX") * s4 = SizeMatters.new("WWWW") * s5 = SizeMatters.new("VVVVV") - * + * * s1 < s2 #=> true * s4.between?(s1, s3) #=> false * s4.between?(s3, s5) #=> true * [ s3, s2, s5, s4, s1 ].sort #=> [Z, YY, XXX, WWWW, VVVVV] - * + * */ void -Init_Comparable() +Init_Comparable(void) { +#undef rb_intern +#define rb_intern(str) rb_intern_const(str) + rb_mComparable = rb_define_module("Comparable"); rb_define_method(rb_mComparable, "==", cmp_equal, 1); rb_define_method(rb_mComparable, ">", cmp_gt, 1); @@ -238,6 +258,5 @@ Init_Comparable() rb_define_method(rb_mComparable, "<", cmp_lt, 1); rb_define_method(rb_mComparable, "<=", cmp_le, 1); rb_define_method(rb_mComparable, "between?", cmp_between, 2); - - cmp = rb_intern("<=>"); + rb_define_method(rb_mComparable, "clamp", cmp_clamp, 2); } |