Re: Gradual Growth of Memory Use?
"Yuri Davidovsky (as work at disclosure dot ie)" <[email protected]>
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
> On 13 Mar 2025, at 13:13, David McClain (as dbm at refined-audiometrics dot com) <[email protected]> wrote: > > The telemetry data is simply being PUSH’d into a list. No permutations. But that list becomes very long after 24 hours, and could cost a lot of time chasing through all the links that never get discarded anyway. So it turns out that you do collect data, making the heap grow? So it is not a memory leak per se, since you are actually hoarding it? I think the solution here may be just to let it go, or flush it to the filesystem. And yes, if you have to traverse million entries long lists to find something, it is not unfeasible that it may get slow as you would be hopping all over the heap. Your idea to switch to arrays may help here, but those had better be typed ones, as in, if you would have T element arrays, it might not be too different to using lists. _______________________________________________ Lisp Hug - the mailing list for LispWorks users [email protected] http://www.lispworks.com/support/lisp-hug.html