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.
Read more about Unrolled Linked List: Overview, Performance
Famous quotes containing the words unrolled, linked and/or list:
“And he unrolled his feathers
And rowed him softer home—
Than Oars divide the Ocean,
Too silver for a seam—
Or Butterflies, off Banks of Noon
Leap, plashless as they swim.”
—Emily Dickinson (1830–1886)
“Thus for each blunt-faced ignorant one
The great grey rigid uniform combined
Safety with virtue of the sun.
Thus concepts linked like chainmail in the mind.”
—Thom Gunn (b. 1929)
“Modern tourist guides have helped raised tourist expectations. And they have provided the natives—from Kaiser Wilhelm down to the villagers of Chichacestenango—with a detailed and itemized list of what is expected of them and when. These are the up-to- date scripts for actors on the tourists’ stage.”
—Daniel J. Boorstin (b. 1914)