11:19 <freemint> Hey

11:22 <freemint> I saw something neat that might be worth exploring for PicoLisp to speed up traversing lists based on the assumption that cells in the list are next to each other. https://mazzo.li/posts/value-speculation.html

11:25 <freemint> There might be some situations where you can guarantee that property.

11:27 <freemint> *next to eachother -> at predictable offset

11:47 <Regenaxer> hi free

11:47 <Regenaxer> mint!

11:48 <Regenaxer> I'm aware of that

11:48 <Regenaxer> In fact, cells allocated in a new heap are always sequential

11:48 <Regenaxer> i.e. unless it got fragmented by garbage collection

20:19 <freemint> Or defragmented by sorting or something.