Samuel A. Falvo II <kc5tja at garnet.armored.net> wrote: > I really like the stop and copy collector theory, but they have practical > disadvantages that significantly impact runtime performance. > First, you need to perform a memory to memory copy of each object that is > referenced. Because of this, a large amount of time is spent moving chunks > of memory. On the other hand, you pretty much never need to worry about > memory fragmentation. Depending on the language (and specifically the piece of code), copying collectors can be a performance win. Since you never have to touch garbage, code that allocates many small chunks of memory to be used briefly can benefit. But of course Python doesn't have the equivalent of cons cells. Unless you want to count something like "(1, (2, (3, ())))".
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