tool for me to use if i drop nixos
Initial Commit: Create an expression language for the rest of the project
+1952
+1
.envrc
+1
.envrc
···
1
+
use nix
+153
Cargo.lock
+153
Cargo.lock
···
1
+
# This file is automatically @generated by Cargo.
2
+
# It is not intended for manual editing.
3
+
version = 4
4
+
5
+
[[package]]
6
+
name = "demeter"
7
+
version = "0.1.0"
8
+
9
+
[[package]]
10
+
name = "dmx"
11
+
version = "0.1.0"
12
+
dependencies = [
13
+
"indexmap",
14
+
"serde",
15
+
"strum",
16
+
"thiserror",
17
+
]
18
+
19
+
[[package]]
20
+
name = "equivalent"
21
+
version = "1.0.2"
22
+
source = "registry+https://github.com/rust-lang/crates.io-index"
23
+
checksum = "877a4ace8713b0bcf2a4e7eec82529c029f1d0619886d18145fea96c3ffe5c0f"
24
+
25
+
[[package]]
26
+
name = "hashbrown"
27
+
version = "0.16.1"
28
+
source = "registry+https://github.com/rust-lang/crates.io-index"
29
+
checksum = "841d1cc9bed7f9236f321df977030373f4a4163ae1a7dbfe1a51a2c1a51d9100"
30
+
31
+
[[package]]
32
+
name = "heck"
33
+
version = "0.5.0"
34
+
source = "registry+https://github.com/rust-lang/crates.io-index"
35
+
checksum = "2304e00983f87ffb38b55b444b5e3b60a884b5d30c0fca7d82fe33449bbe55ea"
36
+
37
+
[[package]]
38
+
name = "indexmap"
39
+
version = "2.13.0"
40
+
source = "registry+https://github.com/rust-lang/crates.io-index"
41
+
checksum = "7714e70437a7dc3ac8eb7e6f8df75fd8eb422675fc7678aff7364301092b1017"
42
+
dependencies = [
43
+
"equivalent",
44
+
"hashbrown",
45
+
"serde",
46
+
"serde_core",
47
+
]
48
+
49
+
[[package]]
50
+
name = "proc-macro2"
51
+
version = "1.0.106"
52
+
source = "registry+https://github.com/rust-lang/crates.io-index"
53
+
checksum = "8fd00f0bb2e90d81d1044c2b32617f68fcb9fa3bb7640c23e9c748e53fb30934"
54
+
dependencies = [
55
+
"unicode-ident",
56
+
]
57
+
58
+
[[package]]
59
+
name = "quote"
60
+
version = "1.0.45"
61
+
source = "registry+https://github.com/rust-lang/crates.io-index"
62
+
checksum = "41f2619966050689382d2b44f664f4bc593e129785a36d6ee376ddf37259b924"
63
+
dependencies = [
64
+
"proc-macro2",
65
+
]
66
+
67
+
[[package]]
68
+
name = "serde"
69
+
version = "1.0.228"
70
+
source = "registry+https://github.com/rust-lang/crates.io-index"
71
+
checksum = "9a8e94ea7f378bd32cbbd37198a4a91436180c5bb472411e48b5ec2e2124ae9e"
72
+
dependencies = [
73
+
"serde_core",
74
+
"serde_derive",
75
+
]
76
+
77
+
[[package]]
78
+
name = "serde_core"
79
+
version = "1.0.228"
80
+
source = "registry+https://github.com/rust-lang/crates.io-index"
81
+
checksum = "41d385c7d4ca58e59fc732af25c3983b67ac852c1a25000afe1175de458b67ad"
82
+
dependencies = [
83
+
"serde_derive",
84
+
]
85
+
86
+
[[package]]
87
+
name = "serde_derive"
88
+
version = "1.0.228"
89
+
source = "registry+https://github.com/rust-lang/crates.io-index"
90
+
checksum = "d540f220d3187173da220f885ab66608367b6574e925011a9353e4badda91d79"
91
+
dependencies = [
92
+
"proc-macro2",
93
+
"quote",
94
+
"syn",
95
+
]
96
+
97
+
[[package]]
98
+
name = "strum"
99
+
version = "0.28.0"
100
+
source = "registry+https://github.com/rust-lang/crates.io-index"
101
+
checksum = "9628de9b8791db39ceda2b119bbe13134770b56c138ec1d3af810d045c04f9bd"
102
+
dependencies = [
103
+
"strum_macros",
104
+
]
105
+
106
+
[[package]]
107
+
name = "strum_macros"
108
+
version = "0.28.0"
109
+
source = "registry+https://github.com/rust-lang/crates.io-index"
110
+
checksum = "ab85eea0270ee17587ed4156089e10b9e6880ee688791d45a905f5b1ca36f664"
111
+
dependencies = [
112
+
"heck",
113
+
"proc-macro2",
114
+
"quote",
115
+
"syn",
116
+
]
117
+
118
+
[[package]]
119
+
name = "syn"
120
+
version = "2.0.117"
121
+
source = "registry+https://github.com/rust-lang/crates.io-index"
122
+
checksum = "e665b8803e7b1d2a727f4023456bbbbe74da67099c585258af0ad9c5013b9b99"
123
+
dependencies = [
124
+
"proc-macro2",
125
+
"quote",
126
+
"unicode-ident",
127
+
]
128
+
129
+
[[package]]
130
+
name = "thiserror"
131
+
version = "2.0.18"
132
+
source = "registry+https://github.com/rust-lang/crates.io-index"
133
+
checksum = "4288b5bcbc7920c07a1149a35cf9590a2aa808e0bc1eafaade0b80947865fbc4"
134
+
dependencies = [
135
+
"thiserror-impl",
136
+
]
137
+
138
+
[[package]]
139
+
name = "thiserror-impl"
140
+
version = "2.0.18"
141
+
source = "registry+https://github.com/rust-lang/crates.io-index"
142
+
checksum = "ebc4ee7f67670e9b64d05fa4253e753e016c6c95ff35b89b7941d6b856dec1d5"
143
+
dependencies = [
144
+
"proc-macro2",
145
+
"quote",
146
+
"syn",
147
+
]
148
+
149
+
[[package]]
150
+
name = "unicode-ident"
151
+
version = "1.0.24"
152
+
source = "registry+https://github.com/rust-lang/crates.io-index"
153
+
checksum = "e6e4313cd5fcd3dad5cafa179702e2b244f760991f45397d14d4ebf38247da75"
+27
Cargo.toml
+27
Cargo.toml
···
1
+
[workspace]
2
+
resolver = "3"
3
+
members = ["crates/demeter", "crates/dmx"]
4
+
5
+
[workspace.metadata]
6
+
7
+
[workspace.package]
8
+
edition = "2024"
9
+
license = "GPL-3.0-or-later"
10
+
11
+
[workspace.dependencies]
12
+
dmx = { version = "0.1.0", path = "crates/dmx" }
13
+
14
+
nix = "0.31.2"
15
+
log = "0.4.29"
16
+
thiserror = "2.0.18"
17
+
anyhow = "1.0.102"
18
+
serde = "1.0.228"
19
+
regex = "1.12.3"
20
+
clap = { version = "4.6.0", features = ["derive"] }
21
+
bytes = "1.11.1"
22
+
semver = "1.0.27"
23
+
hyper = "1.8.1"
24
+
mime = "0.3.17"
25
+
indexmap = "2.13.0"
26
+
strum = { version = "0.28.0", features = ["derive"] }
27
+
+674
LICENSE
+674
LICENSE
···
1
+
GNU GENERAL PUBLIC LICENSE
2
+
Version 3, 29 June 2007
3
+
4
+
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
5
+
Everyone is permitted to copy and distribute verbatim copies
6
+
of this license document, but changing it is not allowed.
7
+
8
+
Preamble
9
+
10
+
The GNU General Public License is a free, copyleft license for
11
+
software and other kinds of works.
12
+
13
+
The licenses for most software and other practical works are designed
14
+
to take away your freedom to share and change the works. By contrast,
15
+
the GNU General Public License is intended to guarantee your freedom to
16
+
share and change all versions of a program--to make sure it remains free
17
+
software for all its users. We, the Free Software Foundation, use the
18
+
GNU General Public License for most of our software; it applies also to
19
+
any other work released this way by its authors. You can apply it to
20
+
your programs, too.
21
+
22
+
When we speak of free software, we are referring to freedom, not
23
+
price. Our General Public Licenses are designed to make sure that you
24
+
have the freedom to distribute copies of free software (and charge for
25
+
them if you wish), that you receive source code or can get it if you
26
+
want it, that you can change the software or use pieces of it in new
27
+
free programs, and that you know you can do these things.
28
+
29
+
To protect your rights, we need to prevent others from denying you
30
+
these rights or asking you to surrender the rights. Therefore, you have
31
+
certain responsibilities if you distribute copies of the software, or if
32
+
you modify it: responsibilities to respect the freedom of others.
33
+
34
+
For example, if you distribute copies of such a program, whether
35
+
gratis or for a fee, you must pass on to the recipients the same
36
+
freedoms that you received. You must make sure that they, too, receive
37
+
or can get the source code. And you must show them these terms so they
38
+
know their rights.
39
+
40
+
Developers that use the GNU GPL protect your rights with two steps:
41
+
(1) assert copyright on the software, and (2) offer you this License
42
+
giving you legal permission to copy, distribute and/or modify it.
43
+
44
+
For the developers' and authors' protection, the GPL clearly explains
45
+
that there is no warranty for this free software. For both users' and
46
+
authors' sake, the GPL requires that modified versions be marked as
47
+
changed, so that their problems will not be attributed erroneously to
48
+
authors of previous versions.
49
+
50
+
Some devices are designed to deny users access to install or run
51
+
modified versions of the software inside them, although the manufacturer
52
+
can do so. This is fundamentally incompatible with the aim of
53
+
protecting users' freedom to change the software. The systematic
54
+
pattern of such abuse occurs in the area of products for individuals to
55
+
use, which is precisely where it is most unacceptable. Therefore, we
56
+
have designed this version of the GPL to prohibit the practice for those
57
+
products. If such problems arise substantially in other domains, we
58
+
stand ready to extend this provision to those domains in future versions
59
+
of the GPL, as needed to protect the freedom of users.
60
+
61
+
Finally, every program is threatened constantly by software patents.
62
+
States should not allow patents to restrict development and use of
63
+
software on general-purpose computers, but in those that do, we wish to
64
+
avoid the special danger that patents applied to a free program could
65
+
make it effectively proprietary. To prevent this, the GPL assures that
66
+
patents cannot be used to render the program non-free.
67
+
68
+
The precise terms and conditions for copying, distribution and
69
+
modification follow.
70
+
71
+
TERMS AND CONDITIONS
72
+
73
+
0. Definitions.
74
+
75
+
"This License" refers to version 3 of the GNU General Public License.
76
+
77
+
"Copyright" also means copyright-like laws that apply to other kinds of
78
+
works, such as semiconductor masks.
79
+
80
+
"The Program" refers to any copyrightable work licensed under this
81
+
License. Each licensee is addressed as "you". "Licensees" and
82
+
"recipients" may be individuals or organizations.
83
+
84
+
To "modify" a work means to copy from or adapt all or part of the work
85
+
in a fashion requiring copyright permission, other than the making of an
86
+
exact copy. The resulting work is called a "modified version" of the
87
+
earlier work or a work "based on" the earlier work.
88
+
89
+
A "covered work" means either the unmodified Program or a work based
90
+
on the Program.
91
+
92
+
To "propagate" a work means to do anything with it that, without
93
+
permission, would make you directly or secondarily liable for
94
+
infringement under applicable copyright law, except executing it on a
95
+
computer or modifying a private copy. Propagation includes copying,
96
+
distribution (with or without modification), making available to the
97
+
public, and in some countries other activities as well.
98
+
99
+
To "convey" a work means any kind of propagation that enables other
100
+
parties to make or receive copies. Mere interaction with a user through
101
+
a computer network, with no transfer of a copy, is not conveying.
102
+
103
+
An interactive user interface displays "Appropriate Legal Notices"
104
+
to the extent that it includes a convenient and prominently visible
105
+
feature that (1) displays an appropriate copyright notice, and (2)
106
+
tells the user that there is no warranty for the work (except to the
107
+
extent that warranties are provided), that licensees may convey the
108
+
work under this License, and how to view a copy of this License. If
109
+
the interface presents a list of user commands or options, such as a
110
+
menu, a prominent item in the list meets this criterion.
111
+
112
+
1. Source Code.
113
+
114
+
The "source code" for a work means the preferred form of the work
115
+
for making modifications to it. "Object code" means any non-source
116
+
form of a work.
117
+
118
+
A "Standard Interface" means an interface that either is an official
119
+
standard defined by a recognized standards body, or, in the case of
120
+
interfaces specified for a particular programming language, one that
121
+
is widely used among developers working in that language.
122
+
123
+
The "System Libraries" of an executable work include anything, other
124
+
than the work as a whole, that (a) is included in the normal form of
125
+
packaging a Major Component, but which is not part of that Major
126
+
Component, and (b) serves only to enable use of the work with that
127
+
Major Component, or to implement a Standard Interface for which an
128
+
implementation is available to the public in source code form. A
129
+
"Major Component", in this context, means a major essential component
130
+
(kernel, window system, and so on) of the specific operating system
131
+
(if any) on which the executable work runs, or a compiler used to
132
+
produce the work, or an object code interpreter used to run it.
133
+
134
+
The "Corresponding Source" for a work in object code form means all
135
+
the source code needed to generate, install, and (for an executable
136
+
work) run the object code and to modify the work, including scripts to
137
+
control those activities. However, it does not include the work's
138
+
System Libraries, or general-purpose tools or generally available free
139
+
programs which are used unmodified in performing those activities but
140
+
which are not part of the work. For example, Corresponding Source
141
+
includes interface definition files associated with source files for
142
+
the work, and the source code for shared libraries and dynamically
143
+
linked subprograms that the work is specifically designed to require,
144
+
such as by intimate data communication or control flow between those
145
+
subprograms and other parts of the work.
146
+
147
+
The Corresponding Source need not include anything that users
148
+
can regenerate automatically from other parts of the Corresponding
149
+
Source.
150
+
151
+
The Corresponding Source for a work in source code form is that
152
+
same work.
153
+
154
+
2. Basic Permissions.
155
+
156
+
All rights granted under this License are granted for the term of
157
+
copyright on the Program, and are irrevocable provided the stated
158
+
conditions are met. This License explicitly affirms your unlimited
159
+
permission to run the unmodified Program. The output from running a
160
+
covered work is covered by this License only if the output, given its
161
+
content, constitutes a covered work. This License acknowledges your
162
+
rights of fair use or other equivalent, as provided by copyright law.
163
+
164
+
You may make, run and propagate covered works that you do not
165
+
convey, without conditions so long as your license otherwise remains
166
+
in force. You may convey covered works to others for the sole purpose
167
+
of having them make modifications exclusively for you, or provide you
168
+
with facilities for running those works, provided that you comply with
169
+
the terms of this License in conveying all material for which you do
170
+
not control copyright. Those thus making or running the covered works
171
+
for you must do so exclusively on your behalf, under your direction
172
+
and control, on terms that prohibit them from making any copies of
173
+
your copyrighted material outside their relationship with you.
174
+
175
+
Conveying under any other circumstances is permitted solely under
176
+
the conditions stated below. Sublicensing is not allowed; section 10
177
+
makes it unnecessary.
178
+
179
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180
+
181
+
No covered work shall be deemed part of an effective technological
182
+
measure under any applicable law fulfilling obligations under article
183
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
184
+
similar laws prohibiting or restricting circumvention of such
185
+
measures.
186
+
187
+
When you convey a covered work, you waive any legal power to forbid
188
+
circumvention of technological measures to the extent such circumvention
189
+
is effected by exercising rights under this License with respect to
190
+
the covered work, and you disclaim any intention to limit operation or
191
+
modification of the work as a means of enforcing, against the work's
192
+
users, your or third parties' legal rights to forbid circumvention of
193
+
technological measures.
194
+
195
+
4. Conveying Verbatim Copies.
196
+
197
+
You may convey verbatim copies of the Program's source code as you
198
+
receive it, in any medium, provided that you conspicuously and
199
+
appropriately publish on each copy an appropriate copyright notice;
200
+
keep intact all notices stating that this License and any
201
+
non-permissive terms added in accord with section 7 apply to the code;
202
+
keep intact all notices of the absence of any warranty; and give all
203
+
recipients a copy of this License along with the Program.
204
+
205
+
You may charge any price or no price for each copy that you convey,
206
+
and you may offer support or warranty protection for a fee.
207
+
208
+
5. Conveying Modified Source Versions.
209
+
210
+
You may convey a work based on the Program, or the modifications to
211
+
produce it from the Program, in the form of source code under the
212
+
terms of section 4, provided that you also meet all of these conditions:
213
+
214
+
a) The work must carry prominent notices stating that you modified
215
+
it, and giving a relevant date.
216
+
217
+
b) The work must carry prominent notices stating that it is
218
+
released under this License and any conditions added under section
219
+
7. This requirement modifies the requirement in section 4 to
220
+
"keep intact all notices".
221
+
222
+
c) You must license the entire work, as a whole, under this
223
+
License to anyone who comes into possession of a copy. This
224
+
License will therefore apply, along with any applicable section 7
225
+
additional terms, to the whole of the work, and all its parts,
226
+
regardless of how they are packaged. This License gives no
227
+
permission to license the work in any other way, but it does not
228
+
invalidate such permission if you have separately received it.
229
+
230
+
d) If the work has interactive user interfaces, each must display
231
+
Appropriate Legal Notices; however, if the Program has interactive
232
+
interfaces that do not display Appropriate Legal Notices, your
233
+
work need not make them do so.
234
+
235
+
A compilation of a covered work with other separate and independent
236
+
works, which are not by their nature extensions of the covered work,
237
+
and which are not combined with it such as to form a larger program,
238
+
in or on a volume of a storage or distribution medium, is called an
239
+
"aggregate" if the compilation and its resulting copyright are not
240
+
used to limit the access or legal rights of the compilation's users
241
+
beyond what the individual works permit. Inclusion of a covered work
242
+
in an aggregate does not cause this License to apply to the other
243
+
parts of the aggregate.
244
+
245
+
6. Conveying Non-Source Forms.
246
+
247
+
You may convey a covered work in object code form under the terms
248
+
of sections 4 and 5, provided that you also convey the
249
+
machine-readable Corresponding Source under the terms of this License,
250
+
in one of these ways:
251
+
252
+
a) Convey the object code in, or embodied in, a physical product
253
+
(including a physical distribution medium), accompanied by the
254
+
Corresponding Source fixed on a durable physical medium
255
+
customarily used for software interchange.
256
+
257
+
b) Convey the object code in, or embodied in, a physical product
258
+
(including a physical distribution medium), accompanied by a
259
+
written offer, valid for at least three years and valid for as
260
+
long as you offer spare parts or customer support for that product
261
+
model, to give anyone who possesses the object code either (1) a
262
+
copy of the Corresponding Source for all the software in the
263
+
product that is covered by this License, on a durable physical
264
+
medium customarily used for software interchange, for a price no
265
+
more than your reasonable cost of physically performing this
266
+
conveying of source, or (2) access to copy the
267
+
Corresponding Source from a network server at no charge.
268
+
269
+
c) Convey individual copies of the object code with a copy of the
270
+
written offer to provide the Corresponding Source. This
271
+
alternative is allowed only occasionally and noncommercially, and
272
+
only if you received the object code with such an offer, in accord
273
+
with subsection 6b.
274
+
275
+
d) Convey the object code by offering access from a designated
276
+
place (gratis or for a charge), and offer equivalent access to the
277
+
Corresponding Source in the same way through the same place at no
278
+
further charge. You need not require recipients to copy the
279
+
Corresponding Source along with the object code. If the place to
280
+
copy the object code is a network server, the Corresponding Source
281
+
may be on a different server (operated by you or a third party)
282
+
that supports equivalent copying facilities, provided you maintain
283
+
clear directions next to the object code saying where to find the
284
+
Corresponding Source. Regardless of what server hosts the
285
+
Corresponding Source, you remain obligated to ensure that it is
286
+
available for as long as needed to satisfy these requirements.
287
+
288
+
e) Convey the object code using peer-to-peer transmission, provided
289
+
you inform other peers where the object code and Corresponding
290
+
Source of the work are being offered to the general public at no
291
+
charge under subsection 6d.
292
+
293
+
A separable portion of the object code, whose source code is excluded
294
+
from the Corresponding Source as a System Library, need not be
295
+
included in conveying the object code work.
296
+
297
+
A "User Product" is either (1) a "consumer product", which means any
298
+
tangible personal property which is normally used for personal, family,
299
+
or household purposes, or (2) anything designed or sold for incorporation
300
+
into a dwelling. In determining whether a product is a consumer product,
301
+
doubtful cases shall be resolved in favor of coverage. For a particular
302
+
product received by a particular user, "normally used" refers to a
303
+
typical or common use of that class of product, regardless of the status
304
+
of the particular user or of the way in which the particular user
305
+
actually uses, or expects or is expected to use, the product. A product
306
+
is a consumer product regardless of whether the product has substantial
307
+
commercial, industrial or non-consumer uses, unless such uses represent
308
+
the only significant mode of use of the product.
309
+
310
+
"Installation Information" for a User Product means any methods,
311
+
procedures, authorization keys, or other information required to install
312
+
and execute modified versions of a covered work in that User Product from
313
+
a modified version of its Corresponding Source. The information must
314
+
suffice to ensure that the continued functioning of the modified object
315
+
code is in no case prevented or interfered with solely because
316
+
modification has been made.
317
+
318
+
If you convey an object code work under this section in, or with, or
319
+
specifically for use in, a User Product, and the conveying occurs as
320
+
part of a transaction in which the right of possession and use of the
321
+
User Product is transferred to the recipient in perpetuity or for a
322
+
fixed term (regardless of how the transaction is characterized), the
323
+
Corresponding Source conveyed under this section must be accompanied
324
+
by the Installation Information. But this requirement does not apply
325
+
if neither you nor any third party retains the ability to install
326
+
modified object code on the User Product (for example, the work has
327
+
been installed in ROM).
328
+
329
+
The requirement to provide Installation Information does not include a
330
+
requirement to continue to provide support service, warranty, or updates
331
+
for a work that has been modified or installed by the recipient, or for
332
+
the User Product in which it has been modified or installed. Access to a
333
+
network may be denied when the modification itself materially and
334
+
adversely affects the operation of the network or violates the rules and
335
+
protocols for communication across the network.
336
+
337
+
Corresponding Source conveyed, and Installation Information provided,
338
+
in accord with this section must be in a format that is publicly
339
+
documented (and with an implementation available to the public in
340
+
source code form), and must require no special password or key for
341
+
unpacking, reading or copying.
342
+
343
+
7. Additional Terms.
344
+
345
+
"Additional permissions" are terms that supplement the terms of this
346
+
License by making exceptions from one or more of its conditions.
347
+
Additional permissions that are applicable to the entire Program shall
348
+
be treated as though they were included in this License, to the extent
349
+
that they are valid under applicable law. If additional permissions
350
+
apply only to part of the Program, that part may be used separately
351
+
under those permissions, but the entire Program remains governed by
352
+
this License without regard to the additional permissions.
353
+
354
+
When you convey a copy of a covered work, you may at your option
355
+
remove any additional permissions from that copy, or from any part of
356
+
it. (Additional permissions may be written to require their own
357
+
removal in certain cases when you modify the work.) You may place
358
+
additional permissions on material, added by you to a covered work,
359
+
for which you have or can give appropriate copyright permission.
360
+
361
+
Notwithstanding any other provision of this License, for material you
362
+
add to a covered work, you may (if authorized by the copyright holders of
363
+
that material) supplement the terms of this License with terms:
364
+
365
+
a) Disclaiming warranty or limiting liability differently from the
366
+
terms of sections 15 and 16 of this License; or
367
+
368
+
b) Requiring preservation of specified reasonable legal notices or
369
+
author attributions in that material or in the Appropriate Legal
370
+
Notices displayed by works containing it; or
371
+
372
+
c) Prohibiting misrepresentation of the origin of that material, or
373
+
requiring that modified versions of such material be marked in
374
+
reasonable ways as different from the original version; or
375
+
376
+
d) Limiting the use for publicity purposes of names of licensors or
377
+
authors of the material; or
378
+
379
+
e) Declining to grant rights under trademark law for use of some
380
+
trade names, trademarks, or service marks; or
381
+
382
+
f) Requiring indemnification of licensors and authors of that
383
+
material by anyone who conveys the material (or modified versions of
384
+
it) with contractual assumptions of liability to the recipient, for
385
+
any liability that these contractual assumptions directly impose on
386
+
those licensors and authors.
387
+
388
+
All other non-permissive additional terms are considered "further
389
+
restrictions" within the meaning of section 10. If the Program as you
390
+
received it, or any part of it, contains a notice stating that it is
391
+
governed by this License along with a term that is a further
392
+
restriction, you may remove that term. If a license document contains
393
+
a further restriction but permits relicensing or conveying under this
394
+
License, you may add to a covered work material governed by the terms
395
+
of that license document, provided that the further restriction does
396
+
not survive such relicensing or conveying.
397
+
398
+
If you add terms to a covered work in accord with this section, you
399
+
must place, in the relevant source files, a statement of the
400
+
additional terms that apply to those files, or a notice indicating
401
+
where to find the applicable terms.
402
+
403
+
Additional terms, permissive or non-permissive, may be stated in the
404
+
form of a separately written license, or stated as exceptions;
405
+
the above requirements apply either way.
406
+
407
+
8. Termination.
408
+
409
+
You may not propagate or modify a covered work except as expressly
410
+
provided under this License. Any attempt otherwise to propagate or
411
+
modify it is void, and will automatically terminate your rights under
412
+
this License (including any patent licenses granted under the third
413
+
paragraph of section 11).
414
+
415
+
However, if you cease all violation of this License, then your
416
+
license from a particular copyright holder is reinstated (a)
417
+
provisionally, unless and until the copyright holder explicitly and
418
+
finally terminates your license, and (b) permanently, if the copyright
419
+
holder fails to notify you of the violation by some reasonable means
420
+
prior to 60 days after the cessation.
421
+
422
+
Moreover, your license from a particular copyright holder is
423
+
reinstated permanently if the copyright holder notifies you of the
424
+
violation by some reasonable means, this is the first time you have
425
+
received notice of violation of this License (for any work) from that
426
+
copyright holder, and you cure the violation prior to 30 days after
427
+
your receipt of the notice.
428
+
429
+
Termination of your rights under this section does not terminate the
430
+
licenses of parties who have received copies or rights from you under
431
+
this License. If your rights have been terminated and not permanently
432
+
reinstated, you do not qualify to receive new licenses for the same
433
+
material under section 10.
434
+
435
+
9. Acceptance Not Required for Having Copies.
436
+
437
+
You are not required to accept this License in order to receive or
438
+
run a copy of the Program. Ancillary propagation of a covered work
439
+
occurring solely as a consequence of using peer-to-peer transmission
440
+
to receive a copy likewise does not require acceptance. However,
441
+
nothing other than this License grants you permission to propagate or
442
+
modify any covered work. These actions infringe copyright if you do
443
+
not accept this License. Therefore, by modifying or propagating a
444
+
covered work, you indicate your acceptance of this License to do so.
445
+
446
+
10. Automatic Licensing of Downstream Recipients.
447
+
448
+
Each time you convey a covered work, the recipient automatically
449
+
receives a license from the original licensors, to run, modify and
450
+
propagate that work, subject to this License. You are not responsible
451
+
for enforcing compliance by third parties with this License.
452
+
453
+
An "entity transaction" is a transaction transferring control of an
454
+
organization, or substantially all assets of one, or subdividing an
455
+
organization, or merging organizations. If propagation of a covered
456
+
work results from an entity transaction, each party to that
457
+
transaction who receives a copy of the work also receives whatever
458
+
licenses to the work the party's predecessor in interest had or could
459
+
give under the previous paragraph, plus a right to possession of the
460
+
Corresponding Source of the work from the predecessor in interest, if
461
+
the predecessor has it or can get it with reasonable efforts.
462
+
463
+
You may not impose any further restrictions on the exercise of the
464
+
rights granted or affirmed under this License. For example, you may
465
+
not impose a license fee, royalty, or other charge for exercise of
466
+
rights granted under this License, and you may not initiate litigation
467
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
468
+
any patent claim is infringed by making, using, selling, offering for
469
+
sale, or importing the Program or any portion of it.
470
+
471
+
11. Patents.
472
+
473
+
A "contributor" is a copyright holder who authorizes use under this
474
+
License of the Program or a work on which the Program is based. The
475
+
work thus licensed is called the contributor's "contributor version".
476
+
477
+
A contributor's "essential patent claims" are all patent claims
478
+
owned or controlled by the contributor, whether already acquired or
479
+
hereafter acquired, that would be infringed by some manner, permitted
480
+
by this License, of making, using, or selling its contributor version,
481
+
but do not include claims that would be infringed only as a
482
+
consequence of further modification of the contributor version. For
483
+
purposes of this definition, "control" includes the right to grant
484
+
patent sublicenses in a manner consistent with the requirements of
485
+
this License.
486
+
487
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
488
+
patent license under the contributor's essential patent claims, to
489
+
make, use, sell, offer for sale, import and otherwise run, modify and
490
+
propagate the contents of its contributor version.
491
+
492
+
In the following three paragraphs, a "patent license" is any express
493
+
agreement or commitment, however denominated, not to enforce a patent
494
+
(such as an express permission to practice a patent or covenant not to
495
+
sue for patent infringement). To "grant" such a patent license to a
496
+
party means to make such an agreement or commitment not to enforce a
497
+
patent against the party.
498
+
499
+
If you convey a covered work, knowingly relying on a patent license,
500
+
and the Corresponding Source of the work is not available for anyone
501
+
to copy, free of charge and under the terms of this License, through a
502
+
publicly available network server or other readily accessible means,
503
+
then you must either (1) cause the Corresponding Source to be so
504
+
available, or (2) arrange to deprive yourself of the benefit of the
505
+
patent license for this particular work, or (3) arrange, in a manner
506
+
consistent with the requirements of this License, to extend the patent
507
+
license to downstream recipients. "Knowingly relying" means you have
508
+
actual knowledge that, but for the patent license, your conveying the
509
+
covered work in a country, or your recipient's use of the covered work
510
+
in a country, would infringe one or more identifiable patents in that
511
+
country that you have reason to believe are valid.
512
+
513
+
If, pursuant to or in connection with a single transaction or
514
+
arrangement, you convey, or propagate by procuring conveyance of, a
515
+
covered work, and grant a patent license to some of the parties
516
+
receiving the covered work authorizing them to use, propagate, modify
517
+
or convey a specific copy of the covered work, then the patent license
518
+
you grant is automatically extended to all recipients of the covered
519
+
work and works based on it.
520
+
521
+
A patent license is "discriminatory" if it does not include within
522
+
the scope of its coverage, prohibits the exercise of, or is
523
+
conditioned on the non-exercise of one or more of the rights that are
524
+
specifically granted under this License. You may not convey a covered
525
+
work if you are a party to an arrangement with a third party that is
526
+
in the business of distributing software, under which you make payment
527
+
to the third party based on the extent of your activity of conveying
528
+
the work, and under which the third party grants, to any of the
529
+
parties who would receive the covered work from you, a discriminatory
530
+
patent license (a) in connection with copies of the covered work
531
+
conveyed by you (or copies made from those copies), or (b) primarily
532
+
for and in connection with specific products or compilations that
533
+
contain the covered work, unless you entered into that arrangement,
534
+
or that patent license was granted, prior to 28 March 2007.
535
+
536
+
Nothing in this License shall be construed as excluding or limiting
537
+
any implied license or other defenses to infringement that may
538
+
otherwise be available to you under applicable patent law.
539
+
540
+
12. No Surrender of Others' Freedom.
541
+
542
+
If conditions are imposed on you (whether by court order, agreement or
543
+
otherwise) that contradict the conditions of this License, they do not
544
+
excuse you from the conditions of this License. If you cannot convey a
545
+
covered work so as to satisfy simultaneously your obligations under this
546
+
License and any other pertinent obligations, then as a consequence you may
547
+
not convey it at all. For example, if you agree to terms that obligate you
548
+
to collect a royalty for further conveying from those to whom you convey
549
+
the Program, the only way you could satisfy both those terms and this
550
+
License would be to refrain entirely from conveying the Program.
551
+
552
+
13. Use with the GNU Affero General Public License.
553
+
554
+
Notwithstanding any other provision of this License, you have
555
+
permission to link or combine any covered work with a work licensed
556
+
under version 3 of the GNU Affero General Public License into a single
557
+
combined work, and to convey the resulting work. The terms of this
558
+
License will continue to apply to the part which is the covered work,
559
+
but the special requirements of the GNU Affero General Public License,
560
+
section 13, concerning interaction through a network will apply to the
561
+
combination as such.
562
+
563
+
14. Revised Versions of this License.
564
+
565
+
The Free Software Foundation may publish revised and/or new versions of
566
+
the GNU General Public License from time to time. Such new versions will
567
+
be similar in spirit to the present version, but may differ in detail to
568
+
address new problems or concerns.
569
+
570
+
Each version is given a distinguishing version number. If the
571
+
Program specifies that a certain numbered version of the GNU General
572
+
Public License "or any later version" applies to it, you have the
573
+
option of following the terms and conditions either of that numbered
574
+
version or of any later version published by the Free Software
575
+
Foundation. If the Program does not specify a version number of the
576
+
GNU General Public License, you may choose any version ever published
577
+
by the Free Software Foundation.
578
+
579
+
If the Program specifies that a proxy can decide which future
580
+
versions of the GNU General Public License can be used, that proxy's
581
+
public statement of acceptance of a version permanently authorizes you
582
+
to choose that version for the Program.
583
+
584
+
Later license versions may give you additional or different
585
+
permissions. However, no additional obligations are imposed on any
586
+
author or copyright holder as a result of your choosing to follow a
587
+
later version.
588
+
589
+
15. Disclaimer of Warranty.
590
+
591
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599
+
600
+
16. Limitation of Liability.
601
+
602
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610
+
SUCH DAMAGES.
611
+
612
+
17. Interpretation of Sections 15 and 16.
613
+
614
+
If the disclaimer of warranty and limitation of liability provided
615
+
above cannot be given local legal effect according to their terms,
616
+
reviewing courts shall apply local law that most closely approximates
617
+
an absolute waiver of all civil liability in connection with the
618
+
Program, unless a warranty or assumption of liability accompanies a
619
+
copy of the Program in return for a fee.
620
+
621
+
END OF TERMS AND CONDITIONS
622
+
623
+
How to Apply These Terms to Your New Programs
624
+
625
+
If you develop a new program, and you want it to be of the greatest
626
+
possible use to the public, the best way to achieve this is to make it
627
+
free software which everyone can redistribute and change under these terms.
628
+
629
+
To do so, attach the following notices to the program. It is safest
630
+
to attach them to the start of each source file to most effectively
631
+
state the exclusion of warranty; and each file should have at least
632
+
the "copyright" line and a pointer to where the full notice is found.
633
+
634
+
<one line to give the program's name and a brief idea of what it does.>
635
+
Copyright (C) <year> <name of author>
636
+
637
+
This program is free software: you can redistribute it and/or modify
638
+
it under the terms of the GNU General Public License as published by
639
+
the Free Software Foundation, either version 3 of the License, or
640
+
(at your option) any later version.
641
+
642
+
This program is distributed in the hope that it will be useful,
643
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
644
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645
+
GNU General Public License for more details.
646
+
647
+
You should have received a copy of the GNU General Public License
648
+
along with this program. If not, see <https://www.gnu.org/licenses/>.
649
+
650
+
Also add information on how to contact you by electronic and paper mail.
651
+
652
+
If the program does terminal interaction, make it output a short
653
+
notice like this when it starts in an interactive mode:
654
+
655
+
<program> Copyright (C) <year> <name of author>
656
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657
+
This is free software, and you are welcome to redistribute it
658
+
under certain conditions; type `show c' for details.
659
+
660
+
The hypothetical commands `show w' and `show c' should show the appropriate
661
+
parts of the General Public License. Of course, your program's commands
662
+
might be different; for a GUI interface, you would use an "about box".
663
+
664
+
You should also get your employer (if you work as a programmer) or school,
665
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
666
+
For more information on this, and how to apply and follow the GNU GPL, see
667
+
<https://www.gnu.org/licenses/>.
668
+
669
+
The GNU General Public License does not permit incorporating your program
670
+
into proprietary programs. If your program is a subroutine library, you
671
+
may consider it more useful to permit linking proprietary applications with
672
+
the library. If this is what you want to do, use the GNU Lesser General
673
+
Public License instead of this License. But first, please read
674
+
<https://www.gnu.org/licenses/why-not-lgpl.html>.
+5
README.md
+5
README.md
+5
crates/demeter/Cargo.toml
+5
crates/demeter/Cargo.toml
+15
crates/dmx/Cargo.toml
+15
crates/dmx/Cargo.toml
···
1
+
[package]
2
+
name = "dmx"
3
+
version = "0.1.0"
4
+
edition.workspace = true
5
+
license.workspace = true
6
+
7
+
[dependencies]
8
+
serde = { workspace = true, optional = true }
9
+
indexmap.workspace = true
10
+
strum.workspace = true
11
+
thiserror.workspace = true
12
+
13
+
[features]
14
+
default = []
15
+
serde = ["dep:serde", "serde/derive", "indexmap/serde"]
+3
crates/dmx/README.md
+3
crates/dmx/README.md
+217
crates/dmx/src/builtins.rs
+217
crates/dmx/src/builtins.rs
···
1
+
use crate::{
2
+
Expr, Func, RuntimeError, Scope, Type,
3
+
scope::{ASTRef, ScopeRef},
4
+
value::ExprRef,
5
+
};
6
+
use std::sync::Arc;
7
+
8
+
pub fn load_builtins(scope: &Arc<Scope>) {
9
+
let builtins = [
10
+
("nil", Expr::Nil),
11
+
("true", Expr::Bool(true)),
12
+
("false", Expr::Bool(false)),
13
+
("progn", Expr::Macro(crate::value::Macro(macro_progn))),
14
+
("let", Expr::Macro(crate::value::Macro(macro_let))),
15
+
("lambda", Expr::Macro(crate::value::Macro(macro_lambda))),
16
+
("if", Expr::Macro(crate::value::Macro(macro_if))),
17
+
("list", Expr::PrimOp(crate::value::PrimOp(func_list))),
18
+
("debug", Expr::PrimOp(crate::value::PrimOp(func_debug))),
19
+
("nth", Expr::PrimOp(crate::value::PrimOp(func_nth))),
20
+
("map", Expr::PrimOp(crate::value::PrimOp(func_map))),
21
+
("+", Expr::PrimOp(crate::value::PrimOp(func_add))),
22
+
("-", Expr::PrimOp(crate::value::PrimOp(func_sub))),
23
+
("*", Expr::PrimOp(crate::value::PrimOp(func_mul))),
24
+
("/", Expr::PrimOp(crate::value::PrimOp(func_div))),
25
+
];
26
+
27
+
for (name, value) in builtins {
28
+
scope.set(name, scope.value(value));
29
+
}
30
+
}
31
+
32
+
// -- MACROS --
33
+
34
+
fn macro_progn(scope: ScopeRef, args: ASTRef) -> Result<ExprRef, RuntimeError> {
35
+
scope.eval_ast(args)
36
+
}
37
+
38
+
fn macro_let(scope: ScopeRef, args: ASTRef) -> Result<ExprRef, RuntimeError> {
39
+
if args.len() < 2 {
40
+
return Err(RuntimeError::InvalidArguments(format!(
41
+
"expected 2 or more arguments"
42
+
)));
43
+
}
44
+
45
+
let t = &args[0];
46
+
match &**t {
47
+
Expr::Map(t) => {
48
+
for (k, v) in t {
49
+
scope.set(k, Arc::clone(v));
50
+
}
51
+
let args = &args[1..];
52
+
scope.eval_ast(&args)
53
+
}
54
+
_ => {
55
+
return Err(RuntimeError::InvalidArguments(format!(
56
+
"expected {:?} for argument #1",
57
+
Type::Map
58
+
)));
59
+
}
60
+
}
61
+
}
62
+
63
+
fn macro_lambda(scope: ScopeRef, args: ASTRef) -> Result<ExprRef, RuntimeError> {
64
+
if args.len() < 2 {
65
+
return Err(RuntimeError::InvalidArguments(format!(
66
+
"expected 2 or more arguments"
67
+
)));
68
+
}
69
+
70
+
let [argv, ast @ ..] = &args[..] else {
71
+
unreachable!()
72
+
};
73
+
74
+
let argn: Vec<String> = match &**argv {
75
+
Expr::List(l) => {
76
+
let mut argn = vec![];
77
+
78
+
for e in l {
79
+
let Expr::Symbol(s) = &**e else {
80
+
return Err(RuntimeError::InvalidArguments(format!(
81
+
"expected argument #1 to be list of symbols"
82
+
)));
83
+
};
84
+
argn.push(s.to_owned());
85
+
}
86
+
87
+
argn
88
+
}
89
+
_ => {
90
+
return Err(RuntimeError::InvalidArguments(format!(
91
+
"expected argument #1 to be list of symbols"
92
+
)));
93
+
}
94
+
};
95
+
96
+
let function = Func {
97
+
arglist: argn,
98
+
body: ast.to_owned(),
99
+
};
100
+
101
+
Ok(scope.value(Expr::Function(function)))
102
+
}
103
+
104
+
fn macro_if(scope: ScopeRef, args: ASTRef) -> Result<ExprRef, RuntimeError> {
105
+
if args.len() != 3 {
106
+
return Err(RuntimeError::InvalidArguments(format!(
107
+
"expected 3 arguments"
108
+
)));
109
+
}
110
+
111
+
let [condition, p, q] = &args[..] else {
112
+
unreachable!()
113
+
};
114
+
115
+
if scope.eval(ExprRef::clone(condition))?.is_truthy() {
116
+
scope.eval(ExprRef::clone(p))
117
+
} else {
118
+
scope.eval(ExprRef::clone(q))
119
+
}
120
+
}
121
+
122
+
// -- FUNCTIONS --
123
+
124
+
fn func_list(scope: ScopeRef, args: &[ExprRef]) -> Result<ExprRef, RuntimeError> {
125
+
Ok(scope.value(Expr::List(args.to_owned())))
126
+
}
127
+
128
+
fn func_debug(scope: ScopeRef, args: &[ExprRef]) -> Result<ExprRef, RuntimeError> {
129
+
for a in args {
130
+
println!("{a:?}");
131
+
}
132
+
133
+
Ok(scope.value(Expr::Nil))
134
+
}
135
+
136
+
fn func_nth(scope: ScopeRef, args: &[ExprRef]) -> Result<ExprRef, RuntimeError> {
137
+
let _ = scope;
138
+
if args.len() != 2 {
139
+
return Err(RuntimeError::InvalidArguments(format!(
140
+
"expected 2 arguments"
141
+
)));
142
+
}
143
+
144
+
let [list, index] = &args[..] else {
145
+
unreachable!()
146
+
};
147
+
148
+
match (&**list, &**index) {
149
+
(Expr::List(l), Expr::Int(i)) => {
150
+
let i = *i as usize;
151
+
152
+
match l.get(i) {
153
+
None => Err(RuntimeError::Exception(format!("out of bounds: {i}"))),
154
+
Some(v) => Ok(ExprRef::clone(v)),
155
+
}
156
+
}
157
+
_ => Err(RuntimeError::InvalidArguments(format!(
158
+
"expected list for argument #1 and int for argument #2"
159
+
))),
160
+
}
161
+
}
162
+
163
+
fn func_map(scope: ScopeRef, args: &[ExprRef]) -> Result<ExprRef, RuntimeError> {
164
+
if args.len() != 2 {
165
+
return Err(RuntimeError::InvalidArguments(format!(
166
+
"expected 2 arguments"
167
+
)));
168
+
}
169
+
170
+
let [list, func] = &args[..] else {
171
+
unreachable!()
172
+
};
173
+
174
+
match (&**list, &**func) {
175
+
(Expr::List(l), _) => {
176
+
let mut list = vec![];
177
+
178
+
for v in l {
179
+
list.push(scope.call_function(ExprRef::clone(func), &[ExprRef::clone(&v)])?);
180
+
}
181
+
182
+
Ok(scope.value(Expr::List(list)))
183
+
}
184
+
_ => Err(RuntimeError::InvalidArguments(format!(
185
+
"expected list for argument #1 and callable for argument #2"
186
+
))),
187
+
}
188
+
}
189
+
190
+
macro_rules! arithmetic {
191
+
($name:ident, $operator:ident) => {
192
+
fn $name(scope: ScopeRef, args: &[ExprRef]) -> Result<ExprRef, RuntimeError> {
193
+
let _ = scope;
194
+
if args.len() < 1 {
195
+
return Err(RuntimeError::InvalidArguments(format!(
196
+
"expected 1 or more arguments"
197
+
)));
198
+
}
199
+
200
+
let [first, rest @ ..] = &args[..] else {
201
+
unreachable!()
202
+
};
203
+
204
+
let mut first = ExprRef::clone(first);
205
+
for v in &*rest {
206
+
first = ExprRef::new(first.$operator(v));
207
+
}
208
+
209
+
Ok(first)
210
+
}
211
+
};
212
+
}
213
+
214
+
arithmetic!(func_add, add);
215
+
arithmetic!(func_sub, sub);
216
+
arithmetic!(func_mul, mul);
217
+
arithmetic!(func_div, div);
+84
crates/dmx/src/engine.rs
+84
crates/dmx/src/engine.rs
···
1
+
use crate::{RuntimeError, Scope, scope::AST, value::ExprRef};
2
+
use std::sync::Arc;
3
+
4
+
pub mod lexer;
5
+
pub mod parser;
6
+
7
+
#[derive(Debug, thiserror::Error)]
8
+
pub enum ChunkLoadError {
9
+
#[error("lexer error: {0}")]
10
+
Lexer(#[from] lexer::LexerError),
11
+
#[error("parse error: {0}")]
12
+
Parse(#[from] parser::ParseError),
13
+
}
14
+
15
+
pub struct Chunk {
16
+
ast: AST,
17
+
}
18
+
19
+
impl Chunk {
20
+
pub fn from_ast(ast: AST) -> Self {
21
+
Chunk { ast }
22
+
}
23
+
24
+
pub fn from_source(src: &str) -> Result<Self, ChunkLoadError> {
25
+
let lexer = lexer::Lexer::new(src);
26
+
let tokens = lexer.lex_all()?;
27
+
let ast = parser::parse_tokens(tokens)?;
28
+
Ok(Chunk { ast })
29
+
}
30
+
}
31
+
32
+
pub struct Engine {
33
+
scope: Arc<Scope>,
34
+
}
35
+
36
+
impl Engine {
37
+
pub fn new() -> Self {
38
+
Engine {
39
+
scope: {
40
+
let scope = Scope::new();
41
+
crate::builtins::load_builtins(&scope);
42
+
scope
43
+
},
44
+
}
45
+
}
46
+
47
+
pub fn eval_chunk(&self, chunk: &Chunk) -> Result<ExprRef, RuntimeError> {
48
+
self.scope.eval_ast(&chunk.ast)
49
+
}
50
+
51
+
pub fn get_scope<'engine>(&'engine self) -> &'engine Arc<Scope> {
52
+
&self.scope
53
+
}
54
+
}
55
+
56
+
#[cfg(test)]
57
+
mod tests {
58
+
use super::*;
59
+
60
+
#[test]
61
+
fn engine() {
62
+
let engine = Engine::new();
63
+
64
+
let chunk = Chunk::from_source(
65
+
r#"
66
+
(debug 32 3.1415926589793234 "hello world" true)
67
+
(debug ((lambda (x) x) 5) -43.5 false nil)
68
+
69
+
(let {
70
+
a "hello",
71
+
b "jeff",
72
+
} (debug a b))
73
+
(debug a b)
74
+
75
+
(debug (if false 6.28 3.14))
76
+
77
+
(debug (nth '(1 2 3 4) 2))
78
+
(debug (map '(1 2 3 4) (lambda (x) (* x 2))))
79
+
"#,
80
+
)
81
+
.unwrap();
82
+
engine.eval_chunk(&chunk).unwrap();
83
+
}
84
+
}
+290
crates/dmx/src/engine/lexer.rs
+290
crates/dmx/src/engine/lexer.rs
···
1
+
use std::{iter::Peekable, str::Chars as CharIter};
2
+
3
+
use crate::value::{Float, Int};
4
+
5
+
#[derive(Clone, Debug)]
6
+
pub enum TokenValue {
7
+
Int(Int),
8
+
Float(Float),
9
+
Symbol(String),
10
+
String(String),
11
+
LParen,
12
+
RParen,
13
+
// should tables be made with simple function or syntactic sugar?
14
+
LBrace,
15
+
RBrace,
16
+
Quote,
17
+
Comma,
18
+
}
19
+
20
+
#[derive(Clone, Debug)]
21
+
pub struct Token {
22
+
pub line: LineInfo,
23
+
pub value: TokenValue,
24
+
}
25
+
26
+
#[derive(Clone, Copy, Debug)]
27
+
pub struct LineInfo {
28
+
pub line: usize,
29
+
pub column: usize,
30
+
}
31
+
impl std::fmt::Display for LineInfo {
32
+
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
33
+
write!(f, "{}:{}", self.line + 1, self.column)
34
+
}
35
+
}
36
+
37
+
#[derive(Debug, thiserror::Error)]
38
+
pub enum LexerError {
39
+
#[error("unexpected token near {0}: `{1}`")]
40
+
UnexpectedToken(LineInfo, char),
41
+
42
+
#[error("invalid number near: {0}")]
43
+
InvalidNumber(LineInfo),
44
+
45
+
#[error("invalid symbol near {0}, invalid character: `{1}`")]
46
+
InvalidSymbol(LineInfo, char),
47
+
48
+
#[error("invalid escape character near {0}: `{1}`")]
49
+
InvalidEscape(LineInfo, char),
50
+
51
+
#[error("string broken onto a new line near {0}")]
52
+
StringBreak(LineInfo),
53
+
}
54
+
55
+
struct Chars;
56
+
impl Chars {
57
+
pub const LPAREN: char = '(';
58
+
pub const RPAREN: char = ')';
59
+
pub const LBRACE: char = '{';
60
+
pub const RBRACE: char = '}';
61
+
pub const QUOTE: char = '\'';
62
+
pub const STR_QUOTE: char = '"';
63
+
pub const COMMENT: char = ';';
64
+
pub const COMMA: char = ',';
65
+
}
66
+
67
+
macro_rules! lexer_pattern {
68
+
(whitespace) => {
69
+
' ' | '\n' | '\r'
70
+
};
71
+
(symbol) => {
72
+
'a'..='z' | 'A'..='Z' | '_' | '+' | '-' | '=' | '*' | '/' | '#' | '!' |
73
+
'$' | '%' | '@' | '&' | '[' | ']' | '|' | '>' | '<' | '?' | '.' | '~' | ':'
74
+
};
75
+
(symbol_rest) => {
76
+
lexer_pattern!(symbol) | lexer_pattern!(number) | ','
77
+
};
78
+
(number) => {
79
+
'0'..='9'
80
+
};
81
+
}
82
+
83
+
pub struct Lexer<'str> {
84
+
source: &'str str,
85
+
chars: Peekable<CharIter<'str>>,
86
+
is_negative_num: bool,
87
+
symbol_prepend_dash: bool,
88
+
line: LineInfo,
89
+
tokens: Vec<Token>,
90
+
}
91
+
92
+
impl<'str> Lexer<'str> {
93
+
pub fn new(source: &'str str) -> Self {
94
+
Self {
95
+
source,
96
+
chars: source.chars().peekable(),
97
+
is_negative_num: false,
98
+
symbol_prepend_dash: false,
99
+
line: LineInfo { line: 0, column: 0 },
100
+
// safe to assume we'll have a lot of tokens
101
+
tokens: Vec::with_capacity(1000),
102
+
}
103
+
}
104
+
105
+
pub fn is_done(&mut self) -> bool {
106
+
self.chars.peek().is_none()
107
+
}
108
+
109
+
/// scan for a single token
110
+
pub fn next(&mut self) -> Result<(), LexerError> {
111
+
let Some(c) = self.chars.next() else {
112
+
return Ok(());
113
+
};
114
+
self.line.column += 1;
115
+
116
+
match c {
117
+
Chars::LPAREN => self.tokens.push(Token {
118
+
line: self.line,
119
+
value: TokenValue::LParen,
120
+
}),
121
+
Chars::RPAREN => self.tokens.push(Token {
122
+
line: self.line,
123
+
value: TokenValue::RParen,
124
+
}),
125
+
Chars::LBRACE => self.tokens.push(Token {
126
+
line: self.line,
127
+
value: TokenValue::LBrace,
128
+
}),
129
+
Chars::RBRACE => self.tokens.push(Token {
130
+
line: self.line,
131
+
value: TokenValue::RBrace,
132
+
}),
133
+
Chars::QUOTE => self.tokens.push(Token {
134
+
line: self.line,
135
+
value: TokenValue::Quote,
136
+
}),
137
+
Chars::COMMA => self.tokens.push(Token {
138
+
line: self.line,
139
+
value: TokenValue::Comma,
140
+
}),
141
+
Chars::COMMENT => {
142
+
while let Some(c) = self.chars.next() {
143
+
if c == '\n' {
144
+
break;
145
+
}
146
+
}
147
+
}
148
+
'-' if !self.is_negative_num && !self.symbol_prepend_dash => {
149
+
if let Some(c) = self.chars.peek() {
150
+
if matches!(c, lexer_pattern!(number)) {
151
+
self.is_negative_num = true;
152
+
} else if matches!(c, lexer_pattern!(symbol)) {
153
+
self.symbol_prepend_dash = true;
154
+
} else {
155
+
self.tokens.push(Token {
156
+
line: self.line,
157
+
value: TokenValue::Symbol("-".to_owned()),
158
+
});
159
+
}
160
+
}
161
+
}
162
+
lexer_pattern!(number) => {
163
+
let mut buf = if self.is_negative_num {
164
+
String::from("-")
165
+
} else {
166
+
String::new()
167
+
};
168
+
self.is_negative_num = false;
169
+
let mut has_decimal = false;
170
+
buf.push(c);
171
+
172
+
while let Some(c) = self.chars.peek() {
173
+
if matches!(c, lexer_pattern!(number)) {
174
+
buf.push(self.chars.next().unwrap());
175
+
} else if *c == '.' {
176
+
if has_decimal {
177
+
return Err(LexerError::InvalidNumber(self.line));
178
+
}
179
+
has_decimal = true;
180
+
buf.push(self.chars.next().unwrap());
181
+
} else {
182
+
break;
183
+
}
184
+
}
185
+
186
+
if has_decimal {
187
+
self.tokens.push(Token {
188
+
line: self.line,
189
+
value: TokenValue::Float(buf.parse().unwrap()),
190
+
});
191
+
} else {
192
+
self.tokens.push(Token {
193
+
line: self.line,
194
+
value: TokenValue::Int(buf.parse().unwrap()),
195
+
});
196
+
}
197
+
}
198
+
lexer_pattern!(symbol) => {
199
+
let mut buf = if self.symbol_prepend_dash {
200
+
String::from("-")
201
+
} else {
202
+
String::new()
203
+
};
204
+
self.symbol_prepend_dash = false;
205
+
buf.push(c);
206
+
207
+
while let Some(c) = self.chars.peek() {
208
+
if matches!(c, lexer_pattern!(symbol_rest)) {
209
+
buf.push(self.chars.next().unwrap());
210
+
} else {
211
+
break;
212
+
}
213
+
}
214
+
215
+
self.tokens.push(Token {
216
+
line: self.line,
217
+
value: TokenValue::Symbol(buf),
218
+
});
219
+
}
220
+
lexer_pattern!(whitespace) => {
221
+
if c == '\n' {
222
+
self.line.line += 1;
223
+
self.line.column = 0;
224
+
}
225
+
}
226
+
Chars::STR_QUOTE => {
227
+
let mut buf = String::new();
228
+
let mut in_escape = false;
229
+
230
+
while let Some(c) = self.chars.peek() {
231
+
if *c == Chars::STR_QUOTE && !in_escape {
232
+
self.chars.next().unwrap();
233
+
break;
234
+
}
235
+
236
+
if in_escape {
237
+
let c = self.chars.next().unwrap();
238
+
239
+
match c {
240
+
'\\' => buf.push('\\'),
241
+
'n' => buf.push('\n'),
242
+
'r' => buf.push('\r'),
243
+
't' => buf.push('\t'),
244
+
Chars::STR_QUOTE => buf.push(Chars::STR_QUOTE),
245
+
_ => return Err(LexerError::InvalidEscape(self.line, c)),
246
+
}
247
+
248
+
in_escape = false;
249
+
} else if *c == '\\' {
250
+
in_escape = true;
251
+
self.chars.next().unwrap();
252
+
} else {
253
+
buf.push(self.chars.next().unwrap())
254
+
}
255
+
}
256
+
257
+
self.tokens.push(Token {
258
+
line: self.line,
259
+
value: TokenValue::String(buf),
260
+
});
261
+
}
262
+
_ => return Err(LexerError::UnexpectedToken(self.line, c)),
263
+
}
264
+
265
+
Ok(())
266
+
}
267
+
268
+
pub fn lex_all(mut self) -> Result<Vec<Token>, LexerError> {
269
+
while !self.is_done() {
270
+
self.next()?;
271
+
}
272
+
Ok(self.tokens)
273
+
}
274
+
275
+
pub fn clone_source(&self) -> String {
276
+
self.source.to_owned()
277
+
}
278
+
}
279
+
280
+
#[cfg(test)]
281
+
mod tests {
282
+
use super::*;
283
+
284
+
#[test]
285
+
fn lex() {
286
+
let lexer = Lexer::new("(- hello -3.14159)");
287
+
let tokens = lexer.lex_all().unwrap();
288
+
println!("{tokens:#?}");
289
+
}
290
+
}
+85
crates/dmx/src/engine/parser.rs
+85
crates/dmx/src/engine/parser.rs
···
1
+
use super::lexer::{LineInfo, Token, TokenValue};
2
+
use crate::{Expr, Map, scope::AST, value::ExprRef};
3
+
4
+
#[derive(Debug, thiserror::Error)]
5
+
pub enum ParseError {
6
+
#[error("unexpected EOF near `{0}`")]
7
+
UnexpectedEOF(LineInfo),
8
+
#[error("unclosed list near `{0}`")]
9
+
UnclosedList(LineInfo),
10
+
#[error("unexpected token near `{0}`: `{1:?}`")]
11
+
UnexpectedToken(LineInfo, TokenValue),
12
+
#[error("unexpected token near `{0}`, got `{1:?}` wanted symbol")]
13
+
ExpectedSymbol(LineInfo, TokenValue),
14
+
}
15
+
16
+
pub fn parse_tokens(tokens: Vec<Token>) -> Result<AST, ParseError> {
17
+
let mut ast = AST::new();
18
+
let mut tokens = tokens.into_iter();
19
+
20
+
while let Some(token) = tokens.next() {
21
+
ast.push(parse_expr(&token, &mut tokens)?);
22
+
}
23
+
24
+
Ok(ast)
25
+
}
26
+
27
+
pub fn parse_expr(
28
+
token: &Token,
29
+
token_iter: &mut impl Iterator<Item = Token>,
30
+
) -> Result<ExprRef, ParseError> {
31
+
let line = token.line;
32
+
let result = match &token.value {
33
+
TokenValue::Int(n) => Ok(Expr::Int(*n)),
34
+
TokenValue::Float(n) => Ok(Expr::Float(*n)),
35
+
TokenValue::Symbol(s) => Ok(Expr::Symbol(s.clone())),
36
+
TokenValue::String(s) => Ok(Expr::String(s.clone())),
37
+
TokenValue::Quote => {
38
+
let next_token = token_iter.next().ok_or(ParseError::UnexpectedEOF(line))?;
39
+
let expr = parse_expr(&next_token, token_iter)?;
40
+
Ok(Expr::Quote(expr))
41
+
}
42
+
TokenValue::LParen => {
43
+
let mut list = vec![];
44
+
45
+
while let Some(next_token) = token_iter.next() {
46
+
match &next_token.value {
47
+
TokenValue::RParen => break,
48
+
_ => {
49
+
let expr = parse_expr(&next_token, token_iter)?;
50
+
list.push(expr);
51
+
}
52
+
}
53
+
}
54
+
55
+
Ok(Expr::List(list))
56
+
}
57
+
TokenValue::LBrace => {
58
+
let mut map = Map::new();
59
+
let mut need_comma = false;
60
+
61
+
while let Some(next_token) = token_iter.next() {
62
+
match &next_token.value {
63
+
TokenValue::RBrace => break,
64
+
TokenValue::Symbol(sym) if !need_comma => {
65
+
need_comma = true;
66
+
let Some(value_token) = token_iter.next() else {
67
+
return Err(ParseError::UnexpectedEOF(line));
68
+
};
69
+
let val = parse_expr(&value_token, token_iter)?;
70
+
map.insert(sym.clone(), val);
71
+
}
72
+
TokenValue::Comma => need_comma = false,
73
+
_ => return Err(ParseError::UnexpectedToken(line, next_token.value)),
74
+
}
75
+
}
76
+
77
+
Ok(Expr::Map(map))
78
+
}
79
+
TokenValue::RParen | TokenValue::RBrace | TokenValue::Comma => {
80
+
Err(ParseError::UnexpectedToken(line, token.value.clone()))
81
+
}
82
+
};
83
+
84
+
result.map(ExprRef::new)
85
+
}
+20
crates/dmx/src/lib.rs
+20
crates/dmx/src/lib.rs
···
1
+
//! dmx expression language
2
+
3
+
// TODO: stack traces
4
+
5
+
pub mod builtins;
6
+
pub mod engine;
7
+
pub mod scope;
8
+
pub mod value;
9
+
10
+
pub use engine::Engine;
11
+
pub use scope::Scope;
12
+
pub use value::{Expr, Func, Macro, Map, PrimOp, Type};
13
+
14
+
#[derive(Debug, thiserror::Error)]
15
+
pub enum RuntimeError {
16
+
#[error("invalid argument(s): {0}")]
17
+
InvalidArguments(String),
18
+
#[error("exception occured: {0}")]
19
+
Exception(String),
20
+
}
+176
crates/dmx/src/scope.rs
+176
crates/dmx/src/scope.rs
···
1
+
use crate::{Expr, RuntimeError};
2
+
use std::{
3
+
collections::HashMap,
4
+
sync::{Arc, Mutex, Weak},
5
+
};
6
+
7
+
pub type Symbol = String;
8
+
9
+
pub type AST = Vec<Arc<Expr>>;
10
+
pub type ASTRef<'a> = &'a [Arc<Expr>];
11
+
12
+
pub type ScopeRef = Arc<Scope>;
13
+
14
+
/// Scope, should only be accessed via when wrapped in an [Arc]
15
+
pub struct Scope {
16
+
this: Weak<Self>,
17
+
parent: Option<Weak<Self>>,
18
+
locals: Mutex<HashMap<Symbol, Weak<Expr>>>,
19
+
values: Mutex<Vec<Arc<Expr>>>,
20
+
}
21
+
22
+
impl Scope {
23
+
pub fn new() -> Arc<Self> {
24
+
Arc::new_cyclic(|p| Self {
25
+
this: Weak::clone(p),
26
+
parent: None,
27
+
locals: Mutex::new(HashMap::new()),
28
+
values: Mutex::new(Vec::new()),
29
+
})
30
+
}
31
+
32
+
pub fn value(self: &Arc<Self>, value: Expr) -> Arc<Expr> {
33
+
let v = Arc::new(value);
34
+
let p = Arc::clone(&v);
35
+
self.values.lock().unwrap().push(v);
36
+
p
37
+
}
38
+
39
+
pub fn set<S: ToString>(self: &Arc<Self>, symbol: S, value: Arc<Expr>) {
40
+
self.locals
41
+
.lock()
42
+
.unwrap()
43
+
.insert(symbol.to_string(), Arc::downgrade(&value));
44
+
}
45
+
46
+
pub fn get<S: AsRef<str>>(self: &Arc<Self>, symbol: S) -> Option<Weak<Expr>> {
47
+
if let Some(p) = self.locals.lock().unwrap().get(symbol.as_ref()) {
48
+
Some(Weak::clone(&p))
49
+
} else if let Some(p) = self.parent.as_ref().map(|w| w.upgrade()).flatten() {
50
+
p.get(symbol)
51
+
} else {
52
+
None
53
+
}
54
+
}
55
+
56
+
pub fn parent(self: &Arc<Self>) -> Option<ScopeRef> {
57
+
self.parent.as_ref().map(Weak::upgrade).flatten()
58
+
}
59
+
60
+
pub fn weak(self: &Arc<Self>) -> Weak<Self> {
61
+
Weak::clone(&self.this)
62
+
}
63
+
64
+
pub fn branch(self: &Arc<Self>) -> Arc<Self> {
65
+
Arc::new_cyclic(|p| Self {
66
+
this: Weak::clone(p),
67
+
parent: Some(self.weak()),
68
+
locals: Mutex::new(HashMap::new()),
69
+
values: Mutex::new(Vec::new()),
70
+
})
71
+
}
72
+
73
+
pub fn eval(self: &Arc<Self>, value: Arc<Expr>) -> Result<Arc<Expr>, RuntimeError> {
74
+
Ok(match &*value {
75
+
Expr::Symbol(s) => self
76
+
.get(s)
77
+
.map(|w| w.upgrade())
78
+
.flatten()
79
+
.unwrap_or_else(|| Arc::new(Expr::Nil)),
80
+
Expr::Quote(q) => Arc::clone(&q),
81
+
Expr::List(l) if l.len() >= 1 => {
82
+
let [func, args @ ..] = &l[..] else {
83
+
unreachable!()
84
+
};
85
+
let func = self.eval(Arc::clone(func))?;
86
+
self.call_function(func, args)?
87
+
}
88
+
_ => value,
89
+
})
90
+
}
91
+
92
+
pub fn call_function(
93
+
self: &Arc<Self>,
94
+
func: Arc<Expr>,
95
+
args: &[Arc<Expr>],
96
+
) -> Result<Arc<Expr>, RuntimeError> {
97
+
let branch = self.branch();
98
+
match &*func {
99
+
Expr::PrimOp(f) => {
100
+
let args: Vec<_> = args
101
+
.iter()
102
+
.map(|c| self.eval(Arc::clone(&c)))
103
+
.filter_map(|p| p.ok())
104
+
.collect();
105
+
(f.0)(branch, &args)
106
+
}
107
+
Expr::Macro(f) => (f.0)(branch, &args),
108
+
Expr::Function(f) => {
109
+
let argn = f.arglist.len();
110
+
if argn != args.len() {
111
+
return Err(RuntimeError::InvalidArguments(format!(
112
+
"expected {argn} arguments"
113
+
)));
114
+
}
115
+
116
+
let iter = f.arglist.iter().zip(args.iter());
117
+
for (name, value) in iter {
118
+
branch.set(name, Arc::clone(&value));
119
+
}
120
+
121
+
branch.eval_ast(&f.body)
122
+
}
123
+
_ => {
124
+
return Err(RuntimeError::Exception(format!(
125
+
"attempt to call something that isn't callable"
126
+
)));
127
+
}
128
+
}
129
+
}
130
+
131
+
pub fn eval_ast(self: &Arc<Self>, ast: ASTRef) -> Result<Arc<Expr>, RuntimeError> {
132
+
let mut out = Arc::new(Expr::Nil);
133
+
let mut iter = ast.into_iter();
134
+
135
+
while let Some(v) = iter.next() {
136
+
let x = Arc::clone(&v);
137
+
out = self.eval(x)?;
138
+
}
139
+
140
+
Ok(out)
141
+
}
142
+
}
143
+
144
+
#[cfg(test)]
145
+
mod tests {
146
+
use crate::PrimOp;
147
+
148
+
use super::*;
149
+
150
+
#[test]
151
+
fn a() {
152
+
let s = Scope::new();
153
+
crate::builtins::load_builtins(&s);
154
+
155
+
s.set("hello", s.value(Expr::String("world".to_string())));
156
+
s.set("fe", s.value(Expr::Float(32.43)));
157
+
158
+
let t = s.branch();
159
+
let v = t.get("hello");
160
+
if let Some(v) = v.map(|p| p.upgrade()).flatten() {
161
+
println!("{v:?}");
162
+
}
163
+
t.set("frejfio", s.value(Expr::Bool(false)));
164
+
165
+
s.set(
166
+
"hello",
167
+
s.value(Expr::PrimOp(PrimOp(|s, _| {
168
+
println!("hello world");
169
+
Ok(s.value(Expr::Nil))
170
+
}))),
171
+
);
172
+
173
+
s.eval(s.value(Expr::List(vec![s.value(Expr::Symbol("hello".to_string()))])))
174
+
.unwrap();
175
+
}
176
+
}
+184
crates/dmx/src/value.rs
+184
crates/dmx/src/value.rs
···
1
+
use crate::{
2
+
RuntimeError,
3
+
scope::{AST, ASTRef, ScopeRef},
4
+
};
5
+
use indexmap::IndexMap;
6
+
use std::sync::{Arc, Weak};
7
+
8
+
pub type Int = i64;
9
+
pub type Float = f64;
10
+
11
+
/// Map
12
+
pub type Map<K, V> = IndexMap<K, V>;
13
+
14
+
#[derive(Debug, Clone, PartialEq)]
15
+
pub struct Func {
16
+
pub arglist: Vec<String>,
17
+
pub body: AST,
18
+
}
19
+
20
+
#[derive(Debug, Clone, Copy)]
21
+
pub struct PrimOp(pub fn(scope: ScopeRef, args: &[Arc<Expr>]) -> Result<Arc<Expr>, RuntimeError>);
22
+
23
+
impl PartialEq for PrimOp {
24
+
fn eq(&self, other: &Self) -> bool {
25
+
let _ = other;
26
+
false
27
+
}
28
+
29
+
fn ne(&self, other: &Self) -> bool {
30
+
let _ = other;
31
+
false
32
+
}
33
+
}
34
+
#[derive(Debug, Clone, Copy)]
35
+
pub struct Macro(pub fn(scope: ScopeRef, args: ASTRef) -> Result<Arc<Expr>, RuntimeError>);
36
+
37
+
impl PartialEq for Macro {
38
+
fn eq(&self, other: &Self) -> bool {
39
+
let _ = other;
40
+
false
41
+
}
42
+
43
+
fn ne(&self, other: &Self) -> bool {
44
+
let _ = other;
45
+
false
46
+
}
47
+
}
48
+
49
+
pub type ExprRef = Arc<Expr>;
50
+
pub type ExprWeak = Weak<Expr>;
51
+
52
+
/// Dynamic Expression
53
+
#[derive(Default, Debug, Clone, PartialEq)]
54
+
pub enum Expr {
55
+
#[default]
56
+
Nil,
57
+
Bool(bool),
58
+
Int(Int),
59
+
Float(Float),
60
+
Symbol(crate::scope::Symbol),
61
+
String(String),
62
+
List(Vec<Arc<Expr>>),
63
+
Map(Map<String, Arc<Expr>>),
64
+
Quote(Arc<Expr>),
65
+
Function(Func),
66
+
PrimOp(PrimOp),
67
+
Macro(Macro),
68
+
}
69
+
70
+
impl Expr {
71
+
pub fn is_truthy(&self) -> bool {
72
+
match self {
73
+
Expr::Nil => false,
74
+
Expr::Bool(b) => *b,
75
+
Expr::Int(i) => *i != 0,
76
+
Expr::Float(f) => *f != 0.0,
77
+
Expr::Symbol(_) => true,
78
+
Expr::String(s) => !s.is_empty(),
79
+
Expr::List(l) => !l.is_empty(),
80
+
Expr::Map(m) => !m.is_empty(),
81
+
Expr::Quote(q) => q.is_truthy(),
82
+
_ => false,
83
+
}
84
+
}
85
+
86
+
pub fn add(&self, other: &Expr) -> Expr {
87
+
match (self, other) {
88
+
(Expr::Int(a), Expr::Int(b)) => Expr::Int(a + b),
89
+
(Expr::Float(a), Expr::Float(b)) => Expr::Float(a + b),
90
+
(Expr::Float(a), Expr::Int(b)) => Expr::Float(a + *b as Float),
91
+
(Expr::Int(a), Expr::Float(b)) => Expr::Int(a + *b as Int),
92
+
// TODO: better handle invalid types
93
+
_ => self.clone(),
94
+
}
95
+
}
96
+
97
+
pub fn sub(&self, other: &Expr) -> Expr {
98
+
match (self, other) {
99
+
(Expr::Int(a), Expr::Int(b)) => Expr::Int(a - b),
100
+
(Expr::Float(a), Expr::Float(b)) => Expr::Float(a - b),
101
+
(Expr::Float(a), Expr::Int(b)) => Expr::Float(a - *b as Float),
102
+
(Expr::Int(a), Expr::Float(b)) => Expr::Int(a - *b as Int),
103
+
_ => self.clone(),
104
+
}
105
+
}
106
+
107
+
pub fn mul(&self, other: &Expr) -> Expr {
108
+
match (self, other) {
109
+
(Expr::Int(a), Expr::Int(b)) => Expr::Int(a * b),
110
+
(Expr::Float(a), Expr::Float(b)) => Expr::Float(a * b),
111
+
(Expr::Float(a), Expr::Int(b)) => Expr::Float(a * *b as Float),
112
+
(Expr::Int(a), Expr::Float(b)) => Expr::Int(a * *b as Int),
113
+
_ => self.clone(),
114
+
}
115
+
}
116
+
117
+
pub fn div(&self, other: &Expr) -> Expr {
118
+
match (self, other) {
119
+
(Expr::Int(a), Expr::Int(b)) => Expr::Int(a / b),
120
+
(Expr::Float(a), Expr::Float(b)) => Expr::Float(a / b),
121
+
(Expr::Float(a), Expr::Int(b)) => Expr::Float(a / *b as Float),
122
+
(Expr::Int(a), Expr::Float(b)) => Expr::Int(a / *b as Int),
123
+
_ => self.clone(),
124
+
}
125
+
}
126
+
}
127
+
128
+
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
129
+
pub enum Type {
130
+
Nil,
131
+
Bool,
132
+
Int,
133
+
Float,
134
+
Symbol,
135
+
String,
136
+
List,
137
+
Map,
138
+
Quote,
139
+
Function,
140
+
PrimOp,
141
+
Macro,
142
+
}
143
+
144
+
impl Type {
145
+
pub fn as_str(self) -> &'static str {
146
+
match self {
147
+
Self::Nil => "nil",
148
+
Self::Bool => "bool",
149
+
Self::Int => "int",
150
+
Self::Float => "float",
151
+
Self::Symbol => "symbol",
152
+
Self::String => "string",
153
+
Self::List => "list",
154
+
Self::Map => "map",
155
+
Self::Quote => "quote",
156
+
Self::Function => "function",
157
+
Self::PrimOp => "primop",
158
+
Self::Macro => "macro",
159
+
}
160
+
}
161
+
}
162
+
163
+
impl Expr {
164
+
pub fn type_of(&self) -> Type {
165
+
match self {
166
+
Self::Nil => Type::Nil,
167
+
Self::Bool(_) => Type::Bool,
168
+
Self::Int(_) => Type::Int,
169
+
Self::Float(_) => Type::Float,
170
+
Self::Symbol(_) => Type::Symbol,
171
+
Self::String(_) => Type::String,
172
+
Self::List(_) => Type::List,
173
+
Self::Map(_) => Type::Map,
174
+
Self::Quote(_) => Type::Quote,
175
+
Self::Function(_) => Type::Function,
176
+
Self::PrimOp(_) => Type::PrimOp,
177
+
Self::Macro(_) => Type::Macro,
178
+
}
179
+
}
180
+
181
+
pub fn type_of_str(&self) -> &'static str {
182
+
self.type_of().as_str()
183
+
}
184
+
}
+3
rust-toolchain.toml
+3
rust-toolchain.toml