October 04, 2015 Re: Go 1.5 | ||||
---|---|---|---|---|
| ||||
Posted in reply to Ola Fosheim Grøstad | On Tuesday, 29 September 2015 at 08:09:39 UTC, Ola Fosheim Grøstad wrote:
> But doesn't that imply a full scan when you are scanning for common types that live on leaf nodes in the graph?
Yes, if you want to collect a very common type, you'd need to scan many types.
But using typed allocations you can also predict where to find a lot of garbage, so you collect strings when you can collect a lot of them.
|
Copyright © 1999-2021 by the D Language Foundation