-
Notifications
You must be signed in to change notification settings - Fork 0
/
fib.piss
183 lines (154 loc) · 4.05 KB
/
fib.piss
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
# Works (should be 11)
test_eq(4 - 9 / 3 + 5 * 2, 11)
# Also works
test_eq((4 - (9 / 3)) + (5 * 2), 11)
# Also works
test_eq(4 - (9 / 3) + 5 * 2, 11)
# Should be -9
test_eq(4 - ((9 / 3) + 5 * 2), -9)
# Should be 0
test_eq(1+2*((4-5)*(4-5))-6/2, 0)
# Should be -1
test_eq(-1*(2+3)/5, -1)
fun map<T>(over: Sequence<T>, f: Lam<(T) -> T>) -> T {
for i in 0..length(over) {
v = over[i]
over[i] = f(v)
}
over
}
# Should be Ifmmp!Xpsme"
test_eq(map("Hello World!", (c: Str) -> Str {
char_code = str_to_chars(c)[0]
char_to_str(char_code + 1)
}), "Ifmmp!Xpsme\"")
# Should be [3, 5, 7, 9, 11, 13]
test_eq(map([1, 1+1, 2+1, 2*2, 5, 6], (n: Int) -> Int {
n * 2 + 1
}), [3, 5, 7, 9, 11, 13])
# Define test datastructures
struct CartCord {
x: Flt,
y: Flt
}
struct PolarCord {
angle: Flt,
radius: Flt,
thingy: Arr<Arr<CartCord>>
}
enum Cord {
CartCord: CartCord,
PolarCord: PolarCord
}
# Test struct creation
polar_cord = PolarCord {
radius: 12.0,
thingy: [[CartCord {
y: 12.0,
x: 0.0
}]],
angle: 11.0
}
# and accessing
test_eq(polar_cord.angle, 11.0)
test_eq(polar_cord.radius, 12.0)
test_eq(polar_cord.thingy[1-1][1*2-2].x, 0.0)
test_eq(polar_cord.thingy[1-1][1*2-2].y, 12.0)
# Test polar to Cartesian conversion
fun to_cart_cord(polar_cord: PolarCord) -> CartCord {
CartCord {
x: polar_cord.radius * cos(polar_cord.angle),
y: polar_cord.radius * sin(polar_cord.angle)
}
}
converted_cord = to_cart_cord(polar_cord)
test_eq(round(converted_cord.x), 0)
test_eq(round(converted_cord.y), -12)
# Test struct property assignment (Non trivial in postfix, for nested structures)
polar_cord.radius = 13.0
polar_cord.thingy[0][0].x = 3.0
test_eq(polar_cord.radius, 13.0)
test_eq(polar_cord.thingy[0][0].x, 3.0)
cord = Cord:PolarCord(polar_cord) # TODO: Make it possible to do something with enums
fun rect_area(top_left: Cord, bottom_right: Cord) -> Flt {
top_left_cart = inspect top_left {
Cord:PolarCord as inner {
to_cart_cord(inner)
}
Cord:CartCord as inner {
inner
}
}
bottom_right_cart = inspect bottom_right {
Cord:PolarCord as inner {
to_cart_cord(inner)
}
Cord:CartCord as inner {
inner
}
}
width = bottom_right_cart.x - top_left_cart.x
height = bottom_right_cart.y - top_left_cart.y
width * height
}
test_eq(round(rect_area(cord, Cord:CartCord(CartCord {
x: 3.0,
y: 5.0
}))), 53)
test_eq(contains([3, 4, 7], 4), true)
test_eq(contains("Hello, World", "Hello"), true)
fun avg(s: Str) -> Flt {
splits = split(s, "\\n")
sum = 0.0
for number_string in splits {
sum += flt(number_string)
}
sum / flt(length(splits))
}
fun union_generic_stuff<T: Int | Str>(v: T) -> T {
v
}
s = union_generic_stuff("Something") # s is now a string because the value passed to union_generic_stuff had a string type
s += "5"
test_eq(s, "Something5")
fun union_generic_stuff_arr<T: Str | Int | Flt>(v: Arr<T>) -> T {
v[0] # TODO: Make it so that adding this `+ v[1]` will not crash everything
}
t = union_generic_stuff_arr([5, 12]) # t is now a string because the array passed to "union_generic_stuff_arr" had a inner string type
t += 8
test_eq(t, 13)
# Should be 830
test_eq(round(avg("849\\n814\\n906\\n800\\n791\\n807\\n841")), 830)
# Should set inner array value to 15
nested = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
nested[2][1] = 15
test_eq(nested[2][1], 15)
test_stats()
fun fibonacii(n: Int) -> Int {
if n == 0 {
0
} else if n == 1 {
1
} else {
last = 0
current = 1
# Do the loop
for _ in 0..n {
new_current = last + current
last = current
current = new_current
}
current
}
}
fun factorial(n: Int) -> Int {
product = 1
while n != 0 {
product *= n # This does the thing
n -= 1
}
product
}
fact = factorial(read_int())
println("Input: " + str(fact))
println("Output: " + str(fibonacii(fact)))