News for hackers. Stuff that matters.
Re:Erlang/OTP 17.0 has been released by derefr on Wednesday April 09, 2014 @04:17PM (#7562049)
Atoms and keysets both have pretty much the same caching semantics, though: they get repeated over the wire with pretty good locality, and don't have conflicting terms busting the cache in-between. That's not really true for anything else, which makes me guess that an arbitrary term-branch cache would be pretty useless.
Re:Erlang/OTP 17.0 has been released by jlouis on Thursday April 10, 2014 @07:50AM (#7565329)
The idea of having arbitrary subtrees is to support an efficient compression scheme. But you are indeed right that a keyset cache would be extremely effective at limiting the size of maps.