Douglas Alan wrote: > I have a couple of questions regarding the new Python garbage > collector: > > (1) Why does it use the rather unusual algorithm it does, rather > than a more typical mark and sweep? The per-object storage cost > for the extra reference count is surely greater than the bit or > two required for a typical mark and sweep. > > (2) Why does the algorithm need back-pointers for the object chain? > > Just curious. Thanks. > > |>oug The Ruby language uses a mark and sweep GC but it seems that it prevents it from using native threads (in particular Posix Threads) whereas the Python GC is thread safe. -- Romuald Texier
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4