|
1 | 1 | import std::{str, map, uint, int, option};
|
| 2 | +import std::math::{max, min}; |
2 | 3 | import std::map::hashmap;
|
3 | 4 | import std::option::{none, some};
|
4 | 5 | import syntax::ast;
|
@@ -131,53 +132,45 @@ fn lit_in_range(l: @ast::lit, m1: @ast::lit, m2: @ast::lit) -> bool {
|
131 | 132 | irange(i1, i2) {
|
132 | 133 | alt l.node {
|
133 | 134 | ast::lit_int(i3) | ast::lit_mach_int(_, i3) {
|
134 |
| - i3 >= *min(i1, i2) && i3 <= *max(i1, i2) |
| 135 | + i3 >= min(i1, i2) && i3 <= max(i1, i2) |
135 | 136 | }
|
136 | 137 | _ { fail }
|
137 | 138 | }
|
138 | 139 | }
|
139 | 140 | urange(u1, u2) {
|
140 | 141 | alt l.node {
|
141 | 142 | ast::lit_uint(u3) {
|
142 |
| - u3 >= *min(u1, u2) && u3 <= *max(u1, u2) |
| 143 | + u3 >= min(u1, u2) && u3 <= max(u1, u2) |
143 | 144 | }
|
144 | 145 | _ { fail }
|
145 | 146 | }
|
146 | 147 | }
|
147 | 148 | crange(c1, c2) {
|
148 | 149 | alt l.node {
|
149 | 150 | ast::lit_char(c3) {
|
150 |
| - (c3 as uint) >= *min(c1 as uint, c2 as uint) && |
151 |
| - (c3 as uint) <= *max(c1 as uint, c2 as uint) |
| 151 | + (c3 as uint) >= min(c1 as uint, c2 as uint) && |
| 152 | + (c3 as uint) <= max(c1 as uint, c2 as uint) |
152 | 153 | }
|
153 | 154 | _ { fail }
|
154 | 155 | }
|
155 | 156 | }
|
156 | 157 | frange(f1, f2) {
|
157 | 158 | alt l.node {
|
158 | 159 | ast::lit_float(f3) | ast::lit_mach_float(_, f3) {
|
159 |
| - std::float::from_str(f3) >= *min(f1, f2) && |
160 |
| - std::float::from_str(f3) <= *max(f1, f2) |
| 160 | + std::float::from_str(f3) >= min(f1, f2) && |
| 161 | + std::float::from_str(f3) <= max(f1, f2) |
161 | 162 | }
|
162 | 163 | _ { fail }
|
163 | 164 | }
|
164 | 165 | }
|
165 | 166 | }
|
166 | 167 | }
|
167 | 168 |
|
168 |
| -fn min<@T>(x: T, y: T) -> @T { |
169 |
| - ret @(if x > y { y } else { x }); |
170 |
| -} |
171 |
| - |
172 |
| -fn max<@T>(x: T, y: T) -> @T { |
173 |
| - ret @(if x > y { x } else { y }); |
174 |
| -} |
175 |
| - |
176 | 169 | fn ranges_overlap<@T>(a1: T, a2: T, b1: T, b2: T) -> bool {
|
177 |
| - let min1 = *min(a1, a2); |
178 |
| - let max1 = *max(a1, a2); |
179 |
| - let min2 = *min(b1, b2); |
180 |
| - let max2 = *max(b1, b2); |
| 170 | + let min1 = min(a1, a2); |
| 171 | + let max1 = max(a1, a2); |
| 172 | + let min2 = min(b1, b2); |
| 173 | + let max2 = max(b1, b2); |
181 | 174 | ret (min1 >= min2 && max1 <= max2) || (min1 <= min2 && max1 >= min2) ||
|
182 | 175 | (min1 >= min2 && min1 <= max2) || (max1 >= min2 && max1 <= max2);
|
183 | 176 | }
|
|
0 commit comments