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)
“Every morning I woke in dread, waiting for the day nurse to go on her rounds and announce from the list of names in her hand whether or not I was for shock treatment, the new and fashionable means of quieting people and of making them realize that orders are to be obeyed and floors are to be polished without anyone protesting and faces are to be made to be fixed into smiles and weeping is a crime.”
—Janet Frame (b. 1924)