UNPKG

algebrite

Version:

Computer Algebra System in Coffeescript

github.com/davidedc/Algebrite

davidedc/Algebrite

108 lines (72 loc) • 1.55 kB
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
#----------------------------------------------------------------------------- # # Factor small numerical powers # # Input: tos-2 Base (positive integer < 2^31 - 1) # # tos-1 Exponent # # Output: Expr on stack # #----------------------------------------------------------------------------- #define BASE p1 #define EXPO p2 quickfactor = -> i = 0 save() p2 = pop(); # p2 is EXPO p1 = pop(); # p1 is BASE h = tos push(p1); # p1 is BASE factor_small_number() n = tos - h stackIndex = h for i in [0...n] by 2 push(stack[stackIndex+i]); # factored base push(stack[stackIndex + i + 1]); # factored exponent push(p2); # p2 is EXPO multiply() quickpower() # stack has n results from factor_number_raw() # on top of that are all the expressions from quickpower() # multiply the quickpower() results multiply_all(tos - h - n) p1 = pop() moveTos h push(p1) restore() # p1 (BASE) is a prime number so power is simpler quickpower = -> expo = 0 save() p2 = pop(); # p2 is EXPO p1 = pop(); # p1 is BASE push(p2); # p2 is EXPO bignum_truncate() p3 = pop() push(p2); # p2 is EXPO push(p3) subtract() p4 = pop() # fractional part of p2 (EXPO) if (!iszero(p4)) push_symbol(POWER) push(p1); # p1 is BASE push(p4) list(3) push(p3) expo = pop_integer() if (isNaN(expo)) push_symbol(POWER) push(p1); # p1 is BASE push(p3) list(3) restore() return if (expo == 0) restore() return push(p1); # p1 is BASE bignum_power_number(expo) restore() #if SELFTEST