summaryrefslogtreecommitdiff
path: root/Build/source/utils/asymptote/mathop.h
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2009-05-16 00:19:13 +0000
committerKarl Berry <karl@freefriends.org>2009-05-16 00:19:13 +0000
commitbab45528d65eaafe68a705dbb2a57075c7b7cbd8 (patch)
tree10b4ae2b5195c8dede153ab89359ec00f55f325f /Build/source/utils/asymptote/mathop.h
parent8643d90372e9c31e0f461c15c596b60a545bd7d3 (diff)
asymptote 1.72 sources (not integrated into build yet)
git-svn-id: svn://tug.org/texlive/trunk@13110 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Build/source/utils/asymptote/mathop.h')
-rw-r--r--Build/source/utils/asymptote/mathop.h319
1 files changed, 319 insertions, 0 deletions
diff --git a/Build/source/utils/asymptote/mathop.h b/Build/source/utils/asymptote/mathop.h
new file mode 100644
index 00000000000..97772d8e799
--- /dev/null
+++ b/Build/source/utils/asymptote/mathop.h
@@ -0,0 +1,319 @@
+/*****
+ * 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(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 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
+