Lines Matching full:queue

1 .\"	$OpenBSD: queue.3,v 1.70 2022/03/29 18:15:52 naddy Exp $
2 .\"	$NetBSD: queue.3,v 1.4 1995/07/03 00:25:36 mycroft Exp $
31 .\"	@(#)queue.3	8.1 (Berkeley) 12/13/93
274 and few or no removals, or for implementing a LIFO queue.
296 large datasets and few or no removals, or for implementing a FIFO queue.
664 A simple queue is headed by a structure defined by the
668 simple queue and the other to the last element in the simple queue.
670 New elements can be added to the queue after an existing element,
671 at the head of the queue or at the tail of the queue.
683 is the type of the elements to be linked into the queue.
684 A pointer to the head of the queue can later be declared as:
698 the queue.
702 macro initializes the queue referenced by
705 The queue can also be initialized statically by using the
723 at the head of the queue.
729 at the end of the queue.
733 macro removes the queue element immediately following
739 from the queue.
743 macro concatenates all the elements of the queue referenced by
745 to the end of the queue referenced by
758 macros can be used to traverse the queue.
761 macro is used for queue traversal:
768 traverses the queue referenced by head in a
778 .Sh SIMPLE QUEUE EXAMPLE
783 	SIMPLEQ_ENTRY(entry) entries;	/* Simple queue. */
806 A singly-linked tail queue is headed by a structure defined by the
810 the tail queue and the other to the last element in the tail queue.
813 New elements can be added to the tail queue after an existing element,
814 at the head of the tail queue or at the end of the tail queue.
826 is the type of the elements to be linked into the tail queue.
827 A pointer to the head of the tail queue can later be declared as:
841 the tail queue.
845 macro initializes the tail queue referenced by
848 The tail queue can also be initialized statically by using the
866 at the head of the tail queue.
872 at the end of the tail queue.
876 macro removes the queue element immediately following
880 this macro does not traverse the entire tail queue.
885 from the tail queue.
887 elements being removed from the head of the tail queue should
896 from the tail queue.
898 A doubly-linked tail queue should be used if this macro is needed in
903 macro concatenates all the elements of the tail queue referenced by
905 to the end of the tail queue referenced by
916 macro is used for queue traversal:
923 traverses the queue referenced by head in a
935 macros can be used to manually traverse a tail queue or an arbitrary part of
939 macro should be used to check whether a tail queue is empty.
940 .Sh SINGLY-LINKED TAIL QUEUE EXAMPLE
945 	STAILQ_ENTRY(entry) entries;	/* Singly-linked tail queue. */
982 A tail queue is headed by a structure defined by the
986 one to the first element in the tail queue and the other to
987 the last element in the tail queue.
989 removed without traversing the tail queue.
990 New elements can be added to the queue after an existing element,
991 before an existing element, at the head of the queue, or at the end
992 of the queue.
1004 is the type of the elements to be linked into the tail queue.
1005 A pointer to the head of the tail queue can later be declared as:
1019 the tail queue.
1023 macro initializes the tail queue referenced by
1026 The tail queue can also be initialized statically by using the
1034 at the head of the tail queue.
1040 at the end of the tail queue.
1060 from the tail queue.
1071 macro concatenates all the elements of the tail queue referenced by
1073 to the end of the tail queue referenced by
1085 are used for traversing a tail queue.
1113 macros can be used to manually traverse a tail queue or an arbitrary part of
1118 macro should be used to check whether a tail queue is empty.
1119 .Sh TAIL QUEUE EXAMPLE
1124 	TAILQ_ENTRY(entry) entries;	/* Tail queue. */
1128 TAILQ_INIT(&head);			/* Initialize queue. */
1158 after an element has been removed from a list or queue.
1160 removed from a list or queue is incorrect.
1192 .Nm queue
1195 The historical circle queue macros were deprecated in