git.iko.soy/Idris-dev
on ecd9ead help sign in
Idris-dev/js/Runtime-common.js
386 lines 11 kB history raw
1var __IDRRT__ = {};
3/** @constructor */
4__IDRRT__.Type = function(type) {
5 this.type = type;
6};
8__IDRRT__.Int = new __IDRRT__.Type('Int');
9__IDRRT__.Char = new __IDRRT__.Type('Char');
10__IDRRT__.String = new __IDRRT__.Type('String');
11__IDRRT__.Integer = new __IDRRT__.Type('Integer');
12__IDRRT__.Float = new __IDRRT__.Type('Float');
13__IDRRT__.Forgot = new __IDRRT__.Type('Forgot');
15/** @constructor */
16__IDRRT__.Tailcall = function(f) { this.f = f };
18/** @constructor */
19__IDRRT__.Con = function(i,vars) {
20 this.i = i;
21 this.vars = vars;
22};
24__IDRRT__.tailcall = function(f) {
25 var __f = f;
26 var ret;
27 while (__f) {
28 f = __f;
29 __f = null;
30 ret = f();
32 if (ret instanceof __IDRRT__.Tailcall) {
33 __f = ret.f;
34 } else {
35 return ret;
36 }
37 }
38};
40/*
41 BigInteger Javascript code taken from:
42 https://github.com/peterolson
43*/
44__IDRRT__.bigInt = (function () {
45 var base = 10000000, logBase = 7;
46 var sign = {
47 positive: false,
48 negative: true
49 };
51 var normalize = function (first, second) {
52 var a = first.value, b = second.value;
53 var length = a.length > b.length ? a.length : b.length;
54 for (var i = 0; i < length; i++) {
55 a[i] = a[i] || 0;
56 b[i] = b[i] || 0;
57 }
58 for (var i = length - 1; i >= 0; i--) {
59 if (a[i] === 0 && b[i] === 0) {
60 a.pop();
61 b.pop();
62 } else break;
63 }
64 if (!a.length) a = [0], b = [0];
65 first.value = a;
66 second.value = b;
67 };
69 var parse = function (text, first) {
70 if (typeof text === "object") return text;
71 text += "";
72 var s = sign.positive, value = [];
73 if (text[0] === "-") {
74 s = sign.negative;
75 text = text.slice(1);
76 }
77 var text = text.split("e");
78 if (text.length > 2) throw new Error("Invalid integer");
79 if (text[1]) {
80 var exp = text[1];
81 if (exp[0] === "+") exp = exp.slice(1);
82 exp = parse(exp);
83 if (exp.lesser(0)) throw new Error("Cannot include negative exponent part for integers");
84 while (exp.notEquals(0)) {
85 text[0] += "0";
86 exp = exp.prev();
87 }
88 }
89 text = text[0];
90 if (text === "-0") text = "0";
91 var isValid = /^([0-9][0-9]*)$/.test(text);
92 if (!isValid) throw new Error("Invalid integer");
93 while (text.length) {
94 var divider = text.length > logBase ? text.length - logBase : 0;
95 value.push(+text.slice(divider));
96 text = text.slice(0, divider);
97 }
98 var val = bigInt(value, s);
99 if (first) normalize(first, val);
100 return val;
101 };
103 var goesInto = function (a, b) {
104 var a = bigInt(a, sign.positive), b = bigInt(b, sign.positive);
105 if (a.equals(0)) throw new Error("Cannot divide by 0");
106 var n = 0;
107 do {
108 var inc = 1;
109 var c = bigInt(a.value, sign.positive), t = c.times(10);
110 while (t.lesser(b)) {
111 c = t;
112 inc *= 10;
113 t = t.times(10);
114 }
115 while (c.lesserOrEquals(b)) {
116 b = b.minus(c);
117 n += inc;
118 }
119 } while (a.lesserOrEquals(b));
121 return {
122 remainder: b.value,
123 result: n
124 };
125 };
127 var bigInt = function (value, s) {
128 var self = {
129 value: value,
130 sign: s
131 };
132 var o = {
133 value: value,
134 sign: s,
135 negate: function (m) {
136 var first = m || self;
137 return bigInt(first.value, !first.sign);
138 },
139 abs: function (m) {
140 var first = m || self;
141 return bigInt(first.value, sign.positive);
142 },
143 add: function (n, m) {
144 var s, first = self, second;
145 if (m) (first = parse(n)) && (second = parse(m));
146 else second = parse(n, first);
147 s = first.sign;
148 if (first.sign !== second.sign) {
149 first = bigInt(first.value, sign.positive);
150 second = bigInt(second.value, sign.positive);
151 return s === sign.positive ?
152 o.subtract(first, second) :
153 o.subtract(second, first);
154 }
155 normalize(first, second);
156 var a = first.value, b = second.value;
157 var result = [],
158 carry = 0;
159 for (var i = 0; i < a.length || carry > 0; i++) {
160 var sum = (a[i] || 0) + (b[i] || 0) + carry;
161 carry = sum >= base ? 1 : 0;
162 sum -= carry * base;
163 result.push(sum);
164 }
165 return bigInt(result, s);
166 },
167 plus: function (n, m) {
168 return o.add(n, m);
169 },
170 subtract: function (n, m) {
171 var first = self, second;
172 if (m) (first = parse(n)) && (second = parse(m));
173 else second = parse(n, first);
174 if (first.sign !== second.sign) return o.add(first, o.negate(second));
175 if (first.sign === sign.negative) return o.subtract(o.negate(second), o.negate(first));
176 if (o.compare(first, second) === -1) return o.negate(o.subtract(second, first));
177 var a = first.value, b = second.value;
178 var result = [],
179 borrow = 0;
180 for (var i = 0; i < a.length; i++) {
181 a[i] -= borrow;
182 borrow = a[i] < b[i] ? 1 : 0;
183 var minuend = (borrow * base) + a[i] - b[i];
184 result.push(minuend);
185 }
186 return bigInt(result, sign.positive);
187 },
188 minus: function (n, m) {
189 return o.subtract(n, m);
190 },
191 multiply: function (n, m) {
192 var s, first = self, second;
193 if (m) (first = parse(n)) && (second = parse(m));
194 else second = parse(n, first);
195 s = first.sign !== second.sign;
196 var a = first.value, b = second.value;
197 var resultSum = [];
198 for (var i = 0; i < a.length; i++) {
199 resultSum[i] = [];
200 var j = i;
201 while (j--) {
202 resultSum[i].push(0);
203 }
204 }
205 var carry = 0;
206 for (var i = 0; i < a.length; i++) {
207 var x = a[i];
208 for (var j = 0; j < b.length || carry > 0; j++) {
209 var y = b[j];
210 var product = y ? (x * y) + carry : carry;
211 carry = product > base ? Math.floor(product / base) : 0;
212 product -= carry * base;
213 resultSum[i].push(product);
214 }
215 }
216 var max = -1;
217 for (var i = 0; i < resultSum.length; i++) {
218 var len = resultSum[i].length;
219 if (len > max) max = len;
220 }
221 var result = [], carry = 0;
222 for (var i = 0; i < max || carry > 0; i++) {
223 var sum = carry;
224 for (var j = 0; j < resultSum.length; j++) {
225 sum += resultSum[j][i] || 0;
226 }
227 carry = sum > base ? Math.floor(sum / base) : 0;
228 sum -= carry * base;
229 result.push(sum);
230 }
231 return bigInt(result, s);
232 },
233 times: function (n, m) {
234 return o.multiply(n, m);
235 },
236 divmod: function (n, m) {
237 var s, first = self, second;
238 if (m) (first = parse(n)) && (second = parse(m));
239 else second = parse(n, first);
240 s = first.sign !== second.sign;
241 if (bigInt(first.value, first.sign).equals(0)) return {
242 quotient: bigInt([0], sign.positive),
243 remainder: bigInt([0], sign.positive)
244 };
245 if (second.equals(0)) throw new Error("Cannot divide by zero");
246 var a = first.value, b = second.value;
247 var result = [], remainder = [];
248 for (var i = a.length - 1; i >= 0; i--) {
249 var n = [a[i]].concat(remainder);
250 var quotient = goesInto(b, n);
251 result.push(quotient.result);
252 remainder = quotient.remainder;
253 }
254 result.reverse();
255 return {
256 quotient: bigInt(result, s),
257 remainder: bigInt(remainder, first.sign)
258 };
259 },
260 divide: function (n, m) {
261 return o.divmod(n, m).quotient;
262 },
263 over: function (n, m) {
264 return o.divide(n, m);
265 },
266 mod: function (n, m) {
267 return o.divmod(n, m).remainder;
268 },
269 pow: function (n, m) {
270 var first = self, second;
271 if (m) (first = parse(n)) && (second = parse(m));
272 else second = parse(n, first);
273 var a = first, b = second;
274 if (b.lesser(0)) return ZERO;
275 if (b.equals(0)) return ONE;
276 var result = bigInt(a.value, a.sign);
278 if (b.mod(2).equals(0)) {
279 var c = result.pow(b.over(2));
280 return c.times(c);
281 } else {
282 return result.times(result.pow(b.minus(1)));
283 }
284 },
285 next: function (m) {
286 var first = m || self;
287 return o.add(first, 1);
288 },
289 prev: function (m) {
290 var first = m || self;
291 return o.subtract(first, 1);
292 },
293 compare: function (n, m) {
294 var first = self, second;
295 if (m) (first = parse(n)) && (second = parse(m, first));
296 else second = parse(n, first);
297 normalize(first, second);
298 if (first.value.length === 1 && second.value.length === 1 && first.value[0] === 0 && second.value[0] === 0) return 0;
299 if (second.sign !== first.sign) return first.sign === sign.positive ? 1 : -1;
300 var multiplier = first.sign === sign.positive ? 1 : -1;
301 var a = first.value, b = second.value;
302 for (var i = a.length - 1; i >= 0; i--) {
303 if (a[i] > b[i]) return 1 * multiplier;
304 if (b[i] > a[i]) return -1 * multiplier;
305 }
306 return 0;
307 },
308 compareAbs: function (n, m) {
309 var first = self, second;
310 if (m) (first = parse(n)) && (second = parse(m, first));
311 else second = parse(n, first);
312 first.sign = second.sign = sign.positive;
313 return o.compare(first, second);
314 },
315 equals: function (n, m) {
316 return o.compare(n, m) === 0;
317 },
318 notEquals: function (n, m) {
319 return !o.equals(n, m);
320 },
321 lesser: function (n, m) {
322 return o.compare(n, m) < 0;
323 },
324 greater: function (n, m) {
325 return o.compare(n, m) > 0;
326 },
327 greaterOrEquals: function (n, m) {
328 return o.compare(n, m) >= 0;
329 },
330 lesserOrEquals: function (n, m) {
331 return o.compare(n, m) <= 0;
332 },
333 isPositive: function (m) {
334 var first = m || self;
335 return first.sign === sign.positive;
336 },
337 isNegative: function (m) {
338 var first = m || self;
339 return first.sign === sign.negative;
340 },
341 isEven: function (m) {
342 var first = m || self;
343 return first.value[0] % 2 === 0;
344 },
345 isOdd: function (m) {
346 var first = m || self;
347 return first.value[0] % 2 === 1;
348 },
349 toString: function (m) {
350 var first = m || self;
351 var str = "", len = first.value.length;
352 while (len--) {
353 str += (base.toString() + first.value[len]).slice(-logBase);
354 }
355 while (str[0] === "0") {
356 str = str.slice(1);
357 }
358 if (!str.length) str = "0";
359 var s = first.sign === sign.positive ? "" : "-";
360 return s + str;
361 },
362 toJSNumber: function (m) {
363 return +o.toString(m);
364 },
365 valueOf: function (m) {
366 return o.toJSNumber(m);
367 }
368 };
369 return o;
370 };
372 var ZERO = bigInt([0], sign.positive);
373 var ONE = bigInt([1], sign.positive);
374 var MINUS_ONE = bigInt([1], sign.negative);
376 var fnReturn = function (a) {
377 if (typeof a === "undefined") return ZERO;
378 return parse(a);
379 };
380 fnReturn.zero = ZERO;
381 fnReturn.one = ONE;
382 fnReturn.minusOne = MINUS_ONE;
383 return fnReturn;
384})();
386var __IDR__ = {};