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)
“Whatever else may divide us, Europe is our common home; a common fate has linked us through the centuries, and it continues to link us today.”
—Leonid Brezhnev (1906–1982)
“Thirty—the promise of a decade of loneliness, a thinning list of single men to know, a thinning brief-case of enthusiasm, thinning hair.”
—F. Scott Fitzgerald (1896–1940)