Lines Matching full:linked

122 .Nd implementations of singly-linked lists, singly-linked tail queues,
228 Singly-linked lists
230 Singly-linked tail queues
248 Singly-linked lists are the simplest of the four data structures
250 Singly-linked lists are ideal for applications with large datasets
253 Singly-linked lists add the following functionality:
261 Singly-linked tail queues add the following functionality:
278 than singly-linked lists.
281 Singly-linked tail queues are ideal for applications with large datasets and
285 All doubly linked types of data structures (lists and tail queues)
299 twice that of the singly-linked data-structures.
302 Linked lists are the simplest of the doubly linked data structures.
334 than singly-linked lists.
374 .Sh SINGLY-LINKED LISTS
375 A singly-linked list is headed by a structure defined by the
380 The elements are singly linked for minimum space and pointer manipulation
395 is the type of the elements to be linked into the list.
422 A singly-linked tail queue should be used if this macro is needed in
534 A doubly-linked list should be used if this macro is needed in
543 .Sh SINGLY-LINKED LIST EXAMPLE
547 struct slisthead *headp;		/* Singly-linked List head. */
550 	SLIST_ENTRY(entry) entries;	/* Singly-linked List. */
585 .Sh SINGLY-LINKED TAIL QUEUES
586 A singly-linked tail queue is headed by a structure defined by the
592 The elements are singly linked for minimum space and pointer
608 is the type of the elements to be linked into the tail queue.
753 A doubly-linked tail queue should be used if this macro is needed in
762 .Sh SINGLY-LINKED TAIL QUEUE EXAMPLE
766 struct stailhead *headp;		/* Singly-linked tail queue head. */
821 The elements are doubly linked so that an arbitrary element can be
836 is the type of the elements to be linked into the list.
1043 The elements are doubly linked so that an arbitrary element can be
1059 is the type of the elements to be linked into the tail queue.