-
Notifications
You must be signed in to change notification settings - Fork 25
Is there any design documentation/memory layout etc? #20
Comments
Some of these questions are still open, because we have to figure out how to garbage collect using the Vectors are manually manged contiguous blocks of memory returned by I eventually see us building a generational gc, but mark-and-sweep will be a step along the way. Feel free to contribute documentation that might be a little rough around the edges. |
I have to confess I haven't actually got Rhine to build yet, but I am On 18 February 2015 at 14:13, Ramkumar Ramachandra <[email protected]
Simon Brooke :: http://www.journeyman.cc/~simon/
|
Specifically, do you envisage your stack as a fixed-size vector as Clojure, or as a linked list in heap space as in most other Lisp implementations? Do you intend to separate heapspace from cons space, and if so will vectors of cons-space float in the heap? Do you envisage a reference counting or a mark-and-sweep garbage collector?
Cheers!
The text was updated successfully, but these errors were encountered: