Unrolled linked list
From Wikipedia, the free encyclopedia
In computer programming, an unrolled linked list is a variation on the linked list which stores multiple elements in each node. It can dramatically increase cache performance, while decreasing the memory overhead associated with storing list metadata such as references. It is related to the B-tree.
This article relies largely or entirely on a single source. (March 2021) |