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)
“O Nature, and O soul of man! how far beyond all utterance are your linked analogies! not the smallest atom stirs or lives in matter, but has its cunning duplicate in mind.”
—Herman Melville (1819–1891)
“Do your children view themselves as successes or failures? Are they being encouraged to be inquisitive or passive? Are they afraid to challenge authority and to question assumptions? Do they feel comfortable adapting to change? Are they easily discouraged if they cannot arrive at a solution to a problem? The answers to those questions will give you a better appraisal of their education than any list of courses, grades, or test scores.”
—Lawrence Kutner (20th century)