Lines Matching full:lists
126 .Nd implementations of singly-linked lists, singly-linked tail queues,
127 lists and tail queues
234 Lists
236 Singly-linked lists
253 Swapping the contents of two lists.
256 Singly-linked lists are the simplest of the four data structures
258 Singly-linked lists are ideal for applications with large datasets
261 Singly-linked lists add the following functionality:
266 O(n) concatenation of two lists.
286 than singly-linked lists.
293 All doubly linked types of data structures (lists and tail queues)
310 Linked lists are the simplest of the doubly linked data structures.
314 O(n) concatenation of two lists.
342 than singly-linked lists.
382 .Sh SINGLY-LINKED LISTS
431 high-usage code paths or to operate on long lists.
547 high-usage code paths or to operate on long lists.
831 .Sh LISTS
880 high-usage code paths or to operate on long lists.