diff options
| author |   schwarze <schwarze@openbsd.org> | 2020-07-13 01:28:10 +0000 |
|---|---|---|
| committer | schwarze <schwarze@openbsd.org> | 2020-07-13 01:28:10 +0000 |
| commit | 91c1d5903e61d41e60227c9fdb2ce9c1ec7bcb1d (patch) | |
| tree | 71f0bf133bab8f8d39b9e38172f80f0cd40913b4 /share/man/man3 | |
| parent | Add size to free() call (diff) | |
| download | wireguard-openbsd-91c1d5903e61d41e60227c9fdb2ce9c1ec7bcb1d.tar.xz wireguard-openbsd-91c1d5903e61d41e60227c9fdb2ce9c1ec7bcb1d.zip | |
Near the beginning of the DESCRIPTION, provide a tiny table showing
which data structures provide which macros, which is otherwise a bit
tedious to figure out given the length of the NAME section.
Issue observed and patch OK'ed by kn@.
Diffstat (limited to 'share/man/man3')
| -rw-r--r-- | share/man/man3/queue.3 | 14 |
1 files changed, 12 insertions, 2 deletions
diff --git a/share/man/man3/queue.3 b/share/man/man3/queue.3 index f64f2eabe54..e441c2f8869 100644 --- a/share/man/man3/queue.3 +++ b/share/man/man3/queue.3 @@ -1,4 +1,4 @@ -.\" $OpenBSD: queue.3,v 1.66 2019/12/30 17:25:39 schwarze Exp $ +.\" $OpenBSD: queue.3,v 1.67 2020/07/13 01:28:10 schwarze Exp $ .\" $NetBSD: queue.3,v 1.4 1995/07/03 00:25:36 mycroft Exp $ .\" .\" Copyright (c) 1993 The Regents of the University of California. @@ -30,7 +30,7 @@ .\" .\" @(#)queue.3 8.1 (Berkeley) 12/13/93 .\" -.Dd $Mdocdate: December 30 2019 $ +.Dd $Mdocdate: July 13 2020 $ .Dt SLIST_INIT 3 .Os .Sh NAME @@ -222,6 +222,16 @@ Removal of an entry from the head of the list. Forward traversal through the list. .El .Pp +The following table provides a quick overview +of which types support which additional macros: +.Bl -column -offset 6n "LAST, PREV, FOREACH_REVERSE" SLIST LIST SIMPLEQ TAILQ +.It LAST, PREV, FOREACH_REVERSE Ta - Ta - Ta - Ta TAILQ +.It INSERT_BEFORE, REPLACE Ta - Ta LIST Ta - Ta TAILQ +.It INSERT_TAIL, CONCAT Ta - Ta - Ta SIMPLEQ Ta TAILQ +.It REMOVE_AFTER, REMOVE_HEAD Ta SLIST Ta - Ta SIMPLEQ Ta - +.It REMOVE Ta SLIST Ta LIST Ta - Ta TAILQ +.El +.Pp Singly-linked lists are the simplest of the four data structures and support only the above functionality. Singly-linked lists are ideal for applications with large datasets |