From aa0f3ae2988d372b190b9bde2e75a6d17e744e93 Mon Sep 17 00:00:00 2001
From: Ian Jauslin <ian.jauslin@roma1.infn.it>
Date: Sun, 14 Jun 2015 00:52:45 +0000
Subject: Initial commit

---
 src/rational_int.h | 59 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 src/rational_int.h

(limited to 'src/rational_int.h')

diff --git a/src/rational_int.h b/src/rational_int.h
new file mode 100644
index 0000000..a9f164d
--- /dev/null
+++ b/src/rational_int.h
@@ -0,0 +1,59 @@
+/*
+Copyright 2015 Ian Jauslin
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+/* Rational numbers */
+
+#ifndef RATIONAL_AS_FLOAT
+#ifndef RATIONAL_H
+#define RATIONAL_H
+
+#include "types.h"
+
+// Q from int/int
+Q quot(long int p, long int q);
+
+// add
+Q Q_add(Q x1,Q x2);
+//multiply
+Q Q_prod(Q x1,Q x2);
+// inverse
+Q Q_inverse(Q x1);
+// quotient
+Q Q_quot(Q x1, Q x2);
+
+// compare
+int Q_cmp(Q x1, Q x2);
+
+// simplify
+Q Q_simplify(Q x);
+//simplify in place
+int Q_simplify_inplace(Q* x);
+
+// greatest common divisor
+long int gcd(long int x,long int y);
+// least common multiple
+long int lcm(long int x,long int y);
+
+// approximate value as double
+double Q_double_value(Q q);
+
+// print to string
+int Q_sprint(Q num, Char_Array* out);
+// read from a string
+int str_to_Q(char* str, Q* num);
+
+#endif
+#endif
-- 
cgit v1.2.3-70-g09d2