|
Lines 154-163
Link Here
|
| 154 |
.Fn TAILQ_REMOVE "TAILQ_HEAD *head" "TYPE *elm" "TAILQ_ENTRY NAME" |
154 |
.Fn TAILQ_REMOVE "TAILQ_HEAD *head" "TYPE *elm" "TAILQ_ENTRY NAME" |
| 155 |
.\" |
155 |
.\" |
| 156 |
.Sh DESCRIPTION |
156 |
.Sh DESCRIPTION |
| 157 |
These macros define and operate on five types of data structures: |
157 |
These macros define and operate on four types of data structures: |
| 158 |
singly-linked lists, singly-linked tail queues, lists, tail queues, |
158 |
singly-linked lists, singly-linked tail queues, lists and tail queues. |
| 159 |
and circular queues. |
159 |
All four structures support the following functionality: |
| 160 |
All five structures support the following functionality: |
|
|
| 161 |
.Bl -enum -compact -offset indent |
160 |
.Bl -enum -compact -offset indent |
| 162 |
.It |
161 |
.It |
| 163 |
Insertion of a new entry at the head of the list. |
162 |
Insertion of a new entry at the head of the list. |
|
Lines 197-204
Link Here
|
| 197 |
few or no removals, |
196 |
few or no removals, |
| 198 |
or for implementing a FIFO queue. |
197 |
or for implementing a FIFO queue. |
| 199 |
.Pp |
198 |
.Pp |
| 200 |
All doubly linked types of data structures (lists, tail queues, and circle |
199 |
All doubly linked types of data structures (lists and tail queues) |
| 201 |
queues) additionally allow: |
200 |
additionally allow: |
| 202 |
.Bl -enum -compact -offset indent |
201 |
.Bl -enum -compact -offset indent |
| 203 |
.It |
202 |
.It |
| 204 |
Insertion of a new entry before any element in the list. |
203 |
Insertion of a new entry before any element in the list. |