source: EcnlProtoTool/trunk/mruby-1.3.0/mrbgems/mruby-range-ext/src/range.c@ 331

Last change on this file since 331 was 331, checked in by coas-nagasima, 6 years ago

prototoolに関連するプロジェクトをnewlibからmuslを使うよう変更・更新
ntshellをnewlibの下位の実装から、muslのsyscallの実装に変更・更新
以下のOSSをアップデート
・mruby-1.3.0
・musl-1.1.18
・onigmo-6.1.3
・tcc-0.9.27
以下のOSSを追加
・openssl-1.1.0e
・curl-7.57.0
・zlib-1.2.11
以下のmrbgemsを追加
・iij/mruby-digest
・iij/mruby-env
・iij/mruby-errno
・iij/mruby-iijson
・iij/mruby-ipaddr
・iij/mruby-mock
・iij/mruby-require
・iij/mruby-tls-openssl

  • Property svn:eol-style set to native
  • Property svn:mime-type set to text/x-csrc;charset=UTF-8
File size: 4.0 KB
Line 
1#include <mruby.h>
2#include <mruby/range.h>
3#include <math.h>
4#include <float.h>
5
6static mrb_bool
7r_le(mrb_state *mrb, mrb_value a, mrb_value b)
8{
9 mrb_value r = mrb_funcall(mrb, a, "<=>", 1, b); /* compare result */
10 /* output :a < b => -1, a = b => 0, a > b => +1 */
11
12 if (mrb_fixnum_p(r)) {
13 mrb_int c = mrb_fixnum(r);
14 if (c == 0 || c == -1) return TRUE;
15 }
16
17 return FALSE;
18}
19
20static mrb_bool
21r_lt(mrb_state *mrb, mrb_value a, mrb_value b)
22{
23 mrb_value r = mrb_funcall(mrb, a, "<=>", 1, b);
24 /* output :a < b => -1, a = b => 0, a > b => +1 */
25
26 return mrb_fixnum_p(r) && mrb_fixnum(r) == -1;
27}
28
29/*
30 * call-seq:
31 * rng.cover?(obj) -> true or false
32 *
33 * Returns <code>true</code> if +obj+ is between the begin and end of
34 * the range.
35 *
36 * This tests <code>begin <= obj <= end</code> when #exclude_end? is +false+
37 * and <code>begin <= obj < end</code> when #exclude_end? is +true+.
38 *
39 * ("a".."z").cover?("c") #=> true
40 * ("a".."z").cover?("5") #=> false
41 * ("a".."z").cover?("cc") #=> true
42 */
43static mrb_value
44mrb_range_cover(mrb_state *mrb, mrb_value range)
45{
46 mrb_value val;
47 struct RRange *r = mrb_range_ptr(mrb, range);
48 mrb_value beg, end;
49
50 mrb_get_args(mrb, "o", &val);
51
52 beg = r->edges->beg;
53 end = r->edges->end;
54
55 if (r_le(mrb, beg, val)) {
56 if (r->excl) {
57 if (r_lt(mrb, val, end))
58 return mrb_true_value();
59 }
60 else {
61 if (r_le(mrb, val, end))
62 return mrb_true_value();
63 }
64 }
65
66 return mrb_false_value();
67}
68
69/*
70 * call-seq:
71 * rng.last -> obj
72 * rng.last(n) -> an_array
73 *
74 * Returns the last object in the range,
75 * or an array of the last +n+ elements.
76 *
77 * Note that with no arguments +last+ will return the object that defines
78 * the end of the range even if #exclude_end? is +true+.
79 *
80 * (10..20).last #=> 20
81 * (10...20).last #=> 20
82 * (10..20).last(3) #=> [18, 19, 20]
83 * (10...20).last(3) #=> [17, 18, 19]
84 */
85static mrb_value
86mrb_range_last(mrb_state *mrb, mrb_value range)
87{
88 mrb_value num;
89 mrb_value array;
90 struct RRange *r = mrb_range_ptr(mrb, range);
91
92 if (mrb_get_args(mrb, "|o", &num) == 0) {
93 return r->edges->end;
94 }
95
96 array = mrb_funcall(mrb, range, "to_a", 0);
97 return mrb_funcall(mrb, array, "last", 1, mrb_to_int(mrb, num));
98}
99
100/*
101 * call-seq:
102 * rng.size -> num
103 *
104 * Returns the number of elements in the range. Both the begin and the end of
105 * the Range must be Numeric, otherwise nil is returned.
106 *
107 * (10..20).size #=> 11
108 * ('a'..'z').size #=> nil
109 */
110
111static mrb_value
112mrb_range_size(mrb_state *mrb, mrb_value range)
113{
114 struct RRange *r = mrb_range_ptr(mrb, range);
115 mrb_value beg, end;
116 mrb_float beg_f, end_f;
117 mrb_bool num_p = TRUE;
118 mrb_bool excl;
119
120 beg = r->edges->beg;
121 end = r->edges->end;
122 excl = r->excl;
123 if (mrb_fixnum_p(beg)) {
124 beg_f = (mrb_float)mrb_fixnum(beg);
125 }
126 else if (mrb_float_p(beg)) {
127 beg_f = mrb_float(beg);
128 }
129 else {
130 num_p = FALSE;
131 }
132 if (mrb_fixnum_p(end)) {
133 end_f = (mrb_float)mrb_fixnum(end);
134 }
135 else if (mrb_float_p(end)) {
136 end_f = mrb_float(end);
137 }
138 else {
139 num_p = FALSE;
140 }
141 if (num_p) {
142 mrb_float n = end_f - beg_f;
143 mrb_float err = (fabs(beg_f) + fabs(end_f) + fabs(end_f-beg_f)) * MRB_FLOAT_EPSILON;
144
145 if (err>0.5) err=0.5;
146 if (excl) {
147 if (n<=0) return mrb_fixnum_value(0);
148 if (n<1)
149 n = 0;
150 else
151 n = floor(n - err);
152 }
153 else {
154 if (n<0) return mrb_fixnum_value(0);
155 n = floor(n + err);
156 }
157 if (isinf(n+1))
158 return mrb_float_value(mrb, INFINITY);
159 return mrb_fixnum_value((mrb_int)n+1);
160 }
161 return mrb_nil_value();
162}
163
164void
165mrb_mruby_range_ext_gem_init(mrb_state* mrb)
166{
167 struct RClass * s = mrb_class_get(mrb, "Range");
168
169 mrb_define_method(mrb, s, "cover?", mrb_range_cover, MRB_ARGS_REQ(1));
170 mrb_define_method(mrb, s, "last", mrb_range_last, MRB_ARGS_OPT(1));
171 mrb_define_method(mrb, s, "size", mrb_range_size, MRB_ARGS_NONE());
172}
173
174void
175mrb_mruby_range_ext_gem_final(mrb_state* mrb)
176{
177}
Note: See TracBrowser for help on using the repository browser.