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
