| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
#include <search.h> void insque(struct qelem *elem, struct qelem *pred); |
This function manipulates queues built from doubly linked lists. Each element
in the queue must be in the form of struct qelem which is defined
thus:
struct qelem {
struct qelem *q_forw;
struct qelem *q_back;
char q_data[0];
}
|
This function inserts elem in a queue immediately after pred.
None.
| ANSI/ISO C | No |
| POSIX | No |