/explore
|
You are here 
|
wingolog.org | ||
| | | | |
boats.gitlab.io
|
|
| | | | | In the previous post I said that in the second post in the series we'd talk about how rooting works. However, as I sat down to write that post, I realized that it would be a good idea to back up and give an initial overview of how a tracing garbage collector works - and in particular, how the underlying garbage collector in shifgrethor is implemented. In the abstract, we can think of the memory of a Rust program with garbage collection as being divided into three sections: the stack, the "unmanaged" heap... | |
| | | | |
aykevl.nl
|
|
| | | | | An explanation of how garbage collectors work including some pseudocode how a real GC could be implemented. | |
| | | | |
without.boats
|
|
| | | | | [AI summary] The post explains the overview and implementation of a tracing garbage collector in Rust, specifically within the Shifgrethor project, covering concepts like rooted memory, mark-and-sweep phases, and linked list structures. | |
| | | | |
bloeys.com
|
|
| | | In 'Thought 2: Regex is Like Assembly' I wondered why we are still doing regex in this kind of hard to understand, symbolic way, when we have already invented high level programming languages. There is no reason regex can't be written as clearly as any other programming language we use today. I thought doing this would be an interesting project, and so I came up with Regexl, a high level language for writing regex, that can be used as a simple library. | ||
