Skip to content

Comment on Beating the L1 cache with value speculationparent

Comments

It's extremely common in Lisp. Linked lists are the natural data structure of Lisp and in most modern programs they rarely get modified. Common Lisp provides vectors for greater efficiency but they might be less necessary in many programs if this trick works.

That's a very good use case. I wonder if a good CL compiler would be able to convert many of these lists to arrays anyway.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.