An efficient method to store data of unknown amounts
Original Publication Date: 2005-Jan-31
Included in the Prior Art Database: 2005-Jan-31
Disclosed is a solution for rapidly storing large amounts of data of unknown final size while minimising the memory used for the structure’s definition, and while allowing insertion and deletion within the data. It consists in a compromise between an fixed amounts of available memory (i.e. an array) and a linked list, in order to profit from the advantages of both structures.