Persistent data structures #42

New Issue

scott · 2024-05-20T21:52:21Z

scott commented

2024-05-20 21:52:21 +00:00

Right now, the Janet interpreter uses a copy-on-write strategy, which is surely enough for the kind of work we're doing for Computer Class. But: eventually, we'll want persistent data structures à la Clojure.

Consider https://github.com/pyrmont/persimmon/tree/master/src.

However, this may also lie in the realm of "optimization," which may not make sense until we do a bytecode VM, in which case, this will be tied directly to a Zig-based reference-counting memory allocation strategy. So this could be a 0.2.0 milestone if Persimmon isn't adequate or straightforward to integrate.

Right now, the Janet interpreter uses a copy-on-write strategy, which is surely enough for the kind of work we're doing for Computer Class. But: eventually, we'll want persistent data structures à la Clojure. Consider https://github.com/pyrmont/persimmon/tree/master/src. However, this may also lie in the realm of "optimization," which may not make sense until we do a bytecode VM, in which case, this will be tied directly to a Zig-based reference-counting memory allocation strategy. So this could be a 0.2.0 milestone if Persimmon isn't adequate or straightforward to integrate.

scott added this to the 0.2.0 milestone 2024-05-20 21:52:28 +00:00

scott added the

optimization

label 2024-05-20 21:53:28 +00:00

scott added this to the Completing the language project 2024-07-21 17:45:03 +00:00

Sign in to join this conversation.