That sounds pretty much like what the JVM is doing with garbage collection. But I think it has only allocated two data areas during copy and then frees the source after copy (one needs to think of what to do, if the second data area cannot be allocated). If your data structure contains pointers/references to other objects, they need to be updated after copy. But using indirect pointers (like object id of the target instead of pointer) can avoid that, but a search for the target object id would be required at access time - or you do some kind of pointer healing at first access after garbage collection (like setting a bit in the management area of your structures that marks them as not healed after copy). If think the JVM has some kind of meta data for maintaining the references. Solution depends on the access frequency/pattern and requirement of cross references between the actual structures.
On Sunday, December 29, 2024 at 09:51:41 PM GMT+1, Binyamin Dissen <00000662573e2c3a-dmarc-requ...@listserv.ua.edu> wrote: The data structure consists of various items of different lengths. The items are added serially and periodically the area is scanned where most items are removed. The remaining items are likely to be removed in a later scan (with new items). My thought was to have two data areas, and during the scan insert the undeleted items into the alternate area. It will be a bit of data moves but is simple. Does Knuth talk about such a data structure? -- Binyamin Dissen <bdis...@dissensoftware.com> http://www.dissensoftware.com Director, Dissen Software, Bar & Grill - Israel ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
