1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
|
/*****
* mathop.h
* Tom Prince 2005/3/18
*
* Defines some runtime functions used by the stack machine.
*
*****/
#ifndef MATHOP_H
#define MATHOP_H
#include <sstream>
#include "stack.h"
#include "mod.h"
#include "triple.h"
namespace run {
template <typename T>
struct less {
bool operator() (T x, T y, size_t=0) {return x < y;}
};
template <typename T>
struct lessequals {
bool operator() (T x, T y, size_t=0) {return x <= y;}
};
template <typename T>
struct equals {
bool operator() (T x, T y, size_t=0) {return x == y;}
};
template <typename T>
struct greaterequals {
bool operator() (T x, T y, size_t=0) {return x >= y;}
};
template <typename T>
struct greater {
bool operator() (T x, T y, size_t=0) {return x > y;}
};
template <typename T>
struct notequals {
bool operator() (T x, T y, size_t=0) {return x != y;}
};
template <typename T>
struct And {
bool operator() (T x, T y, size_t=0) {return x && y;}
};
template <typename T>
struct Or {
bool operator() (T x, T y, size_t=0) {return x || y;}
};
template <typename T>
struct Xor {
bool operator() (T x, T y, size_t=0) {return x ^ y;}
};
template <typename T>
struct plus {
T operator() (T x, T y, size_t=0) {return x+y;}
};
template <typename T>
struct minus {
T operator() (T x, T y, size_t=0) {return x-y;}
};
template <typename T>
struct times {
T operator() (T x, T y, size_t=0) {return x*y;}
};
template <>
struct times<camp::triple> {
camp::triple operator() (double x, camp::triple y, size_t=0) {return x*y;}
};
template <typename T>
struct timesR {
T operator () (T y, double x, size_t=0) {return x*y;}
};
extern void dividebyzero(size_t i=0);
extern void integeroverflow(size_t i=0);
template <typename T>
struct divide {
T operator() (T x, T y, size_t i=0) {
if(y == 0) dividebyzero(i);
return x/y;
}
};
template <>
struct divide<camp::triple> {
camp::triple operator() (camp::triple x, double y, size_t=0) {return x/y;}
};
inline bool validInt(double x) {
return x > Int_MIN-0.5 && x < Int_MAX+0.5;
}
inline void checkInt(double x, size_t i)
{
if(validInt(x)) return;
integeroverflow(i);
}
inline Int Intcast(double x)
{
if(validInt(x)) return (Int) x;
integeroverflow(0);
return 0;
}
template<>
struct plus<Int> {
Int operator() (Int x, Int y, size_t i=0) {
if((y > 0 && x > Int_MAX-y) || (y < 0 && x < Int_MIN-y))
integeroverflow(i);
return x+y;
}
};
template<>
struct minus<Int> {
Int operator() (Int x, Int y, size_t i=0) {
if((y < 0 && x > Int_MAX+y) || (y > 0 && x < Int_MIN+y))
integeroverflow(i);
return x-y;
}
};
template<>
struct times<Int> {
Int operator() (Int x, Int y, size_t i=0) {
if(y == 0) return 0;
if(y < 0) {y=-y; x=-x;}
if((y > int_MAX || x > int_MAX/(int) y || x < int_MIN/(int) y) &&
(x > Int_MAX/y || x < Int_MIN/y))
integeroverflow(i);
return x*y;
}
};
template<>
struct divide<Int> {
double operator() (Int x, Int y, size_t i=0) {
if(y == 0) dividebyzero(i);
return ((double) x)/(double) y;
}
};
template <class T>
void Negate(vm::stack *s)
{
T a=vm::pop<T>(s);
s->push(-a);
}
inline Int Negate(Int x, size_t i=0) {
if(x < -Int_MAX) integeroverflow(i);
return -x;
}
template<>
inline void Negate<Int>(vm::stack *s)
{
s->push(Negate(vm::pop<Int>(s)));
}
inline double pow(double x, double y)
{
#ifndef HAVE_POW
return exp(y*log(x));
#else
return ::pow(x,y);
#endif
}
template<class T>
T pow(T x, Int y)
{
if(y == 0) return 1.0;
if(x == 0.0 && y > 0) return 0.0;
if(y < 0) {y=-y; x=1/x;}
T r=1.0;
for(;;) {
if(y & 1) r *= x;
if((y >>= 1) == 0) return r;
x *= x;
}
}
template <typename T>
struct power {
T operator() (T x, T y, size_t=0) {return pow(x,y);}
};
template <>
struct power<Int> {
Int operator() (Int x, Int p, size_t i=0) {
if(p == 0) return 1;
Int sign=1;
if(x < 0) {
if(p % 2) sign=-1;
x=-x;
}
if(p > 0) {
if(x == 0) return 0;
Int r = 1;
for(;;) {
if(p & 1) {
if(r > Int_MAX/x) integeroverflow(i);
r *= x;
}
if((p >>= 1) == 0)
return sign*r;
if(x > Int_MAX/x) integeroverflow(i);
x *= x;
}
} else {
if(x == 1) return sign;
ostringstream buf;
if(i > 0) buf << "array element " << i << ": ";
buf << "Only 1 and -1 can be raised to negative exponents as integers.";
vm::error(buf);
return 0;
}
}
};
template <typename T>
struct mod {
T operator() (T x, T y, size_t i=0) {
if(y == 0) dividebyzero(i);
return portableMod(x,y);
}
};
template <typename T>
struct quotient {
T operator() (T x, T y, size_t i=0) {
if(y == 0) dividebyzero(i);
if(y == -1) return Negate(x);
// Implementation-independent definition of integer division: round down
return (x-portableMod(x,y))/y;
}
};
template <typename T>
struct min {
T operator() (T x, T y, size_t=0) {return x < y ? x : y;}
};
template <typename T>
struct max {
T operator() (T x, T y, size_t=0) {return x > y ? x : y;}
};
template<class T>
inline T Min(T a, T b)
{
return (a < b) ? a : b;
}
template<class T>
inline T Max(T a, T b)
{
return (a > b) ? a : b;
}
template <typename T>
struct minbound {
camp::pair operator() (camp::pair z, camp::pair w) {
return camp::pair(Min(z.getx(),w.getx()),Min(z.gety(),w.gety()));
}
camp::triple operator() (camp::triple u, camp::triple v) {
return camp::triple(Min(u.getx(),v.getx()),Min(u.gety(),v.gety()),
Min(u.getz(),v.getz()));
}
};
template <typename T>
struct maxbound {
camp::pair operator() (camp::pair z, camp::pair w) {
return camp::pair(Max(z.getx(),w.getx()),Max(z.gety(),w.gety()));
}
camp::triple operator() (camp::triple u, camp::triple v) {
return camp::triple(Max(u.getx(),v.getx()),Max(u.gety(),v.gety()),
Max(u.getz(),v.getz()));
}
};
template <double (*func)(double)>
void realReal(vm::stack *s)
{
double x=vm::pop<double>(s);
s->push(func(x));
}
template <class T, template <class S> class op>
void binaryOp(vm::stack *s)
{
T b=vm::pop<T>(s);
T a=vm::pop<T>(s);
s->push(op<T>()(a,b));
}
template <class T>
void interp(vm::stack *s)
{
double t=vm::pop<double>(s);
T b=vm::pop<T>(s);
T a=vm::pop<T>(s);
s->push((1-t)*a+t*b);
}
} // namespace run
#endif //MATHOP_H
|