Memory allocation maintaining ordering across multiple heaps

摘要

A method and apparatus for adding and deleting data in a plurality of heaps stored in memory (104), where the ordering of the data in the heaps is maintained across the heaps as the additions and deletions are performed. Not all entries in the heaps have a corresponding entry in all of the other heaps, but the ordering of the data in the heaps is in accordance with an order dependent list stored in memory (104). Such ordered heaps are useful for example, in an incremental linker software program (108).