ACCESSING AN N-WAY LINKED LIST

摘要

Computer-implemented methods for accessing a particular element of a plurality of elements stored in an N-way linked list in a computer memory provide for adding or removing elements at locations within the list. The methods may be employed with LIFO or FIFO N-way linked lists. The methods may include traversing the N sub-lists in parallel as well as the use of single instruction multiple data operations.

主权项

1. A computer-implemented method for accessing a particular element of a plurality of elements stored in an N-way linked list in a computer memory, the N-way linked list having N linked sub-lists and a list order, each element being in one of the N sub-lists and including a pointer to a next sequential element in a same sub-list, comprising:
identifying a location of the particular element; identifying respective locations of N neighbor elements consecutive to the particular element in list order; for each of the N neighbor elements, redirecting a pointer of a respective neighbor element to point to an element one position away, in list order, from an element currently pointed to by the respective neighbor element; and removing the particular element.