2 ms·
Looking at Haskell's Data.Sequence, it looks like it's strict in its elements. So a delete does free up memory as long as the deleted object isn't being used so
by wyager 10y ago
Looking at Haskell's Data.Sequence, it looks like it's strict in its elements. So a delete does free up memory as long as the deleted object isn't being used somewhere else.
- DanWaterworth 10y agoIt needs to be spine strict for that to work, but the amortization for finger trees doesn't work without laziness