-
Notifications
You must be signed in to change notification settings - Fork 0
/
lang.flx
217 lines (158 loc) · 2.64 KB
/
lang.flx
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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
# Variables
let x = 0
# assign both x and y to 0
let x, y = 0
# assign x to 1 and y to 2
let x, y = 1, 2
# for clarity's sake
let x = 1, y = 1
# with explicit data type
let z: int64 = 0
# Constants
const x = 0
# error!
x += 1
# Data types
# int type
let x = 0
let y: int;
# i64
let x: i64 = 0
# i32
let x: i32 = 0
# i16
let x: i16 = 0
# i8
let x: i8 = 0
# unsigned variants
# bool
let x = false
x = !x
let y = false
x &= y
# binary operators - work on bool and int types
let x, y = 15, 3;
# logical and
x & y
x &= y
# logical or
x | y
x |= y
# logical exclusive or
x ^ y
x ^= y
# logical not
!x
# rotate right 3 bits - works on int types
x >> 3;
x >>= 3;
# rotate left 3 bits
x << 3;
x <<= 3;
# Lists
let x = [1,2,3,4]
# indexing
let y = x[1]
# slices
let a = x[0..1] # [1,2]
let b = x[1..] # [2,3,4]
let c = [..1] # [1, 2]
let d = [2..3] # [2, 3]
# negative indexes
let d = [..-2] # [3, 4]
# concats b onto a
concat a: T[] b: T[] -> {
for el in b {
append a el
}
}
# Strings
type char = u8
type str = char[] = u8[]
# Structs
struct Point {
x: int, y: int
}
add (a: Point, b: Point) -> Point { x: a.x + b.x, y: a.y + b.y }
# tuple structs
struct Point(int, int)
add (a: Point, b: Point) -> Point(a.0 + b.0, a.1 + b.1)
# Sets
let a = { 1, 2, 3 },
b = { 4, 5, 6 }
# functional sets
let c = { x: int -> x > 1 }
3 in c # true
# operators
let x = a union b;
let x = a intersect b;
let x = a difference b;
# order of operations
let x = a intersect b union a
# equivalent to
let x = (a intersect b) union a
# Maps
let x = map {
"hello" -> 69
"world" -> 621
}
# explicitly typed
let x = map<str, int> {
}
# or maybe?
let x = map str -> int {
"hello" to 621
}
print x.hello
# Functions
x param1: A -> B
x(param1: A, param2: B) -> (B, C)
sort x: T[] -> T[]
sort x: int[] -> int[] {
for el of x {
# sort
}
}
# infix functions
infix nth<T -> any> x: T[] i: int -> T
let x = [1,2,3,4]
x nth 1 # 2
# tuple arguments
swap x, y -> (y, x)
# i.e.
swap (x, y) -> (y, x)
# Modules
# all imports and exports are named
import stdlib
import io from stdlib
# stdlib.stx
export io from "./io"
# module.stx
export someFunc x: int -> x + 1
export someOtherFunc x: int -> x - 1
# main.stx
import someFunc from "./module"
import {
someFunc
someOtherFunc
} from "./module"
# Conditionals
if condition1 {
} else if condition2 {
} else {
}
# match expression - similar to rust's
match x {
0..10 -> expression1
_ -> elseExpression
}
# e.g.
doAThing x: int -> match x {
0..5 -> x + 1
5..10 -> x - 1
_ -> x
}
doAThing 7
# classes - similar to kotlin
class Shape {}
class Rectangle() : Shape