2 #include <mruby/range.h>
6 r_le(mrb_state *mrb, mrb_value a, mrb_value b)
8 mrb_int n = mrb_cmp(mrb, a, b);
10 if (n == 0 || n == -1) return TRUE;
15 r_lt(mrb_state *mrb, mrb_value a, mrb_value b)
17 return mrb_cmp(mrb, a, b) == -1;
22 * rng.cover?(obj) -> true or false
24 * Returns <code>true</code> if +obj+ is between the begin and end of
27 * This tests <code>begin <= obj <= end</code> when #exclude_end? is +false+
28 * and <code>begin <= obj < end</code> when #exclude_end? is +true+.
30 * ("a".."z").cover?("c") #=> true
31 * ("a".."z").cover?("5") #=> false
32 * ("a".."z").cover?("cc") #=> true
35 range_cover(mrb_state *mrb, mrb_value range)
37 struct RRange *r = mrb_range_ptr(mrb, range);
38 mrb_value val = mrb_get_arg1(mrb);
44 if (r_le(mrb, beg, val)) {
46 if (r_lt(mrb, val, end))
47 return mrb_true_value();
50 if (r_le(mrb, val, end))
51 return mrb_true_value();
55 return mrb_false_value();
61 * rng.last(n) -> an_array
63 * Returns the last object in the range,
64 * or an array of the last +n+ elements.
66 * Note that with no arguments +last+ will return the object that defines
67 * the end of the range even if #exclude_end? is +true+.
69 * (10..20).last #=> 20
70 * (10...20).last #=> 20
71 * (10..20).last(3) #=> [18, 19, 20]
72 * (10...20).last(3) #=> [17, 18, 19]
75 range_last(mrb_state *mrb, mrb_value range)
80 if (mrb_get_args(mrb, "|o", &num) == 0) {
81 return mrb_range_end(mrb, range);
84 array = mrb_funcall(mrb, range, "to_a", 0);
85 return mrb_funcall(mrb, array, "last", 1, mrb_to_int(mrb, num));
92 * Returns the number of elements in the range. Both the begin and the end of
93 * the Range must be Numeric, otherwise nil is returned.
95 * (10..20).size #=> 11
96 * ('a'..'z').size #=> nil
99 #ifndef MRB_WITHOUT_FLOAT
101 range_size(mrb_state *mrb, mrb_value range)
103 struct RRange *r = mrb_range_ptr(mrb, range);
105 mrb_float beg_f, end_f;
106 mrb_bool num_p = TRUE;
111 excl = RANGE_EXCL(r);
112 if (mrb_fixnum_p(beg)) {
113 beg_f = (mrb_float)mrb_fixnum(beg);
115 else if (mrb_float_p(beg)) {
116 beg_f = mrb_float(beg);
121 if (mrb_fixnum_p(end)) {
122 end_f = (mrb_float)mrb_fixnum(end);
124 else if (mrb_float_p(end)) {
125 end_f = mrb_float(end);
131 mrb_float n = end_f - beg_f;
132 mrb_float err = (fabs(beg_f) + fabs(end_f) + fabs(end_f-beg_f)) * MRB_FLOAT_EPSILON;
134 if (err>0.5) err=0.5;
136 if (n<=0) return mrb_fixnum_value(0);
143 if (n<0) return mrb_fixnum_value(0);
147 return mrb_float_value(mrb, INFINITY);
148 return mrb_fixnum_value((mrb_int)n+1);
150 return mrb_nil_value();
154 range_size(mrb_state *mrb, mrb_value range)
156 struct RRange *r = mrb_range_ptr(mrb, range);
162 excl = RANGE_EXCL(r) ? 0 : 1;
164 if (mrb_fixnum_p(beg) && mrb_fixnum_p(end)) {
165 mrb_int a = mrb_fixnum(beg);
166 mrb_int b = mrb_fixnum(end);
167 mrb_int c = b - a + excl;
169 return mrb_fixnum_value(c);
171 return mrb_nil_value();
173 #endif /* MRB_WITHOUT_FLOAT */
176 mrb_mruby_range_ext_gem_init(mrb_state* mrb)
178 struct RClass * s = mrb_class_get(mrb, "Range");
180 mrb_define_method(mrb, s, "cover?", range_cover, MRB_ARGS_REQ(1));
181 mrb_define_method(mrb, s, "last", range_last, MRB_ARGS_OPT(1));
182 mrb_define_method(mrb, s, "size", range_size, MRB_ARGS_NONE());
186 mrb_mruby_range_ext_gem_final(mrb_state* mrb)