| 摘要 |
A random access memory and methods for insertion and deletion of data elements in the memory are presented. The memory comprises a number of parallel shift registers. Each memory cell consits of bits from a number of shift registers. The method for insertion or deletion of a data element into a sequence of data elements, contained in a number of consecutive memory cells comprise the steps of localizing a position at which a data element is to be inserted or deleted, moving the data elements in a controllable number of consecutive memory cells simultaneously to create space for a data element or to delete a data element and, in the case of insertion, inserting the data element into the sequence of data elements at the localized position. As a result, efficient sorting and dynamic searching are achieved, the need of pointers in linked list structures eliminated. |
