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)
“The exercise of letters is sometimes linked to the ambition to contruct an absolute book, a book of books that includes the others like a Platonic archetype, an object whose virtues are not diminished by the passage of time.”
—Jorge Luis Borges (1899–1986)
“We saw the machinery where murderers are now executed. Seven have been executed. The plan is better than the old one. It is quietly done. Only a few, at the most about thirty or forty, can witness [an execution]. It excites nobody outside of the list permitted to attend. I think the time for capital punishment has passed. I would abolish it. But while it lasts this is the best mode.”
—Rutherford Birchard Hayes (1822–1893)