Re: Gradual Growth of Memory Use?

From: "David McClain (as dbm at refined-audiometrics dot com)" <[email protected]>

'LWW seems quite speedy as long as the memory image in use remains below 1.5 GB. Something happens
once you cross above that allocation. Perhaps just overly long CONS chains?'


I just found this recently and haven’t tested it yet, it might also be relevant to the
recent discussion about overall Lisp's performance:


'This code implements a novel algorithm for iterating over all permutations of a standard Lisp list
(a singly linked list). No cons operations are performed during the iteration, and the original
nodes are reused throughout the entire process.'

https://git.univ-pau.fr/tbaruchel/numerical-routines/-/snippets/5


-- 
Regards,

Adrian W. Pasieka