Hacker News Reader

> Storing your cached data in a solution like this suddenly gets rid of the need to have live pointers of data on the heap.

So if I understand this correctly, Go does not do any recursive scanning of structures? Each unique bit of data owns it data for as long as it needs to?

View on HN

Not quite, the difference here is that instead of storing live objects on the heap you would need to serialize them into a byte slice. You then hand that to the cache library and it would find a place to copy those bytes and store them on your behalf. This means your object now just becomes data belonging to the cache and sits somewhere on the libraries internal data-structure.

Reply on news.ycombinator.com