| [2] | 1 | /* insque(3C) routines
|
|---|
| 2 | This file is in the public domain. */
|
|---|
| 3 |
|
|---|
| 4 | /*
|
|---|
| 5 |
|
|---|
| 6 | @deftypefn Supplemental void insque (struct qelem *@var{elem}, struct qelem *@var{pred})
|
|---|
| 7 | @deftypefnx Supplemental void remque (struct qelem *@var{elem})
|
|---|
| 8 |
|
|---|
| 9 | Routines to manipulate queues built from doubly linked lists. The
|
|---|
| 10 | @code{insque} routine inserts @var{elem} in the queue immediately
|
|---|
| 11 | after @var{pred}. The @code{remque} routine removes @var{elem} from
|
|---|
| 12 | its containing queue. These routines expect to be passed pointers to
|
|---|
| 13 | structures which have as their first members a forward pointer and a
|
|---|
| 14 | back pointer, like this prototype (although no prototype is provided):
|
|---|
| |
|---|
